Physics – Quantum Physics
Scientific paper
2004-06-23
IEEE Trans. on Computer-Aided Design, vol. 25, no. 6, June 2006, pp.1000 - 1010
Physics
Quantum Physics
18 pages; v5 fixes minor bugs; v4 is a complete rewrite of v3, with 6x more content, a theory of quantum multiplexors and Quan
Scientific paper
10.1109/TCAD.2005.855930
We discuss efficient quantum logic circuits which perform two tasks: (i) implementing generic quantum computations and (ii) initializing quantum registers. In contrast to conventional computing, the latter task is nontrivial because the state-space of an n-qubit register is not finite and contains exponential superpositions of classical bit strings. Our proposed circuits are asymptotically optimal for respective tasks and improve published results by at least a factor of two. The circuits for generic quantum computation constructed by our algorithms are the most efficient known today in terms of the number of expensive gates (quantum controlled-NOTs). They are based on an analogue of the Shannon decomposition of Boolean functions and a new circuit block, quantum multiplexor, that generalizes several known constructions. A theoretical lower bound implies that our circuits cannot be improved by more than a factor of two. We additionally show how to accommodate the severe architectural limitation of using only nearest-neighbor gates that is representative of current implementation technologies. This increases the number of gates by almost an order of magnitude, but preserves the asymptotic optimality of gate counts.
Bullock Stephen S.
Markov Igor L.
Shende Vivek V.
No associations
LandOfFree
Synthesis of Quantum Logic Circuits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Synthesis of Quantum Logic Circuits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Synthesis of Quantum Logic Circuits will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-248208