Quantum computation and quantum information
Quantum computation and quantum information
An arbitrary twoqubit computation In 23 elementary gates or less
Proceedings of the 40th annual Design Automation Conference
Computing in Science and Engineering
Synthesis of quantum logic circuits
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Block-based quantum-logic synthesis
Quantum Information & Computation
Hi-index | 0.00 |
We show how to implement an arbitrary two-qubit unitary operation using any of several quantum gate libraries with small a priori upper bounds on gate counts. In analogy to library-less logic synthesis, we consider circuits and gates in terms of the underlying model of quantum computation, and do not assume any particular technology. As increasing the number of qubits can be prohibitively expensive, we assume throughout that no extra qubits are available for temporary storage.Using quantum circuit identities, we improve an earlier lower bound of 17 elementary gates by Bullock and Markov to 18, and their upper bound of 23 elementary gates to 18. We also improve upon the generic circuit with six CNOT gates by Zhang et al. (our circuit uses three), and that by Vidal and Dawson with 11 basic gates (we use 10).We study the performance of our synthesis procedures on two-qubit operators that are useful in quantum algorithms and communication protocols. With additional work, we find small circuits and improve upon previously known circuits in some cases.