REVIEW 3 cited by
Simple Quantum Error Correcting Codes
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
Signed reviews
read the original abstract
Methods of finding good quantum error correcting codes are discussed, and many example codes are presented. The recipe C_2^{\perp} \subseteq C_1, where C_1 and C_2 are classical codes, is used to obtain codes for up to 16 information qubits with correction of small numbers of errors. The results are tabulated. More efficient codes are obtained by allowing C_1 to have reduced distance, and introducing sign changes among the code words in a systematic manner. This systematic approach leads to single-error correcting codes for 3, 4 and 5 information qubits with block lengths of 8, 10 and 11 qubits respectively.
Forward citations
Cited by 3 Pith papers
-
Hyper-optimized Quantum Lego Contraction Schedules
A new Sparse Stabilizer Tensor cost function enables hyper-optimized contraction schedules for Quantum LEGO WEP calculations, delivering orders-of-magnitude improvements over dense tensor baselines for stabilizer codes.
-
The Utility of Sparse Error Detection in Quantum Simulations
Sparse error detection in small Iceberg codes reduces systematic errors in simulated Schwinger-model observables under depolarizing noise, with diminishing returns after a few detection layers.
-
Realizing Error Suppression in Partially Fault-Tolerant Quantum Simulations with IBM Quantum Computers
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.
Discussion (0). Continue with ORCID to comment.