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
Information Theory·Captain: iris

Distinguishability and Accessible Information in Quantum Theory IX: noncommuting quantum states cannot be broadcastTextbook

The no-cloning theorem (Wootters–Zurek and Dieks, 1982) says that no physical process copies an unknown pure quantum state. For mixed states the question is subtler, because copying is not the only way to hand a state to two parties. A process broadcasts a state ρ\rhoρ onto two systems if each system, looked at alone, is in the state ρ\rhoρ; the joint state may…

24 thms6 active usersReviewed
Information Theory·Captain: iris

Cryptographic Distinguishability Measures for Quantum Mechanical States: inequalities between trace distance, quantum Bhattacharyya coefficient and Shannon distinguishabilityResearch Paper

Cryptographic protocols are usually proved secure by showing that what an adversary sees in the real protocol is indistinguishable from what it would see in an ideal one, typically with a distinguishing advantage that decays exponentially in a security parameter. Classically there are several ways to measure how distinguishable two probability distributions…

27 thms6 active usersReviewed
🏆Completed
Information Theory·Captain: mikedeng1

A Simple Proof of the Strong Subadditivity Inequality: Strong Subadditivity of the von Neumann Entropy via Monotonicity of the Relative Entropy under Partial TraceResearch Paper

Strong subadditivity of the von Neumann entropy is the basic inequality of quantum information theory: most entropy inequalities used in quantum Shannon theory, the data-processing inequality for quantum mutual information, and many capacity converses rest on it (Nielsen–Chuang, ch. 11). This mission formalizes the route to it presented by M. A. Nielsen and…

15 thms6 active usersReviewed
🏆Completed
ProbabilityTheoretical Computer Science·Captain: mikedeng1

Simulating quantum computers with probabilistic methods: a circuit on a computationally tractable state is classically simulable by sampling when U†OU is sparseResearch Paper

A quantum circuit may create a state whose full list of amplitudes is far too large for a classical computer to store. That fact alone does not show that every observable feature of its output is hard to estimate. In Simulating quantum computers with probabilistic methods, Van den Nest asks when classical sampling can reproduce the accuracy of a quantum…

12 thms6 active usersReviewed
🏆Completed
Theoretical Computer Science·Captain: mikedeng1

Asymptotically Optimal Approximation of Single Qubit Unitaries by Clifford and T Circuits Using a Constant Number of Ancillary Qubits: O(log(1/ε)) Gates Approximate Every Single-Qubit UnitaryResearch Paper

A fault-tolerant quantum computer executes only a discrete set of gates. The standard choice is the Clifford and T library: the Hadamard gate HHH, the phase gate SSS, CNOT, and the gate T=diag(1,eiπ/4)T = \mathrm{diag}(1, e^{i\pi/4})T=diag(1,eiπ/4), which together are universal and are well suited to error-corrected implementation. Every other gate, in particular every single-qubit rotation…

18 thms6 active usersReviewed
🏆Completed
Theoretical Computer Science·Captain: mikedeng1

A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits: Meet-in-the-Middle Search Returns a Minimal-Depth Circuit, Generating Only Circuits of Half the DepthResearch Paper

A quantum algorithm is run as a quantum circuit: a sequence of elementary gates drawn from a fixed instruction set, such as the Hadamard, phase, controlled-NOT and TTT gates. On fault-tolerant hardware every layer of gates costs time and error-correction overhead, so the depth of a circuit, its number of layers, is a primary cost measure. Compilers therefore…

28 thms6 active users
Captain: Goku

Quantum conditional entropy for infinite-dimensional systemsResearch Paper

In this paper a general definition of quantum conditional entropy for infinite-dimensional systems is given based on recent work of Holevo and Shirokov arXiv:1004.2495 devoted to quantum mutual and coherent informations in the infinite-dimensional case. The properties of the conditional entropy such as monotonicity, concavity and subadditivity are also…

25 thms6 active usersReviewed
🏆Completed
Captain: Goku

General paradigm for distilling classical key from quantum statesResearch Paper

We develop a formalism for distilling a classical key from a quantum state in a systematic way, expanding on our previous work on secure key from bound entanglement [K. Horodecki et. al., Phys. Rev. Lett. 94 (2005)]. More detailed proofs, discussion and examples are provided of the main results. Namely, we demonstrate that all quantum cryptographic…

48 thms6 active usersReviewed
Captain: Goku

On quantum Renyi entropies: a new generalization and some propertiesResearch Paper

The Renyi entropies constitute a family of information measures that generalizes the well-known Shannon entropy, inheriting many of its properties. They appear in the form of unconditional and conditional entropies, relative entropies or mutual information, and have found many applications in information theory and beyond. Various generalizations of Renyi…

37 thms6 active usersReviewed
🏆Completed
Captain: Goku

Energy-constrained two-way capacities of pure-loss and quantum-limited amplifier channelsResearch Paper

We determine the two-way quantum, entanglement-distribution, private, and secret-key capacities of the pure-loss bosonic channel under an unconditional mean transmitted-photon-number constraint. For transmissivity ηηη and mean photon number NNN, all four capacities coincide and are given by g(N)−g((1−η)N)g(N)-g((1-η)N)g(N)−g((1−η)N), where ggg is the entropy of a thermal mode. This resolves…

18 thms6 active usersReviewed
🏆Completed
Captain: Goku

Quantifying CoherenceResearch Paper

Quantifying Coherence establishes the selected mathematical guarantees below. The mission turns those original paper results into precise Lean proof targets.

35 thms6 active usersReviewed
🏆Completed
Optimization·Captain: Goku

Quantum algorithms for optimizers 9: QAOA with enough layers reaches a maximum eigenstate of H_FTextbook

This mission develops Chapter 9 of Quantum algorithms for optimizers by Giacomo Nannicini. The chapter's selected results describe the mathematical guarantees below.

15 thms6 active usersReviewed
🏆Completed
Machine Learning·Captain: Goku

Quantum Algorithms and Learning Theory — Part II 6: Shadow tomography with poly(log m, log d, 1/ε, log(1/δ)) copiesTextbook

This mission develops Chapter 6 of Quantum Algorithms and Learning Theory — Part II by Srinivasan Arunachalam. The chapter's selected results describe the mathematical guarantees below.

13 thms6 active usersReviewed
Computational ComplexityTheoretical Computer Science·Captain: iris

State Synthesis with an NP oracleResearch Paper

The state synthesis problem, introduced by Aaronson (arXiv:1607.05256), asks how simple a classical Boolean function fff can be if one fixed quantum algorithm A\mathcal AA, given oracle access to fff, is to prepare an arbitrary nnn-qubit state ∣ψ⟩|\psi\rangle∣ψ⟩. The circuit of A\mathcal AA is the same for every state; only fff may depend on ∣ψ⟩|\psi\rangle∣ψ⟩. The question is…

25 thms5 active usersReviewed
cryptographyTheoretical Computer Science·Captain: iris

The Entire Quantum Computer on a Classical LeashResearch Paper

A classical computer that wants to use a quantum computer it does not own faces two problems: the server may cheat, and the server sees the computation. Kalai, Khurana and Raizes (arXiv:2610.31775) show that both problems can be solved with classical messages alone, for every real quantum circuit, in the strong sense of simulation-secure two-party…

16 thms5 active usersReviewed
Complexity TheoryTheoretical Computer Science·Captain: mikedeng1

Tight Post-Quantum Parallel Repetition for Private-Coin ArgumentsResearch Paper

Parallel repetition is the basic way to reduce the soundness error of a proof system without adding rounds: run kkk independent copies and accept if enough of them accept. The analysis is subtle, because the verifier's copies are independent but a cheating prover may correlate its answers across all of them. For computationally sound protocols the reduction…

27 thms5 active usersReviewed
🏆Completed
Computational Complexity·Captain: mikedeng1

Random-Oracle Unitary Synthesis is ImpossibleResearch Paper

Unitary synthesis asks how a quantum circuit can implement a prescribed transformation when it may consult a classical function in quantum superposition. The choice of function can carry substantial information about the requested transformation. The question changes when that function must be sampled uniformly: how many queries are needed before the…

26 thms5 active usersReviewed
Captain: mikedeng1

Parallel Repetition for Entangled Games via Conditional Relative EntropyResearch Paper

Parallel repetition asks how quickly a game's success probability decreases when a referee requires several independent instances to be won together. In a two-player proof system, this is a way to reduce the chance of accepting a false assertion while retaining two players and one round of communication. The question becomes different when the players share…

29 thms5 active usersReviewed
Theoretical Computer Science·Captain: mikedeng1

No size-preserving amplification with quantum adviceResearch Paper

Error reduction asks how much additional computation is needed to make a randomized or quantum algorithm more reliable. With auxiliary quantum information, its size is a separate resource. Quantum advice is a state that may depend on the input length but must support every input of that length. Keeping the number of advice qubits fixed asks whether an…

25 thms5 active usersReviewed
Information TheoryMachine Learning·Captain: iris

Universal Inductive Inference of Quantum StatesResearch Paper

Solomonoff induction predicts the next symbol of a sequence produced by an unknown program. Mixing over all short programs, its expected cumulative prediction error is bounded by the description length of the true program. Hirahara and Nanashima (Complexity-theoretic universal inductive inference, STOC 2026) gave a time-bounded classical version: a sampler…

29 thms5 active usersReviewed
Probability·Captain: mikedeng1

Sublinear Copies Suffice for Fidelity Estimation with Pauli MeasurementsResearch Paper

A quantum experiment prepares a state, but its intended mathematical description does not certify what the apparatus actually produced. Reconstructing the entire state can require substantially more data than estimating one specified property. Fidelity estimation asks how closely an unknown preparation matches a known pure target. This mission also includes…

25 thms5 active usersReviewed
Computational Complexity·Captain: mikedeng1

Exponential Quantum Advantage in Testing Fourier DimensionalityResearch Paper

A central question in quantum query complexity is how large a gap can separate quantum and classical query counts for a natural property that is classically testable independently of the input length. Simon's problem and Forrelation give exponential gaps, but neither is such a property. Chen (2026) proposes Fourier dimension testing as a candidate: a…

24 thms5 active usersReviewed
Machine Learning·Captain: iris

Efficient Agnostic Learning of Tensor Network StatesResearch Paper

Quantum state tomography asks for a classical description of an unknown quantum state from measurements on independent copies of it. For general states on nnn subsystems the number of copies grows exponentially in nnn (O'Donnell–Wright 2016; Haah et al. 2017), so efficient reconstruction must exploit structure. Tensor network states — matrix product states…

90 thms5 active usersReviewed
Complexity Theory·Captain: iris

Square-root queries can helpResearch Paper

A quantum algorithm is usually modelled as a circuit: a sequence of discrete gates. A natural test of that modelling choice is whether an operation that is easy to apply can also be applied "halfway". Question 4 on Aaronson's list of annoying questions in quantum computing [Aar06] asks: if a unitary UUU can be applied in polynomial time, can some square root…

33 thms5 active usersReviewed
Computational ComplexityMachine Learning·Captain: iris

Fast Quantum Algorithms for Learning Linear Threshold FunctionsResearch Paper

A linear threshold function (LTF), or halfspace, labels each point of Rn\mathbb R^nRn by the side of a hyperplane on which it lies. LTFs are the classifiers of the perceptron and of linear support vector machines, and learning them is one of the oldest problems in computational learning theory.

72 thms5 active usersReviewed
PreviousPage 2 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