On the CNOT-cost of TOFFOLI gates

  title={On the CNOT-cost of TOFFOLI gates},
  author={Vivek V. Shende and Igor L. Markov},
  journal={Quantum Inf. Comput.},
The three-input TOFFOLI gate is the workhorse of circuit synthesis for classical logic oper-ations on quantum data, e.g., reversible arithmetic circuits. In physical implementations,however, TOFFOLI gates are decomposed into six CNOT gates and several one-qubit gates.Though this decomposition has been known for at least 10 years, we provide here thefirst demonstration of its CNOT-optimality. We study three-qubit circuits which containless than six CNOT gates and implement a block-diagonal… 

Figures and Tables from this paper

Single-step implementation of high-fidelity n -bit Toffoli gates
The family of $n$-bit Toffoli gates, with the two-bit Toffoli gate as the figurehead, are of great interest in quantum information as they can be used as universal gates and in quantum error
Reducing the CNOT count for Clifford+T circuits on NISQ architectures
This paper considers the problem of reducing the CNOT-count in Clifford+T circuits on connectivity constrained architectures such as noisy intermediate-scale quantum (NISQ) computing devices and finds that for both the benchmark and random circuits the first algorithm that uses the simple slicing technique dramatically reduces the C NOT-count compared to naively using SWAP gates.
Sequences of Molmer-Sorensen gates can implement controlled rotations using quantum signal processing techniques
This work considers a sequence of equal all-to-all MS operations, interleaved with single qubit gates that act only on one special qubit, and finds that it is possible to perform an arbitray SU(2) rotation on the special qubits if and only if all other qubits are in the state |1>.
Implementation of CNOT and Toffoli gates with higher-dimensional spaces
Minimizing the number of necessary two-qubit gates is an important task in quantum information processing. By introducing non-computational quantum states in auxiliary spaces, we construct effective
Sequences of Mølmer-Sørensen gates can implement controlled rotations using quantum signal processing techniques
Quantum logic gates with many control qubits are essential in many quantum algorithms, but remain challenging to perform in current experiments. Trapped ion quantum computers natively feature a
On the CNOT-complexity of CNOT-PHASE circuits
It is proved that CNOT minimization over CNOT and phase gates is at least as hard as synthesizing a CNOT-optimal circuit computing a set of parities of its inputs as well as NP-complete for two restricted cases where all CNOT gates are required to have the same target.
Block-based quantum-logic synthesis
A basic block based on the cosine-sine decomposition method is suggested which contains l qubits and it is shown that the exact value of $l$ affects the number of one-qubit and CNOT gates in the proposed method.
Signal processing techniques for efficient compilation of controlled rotations in trapped ions
Quantum logic gates with many control qubits are essential in many quantum algorithms, but remain challenging to perform in current experiments. Trapped ion quantum computers natively feature a
Machine-learning-based three-qubit gate design for the Toffoli gate and parity check in transmon systems
We use machine-learning techniques to design three-qubit entangling gates with fidelities of g99.9% and duration of 50 ns for nearest-neighbor coupled flux-tunable transmons in circuit quantum
Mediated gates between spin qubits
In a typical quantum circuit, nonlocal quantum gates are applied to nonproximal qubits. If the underlying physical interactions are short-range (e.g., exchange interactions between spins),


Elementary gates for quantum computation.
U(2) gates are derived, which derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number of unitary operations on arbitrarily many bits.
Optimal quantum circuits for general two-qubit gates (5 pages)
In order to demonstrate nontrivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum
Recognizing small-circuit structure in two-qubit operators (5 pages)
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,
Optimal realizations of simplified Toffoli gates
It is proved that the simplified Toffoli gate implementation by Margolus is optimal, in the sense that it attains a lower bound of three controlled-not gates, and subject to that, a sharp lower Bound of four single-qubit gates.
The simplified Toffoli gate implementation by Margolus is optimal
It is proved that the simplified Toffoli gate by Margolus, which coincides with the Toffolis gate up to a single change of sign, cannot be realized with less than three controlled-not gates.
Results on two-bit gate design for quantum computers
Numerical results show that the Toffoli gate, which is the universal gate for all classical reversible computation, can be implemented using a particular sequence of exactly five two-bit gates.
Universal quantum circuit for two-qubit transformations with three controlled-NOT gates
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
Nonlocal Properties of Two-Qubit Gates and Mixed States, and the Optimization of Quantum Computations
It is proved that one of two mixed states can be transformed into the other by single-qubit operations if and only if these states have equal values of all 18 invariants, which provides a complete description of nonlocal properties.
Quantum circuits for general multiqubit gates.
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 is considered, and a method based on the so-called cosine-sine matrix decomposition is presented.
Optimal realizations of controlled unitary gates
It is proved that a controlled-U gate can be realized with two controlled-not gates and four single qubit gates and that this implementation is optimal if and only if the matrix U satisfies the conditions tr U ≠ 0, tr(UX) ≡ 0, and det U ≡ 1.