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
Optimization·Captain: Goku

Oracle-Parameterized Convergence Rates: SPIDER, Q-SPIDER, and the Exact CrossoverResearch Paper

Quantum algorithms for stochastic optimization are usually presented one paper at a time: a schedule is fixed, a quantum mean estimator is substituted for a classical minibatch, and a new rate is derived from scratch. The derivations are near-identical, and the step that actually differs — the price of one gradient query — is buried inside each proof rather…

37 thms1 active userReviewed
🏆Completed
Algebraic TopologyInformation TheoryQuantum Error Correction·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
🏆Completed
Captain: Elsie66

Grover's AlgorithmResearch Paper

Searching an unsorted list of NNN items for a single marked entry takes Θ(N)\Theta(N)Θ(N) queries classically — there is no way to do better than checking items one at a time. Grover's algorithm (Grover 1996) shows that a quantum computer solves the same problem in Θ(N)\Theta(\sqrt N)Θ(N​) queries, a quadratic speedup that applies to any problem expressible as unstructured…

8 thms1 active user
PreviousPage 57 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