Recognizing small-circuit structure in two-qubit operators
- 19 July 2004
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 70 (1) , 012310
Abstract
This work proposes numerical tests which determine whether a two-qubit operator has an atypically simple quantum circuit. Specifically, we describe formulas, written in terms of matrix coefficients, characterizing operators implementable with exactly zero, one, or two controlled-NOT (CNOT) gates and all other gates being one-qubit gates. We give an algorithm for synthesizing two-qubit circuits with an optimal number of CNOT gates and illustrate it on operators appearing in quantum algorithms by Deutsch-Josza, Shor, and Grover. In another application, our explicit numerical tests allow timing a given Hamiltonian to compute a CNOT modulo one-qubit gate, when this is possible.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Lower bounds on the complexity of simulating quantum gatesPhysical Review A, 2003
- Geometric theory of nonlocal two-qubit operationsPhysical Review A, 2003
- Characterization of separable states and entanglement witnessesPhysical Review A, 2001
- Time optimal control in spin systemsPhysical Review A, 2001
- Experimental issues in coherent quantum-state manipulation of trapped atomic ionsJournal of Research of the National Institute of Standards and Technology, 1998
- Quantum Mechanics Helps in Searching for a Needle in a HaystackPhysical Review Letters, 1997
- Entanglement of a Pair of Quantum BitsPhysical Review Letters, 1997
- Elementary gates for quantum computationPhysical Review A, 1995
- Two-bit gates are universal for quantum computationPhysical Review A, 1995
- Rapid solution of problems by quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1992