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

Bulletin of the American Physical Society

Pulse Sequences for Exchange-Based Quantum Computation

N. E. Bonesteel, Robert Cipri, Daniel Zeuch

Published Mar 16, 2010• 1 citation
OpenAlex

Related papers

Analytic pulse-sequence construction for exchange-only quantum computation

Daniel Zeuch, Robert Cipri, N. E. Bonesteel

We present pulse sequences for two-qubit gates acting on encoded qubits for exchange-only quantum computation. Previous work finding such sequences has always required numerical methods due to the large search space of unitary operators acting on the space of the encoded qubits. By contrast, our construction can be understood entirely in terms of three-dimensional rotations of effective spin-$\frac{1}{2}$ pseudospins which allows us to use geometric intuition to determine the required sequence of operations analytically. The price we pay for this simplification is that, at 39 pulses, our sequences are significantly longer than the best numerically obtained sequences.

arXiv:1402.0551•Physical Review B•Jul 14, 2014•15 citations

Universal quantum computation with the exchange interaction

David Peter Divincenzo, Dave Bacon, Julia Kempe +2 more

arXiv:quant-ph/0005116•Nature•Nov 1, 2000•921 citations

Universal quantum computation and leakage reduction in the 3-Qubit decoherence free subsystem

Bryan H. Fong, Stephen M. Wandzura

We describe exchange-only universal quantum computation and leakage reduction in the 3-qubit decoherence free subsystem (DFS). We discuss the angular momentum structure of the DFS, the proper forms for the DFS CNOT and leakage reduction operators in the total angular momentum basis, and new exchange-only pulse sequences for the CNOT and leakage reduction operators. Our new DFS CNOT sequence requires 22 pulses in 13 time steps. The DFS leakage reduction sequence, the first explicit leakage reduction sequence of its kind, requires 30 pulses in 20 time steps. Although the search for sequences was performed numerically using a genetic algorithm, the solutions presented here are exact, with closed-form expressions.

arXiv:1102.2909•Quantum Information and Computation•Nov 1, 2011•55 citations

Simulation of Quantum Computation

Tzvetan S. Metodi, Arvin I. Faruque, Frederic T. Chong

Synthesis lectures on computer architecture•Jan 1, 2011•1 citation

Models for Quantum Computation

Peter P. Rohde

Cambridge University Press eBooks•Sep 9, 2021•0 citations

Fast Quantum Gates for Exchange-Only Qubits Using Simultaneous Exchange Pulses

Irina Heinz, Felix Borjans, Matthew Curry +6 more

The benefit of exchange-only qubits compared to other spin-qubit types is the universal control using only voltage-controlled exchange interactions between neighboring spins. As a compromise, qubit operations have to be constructed from nonorthogonal rotation axes of the Bloch sphere and result in rather long pulsing sequences. This paper aims to develop a faster implementation of single-qubit gates using simultaneous exchange pulses and manifests their potential for the construction of two-qubit gates. We introduce pulse sequences in which single-qubit gates could be executed faster and show that subsequences on three spins in two-qubit gates could be implemented in fewer steps. Our findings can particularly speed up gate sequences for realistic idle times between sequential pulses and we show that this advantage increases with more interconnectivity of the quantum dots. We further demonstrate how a phase operation can introduce a relative phase between the computational and some of the leakage states, which can be advantageous for the construction of two-qubit gates. In addition to our theoretical analysis, we experimentally demonstrate and characterize a simultaneous exchange implementation of X rotations in a Si Ge quantum dot device and compare to the state of the art with sequential exchange pulses.

arXiv:2409.05843•PRX Quantum•Jul 21, 2025•6 citations
We present pulse sequences for two-qubit gates acting on encoded qubits for exchange-only quantum computation. Previous work finding such sequences has always required numerical methods due to the large search space of unitary operators acting on the space of the encoded qubits. By contrast, our construction can be understood entirely in terms of three-dimensional rotations of effective spin-12\frac{1}{2}21​ pseudospins which allows us to use geometric intuition to determine the required sequence of operations analytically. The price we pay for this simplification is that, at 39 pulses, our sequences are significantly longer than the best numerically obtained sequences.
We describe exchange-only universal quantum computation and leakage reduction in the 3-qubit decoherence free subsystem (DFS). We discuss the angular momentum structure of the DFS, the proper forms for the DFS CNOT and leakage reduction operators in the total angular momentum basis, and new exchange-only pulse sequences for the CNOT and leakage reduction operators. Our new DFS CNOT sequence requires 22 pulses in 13 time steps. The DFS leakage reduction sequence, the first explicit leakage reduction sequence of its kind, requires 30 pulses in 20 time steps. Although the search for sequences was performed numerically using a genetic algorithm, the solutions presented here are exact, with closed-form expressions.
The benefit of exchange-only qubits compared to other spin-qubit types is the universal control using only voltage-controlled exchange interactions between neighboring spins. As a compromise, qubit operations have to be constructed from nonorthogonal rotation axes of the Bloch sphere and result in rather long pulsing sequences. This paper aims to develop a faster implementation of single-qubit gates using simultaneous exchange pulses and manifests their potential for the construction of two-qubit gates. We introduce pulse sequences in which single-qubit gates could be executed faster and show that subsequences on three spins in two-qubit gates could be implemented in fewer steps. Our findings can particularly speed up gate sequences for realistic idle times between sequential pulses and we show that this advantage increases with more interconnectivity of the quantum dots. We further demonstrate how a phase operation can introduce a relative phase between the computational and some of the leakage states, which can be advantageous for the construction of two-qubit gates. In addition to our theoretical analysis, we experimentally demonstrate and characterize a simultaneous exchange implementation of X rotations in a Si Ge quantum dot device and compare to the state of the art with sequential exchange pulses.