Quantum switching networks are analogs of classical switching networks in which classical switches are replaced by quantum switches. These networks are used to switch quantum data among a set of quantum sources and receivers. They can also be used to efficiently switch classical data, and help overcome some limitations of classical switching networks by utilizing the unique properties of quantum information systems, such as superposition and parallelism. In this thesis, we design several such networks which can be broadly put in the following three categories: (1) Quantum unicast networks : We give the design of quantum Baseline network (QBN) which is a self-routing and unicast quantum packet switch that uses the Baseline topology. The classical version of the network blocks packets internally even when there are no output contentions and each input packet is addressed to a different output. The QBN uses the principles of quantum superposition and parallelism to overcome such blocking. Also, for assignments that have multiple input packets addressed to an output, this network creates a quantum superposition of all these packets on that output, ensuring that all packets have non-zero probabilities of being observed on that output. (2) Quantum concentrators : We introduce a new network called quantum concentrator, which is a key component of our quantum multicasting network design. This concentrator is also an n × n quantum switching network, to be denoted by n-QC, and which, for any m, 1 ≤ m ≤ n, routes arbitrary quantum states on any m of its inputs to its top m outputs. This network uses O( n log n) quantum gates, and has a gate level depth of O(log2 n). We also give several variations of this network, the main ones being orderpreserving and priority quantum concentrators. (3) Quantum multicast networks: We first design a quantum multicasting network, called a generalized quantum connector (GQC) which can be used to multicast quantum information from n input sources to n outputs. Since general quantum states cannot be copied due to the no-cloning theorem , this network actually multicasts superposed classical information packets, contained in a finite number of qubits at each input. Copying needed for such multicasting is obtained by Wootters and Zurek’s quantum copying machines   or controlled-not gates. This n-input and n-output (n × n) network, to be denoted by n-GQC, is recursively constructed using n/2-GQCs and uses O(n log2 n) quantum gates. The time complexity of this network in terms of gate level depth is O(log3 n). We also give two variations of this network which improve its behavior when routing multicast assignments that have multiple input packets contending for same outputs.
|Commitee:||Berg, Kenneth, Dagenais, Mario, Newcomb, Robert, Srivastava, Ankur|
|School:||University of Maryland, College Park|
|School Location:||United States -- Maryland|
|Source:||DAI-B 71/07, Dissertation Abstracts International|
|Subjects:||Electrical engineering, Quantum physics|
|Keywords:||Generalized quantum connectors, Quantum switching, Switching networks|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be