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:1108.3966 · Nature

Implementation of a Toffoli gate with superconducting circuits

Arkady Fedorov, L. Steffen, Matthias Baur, Marcus Palmer Da Silva, Andreas J. Wallraff

Published Dec 13, 2011• 399 citations
arXivHTMLPDF
DOI
10.1038/nature10713

Related papers

One-step implementation of a Toffoli gate of separated superconducting qubits via quantum Zeno dynamics

Meifeng Chen, Yongfa Chen, Ma Song-She

Quantum Information Processing•Dec 30, 2015•9 citations

Efficient Toffoli Gate in Circuit Quantum Electrodynamics

Matthew Reed, L. DiCarlo, Luyan Sun +2 more

Bulletin of the American Physical Society•Mar 21, 2011•0 citations

Hardware-Conscious Optimization of the Quantum Toffoli Gate

Max Aksel Bowman, Pranav Gokhale, Jeffrey M. Larson +2 more

While quantum computing holds great potential in combinatorial optimization, electronic structure calculation, and number theory, the current era of quantum computing is limited by noisy hardware. Many quantum compilation approaches can mitigate the effects of imperfect hardware by optimizing quantum circuits for objectives such as critical path length. Few approaches consider quantum circuits in terms of the set of vendor-calibrated operations (i.e., native gates) available on target hardware. This manuscript expands the analytical and numerical approaches for optimizing quantum circuits at this abstraction level. We present a procedure for combining the strengths of analytical native gate-level optimization with numerical optimization. Although we focus on optimizing Toffoli gates on the IBMQ native gate set, the methods presented are generalizable to any gate and superconducting qubit architecture. Our optimized Toffoli gate implementation demonstrates an 18% reduction in infidelity compared with the canonical implementation as benchmarked on IBM Jakarta with quantum process tomography. Assuming the inclusion of multi-qubit cross-resonance (MCR) gates in the IBMQ native gate set, we produce Toffoli implementations with only six multi-qubit gates, a 25% reduction from the canonical eight multi-qubit implementations for linearly connected qubits.

arXiv:2209.02669•ACM Transactions on Quantum Computing•Jul 20, 2023•17 citations

Single-step implementation of high-fidelity n -bit Toffoli gates

S. E. Rasmussen, Koen Groenland, R. Gerritsma +2 more

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 correction, among other things. We present a single-step implementation of arbitrary $n$-bit Toffoli gates (up to a local change of basis), based on resonantly driving a single qubit that has a strong Ising coupling to $n$ other qubits. The setup in the two-qubit case turns out to be identical to the universal Barenco gate. The gate time and error are, in theory, independent of the number of control qubits, scaling better than conventional circuit decompositions. We note that our assumptions, namely, strongly coupling $n+1$ qubits and a driving frequency that scales with $n$, may break down for large systems. Still, our protocol could enhance the capabilities of intermediate-scale quantum computers, and we discuss the prospects of implementing our protocol on trapped ions, Rydberg atoms, and superconducting circuits. Simulations of the latter platform show that the Toffoli gate with two control bits attains fidelities of above 0.98 even in the presence of decoherence. We also show how similar ideas can be used to make a series of controlled-not gates in a single step. We show how these can speed up the implementation of quantum error correcting codes and we simulate the encoding steps of the three-qubit bit-flip code and the seven-qubit Steane code.

arXiv:1910.07548•Physical Review A•Feb 7, 2020•77 citations

Novel Computing Approaches with Superconducting Circuits

Jose L Pacheco, Ajit Hira, Amanda Trujillo

Bulletin of the American Physical Society•Mar 8, 2018•0 citations

Practical fidelity limits of Toffoli gates in superconducting quantum processors

M. AbuGhanem

arXiv:2509.05395•The European Physical Journal Plus•Aug 26, 2026•6 citations
While quantum computing holds great potential in combinatorial optimization, electronic structure calculation, and number theory, the current era of quantum computing is limited by noisy hardware. Many quantum compilation approaches can mitigate the effects of imperfect hardware by optimizing quantum circuits for objectives such as critical path length. Few approaches consider quantum circuits in terms of the set of vendor-calibrated operations (i.e., native gates) available on target hardware. This manuscript expands the analytical and numerical approaches for optimizing quantum circuits at this abstraction level. We present a procedure for combining the strengths of analytical native gate-level optimization with numerical optimization. Although we focus on optimizing Toffoli gates on the IBMQ native gate set, the methods presented are generalizable to any gate and superconducting qubit architecture. Our optimized Toffoli gate implementation demonstrates an 18% reduction in infidelity compared with the canonical implementation as benchmarked on IBM Jakarta with quantum process tomography. Assuming the inclusion of multi-qubit cross-resonance (MCR) gates in the IBMQ native gate set, we produce Toffoli implementations with only six multi-qubit gates, a 25% reduction from the canonical eight multi-qubit implementations for linearly connected qubits.
The family of nnn-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 correction, among other things. We present a single-step implementation of arbitrary nnn-bit Toffoli gates (up to a local change of basis), based on resonantly driving a single qubit that has a strong Ising coupling to nnn other qubits. The setup in the two-qubit case turns out to be identical to the universal Barenco gate. The gate time and error are, in theory, independent of the number of control qubits, scaling better than conventional circuit decompositions. We note that our assumptions, namely, strongly coupling n+1n+1n+1 qubits and a driving frequency that scales with nnn, may break down for large systems. Still, our protocol could enhance the capabilities of intermediate-scale quantum computers, and we discuss the prospects of implementing our protocol on trapped ions, Rydberg atoms, and superconducting circuits. Simulations of the latter platform show that the Toffoli gate with two control bits attains fidelities of above 0.98 even in the presence of decoherence. We also show how similar ideas can be used to make a series of controlled-not gates in a single step. We show how these can speed up the implementation of quantum error correcting codes and we simulate the encoding steps of the three-qubit bit-flip code and the seven-qubit Steane code.