pith. sign in

arxiv: quant-ph/0308006 · v3 · submitted 2003-08-01 · 🪐 quant-ph

Optimal Quantum Circuits for General Two-Qubit Gates

classification 🪐 quant-ph
keywords gatesquantumtwo-qubitone-qubitoptimalcnotdesiredgate
0
0 comments X
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. GULPS: Two-Qubit Gate Synthesis via Linear Programming for Heterogeneous Instruction Sets

    quant-ph 2025-05 unverdicted novelty 7.0

    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...

  2. Controlled Gate Networks: Theory and Application to Eigenvalue Estimation

    quant-ph 2022-08 conditional novelty 7.0

    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 ...