First fault-tolerant quantum memory demonstration for a generalized superfast encoding

• URL: http://arxiv.org/abs/2609.08957v1
• Date: Tue, 08 Sep 2026 16:12:05 GMT
• Title: First fault-tolerant quantum memory demonstration for a generalized superfast encoding
• Abstract summary: We introduce an even-distance $d$ constant stabilizer-weight GSE.<n>This is the first fault-tolerant quantum-memory characterization of a fermion-mapping with threshold-like scaling.
• Score: 0.7161783472741748
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Generalized Superfast Encoding (GSE) is a fermion-to-qubit mapping that has error-correcting/detecting properties. To this point, all demonstrations have been relegated to error-detection only, as no fault-tolerance under circuit-level noise has been observed. Here, we introduce an even-distance $d$ constant stabilizer-weight GSE where each of $N$ modes is assigned a $d$-qubit block arranged on a ring. The resulting stabilizer generators have constant weight 4 or 6 for any even distance $d$. Furthermore, the full stabilizer set of this construction can always be partitioned into four qubit-wise commuting groups, which enables compact syndrome-extraction scheduling. We simulate quantum memory experiments under circuit-level depolarizing noise for two instances of this code, $[[48,8,6]]$ and $[[64,8,8]]$ and the threshold is observed to be $\approx 4\times10^{-3}$. This is, to our knowledge, the first fault-tolerant quantum-memory characterization of a fermion-mapping with threshold-like scaling.

Related papers

• The Gain-Engineered Transmon [68.89136228609398]
  We introduce and experimentally realize a noise-biased qubit in a standard transmon-readout resonator circuit.<n>Our results open a path towards using this system as a simple building-block for hardware-efficient quantum error detection and correction schemes.
  arXiv  Detail & Related papers  (2026-08-26T17:00:42Z)
• Dissipatively Stabilized 0-n Fock Qubits for Noise-Biased Quantum Computing [0.027998963147546147]
  Noise-biased qubits have bit-flip errors that are exponentially suppressed relative to phase-flip errors.<n>We propose a "0-n" Fock qubit architecture that maintains the noise bias by encoding information in the ground state.<n>We numerically demonstrate that bit-flip probabilities approaching $10-8$ are achievable for controlled-X gates on cat qubits.
  arXiv  Detail & Related papers  (2026-08-26T16:20:43Z)
• Noise Resilience of Quantum Support Vector Machine with Selected Feature Maps [0.0]
  Gate-level noise degrades the classification accuracy of QSVMs on NISQ hardware.<n>We tested Z, ZZ, a Pauli, and an amplitude-inspired feature maps under depolarizing, bit-flip, and phase-flip noise channels.
  arXiv  Detail & Related papers  (2026-08-18T08:23:53Z)
• Gram-Certified Resource Continuation for Structured Quantum Representation Audits [0.0]
  We develop Gram-certified resource continuation for structured quantum-representation workloads.<n>We show that continuation cannot overcome a final Schmidt-rank ceiling.<n>These noise-free classical results neither establish generic 40-qubit simulability nor claim hardware performance or quantum advantage.
  arXiv  Detail & Related papers  (2026-07-11T15:38:24Z)
• Spectral Anatomy of Quantum Gaussian Process Kernels [38.264196157340216]
  We prove a Cauchy-Schwarz tail bound on Nystrm approximation error, a finite-sample variance-contraction identity, and a characterization of the emphtarget-dependent optimal entropy.<n>The diagnostic is kernel-agnostic: hardware-efficient, matchgate, IQP emphand RBF/Matérn/RFF/deep- kernel families all collapse onto identical $S/log n$ curves.
  arXiv  Detail & Related papers  (2026-05-29T07:41:14Z)
• Quantum non-demolition measurements as a practical primitive for fault-tolerant computation against biased noise [1.0499611180329804]
  We show that high-fidelity quantum non-demolition (QND) multi-qubit Pauli $Z$ measurements provide an equally powerful yet more accessible primitive.<n>We propose concrete physical implementations of this primitive for two platforms: solid-state nuclear spins coupled to electron spin ancillas, and superconducting cat qubits.
  arXiv  Detail & Related papers  (2026-05-22T22:27:52Z)
• 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)
• Robust Quantum Algorithmic Binary Decision-Making on Displacement Signals [5.042709905708249]
  A relevant signal in the quantum domain may manifest as a displacement or a phase shift operator in the bosonic phase space.<n>We propose a framework based on generalized quantum signal processing interferometryGQSPI.<n>The proposed framework enables decision-making over arbitrary thresholds for any general displacement signal in a single or a few shots.
  arXiv  Detail & Related papers  (2026-01-22T16:22:32Z)
• Erasure qubits: Overcoming the $T_1$ limit in superconducting circuits [105.54048699217668]
  amplitude damping time, $T_phi$, has long stood as the major factor limiting quantum fidelity in superconducting circuits. We propose a scheme for overcoming the conventional $T_phi$ limit on fidelity by designing qubits in a way that amplitude damping errors can be detected and converted into erasure errors.
  arXiv  Detail & Related papers  (2022-08-10T17:39:21Z)
• 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)
• 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)

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.