Quantum computation and quantum information
Quantum computation and quantum information
Quantum Information Processing
Optimal realizations of controlled unitary gates
Quantum Information & Computation
Asymptotically optimal circuits for arbitrary n-qubit diagonal comutations
Quantum Information & Computation
Optimal realizations of simplified Toffoli gates
Quantum Information & Computation
Note on the Khaneja glaser decomposition
Quantum Information & Computation
Synthesis of quantum-logic circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
On the Effect of Quantum Interaction Distance on Quantum Addition Circuits
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Block-based quantum-logic synthesis
Quantum Information & Computation
Multibit CkNOT quantum gates via Rydberg blockade
Quantum Information Processing
Constant-optimized quantum circuits for modular multiplication and exponentiation
Quantum Information & Computation
A Θ( √ n)-depth quantum adder on the 2D NTC quantum computer architecture
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Synthesis and optimization of reversible circuits—a survey
ACM Computing Surveys (CSUR)
Constant-Factor optimization of quantum adders on 2d quantum architectures
RC'13 Proceedings of the 5th international conference on Reversible Computation
Line ordering of reversible circuits for linear nearest neighbor realization
Quantum Information Processing
| Hi-index | 0.00 |
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 operator, then show that theyimplicitly describe the cosine-sine decomposition of a related operator. Leveraging thecanonical nature of such decompositions to limit one-qubit gates appearing in respectivecircuits, we prove that the n-qubit analogue of the TOFFOLI requires at least 2n CNOTgates. Additionally, our results offer a complete classification of three-qubit diagonaloperators by their CNOT-cost, which holds even if ancilla qubits are available.