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

Spectrum Estimation is Almost as Hard as TomographyResearch Paper

A ddd-dimensional quantum state is a density matrix ρ∈Cd×d\rho\in\mathbb C^{d\times d}ρ∈Cd×d: positive semidefinite with trace 111. Its eigenvalues form a probability distribution, the spectrum of ρ\rhoρ, which determines every unitarily invariant property of the state: its von Neumann entropy, its purity, its rank. Spectrum estimation asks how many identical copies of an…

51 thms5 active usersReviewed
Mathematical PhysicsProbabilityRandom Matrix Theory·Captain: iris

Sharp Bounds on Ground State Energy of the SYK ModelResearch Paper

The Sachdev–Ye–Kitaev (SYK) model is a random Hamiltonian on nnn Majorana fermions with all-to-all kkk-body interactions (Sachdev–Ye 1993; Kitaev 2015; Maldacena–Stanford 2016). It is studied in high-energy physics as a solvable model of quantum chaos and holography, and in quantum computing as a candidate for a quantum advantage in ground-state preparation:…

37 thms5 active usersReviewed
Complexity TheoryTheoretical Computer Science·Captain: iris

A Dichotomy for Exact Quantum Circuit AmplitudesResearch Paper

Which quantum circuits can a classical computer simulate exactly? The Gottesman–Knill theorem shows that Clifford circuits can be simulated by tracking stabilizer generators (Aaronson–Gottesman 2004); Valiant's matchgates give a second mechanism, and bounded Schmidt rank a third. In 2005 Aaronson asked whether these simulation algorithms have a common…

43 thms5 active usersReviewed
Theoretical Computer Science·Captain: iris

On the pseudorandomness of simple quantum processesResearch Paper

A pseudorandom unitary ensemble is one that no efficient quantum algorithm can tell apart from the Haar measure. Such ensembles underlie quantum cryptography and are used as models of chaotic many-body dynamics. A weaker, purely statistical property is being an approximate unitary ttt-design: the ensemble reproduces the first ttt moments of the Haar measure.…

47 thms5 active usersReviewed
Statistical Mechanics·Captain: iris

Area laws in quantum systems: mutual information and correlations: thermal states satisfy I(A:B)≤β tr[H∂(ρA⊗ρB−ρAB)]I(A:B)\le\beta\,\mathrm{tr}[H_\partial(\rho_A\otimes\rho_B-\rho_{AB})]I(A:B)≤βtr[H∂​(ρA​⊗ρB​−ρAB​)]Research Paper

The area law asks how the correlations between a region of a many-body system and the rest of the system scale with the size of the region. For ground states of quantum lattice systems the question is usually phrased through the entanglement entropy of the region. Interest in it comes from several directions: the entropy of a black hole scales with the area…

14 thms5 active usersReviewed
🏆Completed
Statistics·Captain: iris

Structure of sufficient quantum coarse-grainings: both outputs of a sufficient coarse-graining factorize over the central blocks of a multiplicative-domain subalgebra, with a common commutant factorResearch Paper

In classical statistics a statistic is sufficient for a family of distributions when nothing is lost by passing to it: the original data can be regenerated from the statistic by a Markov kernel that does not depend on the unknown parameter. The quantum analogue concerns a coarse-graining TTT, a trace-preserving map sending density matrices on one system to…

33 thms5 active usersReviewed
Quantum Error Correction·Captain: iris

A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations: ladder states from ∣H⟩|H\rangle∣H⟩ copies drive a greedy protocol reaching every single-qubit unitary almost surelyResearch Paper

Fault-tolerant quantum computers implement Clifford gates cheaply. Universality needs one non-Clifford ingredient, usually a distilled copy of the magic state ∣H⟩=cos⁡(π/8)∣0⟩+sin⁡(π/8)∣1⟩|H\rangle=\cos(\pi/8)|0\rangle+\sin(\pi/8)|1\rangle∣H⟩=cos(π/8)∣0⟩+sin(π/8)∣1⟩, and distillation is expensive (Bravyi–Kitaev 2005). Algorithms, however, ask for arbitrary single-qubit rotations. The standard route compiles such…

38 thms5 active usersReviewed
Information Theory·Captain: iris

Isotropic quantum spin channels and additivity questions: the spin-1/2 isotropic channel has minimal entropy output log⁡3−23log⁡2\log 3 - \frac{2}{3}\log 2log3−32​log2 and the spin-1 channel log⁡2\log 2log2Research Paper

A quantum channel is a completely positive, trace-preserving linear map Λ\LambdaΛ on matrices; it models how a quantum system is changed by noise. Its minimal entropy output S[Λ]S[\Lambda]S[Λ] measures how close the channel can come to preserving purity: the smallest von Neumann entropy of any output state. The additivity question asks whether …

23 thms5 active usersReviewed
Captain: Gohan

Observables I: Stone SpectraResearch Paper

In this work we discuss the notion of observable - both quantum and classical - from a new point of view. In classical mechanics, an observable is represented as a function (measurable, continuous or smooth), whereas in (von Neumann's approach to) quantum physics, an observable is represented as a bonded selfadjoint operator on Hilbert space. We will show…

74 thms5 active usersReviewed
🏆Completed
Quantum Error Correction·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
Captain: Gohan

An introduction to measurement based quantum computationResearch Paper

In the formalism of measurement based quantum computation we start with a given fixed entangled state of many qubits and perform computation by applying a sequence of measurements to designated qubits in designated bases. The choice of basis for later measurements may depend on earlier measurement outcomes and the final result of the computation is…

32 thms5 active usersReviewed
🏆Completed
Captain: Gohan

Partition AlgebrasResearch Paper

The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the algebra depend polynomially on a parameter. This is a survey paper which proves the primary results in the theory of…

20 thms5 active usersReviewed
Information Theory·Captain: iris

Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels: every two-qubit state M with singlet fidelity ⟨Ψ⁻|M|Ψ⁻⟩ > 1/2 has positive distillable entanglement D(M) > 0Research Paper

Quantum teleportation moves an unknown qubit from Alice to Bob using one shared, perfectly entangled pair and two classical bits (Bennett et al. 1993). In practice the pairs are distributed through a noisy channel and arrive as a mixed state MMM, and teleporting through an impure pair degrades the transmitted state. Bennett, Brassard, Popescu, Schumacher,…

39 thms5 active usersReviewed
Information Theory·Captain: iris

The Capacity of Quantum Channel with General Signal States: the capacity of a classical-quantum channel with arbitrary mixed signal states equals the maximal entropy bound over input distributionsResearch Paper

A classical-quantum channel sends a classical letter iii by preparing a quantum state SiS_iSi​; the receiver measures the state to guess the letter. This is the basic model of transmitting classical information with quantum carriers (photons, spins), and its capacity is the quantity that quantum information theory compares with Shannon's classical capacity. A. S.…

36 thms5 active usersReviewed
🏆Completed
Captain: Gohan

Quantum cloningResearch Paper

The impossibility of perfectly copying (or cloning) an arbitrary quantum state is one of the basic rules governing the physics of quantum systems. The processes that perform the optimal approximate cloning have been found in many cases. These "quantum cloning machines" are important tools for studying a wide variety of tasks, e.g. state estimation and…

52 thms5 active usersReviewed
🏆Completed
Information Theory·Captain: mikedeng1

No-local-broadcasting theorem for quantum correlations: A Bipartite State Can Be Locally Broadcast if and only if It Is Classical-ClassicalResearch Paper

A quantum state of two systems can be correlated without being entangled, and the question of which of those unentangled correlations are still "quantum" has been studied from several directions: quantum discord (Ollivier & Zurek 2001), the classical correlations of Henderson & Vedral 2001, and the work-deficit of Oppenheim, Horodecki et al. 2002. Piani,…

39 thms5 active usersReviewed
🏆Completed
Mathematical Physics·Captain: mikedeng1

Entangling operations and their implementation using a small amount of entanglement: The Gate exp(−i(π/2^N)σx⊗σx) Is Implemented with Unit Probability Using α_N f_N < 5.97932·α_N Ebits on AverageResearch Paper

A two-qubit gate whose qubits sit in different laboratories cannot be applied by local operations and classical communication (LOCC) alone: it can create entanglement, so it must consume some. The basic question of distributed quantum computation is how much. The textbook answer, teleporting one qubit to the other side, applying the gate and teleporting…

14 thms5 active usersReviewed
Captain: Goku

Continuity bounds on the quantum relative entropy - IIResearch Paper

The quantum relative entropy is frequently used as a distance measure between two quantum states, and inequalities relating it to other distance measures are important mathematical tools in many areas of quantum information theory. We have derived many such inequalities in our previous work (K.M.R. Audenaert and J. Eisert, J. Math. Phys. 46, 102104 (2005)).…

19 thms5 active usersReviewed
🏆Completed
Captain: Goku

Reversibility conditions for quantum channels and their applicationsResearch Paper

A necessary condition for reversibility (sufficiency) of a quantum channel with respect to complete families of states with bounded rank is obtained. A full description (up to isometrical equivalence) of all quantum channels reversible with respect to orthogonal and nonorthogonal complete families of pure states is given. Some applications in quantum…

56 thms5 active usersReviewed
🏆Completed
Information Theory·Captain: mikedeng1

An Intuitive Proof of the Data Processing Inequality: Conditional von Neumann Entropy Cannot Increase Under Partial Trace, via the Smooth Min-Entropy DPI and the Quantum AEPResearch Paper

The data processing inequality (DPI) for the conditional von Neumann entropy says that discarding part of the side information cannot make a quantum system less uncertain: for every tripartite state ρABC\rho_{ABC}ρABC​,

22 thms5 active usersReviewed
🏆Completed
Information TheoryTheoretical Computer Science·Captain: mikedeng1

Improving the Security of Quantum Protocols via Commit-and-Open: After the Commit-and-Open Test, Any Dishonest Bob Is β-Benign Up to a Negligible Trace DistanceResearch Paper

Many two-party quantum protocols, such as oblivious transfer and password-based identification, start the same way: Alice sends Bob nnn qubits ∣x⟩θ|x\rangle_\theta∣x⟩θ​ encoding random bits xxx in random BB84 bases θ∈{+,×}n\theta\in\{+,\times\}^nθ∈{+,×}n. Their security proofs work only against a restricted Bob, for example one with bounded quantum memory (Damgård, Fehr, Salvail,…

12 thms5 active usersReviewed
Operations ResearchOptimization·Captain: mikedeng1

An Optimal Product-State Approximation for 2-Local Quantum Hamiltonians with Positive Terms: Rounding Level 2 of the Quantum Lasserre Hierarchy Gives a 1/2-Approximation for Quantum Max CutResearch Paper

Quantum Max Cut assigns a qubit to each vertex of a weighted graph and a two-qubit energy term to each edge. It asks for a quantum state with high total energy. The problem is a quantum analogue of graph Max Cut, but states can be entangled and edge terms act on a Hilbert space whose dimension grows exponentially with the number of vertices. Approximation…

22 thms5 active usersReviewed
🏆Completed
Mathematical PhysicsQuantum Mechanics·Captain: mikedeng1

Teleportation Stretching for Single-Mode Gaussian Channels: Exact LOCC Simulation of a Pure-Loss Channel from a Finite-Energy Effective Choi StateResearch Paper

The ultimate rates of quantum communication over optical fibre — how many secret bits or entangled pairs per channel use a lossy line can carry with unlimited local operations and classical communication (LOCC) — are bounded through a technique called teleportation stretching (Pirandola, Laurenza, Ottaviani, Banchi, arXiv:1510.08863). The idea is that if a…

11 thms5 active usersReviewed
Information TheoryMathematical Physics·Captain: mikedeng1

Capacities of Quantum Channels for Massive Bosons and Fermions: Under Average Energy and Particle-Number Constraints the Capacity Is the Grand-Canonical Entropy, Attained by Fock StatesResearch Paper

Classical information can be sent by choosing a quantum state, transmitting it, and asking a receiver to measure it. An ideal noiseless channel seems to have no finite information limit if its carrier can occupy arbitrarily many quantum states. A physical carrier, however, has a limited average energy, and a channel carrying massive particles also has a…

22 thms5 active usersReviewed
🏆Completed
OptimizationTheoretical Computer Science·Captain: mikedeng1

A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem II: For Random Signs the QAOA Expectation Concentrates Above (1/2 + sin γ cos^(3D) γ/2)mResearch Paper

The Quantum Approximate Optimization Algorithm (QAOA) of Farhi, Goldstone and Gutmann (arXiv:1411.4028) prepares a parametrized quantum state whose measurement yields a candidate solution of a combinatorial optimization problem. Its level-one version alternates a single phase operator and a single mixing operator and is simple enough to analyse by hand. In a…

19 thms5 active usersReviewed
PreviousPage 3 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