Pulse-timing errors in exchange-only spin qubits: how one control imperfection propagates to VQE, QAOA and fault-tolerance primitives
Yuichiro Minato
Abstract
In an exchange-only (EO) spin qubit every gate is a sequence of Heisenberg exchange pulses whose only continuous parameter is the pulse area. We ask how an error in that area propagates to an algorithm's result. On up to six encoded qubits we compile VQE for H2 and LiH, QAOA MaxCut, Grover search, phase estimation and a distance-3 repetition code into exchange pulses and perturb every pulse with a systematic fractional error , an offset or per-pulse jitter. For circuits whose first-order response is negligible at the threshold, the useful regime ends at of a few 10-3: chemical accuracy is lost at ≈6×10-3 for both molecules and 5% of success probability between 3 and 9×10-3 for 498-1216 pulses. A systematic error accumulates as the square of the depth and biases the answer; jitter accumulates linearly and, within statistics, does not bias phase estimation. Leakage from inter-block pulses is a third of the CNOT error, survives variational re-optimisation and a leakage-controlled entangler, and makes a leakage-blind repetition-code round worse than its uncorrected data by a factor 38-93 at =10-2 in three of four compilations; in the fourth the uncorrected data already fail. The compilation moves the thresholds by a factor of two to eight. Measured over-rotation and exchange noise put devices at the edge of this regime, and with the measured 3.5 μs T2* a quasi-static magnetic gradient limits thousand-pulse circuits unless J/h reaches several hundred MHz with continuous areas, because a duration grid of 2-5% of the SWAP time starts to cost chemical accuracy. As a bit budget, a common-mode area error needs 8-10 significant bits and a 6-bit significand for the durations suffices in the tested circuits; half-precision words and picosecond timers exceed this; older devices had 6-8 bits of analog stability.
Create a lesson
Related papers
High-temperature Gibbs states are uniformly Markovian and trivial
Andrew D. Kim, Tai Hsuan Yang, Jong Yeon Lee
Query-Optimal Quantum Minimum Finding from Numerical Estimators
Egil Bae
Fast, in-place, and ancilla-free quantum algorithms for integer multiplication and inversion
David Halpenny, Adithya Sireesh, Petros Wallden
High-Accuracy Neural-Network Quantum States via Randomized Real-Time Dynamics
John M. Martyn, Rod Rofougaran, Samuel Stein et al.
End-to-End Quantum Algorithm for Differential Equations: Application to Simulating a Biomolecular System
Mohsen Bagherimehrab, Daniyaal Farooqi, Gavin K. Brennen et al.
Classically Trained Quantum Generative Models with Shared Training and Fine Tuning for Quantum Matter
Mario Herrero-Gonzalez, Elham Kashefi, Mina Doosti