Physical Review Letters · 2004 · 396 citations · 16 references
ComputingComputer SciencePhysicsAlgebraQuantum ComputingQuantum MechanicsLogic SynthesisQuantum BitsQuantum CircuitsQuantum ComputationQuantum GatesQuantum Hardware ArchitecturesElementary Quantum GatesMulti-qubit GatesQuantum Circuit ConstructionQuantum Circuit DecompositionQuantum Circuit SynthesisQuantum Gate DecompositionQuantum Gate OptimizationQuantum Gate Synthesis
We consider a generic elementary gate sequence which is needed to implement a general quantum gate acting on n qubits-a unitary transformation with 4(n) degrees of freedom. For synthesizing the gate sequence, a method based on the so-called cosine-sine matrix decomposition is presented. The result is optimal in the number of elementary one-qubit gates, 4(n), and scales more favorably than the previously reported decompositions requiring 4(n)-2(n+1) controlled NOT gates.
16
<i>Quantum Computation and Quantum Information</i>
Michael A. Nielsen, Isaac L. Chuang, Lov K. Grover · American Journal of Physics · 2002 · 22.7K citations
Quantum computation and quantum information
Jim Law · ACM SIGSOFT Software Engineering Notes · 2001 · 19.2K citations
Computing, Computer Science, Physics +13
Elementary gates for quantum computation
Adriano Barenco, Charles H. Bennett, Richard Cleve et al. · Physical Review A · 1995 · 4.4K citations · Full text
A Survey of Combinatorial Gray Codes
Carla D. Savage · SIAM Review · 1997 · 487 citations