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:2605.24182

Quantum-Adaptive KS($\varphi$): A Parameterized Three-Qubit Gate Family Embedding Toffoli with Measurement-Free Phase Kickback and Intrinsic Error Non-Amplification

Kripa Sankaranarayanan, Marek Perkowski

quant-phcs.ETSubmitted May 22, 2026• Announced May 26, 2026• 0 citations
arXivHTMLPDF

Abstract

We introduce Quantum-Adaptive KS($\varphi$) ($K$ = kickback, $S$ = sandwich), a parameterized three-qubit gate family that structurally embeds the Toffoli (CCX) gate within two additional components: (1)a palindromic Hadamard sandwich on the first control qubit $q_0$ that conjugates $Z$-type errors to $X$-type in the CCX frame, providing simultaneous sensitivity to both error types without ancilla overhead; and (2)a controlled-phase (CP) gate whose quantum phase kickback propagates post-CCX target-state information into the control-qubit phase without measurement. The term Quantum- Adaptive refers to amplitude steering conditioned by the compile-time parameter $\varphi$ via a Quantum Neural Cellular Automaton (QNCA) majority-inspired bias rule; the gate does not self-modify at runtime. Two QA-KS($π$) gates chained on a shared control qubit $q_0$ produce outputs completely orthogonal to two sequential CCX gates on $q_0$=1 inputs (output fidelity F=0.000), while agreeing exactly on $q_0$=0 inputs (F=1.000). This subspace-dependent divergence is the direct computational signature of coherent phase retention across gate boundaries -- impossible for CCX-only circuits. On the $q_1$ = 0 subspace the gate acts deterministically (up to a relative phase), providing intrinsic error non-amplification. On the $q_1$ = 1 subspace it produces four-component entangled superpositions, making it a strictly distinct quantum-native primitive from CCX. We present the complete $8 \times 8$ unitary matrix, confirmed exact to $||U^{\dagger}U-I||_{\infty} < 10^{-15}$, and define two canonical variants: QA-KS$_{π/2}$ ($\varphi = π/2$, $S$ gate) and QA-KS$_π$ ($\varphi = π$, $Z$ gate). Qiskit depolarizing-noise simulation demonstrates near-unit fidelity at $p \leq 10^{-2}$ with an honest depth cost at higher error rates. The gate preserves the three-qubit footprint of CCX with no qubit overhead.

Related papers

Context-Verified, Error-Budget-Aware Decomposition Selection for Toffoli Networks

Karol Bartkiewicz, Patrycja Tulewicz

The cheapest Toffoli (CCX) decompositions (relative-phase and control-reduced Toffolis) save two-qubit gates, which dominate the error budget of near-term hardware, but they are correct only in context, since a relative phase is observable only when superposed branches interfere. We propose quantum chip performance tuning (QCPT), a compiler that selects the cheapest decomposition for each Toffoli (stage 1) and admits it only if a per-instance check shows that it equals the exact gate, up to one phase, on every state that can enter it; a whole-circuit certificate gates the output. The output acts as the exact circuit on every valid input, superposed ones included, up to a reported global phase, which per-state checks do not guarantee. Substituting relative-phase Toffolis wherever they fit changes the unitary of six of twelve benchmark circuits used as subroutines, whereas stage 1 changes none and removes 31.0% of the two-qubit gates. A certified resynthesis of classical circuits of up to ten qubits raises the saving to 43.1% on the primary suite and to 57.5% on 20 small RevLib circuits (in-sample). A bound on the compilation error plus the per-gate device error separates what the compiler adds from what a depolarizing two-qubit model of the device adds. In mirror tests on ibm_aachen, QCPT (best of four candidates, one of them the Qiskit circuit) returns more often than Qiskit on all nine circuits; in simulation with the calibration that drives its selection, on 29 of 33 circuits and worse on none by more than 0.01. An iterative language-model search with our certificate obtains no fewer gates on any of nine circuits and needs about 45 times longer (one run each). QCPT gives no gain without Toffoli structure. Certified context-dependent selection can thus let near-term devices run larger Toffoli circuits at a given success probability, with a gain that varies by family.

quant-pharXiv:2606.31791•Jul 1, 2026•2 citations

Measurement-Driven Adaptive Low-Overhead Implementation of Multi-Controlled Toffoli Gates

Abhoy Kole, Till Schnittka, Rolf Drechsler

The Toffoli gate is a fundamental building block for quantum arithmetic and reversible logic, yet its efficient realization remains a major challenge in both near-term and fault-tolerant quantum architectures. Recent advances in dynamic quantum circuit capabilities, including mid-circuit measurement and classical feedforward, provide new opportunities for reducing the resource overhead of non-Clifford operations. In this work, we propose a set of dynamic decomposition strategies for multi-controlled Toffoli gates that exploit adaptive circuit execution and ancilla-assisted constructions. Our methods systematically reduce entangling-gate count, T-count, and T-depth compared with conventional static decompositions, while preserving fault-tolerance guarantees. Through analytical cost models and experimental evaluation, we demonstrate that relative-phase primitives and measurement-conditioned corrections enable scalable implementations with improved depth and resource efficiency.

quant-pharXiv:2605.18159•IEEE International Symposium on Design and Diagnostics of Electronic Circuits & Systems (DDECS)•May 19, 2026•2 citations

Adaptive Clifford+T Decomposition of Large Toffoli Gates with One Clean Ancilla

Abhoy Kole, Majd Assaad, Till Schnittka +1 more

Multi-controlled Toffoli gates are fundamental building blocks in quantum computation, with applications in quantum arithmetic, simulation, and search algorithms. In fault-tolerant architectures, their realization is constrained by the high cost of non-Clifford resources, particularly in terms of T-count and T-depth. Recent advances have demonstrated that the use of ancillary qubits, relative-phase Toffoli gates, and dynamic circuit techniques can substantially reduce this overhead. In this work, we investigate the decomposition of large Toffoli gates using 3- and 4-input relative-phase Toffoli gates in the presence of a single clean ancilla and conditionally clean ancillas. We derive explicit resource bounds for Clifford+T implementations incorporating dynamic-circuit-based uncomputation and measurement-conditioned corrections. Our analysis emphasizes T-depth reduction under fixed CX and T-count overhead, ensuring relevance for near-term devices. We show that introducing 4-input relative-phase Toffoli gates enables significant T-depth reductions through enhanced parallelism while maintaining favorable ancilla requirements. We further validate our theoretical results through experimental evaluation and comparative analysis with existing approaches.

quant-pharXiv:2605.18169•May 19, 2026•1 citation

Toffoli-porttien toteutuskustannuksien alentaminen approksimaatioilla

Simo Puttonen

The Toffoli gate (controlled-controlled-NOT) and its multi-controlled generalizations are fundamental logical building blocks of quantum algorithms and utilized extensively in pivotal algorithms such as Grover’s algorithm and Shor’s algorithm. Despite being a fundamental logical primitive of quantum algorithms, Toffoli gates must be decomposed to primitive single-qubit and two-qubit gates which are available in physical quantum hardware. These decompositions incur significant implementation costs in circuit depth and gate count, costs that propagate directly to the entire circuit. Consequently, reducing the implementation cots of Toffoli gates provides a direct method of reducing the implementation costs of many quantum algorithms. This thesis evaluates state-of-the-art methods for reducing the implementation costs of Toffoli gates by introducing approximations. While approximations introduce errors to the output of the Toffoli gate, they can reduce the depth and gate count of the implementation. This thesis finds that discrete errors in two-qubit and three-qubit controlled Toffoli gates have been utilized to reduce the gate counts in such a way that the implementation is exact cancelling the errors. Additionally, continuous errors are utilized to reduce the depth of a multi-controlled Toffoli gate decomposition in ancilla-free settings. However, this review also demonstrates other, non-approximate, construction of multi-controlled Toffoli gate, which achieves comparable implementation costs demonstrating marginal gains for the approximation techniques currently.

•Apr 24, 2026•0 citations

Post-selection-free preparation of high-quality physical qubits

Ben Barber, Neil I. Gillespie, J. M. Taylor

Rapidly improving gate fidelities for coherent operations mean that errors in state preparation and measurement (SPAM) may become a dominant source of error for fault-tolerant operation of quantum computers. This is particularly acute in superconducting systems, where tradeoffs in measurement fidelity and qubit lifetimes have limited overall performance. Fortunately, the essentially classical nature of preparation and measurement enables a wide variety of techniques for improving quality using auxiliary qubits combined with classical control and post-selection. In practice, however, post-selection greatly complicates the scheduling of processes such as syndrome extraction. Here we present a family of quantum circuits that prepare high-quality |0 ⟩ states without post-selection, instead using CNOT and Toffoli gates to non-linearly permute the computational basis. We find meaningful performance enhancements when two-qubit gate fidelities errors go below 0.2%, and even better performance when native Toffoli gates are available.

arXiv:2209.05391•Quantum•May 4, 2023•2 citations

Measurement-Free Ultrafast Quantum Error Correction by Using Multi-Controlled Gates in Higher-Dimensional State Space

Toshiaki Inada, Wonho Jang, Y. Iiyama +4 more

Quantum error correction is a crucial step beyond the current noisy-intermediate-scale quantum device towards fault-tolerant quantum computing. However, most of the error corrections ever demonstrated rely on post-selection of events or post-correction of states, based on measurement results repeatedly recorded during circuit execution. On the other hand, real-time error correction is supposed to be performed through classical feedforward of the measurement results to data qubits. It provides unavoidable latency from conditional electronics that would limit the scalability of the next-generation quantum processors. Here we propose a new approach to real-time error correction that is free from measurement and realized by using multi-controlled gates based on higher-dimensional state space. Specifically, we provide a series of novel decompositions of a Toffoli gate by using the lowest three energy levels of a transmon that significantly reduce the number of two-qubit gates and discuss their essential features, such as extendability to an arbitrary number of control qubits, the necessity of exclusively controlled NOT gates, and usefulness of their incomplete variants. Combined with the recently demonstrated schemes of fast two-qubit gates and all-microwave qubit reset, it would substantially shorten the time required for error correction and resetting ancilla qubits compared to a measurement-based approach and provide an error correction rate of $\gtrsim1$~MHz with high accuracy for three-qubit bit- and phase-flip errors.

arXiv:2109.00086•Aug 31, 2021•13 citations
Quantum-Adaptive KS(φ\varphiφ): A Parameterized Three-Qubit Gate Family Embedding Toffoli with Measurement-Free Phase Kickback and Intrinsic Error Non-Amplification
We introduce Quantum-Adaptive KS(φ\varphiφ) (KKK = kickback, SSS = sandwich), a parameterized three-qubit gate family that structurally embeds the Toffoli (CCX) gate within two additional components: (1)a palindromic Hadamard sandwich on the first control qubit q0q_0q0​ that conjugates ZZZ-type errors to XXX-type in the CCX frame, providing simultaneous sensitivity to both error types without ancilla overhead; and (2)a controlled-phase (CP) gate whose quantum phase kickback propagates post-CCX target-state information into the control-qubit phase without measurement. The term Quantum- Adaptive refers to amplitude steering conditioned by the compile-time parameter φ\varphiφ via a Quantum Neural Cellular Automaton (QNCA) majority-inspired bias rule; the gate does not self-modify at runtime. Two QA-KS(πππ) gates chained on a shared control qubit q0q_0q0​ produce outputs completely orthogonal to two sequential CCX gates on q0q_0q0​=1 inputs (output fidelity F=0.000), while agreeing exactly on q0q_0q0​=0 inputs (F=1.000). This subspace-dependent divergence is the direct computational signature of coherent phase retention across gate boundaries -- impossible for CCX-only circuits. On the q1q_1q1​ = 0 subspace the gate acts deterministically (up to a relative phase), providing intrinsic error non-amplification. On the q1q_1q1​ = 1 subspace it produces four-component entangled superpositions, making it a strictly distinct quantum-native primitive from CCX. We present the complete 8×88 \times 88×8 unitary matrix, confirmed exact to ∣∣U†U−I∣∣∞<10−15||U^{\dagger}U-I||_{\infty} < 10^{-15}∣∣U†U−I∣∣∞​<10−15, and define two canonical variants: QA-KSπ/2_{π/2}π/2​ (φ=π/2\varphi = π/2φ=π/2, SSS gate) and QA-KSπ_ππ​ (φ=π\varphi = πφ=π, ZZZ gate). Qiskit depolarizing-noise simulation demonstrates near-unit fidelity at p≤10−2p \leq 10^{-2}p≤10−2 with an honest depth cost at higher error rates. The gate preserves the three-qubit footprint of CCX with no qubit overhead.
The cheapest Toffoli (CCX) decompositions (relative-phase and control-reduced Toffolis) save two-qubit gates, which dominate the error budget of near-term hardware, but they are correct only in context, since a relative phase is observable only when superposed branches interfere. We propose quantum chip performance tuning (QCPT), a compiler that selects the cheapest decomposition for each Toffoli (stage 1) and admits it only if a per-instance check shows that it equals the exact gate, up to one phase, on every state that can enter it; a whole-circuit certificate gates the output. The output acts as the exact circuit on every valid input, superposed ones included, up to a reported global phase, which per-state checks do not guarantee. Substituting relative-phase Toffolis wherever they fit changes the unitary of six of twelve benchmark circuits used as subroutines, whereas stage 1 changes none and removes 31.0% of the two-qubit gates. A certified resynthesis of classical circuits of up to ten qubits raises the saving to 43.1% on the primary suite and to 57.5% on 20 small RevLib circuits (in-sample). A bound on the compilation error plus the per-gate device error separates what the compiler adds from what a depolarizing two-qubit model of the device adds. In mirror tests on ibm_aachen, QCPT (best of four candidates, one of them the Qiskit circuit) returns more often than Qiskit on all nine circuits; in simulation with the calibration that drives its selection, on 29 of 33 circuits and worse on none by more than 0.01. An iterative language-model search with our certificate obtains no fewer gates on any of nine circuits and needs about 45 times longer (one run each). QCPT gives no gain without Toffoli structure. Certified context-dependent selection can thus let near-term devices run larger Toffoli circuits at a given success probability, with a gain that varies by family.
The Toffoli gate is a fundamental building block for quantum arithmetic and reversible logic, yet its efficient realization remains a major challenge in both near-term and fault-tolerant quantum architectures. Recent advances in dynamic quantum circuit capabilities, including mid-circuit measurement and classical feedforward, provide new opportunities for reducing the resource overhead of non-Clifford operations. In this work, we propose a set of dynamic decomposition strategies for multi-controlled Toffoli gates that exploit adaptive circuit execution and ancilla-assisted constructions. Our methods systematically reduce entangling-gate count, T-count, and T-depth compared with conventional static decompositions, while preserving fault-tolerance guarantees. Through analytical cost models and experimental evaluation, we demonstrate that relative-phase primitives and measurement-conditioned corrections enable scalable implementations with improved depth and resource efficiency.
Multi-controlled Toffoli gates are fundamental building blocks in quantum computation, with applications in quantum arithmetic, simulation, and search algorithms. In fault-tolerant architectures, their realization is constrained by the high cost of non-Clifford resources, particularly in terms of T-count and T-depth. Recent advances have demonstrated that the use of ancillary qubits, relative-phase Toffoli gates, and dynamic circuit techniques can substantially reduce this overhead. In this work, we investigate the decomposition of large Toffoli gates using 3- and 4-input relative-phase Toffoli gates in the presence of a single clean ancilla and conditionally clean ancillas. We derive explicit resource bounds for Clifford+T implementations incorporating dynamic-circuit-based uncomputation and measurement-conditioned corrections. Our analysis emphasizes T-depth reduction under fixed CX and T-count overhead, ensuring relevance for near-term devices. We show that introducing 4-input relative-phase Toffoli gates enables significant T-depth reductions through enhanced parallelism while maintaining favorable ancilla requirements. We further validate our theoretical results through experimental evaluation and comparative analysis with existing approaches.
The Toffoli gate (controlled-controlled-NOT) and its multi-controlled generalizations are fundamental logical building blocks of quantum algorithms and utilized extensively in pivotal algorithms such as Grover’s algorithm and Shor’s algorithm. Despite being a fundamental logical primitive of quantum algorithms, Toffoli gates must be decomposed to primitive single-qubit and two-qubit gates which are available in physical quantum hardware. These decompositions incur significant implementation costs in circuit depth and gate count, costs that propagate directly to the entire circuit. Consequently, reducing the implementation cots of Toffoli gates provides a direct method of reducing the implementation costs of many quantum algorithms. This thesis evaluates state-of-the-art methods for reducing the implementation costs of Toffoli gates by introducing approximations. While approximations introduce errors to the output of the Toffoli gate, they can reduce the depth and gate count of the implementation. This thesis finds that discrete errors in two-qubit and three-qubit controlled Toffoli gates have been utilized to reduce the gate counts in such a way that the implementation is exact cancelling the errors. Additionally, continuous errors are utilized to reduce the depth of a multi-controlled Toffoli gate decomposition in ancilla-free settings. However, this review also demonstrates other, non-approximate, construction of multi-controlled Toffoli gate, which achieves comparable implementation costs demonstrating marginal gains for the approximation techniques currently.
Rapidly improving gate fidelities for coherent operations mean that errors in state preparation and measurement (SPAM) may become a dominant source of error for fault-tolerant operation of quantum computers. This is particularly acute in superconducting systems, where tradeoffs in measurement fidelity and qubit lifetimes have limited overall performance. Fortunately, the essentially classical nature of preparation and measurement enables a wide variety of techniques for improving quality using auxiliary qubits combined with classical control and post-selection. In practice, however, post-selection greatly complicates the scheduling of processes such as syndrome extraction. Here we present a family of quantum circuits that prepare high-quality |0 ⟩ states without post-selection, instead using CNOT and Toffoli gates to non-linearly permute the computational basis. We find meaningful performance enhancements when two-qubit gate fidelities errors go below 0.2%, and even better performance when native Toffoli gates are available.
Quantum error correction is a crucial step beyond the current noisy-intermediate-scale quantum device towards fault-tolerant quantum computing. However, most of the error corrections ever demonstrated rely on post-selection of events or post-correction of states, based on measurement results repeatedly recorded during circuit execution. On the other hand, real-time error correction is supposed to be performed through classical feedforward of the measurement results to data qubits. It provides unavoidable latency from conditional electronics that would limit the scalability of the next-generation quantum processors. Here we propose a new approach to real-time error correction that is free from measurement and realized by using multi-controlled gates based on higher-dimensional state space. Specifically, we provide a series of novel decompositions of a Toffoli gate by using the lowest three energy levels of a transmon that significantly reduce the number of two-qubit gates and discuss their essential features, such as extendability to an arbitrary number of control qubits, the necessity of exclusively controlled NOT gates, and usefulness of their incomplete variants. Combined with the recently demonstrated schemes of fast two-qubit gates and all-microwave qubit reset, it would substantially shorten the time required for error correction and resetting ancilla qubits compared to a measurement-based approach and provide an error correction rate of ≳1\gtrsim1≳1~MHz with high accuracy for three-qubit bit- and phase-flip errors.