Pith Number

pith:2JSEHUDK

pith:2024:2JSEHUDKSJXOVR7IMMEDQFT2S2

not attested not anchored not stored refs resolved

Demonstration of logical qubits and repeated error correction with better-than-physical error rates

(2) Quantinuum), A. Chernoguzov (2), A. Paetznick (1), A. Paz (1), A. Sundaram (1), B. Neyenhuis (2), C. Foltz (2), C. Holliman (2), C. Ryan-Anderson (2), C. V. Horst (2), D. Gresh (2), D. Hayes (2), D. Lucchetti (2), D. Tom (1), F. Frachon (1), J. Johansen (2), J. M. Bello-Rivas (1), J. M. Dreiling (2), J. P. Campora III (2), J. P. Gaebler (2), J. Pino (2), K. M. Svore (1) ((1) Microsoft Azure Quantum, L. Grans-Samuelsson (1), M. Mills (2), M. P. da Silva (1), M. Zanner (1), N. Hewitt (2), P. Siegfried (2), R. P. Stutz (2), S. A. Moses (2), S. J. Wernli (1), T. M. Gatterman (2), Y. Matsuoka (2)

Trapped-ion processor shows logical error rates below physical levels via fault-tolerant encoding.

arxiv:2404.02280 v3 · 2024-04-02 · quant-ph

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{2JSEHUDKSJXOVR7IMMEDQFT2S2}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

We present experiments on a trapped-ion QCCD processor where, through the use of fault-tolerant encoding and error correction, we are able to suppress logical error rates to levels below the physical error rates.

C2weakest assumption

The comparison between logical and physical error rates assumes that post-selection and circuit implementations do not introduce unaccounted biases or that the physical error baselines accurately represent the relevant operations without systematic offsets.

C3one line summary

Logical error rates in [[7,1,3]] and [[12,2,4]] codes are suppressed 9.8-800 times below physical rates on trapped-ion hardware, with repeated correction cycles approaching the error rate of two physical CNOTs.

References

81 extracted · 81 resolved · 13 Pith anchors

[1] Circuits The circuit components used to generate a high-fidelity Bell state were previously demonstrated in Refs. 12 and

[2] The logical program to prepare a logical Bell resource state using the Steane code is in Fig. 1. The preparation includes encoding circuits to initialize two logical qubits to |0⟩, transversal single

[3] 2 (see Appendix B for details of the statistical analysis and Appendix D for additional data)

[4] gain” to be the error rate of the physical circuits divided by the error rate of the corresponding logical circuit, while “corrections

[5] gain” to be the error rate of the unencoded circuits divided by the error rate of the encoded circuit in question, while “corrections

Formal links

1 machine-checked theorem link

Cited by

42 papers in Pith

Sample-efficient benchmarking of shallow all-to-all random quantum circuits

Feasibility of performing quantum chemistry calculations on quantum computers

Managing Classical Processing Requirements for Quantum Error Correction

Quantum memory based on concatenating surface codes and quantum Hamming codes

Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code

Receipt and verification

First computed	2026-05-17T23:38:46.279138Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

d26443d06a926eeac7e8630838167a9694426b33c5ff581737a97338ec8a8d56

Aliases

arxiv: 2404.02280 · arxiv_version: 2404.02280v3 · doi: 10.48550/arxiv.2404.02280 · pith_short_12: 2JSEHUDKSJXO · pith_short_16: 2JSEHUDKSJXOVR7I · pith_short_8: 2JSEHUDK

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/2JSEHUDKSJXOVR7IMMEDQFT2S2 \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: d26443d06a926eeac7e8630838167a9694426b33c5ff581737a97338ec8a8d56

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "e87b4df12409c6e1b1b66241fc936e3ac614b53ebb57c616bdde176b7e8fd4c6",
    "cross_cats_sorted": [],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "quant-ph",
    "submitted_at": "2024-04-02T20:14:13Z",
    "title_canon_sha256": "4f55468295dba5ca68375859c568f70293632ae832d2ae7cc134fe9c46e993e7"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2404.02280",
    "kind": "arxiv",
    "version": 3
  }
}