Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Quantum Error Correction

61 missions · 17 completed

Missions

Open44Completed17All61
🏆Completed
Quantum Information·Captain: iris

Decoherence, Control, and Symmetry in Quantum Computers XI: the [4,2,2]-code Hamiltonian is supercoherent: every single-qubit operator maps its degenerate ground space outTextbook

A qubit that sits in the environment of a physical device loses its information through coupling to that environment. Chapter 15 of Dave Bacon's thesis (arXiv:quant-ph/0305025) sorts decoherence by its effect on the system's energy: a process can lower the energy (cooling), raise it (heating), or leave it unchanged (non-dissipative). Heating processes need…

20 thms5 active usersReviewed
🏆Completed
Quantum Information·Captain: iris

Towards Large-Scale Quantum Computation III: the six Steane-code stabilizers fix exactly the span of the logical states, and adding logical Z leaves only the span of the logical zeroTextbook

Large-scale quantum computers will not run on bare physical qubits. Every proposal in the fault-tolerance literature encodes one logical qubit into many physical qubits and corrects errors faster than they accumulate. The Steane code, seven physical qubits per logical qubit, is a standard code on which the Hadamard, Pauli, phase and controlled-NOT gates all…

11 thms4 active usersReviewed
🏆Completed
Information TheoryLinear algebra·Captain: mikedeng1

Quantum LDPC Codes with Positive Rate and Minimum Distance Proportional to n^{1/2}: The Hypergraph Product of a Full-Rank [n,k,d] Parity-Check Matrix with Itself Is an [[n²+(n−k)², k², d]] CSS CodeResearch Paper

Quantum computers need error correction, and the codes that are cheapest to run in hardware are quantum low-density parity-check (LDPC) codes: every check involves a bounded number of qubits, and every qubit takes part in a bounded number of checks. For a long time the only well-understood quantum LDPC codes were surface codes such as Kitaev's toric code,…

18 thms4 active usersReviewed
🏆Completed
Mathematical PhysicsQuantum GravityQuantum Information·Captain: LG

Harlow TASI 2017: Entanglement Wedge Reconstruction, Quantum RT and JLMS are EquivalentResearch Paper

In the AdS/CFT correspondence a quantum theory of gravity in an asymptotically anti-de Sitter spacetime is equivalent to a conformal field theory on its boundary. A central question is how local bulk physics is encoded in the boundary theory, and in particular which bulk region is described by a given boundary subregion RRR. Harlow's TASI 2017 lectures (arXiv:…

23 thms4 active usersReviewed
🏆Completed
Quantum Information·Captain: iris

Hardware-Efficient Bosonic Quantum Error-Correcting Codes Based on Symmetry Operators: the photon-loss quantum Hamming bound (1+3n)bk≤(4q−3)n(1+3n)b^k \le (4q-3)^n(1+3n)bk≤(4q−3)nResearch Paper

A quantum error-correcting code protects information by embedding it in a larger space. The quantum Hamming bound limits how small that space can be: the images of the code under the correctable errors must fit into the available space. Niu, Chuang and Shapiro (arXiv:1709.05302) design bosonic codes for hardware whose only nonlinearity is coherent χ(2)\chi^{(2)}χ(2)…

12 thms3 active usersReviewed
🏆Completed
Quantum Information·Captain: mikedeng1

A Note on Quantum Error Correction with Continuous Variables: With Infinite Squeezing the Gaussian Three-Mode Repetition Code Reduces the Displacement-Error Probability from γ to γ³Research Paper

Quantum information carried by continuous variables, such as the quadratures xxx and ppp of an optical mode, is cheap to manipulate with beam splitters, squeezers and homodyne detectors, but these Gaussian tools cannot protect Gaussian states against Gaussian noise: Niset, Fiurášek and Cerf proved in 2008 that no Gaussian error-correcting code can do better…

8 thms3 active usersReviewed
🏆Completed
Information TheoryLinear algebraQuantum Information·Captain: mikedeng1

Reversing quantum dynamics with near-optimal quantum and classical fidelity I: The Reversal Operation Attains at Least the Square of the Optimal Average Entanglement FidelityResearch Paper

Quantum error correction and quantum communication both ask the same question: after a known noise process A\mathcal AA has acted on a quantum system, how well can its effect be undone? For a given noise model the best recovery is the solution of a semidefinite program, which gives a number but no structure and no formula. Barnum and Knill showed in 2000 that…

7 thms3 active usersReviewed
🏆Completed
Quantum Information·Captain: Goku

Stabilizer Codes and Quantum Error Correction 4: The standard-form encoding network maps |c⟩ to the encoded basis state (4.8)Textbook

This mission develops Chapter 4 of Stabilizer Codes and Quantum Error Correction by Daniel Gottesman. The chapter's selected results describe the mathematical guarantees below.

2 thms3 active usersReviewed
🏆Completed
CombinatoricsQuantum Information·Captain: Winningatmath

Bivariate-Bicycle Codes: New [[336,20,12]] and [[360,24,12]] Codes and Certified DistancesResearch Paper

A quantum memory stores logical qubits in many physical qubits so that errors can be detected and corrected. The overhead of doing so, measured by how many physical qubits are spent per logical qubit at a given error-correcting power, is one of the main costs of fault-tolerant quantum computation. Bivariate-bicycle (BB) codes are currently the leading…

63 thms2 active usersReviewed
🏆Completed
Quantum Information·Captain: Goku

An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation 3: Every error syndrome of a stabilizer is realized by a Pauli errorTextbook

This mission develops Chapter 3 of An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation by Daniel Gottesman. The chapter's selected results describe the mathematical guarantees below.

3 thms2 active usersReviewed
🏆Completed
Quantum Information·Captain: Goku

An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation 4: Steane error correction: final errors lie only on the fault locationsTextbook

This mission develops Chapter 4 of An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation by Daniel Gottesman. The chapter's selected results describe the mathematical guarantees below.

1 thm2 active usersReviewed
🏆Completed
Quantum Information·Captain: Goku

Stabilizer Codes and Quantum Error Correction 7: The quantum capacity of the erasure channel is max(0, 1 − 2p)Textbook

This mission develops Chapter 7 of Stabilizer Codes and Quantum Error Correction by Daniel Gottesman. The chapter's selected results describe the mathematical guarantees below.

5 thms2 active usersReviewed
🏆Completed
Quantum GravityQuantum Information·Captain: Alien60

Almheiri–Dong–Harlow 2015: Bulk Locality and Quantum Error Correction in AdS/CFTResearch Paper

The AdS/CFT correspondence relates a theory of quantum gravity in anti-de Sitter space (the bulk) to a quantum field theory without gravity on its boundary (the CFT). A central question is how a local field operator ϕ(x)\phi(x)ϕ(x) deep in the bulk is represented by boundary operators. Almheiri, Dong and Harlow (JHEP 04 (2015) 163) pointed out a puzzle.

10 thms2 active usersReviewed
🏆Completed
Quantum Information·Captain: LG

Knill-Laflamme-Zurek: Resilient Quantum Computation and the Error ThresholdResearch Paper

A quantum computer manipulates superpositions of many degrees of freedom, and every gate it applies is imperfect. Before 1996 it was widely argued that this fragility is fatal: the accuracy demanded of each elementary operation appeared to grow with the length of the computation, so that arbitrarily long computations would require arbitrarily perfect…

9 thms2 active usersReviewed
🏆Completed
Quantum Information·Captain: LG

Aharonov-Ben-Or Threshold: Recursive Sparseness Below the ThresholdResearch Paper

Quantum computations are performed on physical devices whose elementary operations are never exact: every gate, every idle qubit, every time step is subject to decoherence, damping and systematic inaccuracy. Without protection these errors accumulate and destroy the computation. In 1997 Dorit Aharonov and Michael Ben-Or proved that this can be overcome: as…

9 thms2 active usersReviewed
🏆Completed
Algebraic TopologyQuantum Information·Captain: Rui Chao

Counterexamples to the Zeng–Pryadko Homological-Distance ConjectureResearch Paper

The tensor product of chain complexes is a basic construction in homological algebra and in the theory of quantum CSS codes. If AAA and BBB are finite based chain complexes over a finite field, their tensor product is graded by total degree,

6 thms2 active usersReviewed
🏆Completed
Algebraic TopologyInformation TheoryQuantum Information·Captain: Rui Chao

Higher-Dimensional Quantum Hypergraph-Product Codes with Finite RatesResearch Paper

Quantum low-density parity-check codes encode quantum information using sparse parity constraints. A standard way to construct them is to translate binary chain complexes into Calderbank--Shor--Steane codes and to combine complexes by tensor product. Homology identifies the logical operators of the resulting code, while the smallest Hamming weight of a…

4 thms1 active userReviewed

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me