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
Complexity TheoryProbabilityTheoretical Computer Science·Captain: mikedeng1

Strengths and Weaknesses of Quantum Computing II: Relative to a Random Permutation, a Quantum Algorithm Needs Ω(2^{n/3}) Queries to Decide the First Bit of A⁻¹(1ⁿ)Research Paper

An oracle lets an algorithm ask for the value of a function without giving it a description of that function. An oracle lower bound isolates how many questions are needed, even when computation between questions is unrestricted. Bennett, Bernstein, Brassard and Vazirani used this viewpoint to compare classical and quantum access to randomly chosen functions…

10 thms3 active usersReviewed
🏆Completed
Mathematical Physics·Captain: LG

Peres-Terno: the no-communication theorem for commuting Kraus operatorsResearch Paper

Two observers, Alice and Bob, share a quantum system. Alice performs some intervention (a measurement, possibly followed by discarding part of her apparatus) and Bob, somewhere else, performs his own. If the statistics of Bob's outcomes could depend on what Alice chose to do, Alice could send Bob a message through the shared system alone, and if the two…

10 thms3 active usersReviewed
🏆Completed
Information TheoryTheoretical Computer Science·Captain: mikedeng1

Shadow Tomography of Quantum States 3: Shadow Tomography Needs Ω(min{D², log M}/ε²) CopiesResearch Paper

A mixed state of a DDD-dimensional quantum system is a D×DD\times DD×D positive semidefinite matrix ρ\rhoρ of trace 111. Writing ρ\rhoρ down takes about D2D^2D2 real numbers, and DDD is exponential in the number of qubits, so learning ρ\rhoρ in full is expensive. Holevo's theorem and the random access code bounds of Ambainis, Nayak, Ta-Shma and Vazirani say that an nnn-qubit state…

16 thms3 active usersReviewed
🏆Completed
Information TheoryStatistics·Captain: mikedeng1

Shadow Tomography of Quantum States 2: Even the Classical Special Case Needs Ω(min{D, log M}/ε²) CopiesResearch Paper

Shadow tomography asks for predictions of many specified measurements of an unknown quantum state, while using as few prepared copies of that state as possible. The requested output is a list of acceptance probabilities, not a full description of the state. A procedure might exploit the fact that these are only MMM numbers, even when the state has dimension DDD.…

14 thms3 active usersReviewed
🏆Completed
Number TheoryProbabilityTheoretical Computer Science·Captain: mikedeng1

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer 3: The Success Probability of Quantum Order FindingResearch Paper

The security of the RSA cryptosystem rests on the assumed difficulty of factoring large integers, and the best known classical algorithms for factoring run in super-polynomial time. In 1994 Peter Shor showed that a quantum computer can factor an nnn-digit integer in time polynomial in nnn (Shor, SIAM J. Comput. 1997; conference version FOCS 1994). The algorithm…

12 thms3 active usersReviewed
🏆Completed
Mathematical PhysicsTheoretical Computer Science·Captain: LG

Undecidability of the Spectral GapResearch Paper

The spectral gap of a quantum many-body Hamiltonian is the difference between the energy of its ground state and the energy of its first excited state, in the limit of infinitely many particles. Whether a given microscopic interaction produces a gapped or a gapless system decides much of the macroscopic physics: gapped systems have exponentially decaying…

22 thms3 active usersReviewed
🏆Completed
Captain: Henry Yuen

Parallel repetition for quantum gamesResearch Paper

A nonlocal game is played between a classical referee and two or more cooperating players who are not allowed to communicate during the game. In the two-player, one-round setting, the referee samples a pair of questions (x,y)(x,y)(x,y) from a distribution μ\muμ, sends xxx to Alice and yyy to Bob, and receives answers aaa and bbb. The players win when a predicate V(x,y,a,b)V(x,y,a,b)V(x,y,a,b) acce…

10 thms3 active usersReviewed
Captain: Mrnaiq

Gao's Quantum Union Bounds for Sequential Projective MeasurementsResearch Paper

A measurement can reveal information while changing the system being measured. Repeating this operation creates a problem for quantum state discrimination, property testing, tomography and communication: a measurement that would usually succeed on the original state is actually applied to a state already changed by earlier measurements. Individual success…

13 thms2 active usersReviewed
Representation Theory·Captain: Shuze Chen

Efficient Quantum Fourier Transforms For Semisimple AlgebrasResearch Paper

The quantum Fourier transform (QFT) of a finite group GGG is the change of basis on C[G]\mathbb{C}[G]C[G] that block-diagonalizes the regular representation. For cyclic groups it is the engine of Shor's period finding, and efficient circuits are known for several non-abelian groups, starting with Beals' QFT for the symmetric group SnS_nSn​ (Beals 1997) and the…

23 thms2 active usersReviewed
Computational ComplexityGraph Theory·Captain: mikedeng1

A Quantum Scaling Algorithm for Maximum-Weight Perfect Matching in General GraphsResearch Paper

The maximum-weight perfect matching (MWPM) problem asks for a perfect matching of maximum total weight in an undirected graph with integer edge weights. It is a basic primitive of combinatorial optimization. It appears directly in resource allocation, exchange markets and scheduling, and as a subroutine in Christofides' 3/2-approximation for metric TSP.…

18 thms2 active usersReviewed
Quantum Error Correction·Captain: mikedeng1

Fault Tolerant Adiabatic Quantum Computation from Passive Error Correcting CodesResearch Paper

Adiabatic quantum computation (AQC) evolves a register under a slowly varying Hamiltonian from an easily prepared ground state to one that encodes the answer. It is polynomially equivalent to the circuit model on perfect hardware (Aharonov et al. 2008), but its natural noise is thermal: a system coupled to a bath at a fixed temperature makes transitions…

18 thms2 active usersReviewed
Complexity TheoryInformation TheoryProbability+1·Captain: mikedeng1

Four Ways to Stream: Exponential Separations from Random Order and Quantum MemoryResearch Paper

Single-pass streaming algorithms read a long input once with little memory. Quantum memory is known to help exponentially on streams whose data all comes before the questions: Boolean Hidden Matching and its relatives give a quantum advantage when the bit items precede the matching items (Gavinsky, Kempe, Kerenidis, Raz and de Wolf, SIAM J. Comput. 2008; Kal…

42 thms2 active usersReviewed
CombinatoricsProbabilityQuantum Error Correction·Captain: iris

Local Quantum Fault Tolerance Without ExpansionResearch Paper

A quantum computer built from noisy components needs an error-correcting code and a decoder that keep errors from accumulating faster than they are removed. Most threshold theorems rely on concatenated codes (Aharonov–Ben-Or) or on codes and decoders with expansion properties. Hardware that is laid out in space favours a different design: a code with…

34 thms2 active usersReviewed
Captain: mikedeng1

Batchwise List Decoding for Agnostic Stabilizer LearningResearch Paper

Stabilizer states are the states reachable from ∣0n⟩|0^n\rangle∣0n⟩ by Clifford circuits. They are classically simulable, they describe the code spaces of stabilizer error-correcting codes, and they are the reference set against which "magic" (non-stabilizerness) is measured. A natural learning question is therefore agnostic and proper: given copies of an…

33 thms2 active usersReviewed
Quantum Error Correction·Captain: mikedeng1

Improved Transversal Non-Clifford Gates from Cup ProductsResearch Paper

Quantum error correction stores logical information across many physical systems so that local errors can be detected and corrected. Performing useful operations on that information can introduce further errors. A transversal gate distributes the operation across physical systems with limited interaction, controlling error propagation. The target here is a…

19 thms2 active usersReviewed
Captain: mikedeng1

Query-optimal quantum simulation of Lindblad evolutionResearch Paper

A quantum system interacting with its environment can lose information even when its isolated dynamics would be reversible. A Lindblad equation describes a finite system whose environment acts as a memoryless reservoir. Efficient simulation of this evolution is relevant both to modeling dissipative physical systems and to algorithms using dissipative…

23 thms2 active usersReviewed
Captain: mikedeng1

Sparse Hamiltonian simulation with optimal dependence on the maximum column Euclidean normResearch Paper

A quantum computer simulates a time-independent physical system by implementing the evolution generated by its Hamiltonian. The same operation supplies a computational primitive for eigenvalue estimation and quantum linear systems. When a matrix is given through queries to its sparse entries, the number of those queries measures how much information the…

22 thms2 active usersReviewed
Quantum Error Correction·Captain: mikedeng1

Good Quantum Locally Testable Codes from Product ExpansionResearch Paper

An error-correcting code separates valid messages from corrupted words. A locally testable code adds a quantitative guarantee: a tester inspects only a bounded number of coordinates, always accepts codewords, and rejects a word with probability proportional to its distance from the code. Quantum error correction asks for compatible tests for two kinds of…

16 thms2 active usersReviewed
Mathematical PhysicsTheoretical Computer Science·Captain: iris

Shallow Quantum Circuits for Geometrically Local Lindblad DynamicsResearch Paper

Quantum systems that exchange energy and coherence with an environment are described, in the Markovian regime, by a Lindblad generator L\mathcal LL and the channel eTLe^{T\mathcal L}eTL it generates (Gorini–Kossakowski–Sudarshan 1976; Lindblad 1976). Such dynamics model decoherence, transport and dissipative state preparation, and simulating them on a quantum…

35 thms2 active usersReviewed
ProbabilityStatisticsTheoretical Computer Science·Captain: iris

Testing State and Unitary DesignsResearch Paper

Random pure states are a resource throughout quantum information: randomized benchmarking, shadow tomography, cryptographic pseudorandom states and random-circuit sampling all rely on an ensemble of states that reproduces the low-order statistics of the uniformly random (Haar) state. An ensemble with this property up to order ttt is a state ttt-design. Designs…

46 thms2 active usersReviewed
Functional AnalysisRandom Matrix TheoryTheoretical Computer Science·Captain: mikedeng1

Quantum Advantage for Distributed Symmetry BreakingResearch Paper

In distributed computing, symmetry breaking asks the nodes of a network, all running the same program, to produce locally different outputs; the basic example is a proper colouring of a cycle. In the classical LOCAL model, 3-colouring an nnn-cycle requires Θ(log⁡∗n)\Theta(\log^* n)Θ(log∗n) communication rounds, with or without randomness (Linial 1992). Whether quantum…

30 thms2 active usersReviewed
Complexity Theory·Captain: mikedeng1

Beyond IP= PSPACE and QIP= PSPACE: Interactive Proofs in Arbitrary Physical TheoriesResearch Paper

An interactive proof lets a verifier with bounded computational power check a claim by exchanging messages with an all-powerful prover. Two theorems describe the power of the model: classical interactive proofs decide exactly polynomial space, IP=PSPACE\mathsf{IP}=\mathsf{PSPACE}IP=PSPACE (Lund, Fortnow, Karloff and Nisan; Shamir; Shen, 1990–92), and quantum interactive…

26 thms2 active usersReviewed
Computational ComplexityGraph Theory·Captain: mikedeng1

A Quantum Lower Bound for Triangle FindingResearch Paper

A triangle is a set of three distinct vertices joined by all three possible edges. In the adjacency-matrix query model, a graph is hidden and an algorithm learns whether two vertices are adjacent by querying their pair. Triangle finding asks the algorithm to return a triangle whenever one exists. The resource being measured is the number of queries;…

20 thms2 active usersReviewed
Computational ComplexityProbabilityTheoretical Computer Science·Captain: mikedeng1

Quantum Query Lower Bounds from Classical Moment MatchingResearch Paper

Many properties studied in property testing and distribution estimation are symmetric: they depend on a function f:[N]→[N]f:[N]\to[N]f:[N]→[N] only through how often each output value occurs. Examples are the number of distinct values (support size), element distinctness, collision-freeness, and kkk-distinctness. A standard way to prove classical query lower bounds for such…

20 thms2 active usersReviewed
Combinatorics·Captain: mikedeng1

Impossibility of One-Way One-Round Quantum 4-Coloring via Matrix-Space StabilityResearch Paper

Locality asks how far information must travel in a network before each node can choose its part of a global solution. The basic model is the LOCAL model (Linial 1992; Peleg 2000): nodes communicate in synchronous rounds, and the round complexity of a problem is the number of rounds needed. Colouring a cycle is the standard test case. For every fixed q≥3q\ge3q≥3, qqq…

24 thms2 active usersReviewed
PreviousPage 24 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