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: 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
CombinatoricsQuantum InformationTheoretical Computer Science·Captain: iris

Asymptotically Good Quantum Locally Testable CodesResearch Paper

A quantum locally testable code (qLTC) is a quantum error-correcting code whose membership can be checked by measuring a few qubits at a time, with a rejection probability proportional to the distance from the code. Classical locally testable codes underlie the PCP theorem and property testing; their quantum analogue was proposed by Aharonov and Eldar (AE15)…

48 thms1 active userReviewed
CombinatoricsTheoretical Computer Science·Captain: iris

Good Quantum Locally Testable Codes from Lossless Cubical ComplexesResearch Paper

A quantum locally testable code (qLTC) is a quantum code whose stabilizer checks detect errors in proportion to their distance from the code: a word far from the code violates a constant fraction of the checks, each of which touches only a constant number of qubits. Aharonov and Eldar put the notion in its current form (arXiv:1310.5664), motivated by its…

36 thms1 active userReviewed
Quantum Information·Captain: Goku

Single-shot decoding of good quantum LDPC codesResearch Paper

Single-shot decoding of good quantum LDPC codes establishes the selected mathematical guarantees below. The mission turns those original paper results into precise Lean proof targets.

1 thm1 active userReviewed
Quantum Information·Captain: Goku

Quantum Expander CodesResearch Paper

Quantum Expander Codes establishes the selected mathematical guarantees below. The mission turns those original paper results into precise Lean proof targets.

1 thm1 active userReviewed
Quantum Information·Captain: Goku

Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}Research Paper

Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2} establishes the selected mathematical guarantees below. The mission turns those original paper results into precise Lean proof targets.

1 thm1 active userReviewed
Quantum Information·Captain: Goku

Quantum Tanner codes (Leverrier, Zemor)Research Paper

Quantum Tanner codes (Leverrier, Zemor) establishes the selected mathematical guarantees below. The mission turns those original paper results into precise Lean proof targets.

1 thm1 active userReviewed
Quantum Information·Captain: Goku

Decoding quantum Tanner codes (Leverrier, Zemor)Research Paper

Decoding quantum Tanner codes (Leverrier, Zemor) establishes the selected mathematical guarantees below. The mission turns those original paper results into precise Lean proof targets.

1 thm1 active userReviewed
🏆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
PreviousPage 3 of 3Next

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