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:2507.12448 · Physical Review Research

Jenga-Krotov algorithm: Efficient compilation of multiqubit gates for exchange-only qubits

Jiahao Wu, Guanjie He, Wenyuan Zhuo, Quan Fu, Xin Wang

Published Nov 12, 2025• 0 citations
arXivHTMLPDF

Abstract

Exchange-only (EO) qubits, implemented in triple-quantum-dot systems, offer a compelling platform for scalable semiconductor-based quantum computing by enabling universal control through purely exchange interactions. While high-fidelity single- and two-qubit gates have been demonstrated, the synthesis of efficient multiqubit operations—such as the Toffoli gate—remains a key bottleneck. Conventional gate decompositions into elementary operations lead to prohibitively long and error-prone pulse sequences, limiting practical deployment. In this work, we introduce a gradient-based optimization algorithm, Jenga-Krotov (JK), tailored to discover compact, high-fidelity EO gate sequences. Applying JK to the Toffoli gate, we reduce the number of required exchange unitaries from 216 (in direct decomposition) to 92, and compress the time steps required from 162 to 50, all while maintaining target fidelity. Under realistic noise, the accumulated gate error from our optimized sequence is an order of magnitude lower than that of conventional approaches. We have also applied the JK algorithm to other multiqubit gates and algorithm. For the Fredkin gate, it reduces the number of time steps from 200 to 104 and the number of exchange unitaries from 276 to 172. For the quantum Fourier transform, it compresses the sequence from 180 to 80 time steps and from 237 to 202 exchange unitaries. These results demonstrate that the JK algorithm is a general and scalable strategy for multiqubit gate synthesis in EO architectures, potentially facilitating realization of multiqubit algorithms on semiconductor platforms.

DOI
10.1103/1x1x-j1xl

Related papers

Minimal nonorthogonal gate decomposition for qubits with limited control

Xiao‐Ming Zhang, Jianan Li, Xin Wang +1 more

In quantum control theory, a question of fundamental and practical interest is how an arbitrary unitary transformation can be decomposed into a minimum number of elementary rotations for implementation, subject to various physical constraints. Examples include the singlet-triplet (ST) and exchange-only (EO) qubits in quantum-dot systems, and gate construction in the Solovay--Kitaev algorithm. For two important scenarios, we present complete solutions to the problems of optimal decomposition of single-qubit unitary gates with non-orthogonal rotations. For each unitary gate, the criteria for determining the minimal number of pieces is given, the explicit gate construction procedure, as well as a computer code for practical uses. Our results include an analytic explanation to the four-gate decomposition of EO qubits, previously determined numerically by Divincenzo et al. [Nature (London) 408, 339 (2000)]. Furthermore, compared with the approaches of Ramon sequence and its variant [Phys. Rev. Lett. 118, 216802 (2017)], our method can reduce about 50% of gate time for ST qubits. Finally, our approach can be extended to solve the problem of optimal control of topological qubits, where gate construction is achieved through the braiding operations.

arXiv:1810.07569•Physical Review A•May 24, 2019•2 citations

Variational quantum compiling for three-qubit-gate design in quantum dots

Yuanyang Zhou, Huaxin He, Fengtao Pang +3 more

Semiconductor quantum dots provide a promising platform for spin qubit manipulation and quantum logic gate implementation, which are essential for scalable quantum computing architectures. In this work we utilize a variational quantum compiling algorithm to design efficient three-qubit gates using a time-independent Hamiltonian composed of only physical interaction terms. The resulting gates, including the Toffoli and Fredkin gates, demonstrate high fidelity and robustness against both coherent and incoherent noise sources, including charge and nuclear spin noise. This method is applicable to a wide range of physical systems, such as superconducting qubits and trapped ions, paving the way for more resilient and universal quantum computing architectures.

arXiv:2412.06276•Physical Review A•Apr 18, 2025•2 citations

Demonstration of an always-on exchange-only spin qubit

Joseph Broz, Jesse C. Hoke, Edwin Acuna +1 more

Abstract In conventional exchange-only (EO) spin qubit demonstrations, quantum gates have been implemented using sequences of individually pulsed pairwise exchange interactions with only one exchange coupling active at a time. Alternatively, multiple non-commuting exchange interactions can be pulsed simultaneously, reducing circuit depths and providing protection against leakage. We demonstrate high-fidelity quantum control of an always-on exchange-only (AEON) qubit, operated using simultaneous exchange pulses in a triangular quantum dot (QD) array. We use blind randomized benchmarking to characterize the performance of the full AEON single-qubit Clifford gate set, achieving an average Clifford gate fidelity F C1 = 99.86%. Extensions of this work may enable more efficient EO two-qubit entangling gates as well as the implementation of native i -Toffoli gates in Loss-DiVincenzo single-spin qubits.

Nature Communications•Apr 3, 2026•1 citation

Feasibility of single-shot realizations of conditional three-qubit gates in exchange-coupled qubit arrays with local control

Vladimir M. Stojanović

We investigate the feasibility of single-shot Toffoli- and Fredkin-gate realizations in qubit arrays with Heisenberg-type exchange interactions between adjacent qubits. As follows from the Lie-algebraic criteria of controllability, such an array is rendered completely controllable---equivalent to allowing universal quantum computation---by a Zeeman-like control field with two orthogonal components acting on a single ``actuator'' qubit. Adopting this local-control setting, we start our analysis with piecewise-constant control fields and determine the global maxima of the relevant figure of merit (target-gate fidelity) by combining the multistart-based clustering algorithm and quasi-Newton type local optimization. We subsequently introduce important practical considerations, such as finite frequency bandwidth of realistic fields and their leakage away from the actuator. We find the shortest times required for high-fidelity Toffoli- and Fredkin-gate realizations and provide comparisons to their respective two-qubit counterparts---controlled-not and exponential-swap. In particular, the Toffoli-gate time compares much more favorably to that of controlled-not than in the standard decomposition-based approach. This study indicates that the use of the single-shot approach can alleviate the burden on control-generating hardware in future experimental realizations of multiqubit gates.

arXiv:1901.01194•Physical Review A•Jan 29, 2019•11 citations

Quantum Gates for Quantum Dots

Matthew P. Wardrop

Since the mid-20th century it has been understood that a general-purpose quan- tum computer would be able to efficiently solve problems that will forever be out-of-reach for conventional computers. Since then, many quantum algorithms have been developed with applications in a wide range of domains including cryptography, simulations, machine learning and data analysis. While this has resulted in substantial attention being paid to the development of quantum com- puters, the best architectures to use in their fabrication is not yet clear. Semiconductor quantum dot devices are a particularly promising candidate for use in quantum computing architectures, as it is anticipated that once the funda- mental building blocks are implemented, they might be massively scalable using the existing lithography techniques of the semiconductor industry. So far, how- ever, it is not yet clear how best to implement the high-fidelity gates required for general-purpose quantum computation. In this thesis, we present and characterise novel theoretical proposals for fast, simple and high-fidelity two-qubit gates using magnetic (exchange) coupling for specific semiconductor quantum dot qubits; namely, the singlet-triplet and resonant-exchange qubits. These two-qubit operations are simple enough that it is feasible for them to be implemented in experiments of the near future. Success- ful implementations would significantly extend the experimentally demonstrable frontier of semi-conductor quantum dot devices as relevant to their use in uni- versal quantum computing architectures. We also develop simple parameter estimation schemes by which it is possible to substantially mitigate the dominant sources of error for our proposed gates; namely, low-frequency charge and magnetic noise. We develop the techniques in the context of pseudo-static magnetic field gradient fluctuations in singlet- triplet qubits, and demonstrate that these techniques lead to a several orders of magnitude improvement in single-qubit coherence times. With minimal effort this could be ported to other qubit architectures.

•Aug 11, 2015•0 citations

Spin-Based Simulation and Optimization of Multi-Qubit Quantum Gates

Dolananda Sri Naga Phani Sarma Mokkapati, V Ramesh Kumar, D. De +1 more

Spin-based quantum architectures offer a promising route toward scalable and practical quantum computing owing to their long coherence times, high-fidelity gate operations, and compatibility with established semiconductor fabrication processes. This work focuses on the design, decomposition, and simulation of fundamental multi-qubit logic gates on spin-based architectures. An optimized CNOT gate decomposition is presented, achieving a $36.36 \%$ reduction in elementary operations, verified through quantum circuit simulation. Furthermore, a resource-efficient Toffoli (CCNOT) gate is developed, yielding a $38 \%$ reduction in elementary gates and demonstrating improved T-depth efficiency. Finally, a four-qubit circuit example is presented, illustrating the scalability of the pseudocode and validating the correctness of the proposed approach.

International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)•Dec 20, 2025•0 citations
Exchange-only (EO) qubits, implemented in triple-quantum-dot systems, offer a compelling platform for scalable semiconductor-based quantum computing by enabling universal control through purely exchange interactions. While high-fidelity single- and two-qubit gates have been demonstrated, the synthesis of efficient multiqubit operations—such as the Toffoli gate—remains a key bottleneck. Conventional gate decompositions into elementary operations lead to prohibitively long and error-prone pulse sequences, limiting practical deployment. In this work, we introduce a gradient-based optimization algorithm, Jenga-Krotov (JK), tailored to discover compact, high-fidelity EO gate sequences. Applying JK to the Toffoli gate, we reduce the number of required exchange unitaries from 216 (in direct decomposition) to 92, and compress the time steps required from 162 to 50, all while maintaining target fidelity. Under realistic noise, the accumulated gate error from our optimized sequence is an order of magnitude lower than that of conventional approaches. We have also applied the JK algorithm to other multiqubit gates and algorithm. For the Fredkin gate, it reduces the number of time steps from 200 to 104 and the number of exchange unitaries from 276 to 172. For the quantum Fourier transform, it compresses the sequence from 180 to 80 time steps and from 237 to 202 exchange unitaries. These results demonstrate that the JK algorithm is a general and scalable strategy for multiqubit gate synthesis in EO architectures, potentially facilitating realization of multiqubit algorithms on semiconductor platforms.
In quantum control theory, a question of fundamental and practical interest is how an arbitrary unitary transformation can be decomposed into a minimum number of elementary rotations for implementation, subject to various physical constraints. Examples include the singlet-triplet (ST) and exchange-only (EO) qubits in quantum-dot systems, and gate construction in the Solovay--Kitaev algorithm. For two important scenarios, we present complete solutions to the problems of optimal decomposition of single-qubit unitary gates with non-orthogonal rotations. For each unitary gate, the criteria for determining the minimal number of pieces is given, the explicit gate construction procedure, as well as a computer code for practical uses. Our results include an analytic explanation to the four-gate decomposition of EO qubits, previously determined numerically by Divincenzo et al. [Nature (London) 408, 339 (2000)]. Furthermore, compared with the approaches of Ramon sequence and its variant [Phys. Rev. Lett. 118, 216802 (2017)], our method can reduce about 50% of gate time for ST qubits. Finally, our approach can be extended to solve the problem of optimal control of topological qubits, where gate construction is achieved through the braiding operations.
Semiconductor quantum dots provide a promising platform for spin qubit manipulation and quantum logic gate implementation, which are essential for scalable quantum computing architectures. In this work we utilize a variational quantum compiling algorithm to design efficient three-qubit gates using a time-independent Hamiltonian composed of only physical interaction terms. The resulting gates, including the Toffoli and Fredkin gates, demonstrate high fidelity and robustness against both coherent and incoherent noise sources, including charge and nuclear spin noise. This method is applicable to a wide range of physical systems, such as superconducting qubits and trapped ions, paving the way for more resilient and universal quantum computing architectures.
Abstract In conventional exchange-only (EO) spin qubit demonstrations, quantum gates have been implemented using sequences of individually pulsed pairwise exchange interactions with only one exchange coupling active at a time. Alternatively, multiple non-commuting exchange interactions can be pulsed simultaneously, reducing circuit depths and providing protection against leakage. We demonstrate high-fidelity quantum control of an always-on exchange-only (AEON) qubit, operated using simultaneous exchange pulses in a triangular quantum dot (QD) array. We use blind randomized benchmarking to characterize the performance of the full AEON single-qubit Clifford gate set, achieving an average Clifford gate fidelity F C1 = 99.86%. Extensions of this work may enable more efficient EO two-qubit entangling gates as well as the implementation of native i -Toffoli gates in Loss-DiVincenzo single-spin qubits.
We investigate the feasibility of single-shot Toffoli- and Fredkin-gate realizations in qubit arrays with Heisenberg-type exchange interactions between adjacent qubits. As follows from the Lie-algebraic criteria of controllability, such an array is rendered completely controllable---equivalent to allowing universal quantum computation---by a Zeeman-like control field with two orthogonal components acting on a single ``actuator'' qubit. Adopting this local-control setting, we start our analysis with piecewise-constant control fields and determine the global maxima of the relevant figure of merit (target-gate fidelity) by combining the multistart-based clustering algorithm and quasi-Newton type local optimization. We subsequently introduce important practical considerations, such as finite frequency bandwidth of realistic fields and their leakage away from the actuator. We find the shortest times required for high-fidelity Toffoli- and Fredkin-gate realizations and provide comparisons to their respective two-qubit counterparts---controlled-not and exponential-swap. In particular, the Toffoli-gate time compares much more favorably to that of controlled-not than in the standard decomposition-based approach. This study indicates that the use of the single-shot approach can alleviate the burden on control-generating hardware in future experimental realizations of multiqubit gates.
Since the mid-20th century it has been understood that a general-purpose quan- tum computer would be able to efficiently solve problems that will forever be out-of-reach for conventional computers. Since then, many quantum algorithms have been developed with applications in a wide range of domains including cryptography, simulations, machine learning and data analysis. While this has resulted in substantial attention being paid to the development of quantum com- puters, the best architectures to use in their fabrication is not yet clear. Semiconductor quantum dot devices are a particularly promising candidate for use in quantum computing architectures, as it is anticipated that once the funda- mental building blocks are implemented, they might be massively scalable using the existing lithography techniques of the semiconductor industry. So far, how- ever, it is not yet clear how best to implement the high-fidelity gates required for general-purpose quantum computation. In this thesis, we present and characterise novel theoretical proposals for fast, simple and high-fidelity two-qubit gates using magnetic (exchange) coupling for specific semiconductor quantum dot qubits; namely, the singlet-triplet and resonant-exchange qubits. These two-qubit operations are simple enough that it is feasible for them to be implemented in experiments of the near future. Success- ful implementations would significantly extend the experimentally demonstrable frontier of semi-conductor quantum dot devices as relevant to their use in uni- versal quantum computing architectures. We also develop simple parameter estimation schemes by which it is possible to substantially mitigate the dominant sources of error for our proposed gates; namely, low-frequency charge and magnetic noise. We develop the techniques in the context of pseudo-static magnetic field gradient fluctuations in singlet- triplet qubits, and demonstrate that these techniques lead to a several orders of magnitude improvement in single-qubit coherence times. With minimal effort this could be ported to other qubit architectures.
Spin-based quantum architectures offer a promising route toward scalable and practical quantum computing owing to their long coherence times, high-fidelity gate operations, and compatibility with established semiconductor fabrication processes. This work focuses on the design, decomposition, and simulation of fundamental multi-qubit logic gates on spin-based architectures. An optimized CNOT gate decomposition is presented, achieving a 36.36%36.36 \%36.36% reduction in elementary operations, verified through quantum circuit simulation. Furthermore, a resource-efficient Toffoli (CCNOT) gate is developed, yielding a 38%38 \%38% reduction in elementary gates and demonstrating improved T-depth efficiency. Finally, a four-qubit circuit example is presented, illustrating the scalability of the pseudocode and validating the correctness of the proposed approach.