Exchange-Only Silicon Based Spin Qubits: Charge Noise, PINN Optimised Pulse Sequences,and Gate-Level Fidelity
- URL: http://arxiv.org/abs/2605.03056v1
- Date: Mon, 04 May 2026 18:20:13 GMT
- Title: Exchange-Only Silicon Based Spin Qubits: Charge Noise, PINN Optimised Pulse Sequences,and Gate-Level Fidelity
- Abstract summary: Exchange-only (EO) spin qubits in silicon realise all-electrical qubit control through pairwise Heisenberg exchange interactions.<n>Their principal vulnerability is charge noise, which couples multiplicatively to the exchange coupling and degrades gate fidelity.<n>We present a emphtwo-stage Physics-Informed Neural Network (PINN) framework for per-gate pulse optimisation.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Exchange-only (EO) spin qubits in silicon realise all-electrical qubit control through pairwise Heisenberg exchange interactions, making them attractive for scalable quantum computation. Their principal vulnerability is charge noise, which couples multiplicatively to the exchange coupling and degrades gate fidelity. We present a \emph{two-stage} Physics-Informed Neural Network (PINN) framework for per-gate pulse optimisation. In \textbf{Stage~I} (iterations~1--100) the PINN maximises the noise-averaged gate fidelity toward a threshold of $\Fth=0.99$; the pulse duration is held fixed at its nominal hardware value. Once the threshold is crossed, \textbf{Stage~II} (iterations~101--250) progressively compresses the total pulse time while maintaining $F\geq\Fth$ via continuous fine-tuning of the pulse-shape parameters. The cost function is a Monte-Carlo ensemble mean-squared error (MSE) averaged over $N_{\rm real}=2000$ quasi-static Gaussian noise realisations drawn fresh at every iteration. We benchmark the framework on the single-qubit gate set $\{X,Y,Z,H\}$ and the two-qubit set $\{X,Y,Z,H,\mathrm{CX}\}$ at noise levels $\sigmaJ/J\in\{1\%,5\%,10\%\}$. All single-qubit gates cross $\Fth$ within the first 100 iterations across all noise levels; Stage~II then reduces pulse durations by 20--40\% from their nominal values. The two-qubit gates follow the same two-phase behaviour, with the CX gate compressing from its nominal \SI{31}{\nano\second} to $\approx\SI{22}{\nano\second}$ at 1\% noise.
Related papers
- A Degenerate Singlet-Triplet Qubit with All-Electrical Orthogonal Control [0.0]
Singlet-triplet qubits offer attractive encoding for semiconductor quantum computing.<n>Zeman energy difference $E_mathrmZ$ is typically fixed by local magnetic field or $g$-factor inhomogeneities.
arXiv Detail & Related papers (2026-07-29T15:54:51Z) - Adiabatic Quantum Phase Estimation [47.3103723337301]
Quantum phase estimation (QPE) is a central algorithmic primitive that estimates eigenvalues of a Hamiltonian up to precision $$ in Heisenberg-limited time $T= (1/)$.<n>Standard gate-based implementations of QPE require deep controlled time-evolution circuits and are not native to analog hardware.<n>We present a simple adiabatic protocol for QPE that achieves the optimal Heisenberg-limited scaling $T = Oleft( frac1 logleft(-1right)right)$ in both the precision $$
arXiv Detail & Related papers (2026-05-21T17:31:36Z) - In-situ mid-circuit qubit measurement and reset in a single-species trapped-ion quantum computing system [34.82692226532414]
We implement in-situ mid-circuit measurement and reset (MCMR) operations on a trapped-ion quantum computing system.<n>We introduce and compare two methods for isolating data qubits from measured qubits.<n>We experimentally demonstrate both methods on a crystal of two $171textrmYb+$ ions.
arXiv Detail & Related papers (2025-04-17T00:10:35Z) - A dressed singlet-triplet qubit in germanium [0.0]
In semiconductor hole spin qubits, low magnetic field operation extends the coherence time but proportionally reduces the gate speed.<n>In contrast, singlet-triplet (ST) qubits are primarily controlled by the exchange interaction.<n>By modulating germanJ$, we achieve resonant driving of the ST qubit.
arXiv Detail & Related papers (2025-01-24T16:44:58Z) - Single-qubit quantum gate at an arbitrary speed [0.7256915467062314]
We show that it is possible to construct a universal set of single-qubit gates at a strong-coupling and ultrafast regime.<n>We observe a transition in the scaling behavior of the central frequency from the long-gate time regime to the short-gate time regime.
arXiv Detail & Related papers (2024-12-27T10:05:27Z) - Tunable inductive coupler for high fidelity gates between fluxonium
qubits [0.27638147714466216]
We present a tunable coupler that realizes strong inductive coupling between two heavy-fluxonium qubits.
These qualities lead to fast, high-fidelity single- and two-qubit gates.
arXiv Detail & Related papers (2023-09-11T18:00:18Z) - Cat-qubit-inspired gate on cos($2\theta$) qubits [77.34726150561087]
We introduce a single-qubit $Z$ gate inspired by the noise-bias preserving gate of the Kerr-cat qubit.
This scheme relies on a $pi$ rotation in phase space via a beamsplitter-like transformation between a qubit and ancilla qubit.
arXiv Detail & Related papers (2023-04-04T23:06:22Z) - Sharper Convergence Guarantees for Asynchronous SGD for Distributed and
Federated Learning [77.22019100456595]
We show a training algorithm for distributed computation workers with varying communication frequency.
In this work, we obtain a tighter convergence rate of $mathcalO!!!(sigma2-2_avg!! .
We also show that the heterogeneity term in rate is affected by the average delay within each worker.
arXiv Detail & Related papers (2022-06-16T17:10:57Z) - Unimon qubit [42.83899285555746]
Superconducting qubits are one of the most promising candidates to implement quantum computers.
Here, we introduce and demonstrate a superconducting-qubit type, the unimon, which combines the desired properties of high non-linearity, full insensitivity to dc charge noise, insensitivity to flux noise, and a simple structure consisting only of a single Josephson junction in a resonator.
arXiv Detail & Related papers (2022-03-11T12:57:43Z) - A lower bound on the space overhead of fault-tolerant quantum computation [51.723084600243716]
The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation.
We prove an exponential upper bound on the maximal length of fault-tolerant quantum computation with amplitude noise.
arXiv Detail & Related papers (2022-01-31T22:19:49Z) - Random quantum circuits transform local noise into global white noise [118.18170052022323]
We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime.
For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially.
If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
arXiv Detail & Related papers (2021-11-29T19:26:28Z) - Binary Optimal Control Of Single-Flux-Quantum Pulse Sequences [0.0]
We introduce a binary, relaxed gradient, trust-region method for optimizing pulse sequences for single flux quanta (SFQ) control of a quantum computer.
We present numerical results for the H and X gates, where the optimized pulse sequences give gate fidelity's better than $99.9%$, in $approx 25$ trust-region.
arXiv Detail & Related papers (2021-06-18T19:40:10Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.