Optimal Quantum Circuits for General Two-Qubit Gates
read the original abstract
In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence of one-qubit and two-qubit gates. We contribute to this effort by providing a method to construct an optimal quantum circuit for a general two-qubit gate that requires at most 3 CNOT gates and 15 elementary one-qubit gates. Moreover, if the desired two-qubit gate corresponds to a purely real unitary transformation, we provide a construction that requires at most 2 CNOTs and 12 one-qubit gates. We then prove that these constructions are optimal with respect to the family of CNOT, y-rotation, z-rotation, and phase gates.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
GULPS: Two-Qubit Gate Synthesis via Linear Programming for Heterogeneous Instruction Sets
GULPS partitions two-qubit unitary synthesis into depth-2 segments solved via linear programming over Littlewood-Richardson inequalities followed by least-squares optimization, yielding faster and lower-cost decomposi...
-
Controlled Gate Networks: Theory and Application to Eigenvalue Estimation
Controlled gate networks reduce two-qubit gate counts for linear combinations of unitary operators in quantum circuits, shown in variational calculations, rodeo eigenvalue estimation, and lattice nucleon evolution on ...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.