Improved Quantum Cost for n-bit Toffoli Gates
arXiv:quant-ph/0403053 · doi:10.1049/el:20031202
Abstract
We present an n-bit Toffoli gate quantum circuit based on the realization proposed by Barenco, where some of the Toffoli gates in their construction are replaced with Peres gates. This results in a significant cost reduction. Our main contribution is a quantum circuit which simulates the (m+1)-bit Toffoli gate with 32m-96 elementary quantum gates and one garbage bit which is passed unchanged. This paper is a corrected and expanded version of our recent journal publication.
Cited by in corpus (17)
- Realization of the quantum Toffoli gate with trapped ions
- Synthesis and Optimization of Reversible Circuits - A Survey
- Quantum Circuit Simplification and Level Compaction
- Circuit-Based Quantum Random Access Memory for Classical Data
- Fast multi-qubit gates by adiabatic evolution in interacting excited state manifolds
- Five Two-Qubit Gates Are Necessary for Implementing Toffoli Gate
- Reducing Quantum Cost in Reversible Toffoli Circuits
- Linear and logarithmic time compositions of quantum many-body operators
- New techniques for fault-tolerant decomposition of Multi-Controlled Toffoli gate
- A high-fidelity method for a single-step -bit Toffoli gate in trapped ions
- An algorithm for minimization of quantum cost
- Complexity Analysis of Reversible Logic Synthesis
- Signal processing techniques for efficient compilation of controlled rotations in trapped ions
- Evolutionary Quantum Logic Synthesis of Boolean Reversible Logic Circuits Embedded in Ternary Quantum Space using Heuristics
- Fault-tolerance in qudit circuit design
- Electron cloud design for Rydberg multi-qubit gates
- A Reed Muller-based approach for optimization of general binary quantum multiplexers