Pith. sign in

REVIEW 2 cited by

Encoding a magic state with beyond break-even fidelity

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 2305.13581 v2 pith:EQ4SKPW4 submitted 2023-05-23 quant-ph

classification quant-ph
keywords magicstatescitegateslogicqubitsalgorithmscalled
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

To run large-scale algorithms on a quantum computer, error-correcting codes must be able to perform a fundamental set of operations, called logic gates, while isolating the encoded information from noise~\cite{Harper2019,Ryan-Anderson2021,Egan2021fault, Chen2022calibrated, Sundaresan2022matching, ryananderson2022implementing, Postler2022demonstration, GoogleAI2023}. We can complete a universal set of logic gates by producing special resources called magic states~\cite{Bravyi2005universal,Maier2013magic, Chamberland2022building}. It is therefore important to produce high-fidelity magic states to conduct algorithms while introducing a minimal amount of noise to the computation. Here, we propose and implement a scheme to prepare a magic state on a superconducting qubit array using error correction. We find that our scheme produces better magic states than those we can prepare using the individual qubits of the device. This demonstrates a fundamental principle of fault-tolerant quantum computing~\cite{Shor96}, namely, that we can use error correction to improve the quality of logic gates with noisy qubits. Additionally, we show we can increase the yield of magic states using adaptive circuits, where circuit elements are changed depending on the outcome of mid-circuit measurements. This demonstrates an essential capability we will need for many error-correction subroutines. Our prototype will be invaluable in the future as it can reduce the number of physical qubits needed to produce high-fidelity magic states in large-scale quantum-computing architectures.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Realizing Error Suppression in Partially Fault-Tolerant Quantum Simulations with IBM Quantum Computers

    quant-ph 2026-07 conditional novelty 6.0 of 10

    Partially fault-tolerant [[4,2,2]] Iceberg-code simulations on ibm_boston improve local Ising observables over unencoded baselines by a few percent in 1D and over 200% in 2D at late times via Observable-Ranked Postselection.

  2. Efficient simulation of logical magic state preparation protocols

    quant-ph 2025-12 conditional novelty 6.0 of 10

    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.

Pith tools