Abstract The first hardware evidence is reported that a Quantum Memory Matrix (QMM) ‐ conceived as a Planck‐scale lattice of finite‐dimensional memory cells ‐ functions as an ultra‐shallow, measurement‐free error‐suppression layer for noisy intermediate‐scale quantum processors. On a seven‐qubit IBM transmon device, quantum states are imprint onto local cells with single‐qubit and nearest‐neighbor gates and later retrieve them through a controlled‐SWAP, guaranteeing unitary reversibility. A single imprint–retrieval cycle attains a hardware fidelity of ; prepending the same layer to a conventional repetition code boosts the logical fidelity to ‐ a 32 % improvement obtained without additional CX gates. Incorporating the layer into a variational quantum classifier lowers the final training loss by 35 % and halves run‐to‐run variance, evidencing its value for hybrid quantum‐classical workloads. Noise‐calibrated simulations further show that stacking three QMM layers brings the logical error rate to within 20 % of a distance‐three surface code while using an order of magnitude fewer qubits. Because the QMM booster is fully unitary and eschews mid‐circuit measurement, it is directly compatible with platforms where rapid stabilizer read‐out is impractical and provides empirical support for the broader notion that space‐time itself may behave as a distributed quantum memory.
Abstract The first hardware evidence is reported that a Quantum Memory Matrix (QMM) ‐ conceived as a Planck‐scale lattice of finite‐dimensional memory cells ‐ functions as an ultra‐shallow, measurement‐free error‐suppression layer for noisy intermediate‐scale quantum processors. On a seven‐qubit IBM transmon device, quantum states are imprint onto local cells with single‐qubit and nearest‐neighbor gates and later retrieve them through a controlled‐SWAP, guaranteeing unitary reversibility. A single imprint–retrieval cycle attains a hardware fidelity of ; prepending the same layer to a conventional repetition code boosts the logical fidelity to ‐ a 32 % improvement obtained without additional CX gates. Incorporating the layer into a variational quantum classifier lowers the final training loss by 35 % and halves run‐to‐run variance, evidencing its value for hybrid quantum‐classical workloads. Noise‐calibrated simulations further show that stacking three QMM layers brings the logical error rate to within 20 % of a distance‐three surface code while using an order of magnitude fewer qubits. Because the QMM booster is fully unitary and eschews mid‐circuit measurement, it is directly compatible with platforms where rapid stabilizer read‐out is impractical and provides empirical support for the broader notion that space‐time itself may behave as a distributed quantum memory.
Abstract We report a hardware implementation of a reversible imprint-retrieval cycle motivated by the Quantum Memory Matrix (QMM) framework. Using IBM Quantum backends, we realize five circuits that scale from a minimal three-qubit memory cell to a five-qubit dual-cycle architecture, including variants with controlled phase evolution and deliberate perturbation. Because the circuit readout is based on computational-basis bit strings, the primary experimental metric is the basis-matched retrieval probability, Pret=Nmatch/Nshots P ret = N match / N shots , reported together with Wilson-score 95% 95 % confidence intervals, Pearson correlations, and mutual information between field and output qubits. Across the five experiments, Pret P ret ranges from 0.487±0.017 0.487 ± 0.017 in the evolution stress test to 0.732±0.012 0.732 ± 0.012 in the baseline three-qubit cycle, with the dual-cycle and controlled-error variants remaining near 0.70 under realistic device noise. These results provide a proof-of-principle demonstration that finite-dimensional quantum registers can store and return basis-level information through local unitary gates. The experiments therefore support the operational imprint-retrieval primitive underlying QMM, while also identifying full state tomography as the next step toward verifying phase-coherent state recovery.
To solve problems of practical importance1,2, quantum computers probably need to incorporate quantum error correction, in which a logical qubit is redundantly encoded in many noisy physical qubits3–5. The large physical-qubit overhead associated with error correction motivates the search for more hardware-efficient approaches6–18. Here, using a superconducting quantum circuit19, we realize a logical qubit memory formed from the concatenation of encoded bosonic cat qubits with an outer repetition code of distance d = 5 (ref. 10). A stabilizing circuit passively protects cat qubits against bit flips20–24. The repetition code, using ancilla transmons for syndrome measurement, corrects cat qubit phase flips. We study the performance and scaling of the logical qubit memory, finding that the phase-flip correcting repetition code operates below the threshold. The logical bit-flip error is suppressed with increasing cat qubit mean photon number, enabled by our realization of a cat-transmon noise-biased CX gate. The minimum measured logical error per cycle is on average 1.75(2)% for the distance-3 code sections, and 1.65(3)% for the distance-5 code. Despite the increased number of fault locations of the distance-5 code, the high degree of noise bias preserved during error correction enables comparable performance. These results, where the intrinsic error suppression of the bosonic encodings enables us to use a hardware-efficient outer error-correcting code, indicate that concatenated bosonic codes can be a compelling model for reaching fault-tolerant quantum computation. Bosonic qubits can be engineered to feature intrinsic protection against certain kinds of errors, which makes quantum error correction across many bosonic qubits possible with less overhead.
We present a general framework for applying linear quantum error mitigation (QEM) techniques directly to physical qubits within a logical qubit to suppress logical errors. By exploiting the linearity of quantum error correction (QEC), we demonstrate that any linear QEM method$\unicode{x2014}$including probabilistic error cancellation (PEC), zero-noise extrapolation (ZNE), and symmetry verification$\unicode{x2014}$can be integrated into the physical layer without requiring modifications to the subsequent QEC decoder. Applying this framework to memory experiments using PEC, we analytically prove and numerically verify that the leading-order contribution to the logical error can be removed, increasing the effective code distance by 2. Our simulations on repetition and rotated surface codes show that a distance-3 code with physical-level PEC achieves logical error rates lower than or similar to a distance-5 unmitigated code while using 40% and 64% fewer qubits, respectively. These results establish physical-level QEM as a widely compatible and resource-efficient strategy for enhancing logical performance in early fault-tolerant architectures.
Abstract The accumulation of physical errors 1–3 prevents the execution of large-scale algorithms in current quantum computers. Quantum error correction 4 promises a solution by encoding k logical qubits onto a larger number n of physical qubits, such that the physical errors are suppressed enough to allow running a desired computation with tolerable fidelity. Quantum error correction becomes practically realizable once the physical error rate is below a threshold value that depends on the choice of quantum code, syndrome measurement circuit and decoding algorithm 5 . We present an end-to-end quantum error correction protocol that implements fault-tolerant memory on the basis of a family of low-density parity-check codes 6 . Our approach achieves an error threshold of 0.7% for the standard circuit-based noise model, on par with the surface code 7–10 that for 20 years was the leading code in terms of error threshold. The syndrome measurement cycle for a length- n code in our family requires n ancillary qubits and a depth-8 circuit with CNOT gates, qubit initializations and measurements. The required qubit connectivity is a degree-6 graph composed of two edge-disjoint planar subgraphs. In particular, we show that 12 logical qubits can be preserved for nearly 1 million syndrome cycles using 288 physical qubits in total, assuming the physical error rate of 0.1%, whereas the surface code would require nearly 3,000 physical qubits to achieve said performance. Our findings bring demonstrations of a low-overhead fault-tolerant quantum memory within the reach of near-term quantum processors.
Dissipative cat qubits are a promising physical platform for quantum computing, since their large noise bias can enable more hardware-efficient quantum error correction. In this work we theoretically study the long-term prospects of a hybrid cat-transmon quantum computing architecture where dissipative cat qubits play the role of data qubits, and error syndromes are measured using ancillary transmon qubits. The cat qubits’ noise bias enables more hardware-efficient quantum error correction, and the use of transmons allows for practical, high-fidelity syndrome measurement. While correction of the dominant cat Z errors with a repetition code has recently been demonstrated in experiment, here we show how the architecture can be scaled beyond a repetition code. In particular, we propose a cat-transmon entangling gate that enables the correction of residual cat X errors in a thin rectangular surface code, so that logical error can be arbitrarily suppressed by increasing code distance. We numerically estimate logical memory performance, finding significant overhead reductions in comparison to architectures without biased noise. For example, with current state-of-the-art coherence, physical error rates of 10 − 3 and noise biases in the range 10 3 – 10 4 are achievable. With this level of performance, the qubit overhead required to reach algorithmically relevant logical error rates with the cat-transmon architecture matches that of an unbiased-noise architecture with physical error rates in the range 10 − 5 – 10 − 4 .
Readout errors are one of the dominant sources of noise in current quantum processors, limiting both expectation-value estimation and sampling-based applications. Since they affect only the classical measurement outcomes, they can be addressed using classical coding techniques: immediately before measurement, each data qubit is redundantly encoded with ancilla qubits, and the resulting bit string is decoded either by post-selection or by majority voting. Unlike conventional readout error mitigation, which corrects only aggregate quantities such as expectation values, this approach operates on individual measurement shots and can therefore produce approximately corrected samples. We present a systematic cross-platform and cross-generation experimental evaluation of repetition-code readout error detection and correction. We benchmark the same protocol on IBM Heron r1-r3 superconducting processors and Quantinuum H1 and H2 trapped-ion processors while independently varying the code distance, hardware generation, and encoding layout. We find that both error detection and correction improve readout fidelity on every device and generation tested, even as the unencoded baseline improves substantially across successive hardware releases. At the same time, the value of additional redundancy depends strongly on the underlying hardware. On superconducting processors, the extra gate errors introduced by the encoding rapidly offset its benefits, whereas on trapped-ion processors the much lower gate error rates allow larger code distances to remain advantageous.