Pith. sign in

REVIEW 18 cited by

Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2506.14688 v1 pith:POHXUI7M submitted 2025-06-17 quant-ph

Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate

classification quant-ph
keywords quantumlogicalmagicstatestimeserrorinfidelityoverhead
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Encoding quantum information to protect it from errors is essential for performing large-scale quantum computations. Performing a universal set of quantum gates on encoded states demands a potentially large resource overhead and minimizing this overhead is key for the practical development of large-scale fault-tolerant quantum computers. We propose and experimentally implement a magic-state preparation protocol to fault-tolerantly prepare a pair of logical magic states in a [[6,2,2]] quantum error-detecting code using only eight physical qubits. Implementing this protocol on H1-1, a 20 qubit trapped-ion quantum processor, we prepare magic states with experimental infidelity $7^{+3}_{-1}\times 10^{-5}$ with a $14.8^{+1}_{-1}\%$ discard rate and use these to perform a fault-tolerant non-Clifford gate, the controlled-Hadamard (CH), with logical infidelity $\leq 2.3^{+9}_{-9}\times 10^{-4}$. Notably, this significantly outperforms the unencoded physical CH infidelity of $10^{-3}$. Through circuit-level stabilizer simulations, we show that this protocol can be self-concatenated to produce extremely high-fidelity magic states with low space-time overhead in a [[36,4,4]] quantum error correcting code, with logical error rates of $6\times 10^{-10}$ ($5\times 10^{-14}$) at two-qubit error rate of $10^{-3}$ ($10^{-4}$) respectively.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 18 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction

    quant-ph 2026-04 conditional novelty 8.0

    LightStim automates DEM construction for QEC protocols via an augmented Pauli tableau during compilation, matching public tools on detector counts and error rates while enabling new cross-code designs.

  2. In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes

    quant-ph 2026-04 unverdicted novelty 8.0

    A new in-situ scheme prepares logical magic states inside arbitrary CSS qLDPC codes using only syndrome-extraction ancillas, with simulations on the [[144,12,12]] BB code and [[225,9,4]] hypergraph-product code showin...

  3. Error-corrected phase estimation averaged over variable grids on a trapped-ion quantum computer: hyperacuity spectra of a CO molecule adsorbed onto $\chi$-Fe$_5$C$_2$

    quant-ph 2026-05 unverdicted novelty 7.0

    QAVG reconstructs sub-resolution excitation spectra of a CO/χ-Fe5C2 model via averaged variable-grid QPE on Quantinuum H2-2 with Steane-code error correction.

  4. Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits

    quant-ph 2026-04 unverdicted novelty 7.0

    Clifft introduces a factored-state simulator that shifts exponential cost to a dynamic active subspace, generalizing Stim's compile-once model to near-Clifford circuits and enabling the first exact end-to-end simulati...

  5. Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks

    cs.NE 2026-04 accept novelty 7.0

    LightStim automates DEM construction for QEC protocols via a record-augmented Pauli tableau tracker, validated across memory, logical operations, distillation, and a novel cross-code lattice surgery design.

  6. Helios: A 98-qubit trapped-ion quantum computer

    quant-ph 2025-11 accept novelty 7.0

    Helios achieves 98 qubits with single-qubit gate infidelity 2.5(1)×10^{-5}, two-qubit 7.9(2)×10^{-4}, and SPAM 4.8(6)×10^{-4}, enabling circuits beyond classical simulation.

  7. Error detection without post-selection in adaptive quantum circuits

    quant-ph 2025-09 unverdicted novelty 7.0

    Error detection is integrated into adaptive quantum circuits for non-equilibrium phase transition simulations by mapping errors to resets, achieving post-selection-free logical simulations near break-even on current hardware.

  8. Trapped-Ion Multiqubit Gates are Compatible with Scalable Quantum Error Correction

    quant-ph 2026-05 unverdicted novelty 6.0

    A noise model for trapped-ion multi-qubit gates shows that dominant error channels remain compatible with scalable rotated-surface-code quantum error correction when realistic experimental parameters are used.

  9. Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation

    quant-ph 2026-05 conditional novelty 6.0

    New search algorithms over stabilizer tableaus and modular assembly techniques yield encoders with up to 43% fewer two-qubit gates and 70% lower depth than prior constructions on tested stabilizer codes including qLDP...

  10. Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits

    quant-ph 2026-04 unverdicted novelty 6.0

    Clifft achieves fast exact simulation of near-Clifford quantum circuits via dynamic active subspaces, delivering orders-of-magnitude speedups and the first full end-to-end simulations of magic state cultivation over h...

  11. LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction

    quant-ph 2026-04 conditional novelty 6.0

    A tree-encoded fusion scheme and MemTree compiler suppress fusion erasure errors in photonic MBQC, achieving large execution-time reductions over prior compilers with real-hardware validation.

  12. Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks

    cs.NE 2026-04 unverdicted novelty 6.0

    Novelty search generates diverse continuous multimodal landscapes with direct basin definitions, enabling low-cost local optima networks whose features predict evolutionary algorithm performance.

  13. Efficient simulation of logical magic state preparation protocols

    quant-ph 2025-12 conditional novelty 6.0

    A classical simulation method that propagates circuit-level Pauli noise to a Clifford error makes logical magic-state preparation protocols simulable in time polynomial in qubits and the target state's stabilizer rank.

  14. Efficient certification of intractable quantum states with few Pauli measurements

    quant-ph 2025-11 reject novelty 6.0

    The paper claims Clifford-enhanced product states can be certified with O(n^2/epsilon^2) Pauli measurements in the i.i.d. setting and polynomially many in the adversarial setting, but the central estimator is derived ...

  15. Theoretical and experimental analysis of adaptive quantum computers

    quant-ph 2025-09 conditional novelty 6.0

    Under a worst-case noise model, adaptive GHZ and W-state preparation can exponentially beat non-adaptive circuits only in narrow gate-vs-idling error regimes, and current IBM hardware is too noisy and too restricted t...

  16. Efficient and scalable inter-module switching for distributed quantum computing architectures

    quant-ph 2025-08 conditional novelty 6.0

    GMZI-based decentralized switch designs achieve any-to-any module connectivity with half the active depth and coupler count of GMZI-Spanke switches.

  17. Channel-agnostic finite-temperature phase estimation averaged over variable grids: reconstruction of Green's function for dynamical mean-field theory

    quant-ph 2026-05 unverdicted novelty 5.0

    A hybrid scheme combines channel-agnostic finite-temperature QPE with QAVG reconstruction to obtain the one-particle Green's function for DMFT, shown via numerical simulation on SrVO3.

  18. Hardware-Tailored Resource Estimation for Magic-State Distillation on Silicon Spin Qubits

    quant-ph 2026-05 unverdicted novelty 5.0

    Resource estimation for magic-state distillation on silicon spin qubits finds 42% overhead reduction via optimized pulses and ~3x physical footprint reduction with biased codes versus surface code.