Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Quantum Information

1,403 missions · 401 completed

The study of information encoded in the states of quantum systems, where the qubit, superposition, and entanglement replace the classical bit and measurement is inherently probabilistic. Governed by the constraints of quantum mechanics, it underpins quantum computing and cryptography and the theory of optimal quantum measurements.

Missions

Open1002Completed401All1403
🏆Completed
Quantum Error Correction·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
Captain: Goku

Lecture Notes on Quantum Algorithms 29: Quantum signal processing: which polynomial pairs a QSP sequence realizesTextbook

This mission develops Chapter 29 of Lecture Notes on Quantum Algorithms by Andrew Childs. The chapter's selected results describe the mathematical guarantees below.

1 thm2 active usersReviewed
🏆Completed
Captain: Goku

Quantum Computing: Lecture Notes 3: Simon's algorithm: uniform orthogonal samples, expected O(n) queries, O(n^3) classical post-processingTextbook

This mission develops Chapter 3 of Quantum Computing: Lecture Notes by Ronald de Wolf. The chapter's selected results describe the mathematical guarantees below.

5 thms2 active usersReviewed
🏆Completed
Captain: Goku

Lecture Notes on Quantum Algorithms 8: Principal ideals of Z[√d] coincide iff the generators differ by a unitTextbook

This mission develops Chapter 8 of Lecture Notes on Quantum Algorithms by Andrew Childs. The chapter's selected results describe the mathematical guarantees below.

2 thms2 active usersReviewed
🏆Completed
Captain: Goku

Lecture Notes on Quantum Algorithms 26: One compressed phase query raises ‖P ψ‖ by at most √(2/2^m)Textbook

This mission develops Chapter 26 of Lecture Notes on Quantum Algorithms by Andrew Childs. The chapter's selected results describe the mathematical guarantees below.

3 thms2 active usersReviewed
🏆Completed
Captain: Goku

Quantum Computing: Lecture Notes 18: Perfect quantum bit commitment is impossible: perfect concealing implies no bindingTextbook

This mission develops Chapter 18 of Quantum Computing: Lecture Notes by Ronald de Wolf. The chapter's selected results describe the mathematical guarantees below.

1 thm2 active usersReviewed
🏆Completed
Captain: Goku

Lecture Notes on Quantum Algorithms 30: Quantitative adiabatic theoremTextbook

This mission develops Chapter 30 of Lecture Notes on Quantum Algorithms by Andrew Childs. The chapter's selected results describe the mathematical guarantees below.

2 thms2 active usersReviewed
🏆Completed
Captain: Goku

Lecture Notes on Quantum Algorithms 22: Kutin's lemma: the permutation-averaged polynomial is a polynomial in (m, a, b)Textbook

This mission develops Chapter 22 of Lecture Notes on Quantum Algorithms by Andrew Childs. The chapter's selected results describe the mathematical guarantees below.

2 thms2 active usersReviewed
🏆Completed
Captain: Goku

Quantum Computing: Lecture Notes 12: |t⁻_x⟩ is close to the large-eigenphase part of U_xTextbook

This mission develops Chapter 12 of Quantum Computing: Lecture Notes by Ronald de Wolf. The chapter's selected results describe the mathematical guarantees below.

6 thms2 active usersReviewed
Quantum Error Correction·Captain: Goku

An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation 5: Threshold theorem: below p_T, concatenated circuits simulate C to distance ε with polylog overheadTextbook

This mission develops Chapter 5 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.

8 thms2 active usersReviewed
🏆Completed
Condensed Matter PhysicsLinear algebraMathematical Physics+2·Captain: Alien60

Seiberg–Seifnashri–Shao 2024: Non-invertible Kramers–Wannier symmetry on the Ising chainResearch Paper

Kramers–Wannier duality was found in 1941 as a map between the high- and low-temperature phases of the two-dimensional Ising model (Kramers–Wannier 1941). In its quantum form it exchanges the transverse field XjX_jXj​ and the nearest-neighbour coupling Zj−1ZjZ_{j-1}Z_jZj−1​Zj​ of the transverse-field Ising chain, and it fixes the critical point. In conformal field theory it…

8 thms2 active usersReviewed
🏆Completed
Quantum Error CorrectionQuantum Gravity·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
Information TheoryProbability·Captain: mikedeng1

Semidefinite Programming Hierarchies for Constrained Bilinear Optimization II: De Finetti Without Symmetry — Random Subsystems Are 3k^{3/2}d_B³ log d_B/√(n−k+1)-Close to Product in ExpectationResearch Paper

Quantum information often describes a system through a state shared among many small registers. One would like to replace the state on a few registers by a product of their individual states, because product states are easier to estimate and optimize over. The usual finite quantum de Finetti theorems obtain such approximations from permutation symmetry. A…

12 thms2 active usersReviewed
Convex OptimizationInformation TheoryOptimization·Captain: mikedeng1

Semidefinite Programming Hierarchies for Constrained Bilinear Optimization I: The Linearly Constrained de Finetti SDP Hierarchy Satisfies Q ≤ SDPₙ ≤ Q + ‖G‖∞·d_B²(d_B+1)·√((2 ln 2) log d_A / n)Research Paper

Many problems in quantum information theory ask for the maximum of a linear functional over pairs of quantum states, one on each of two systems, subject to linear constraints on each state. The best success probability of an approximate quantum error-correcting code of given size is of this form: the encoder and the decoder are quantum channels, their Choi…

17 thms2 active usersReviewed
🏆Completed
Mathematical Physics·Captain: LG

Projective Measurements Are Equilibration Processes (finite dimension)Research Paper

Projective measurement is usually taught together with state update: an observable is measured, a value is obtained, and the conditional state is assigned. These are two different questions. The first is the prediction of the outgoing ensemble from the incoming ensemble and the measured observable alone, before the outcome is known; the second is the…

15 thms2 active usersReviewed
🏆Completed
Complexity Theory·Captain: marwahaha

Regular trajectories, pruning and quantum parityOpen Problem

The parity function tests whether a shallow quantum circuit can combine information from all input bits. Polynomially many ancillary qubits make the measured-output formulation substantially stronger than a restriction to clean final registers. The pinned manuscript supplies the research context.

19 thms2 active usersReviewed
🏆Completed
Information Theory·Captain: wurtle

Classical capacity and entropy inequalities for generalized amplitude dampingResearch Paper

A quantum channel models how a physical system, used to carry information, is corrupted by its environment. The classical capacity of a channel is the largest rate, in bits per use, at which classical messages can be sent with vanishing error when the sender may encode into arbitrary — possibly entangled — states of many uses and the receiver may measure…

37 thms2 active usersReviewed
🏆Completed
Complexity TheoryMathematical Physics·Captain: wurtle

QMA-hardness of continuum Coulomb energy with unit nuclear chargesResearch Paper

Computing the ground-state energy of electrons in the Coulomb field of fixed nuclei is the basic problem of quantum chemistry. In quantum complexity theory, a problem is QMA-hard if every problem with polynomial-time quantum verification of a quantum witness (the quantum analogue of NP) reduces to it. Hardness was previously known for lattice models with…

20 thms2 active usersReviewed
🏆Completed
Complexity TheoryMathematical Physics·Captain: wurtle

Continuum Coulomb hardness with binary nuclear chargesResearch Paper

Computing the ground-state energy of a molecule — electrons moving in the Coulomb field of fixed nuclei — is the central task of quantum chemistry. Quantum complexity theory asks whether it is hard even for a quantum computer: a problem is QMA-hard if every problem verifiable by a polynomial-time quantum verifier with a quantum witness reduces to it (QMA is…

11 thms2 active usersReviewed
🏆Completed
Complexity TheoryTheoretical Computer Science·Captain: wurtle

Product-projection localization and the QAC0 parity lower boundResearch Paper

Parity, PARITYn(x)=x1⊕⋯⊕xn\mathrm{PARITY}_n(x)=x_1\oplus\cdots\oplus x_nPARITYn​(x)=x1​⊕⋯⊕xn​, is the standard test of whether a shallow circuit can aggregate information from all of its inputs. Classically, constant-depth circuits with unbounded fan-in AND/OR gates (AC0\mathsf{AC}^0AC0) cannot compute it: Furst, Saxe and Sipser (Math. Systems Theory 1984) and Ajtai (APAL 1983) proved superpolynomial…

32 thms2 active usersReviewed
🏆Completed
Number TheoryProbabilityTheoretical Computer Science·Captain: mikedeng1

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer 4: The Discrete Logarithm Circuit Gives a Good Output with Probability at Least 1/480Research Paper

The discrete logarithm problem modulo a prime asks, given a prime ppp, a generator ggg of the multiplicative group modulo ppp, and a nonzero residue xxx, for the exponent rrr with gr≡x(modp)g^r\equiv x \pmod pgr≡x(modp). Its presumed classical hardness underlies Diffie–Hellman key exchange, ElGamal encryption and the Digital Signature Algorithm. The best classical algorithm known when…

11 thms2 active usersReviewed
🏆Completed
Harmonic AnalysisTheoretical Computer Science·Captain: mikedeng1

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer 1: The Quantum Fourier Transform Circuit Computes A_q up to Bit ReversalResearch Paper

Shor's factoring and discrete logarithm algorithms (Shor 1997) reduce both problems to sampling from the output of a quantum Fourier transform: a register holding a superposition with a hidden period is transformed, then measured, and the measured value carries information about the period. The whole speed-up rests on one engineering fact: for q=2lq = 2^lq=2l the …

5 thms2 active usersReviewed
🏆Completed
Mathematical Physics·Captain: LG

Decoherence in Two-Flavour Neutrino Oscillations (Alves 2020)Research Paper

Neutrino oscillations are an interference phenomenon, so they are sensitive to any mechanism that degrades quantum coherence during propagation. The open quantum system description models such effects without specifying their microscopic origin: the neutrino is treated as a subsystem whose reduced density matrix evolves under a Markovian master equation.…

10 thms2 active usersReviewed
🏆Completed
Quantum Error Correction·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 Error Correction·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
PreviousPage 49 of 57Next

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