Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0212109 · Physical Review Letters

Exact Two-Qubit Universal Quantum Circuit

Jun Zhang, Jiří Vala, Shankar Sastry, K. Birgitta Whaley

Published Jul 11, 2003• 78 citations
arXivHTMLPDF

Abstract

We provide an analytic way to implement any arbitrary two-qubit unitary operation, given an entangling two-qubit gate together with local gates. This is shown to provide explicit construction of a universal quantum circuit that exactly simulates arbitrary two-qubit operations in SU(4). Each block in this circuit is given in a closed form solution. We also provide a uniform upper bound of the applications of the given entangling gates, and find that exactly half of all the controlled-unitary gates satisfy the same upper bound as the CNOT gate. These results allow for the efficient implementation of operations in SU(4) required for both quantum computation and quantum simulation.

DOI
10.1103/physrevlett.91.027903

Related papers

Universal quantum circuit for two-qubit transformations with three controlled-NOT gates

Guifré Vidal, Christopher M. Dawson

We consider quantum circuits made of controlled-NOT (CNOT) gates and single-qubit unitary gates and look for constructions that minimize the use of CNOT gates. We show, by means of an explicit quantum circuit, that three CNOT gates are necessary and sufficient in order to implement an arbitrary unitary transformation of two qubits. We also identify the subset of two-qubit gates that can be performed with only two CNOT gates and provide a simple characterization for them.

arXiv:quant-ph/0307177•Physical Review A•Jan 8, 2004•296 citations

Minimal universal two-qubit controlled-NOT-based circuits

Vivek Shende, Igor L. Markov, Stephen S. Bullock

We give quantum circuits that simulate an arbitrary two-qubit unitary operator up to a global phase. For several quantum gate libraries we prove that gate counts are optimal in the worst and average cases. Our lower and upper bounds compare favorably to previously published results. Temporary storage is not used because it tends to be expensive in physical implementations. For each gate library, the best gate counts can be achieved by a single universal circuit. To compute the gate parameters in universal circuits, we use only closed-form algebraic expressions, and in particular do not rely on matrix exponentials. Our algorithm has been coded in $\mathrm{C}++$.

arXiv:quant-ph/0308033•Physical Review A•Jun 30, 2004•331 citations

Quantum-state preparation with universal gate decompositions

Martin Plesch, Časlav Brukner

In quantum computation every unitary operation can be decomposed into quantum circuits---a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-not(cnot) gates. Two measures are important when judging the complexity of the circuit: the total number of cnot gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of $2$. It also reduces the total number of cnot gates from ${2}^{n}$ to $\frac{23}{24}{2}^{n}$ in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from $11$ cnot gates to $9$ and the depth from $11$ to $5$ steps for four qubits. Our results are expected to help in designing and building small-scale quantum circuits using present technologies.

arXiv:1003.5760•Physical Review A•Mar 3, 2011•387 citations

Arbitrary two-qubit computation in 23 elementary gates

Stephen S. Bullock, Igor L. Markov

We address the problem of constructing quantum circuits to implement an arbitrary two-qubit quantum computation. We pursue circuits without ancilla qubits and as small a number of elementary quantum gates as possible. Our lower bound for worst-case optimal two-qubit circuits calls for at least $17$ gates: $15$ one-qubit rotations and $2$ controlled-NOT (CNOT) gates. We also constructively prove a worst-case upper bound of $23$ elementary gates, of which at most four (CNOT gates) entail multiqubit interactions. Our analysis shows that synthesis algorithms suggested in previous work, although more general, entail larger quantum circuits than ours in the special case of two qubits. One such algorithm has a worst case of $61$ gates, of which $18$ may be CNOT gates.

arXiv:quant-ph/0211002•Physical Review A•Jul 22, 2003•60 citations

Optimal quantum circuit synthesis from controlled-unitary gates

Jun Zhang, Jiří Vala, Shankar Sastry +1 more

Using a geometric approach, we derive the minimum number of applications needed for an arbitrary controlled-unitary gate to construct a universal quantum circuit. An analytic construction procedure is presented and shown to be either optimal or close to optimal. This result can be extended to improve the efficiency of universal quantum circuit construction from any entangling gate. In addition, for both the controlled-NOT (CNOT) and double-CNOT gates, we develop simple analytic ways to construct universal quantum circuits with three applications, which is the least possible for these gates.

arXiv:quant-ph/0308167•Physical Review A•Apr 16, 2004•56 citations

Conditions for optimal construction of two-qubit nonlocal gates

Yong-Sheng Zhang, Ming-Yong Ye, Guang‐Can Guo

Optimal implementation of quantum gates is crucial for designing a quantum computer. The necessary condition for optimal construction of a two-qubit unitary operation is obtained. It can be proved that the $B$ gate is the unique gate that can construct a two-qubit universal circuit with only two applications, i.e., this condition is also sufficient in the case of two applications of the elementary two-qubit gate. It is also shown that many perfect entanglers cannot simulate an arbitrary two-qubit gate with only three applications. We show how a two-qubit gate's construction power is related to the construction power of its mirror gate, and introduce a specific kind of two-qubit entangling gate, i.e., a super controlled gate, which can construct an arbitrary two-qubit gate by three applications.

arXiv:quant-ph/0411058•Physical Review A•Jun 24, 2005•43 citations
We provide an analytic way to implement any arbitrary two-qubit unitary operation, given an entangling two-qubit gate together with local gates. This is shown to provide explicit construction of a universal quantum circuit that exactly simulates arbitrary two-qubit operations in SU(4). Each block in this circuit is given in a closed form solution. We also provide a uniform upper bound of the applications of the given entangling gates, and find that exactly half of all the controlled-unitary gates satisfy the same upper bound as the CNOT gate. These results allow for the efficient implementation of operations in SU(4) required for both quantum computation and quantum simulation.
We give quantum circuits that simulate an arbitrary two-qubit unitary operator up to a global phase. For several quantum gate libraries we prove that gate counts are optimal in the worst and average cases. Our lower and upper bounds compare favorably to previously published results. Temporary storage is not used because it tends to be expensive in physical implementations. For each gate library, the best gate counts can be achieved by a single universal circuit. To compute the gate parameters in universal circuits, we use only closed-form algebraic expressions, and in particular do not rely on matrix exponentials. Our algorithm has been coded in C++\mathrm{C}++C++.
In quantum computation every unitary operation can be decomposed into quantum circuits---a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-not(cnot) gates. Two measures are important when judging the complexity of the circuit: the total number of cnot gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of 222. It also reduces the total number of cnot gates from 2n{2}^{n}2n to 23242n\frac{23}{24}{2}^{n}2423​2n in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from 111111 cnot gates to 999 and the depth from 111111 to 555 steps for four qubits. Our results are expected to help in designing and building small-scale quantum circuits using present technologies.
We address the problem of constructing quantum circuits to implement an arbitrary two-qubit quantum computation. We pursue circuits without ancilla qubits and as small a number of elementary quantum gates as possible. Our lower bound for worst-case optimal two-qubit circuits calls for at least 171717 gates: 151515 one-qubit rotations and 222 controlled-NOT (CNOT) gates. We also constructively prove a worst-case upper bound of 232323 elementary gates, of which at most four (CNOT gates) entail multiqubit interactions. Our analysis shows that synthesis algorithms suggested in previous work, although more general, entail larger quantum circuits than ours in the special case of two qubits. One such algorithm has a worst case of 616161 gates, of which 181818 may be CNOT gates.
Using a geometric approach, we derive the minimum number of applications needed for an arbitrary controlled-unitary gate to construct a universal quantum circuit. An analytic construction procedure is presented and shown to be either optimal or close to optimal. This result can be extended to improve the efficiency of universal quantum circuit construction from any entangling gate. In addition, for both the controlled-NOT (CNOT) and double-CNOT gates, we develop simple analytic ways to construct universal quantum circuits with three applications, which is the least possible for these gates.
Optimal implementation of quantum gates is crucial for designing a quantum computer. The necessary condition for optimal construction of a two-qubit unitary operation is obtained. It can be proved that the BBB gate is the unique gate that can construct a two-qubit universal circuit with only two applications, i.e., this condition is also sufficient in the case of two applications of the elementary two-qubit gate. It is also shown that many perfect entanglers cannot simulate an arbitrary two-qubit gate with only three applications. We show how a two-qubit gate's construction power is related to the construction power of its mirror gate, and introduce a specific kind of two-qubit entangling gate, i.e., a super controlled gate, which can construct an arbitrary two-qubit gate by three applications.