Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Collections

The Quantum Formalization Drive

A coordinated effort to formalize the mathematics of quantum information and quantum computation in Lean 4.

Scope: missions in quantum information theory, quantum computation and algorithms, quantum complexity theory, quantum error correction, entanglement theory, and quantum learning.

819 open missions

Missions

201–225 of 819
Open819Completed411All1230
Quantum Information·Captain: Gohan

Port-based teleportation in arbitrary dimensionResearch Paper

Port-based teleportation (PBT), introduced in 2008, is a type of quantum teleportation protocol which transmits the state to the receiver without requiring any corrections on the receiver's side. Evaluating the performance of PBT was computationally intractable and previous attempts succeeded only with small systems. We study PBT protocols and fully…

34 thms3 active usersReviewed
Quantum Information·Captain: Gohan

Compatible quantum correlations: on extension problems for Werner and isotropic statesResearch Paper

We investigate some basic scenarios in which a given set of bipartite quantum states may consistently arise as the set of reduced states of a global N-partite quantum state. Intuitively, we say that the multipartite state "joins" the underlying correlations. Determining whether, for a given set of states and a given joining structure, a compatible N-partite…

40 thms3 active usersReviewed
Quantum Information·Captain: Gohan

Deterministic transformations between unitary operations: Exponential advantage with adaptive quantum circuits and the power of indefinite causalityResearch Paper

This work analyses the performance of quantum circuits and general processes to transform kkk uses of an arbitrary unitary operation UUU into another unitary operation f(U)f(U)f(U). When the desired function fff a homomorphism, i.e., f(UV)=f(U)f(V)f(UV)=f(U)f(V)f(UV)=f(U)f(V), it is known that optimal average fidelity is attainable by parallel circuits and indefinite causality does not provide any…

29 thms3 active usersReviewed
Quantum Information·Captain: Gohan

Multiplicativity of completely bounded p-norms implies a new additivity resultResearch Paper

We prove additivity of the minimal conditional entropy associated with a quantum channel Phi, represented by a completely positive (CP), trace-preserving map, when the infimum of S(gamma_{12}) - S(gamma_1) is restricted to states of the form gamma_{12} = (I \ot Phi)(| psi >< psi |). We show that this follows from multiplicativity of the completely bounded…

40 thms3 active usersReviewed
Quantum Information·Captain: Gohan

Second-Order Asymptotics for the Classical Capacity of Image-Additive Quantum ChannelsResearch Paper

We study non-asymptotic fundamental limits for transmitting classical information over memoryless quantum channels, i.e. we investigate the amount of classical information that can be transmitted when a quantum channel is used a finite number of times and a fixed, non-vanishing average error is permissible. We consider the classical capacity of quantum…

39 thms3 active usersReviewed
Quantum Information·Captain: Gohan

Quantum wiretap channel with non-uniform random number and its exponent and equivocation rate of leaked informationResearch Paper

A usual code for quantum wiretap channel requires an auxiliary random variable subject to the perfect uniform distribution. However, it is difficult to prepare such an auxiliary random variable. We propose a code that requires only an auxiliary random variable subject to a non-uniform distribution instead of the perfect uniform distribution. Further, we…

52 thms3 active usersReviewed
Functional AnalysisQuantum InformationQuantum Mechanics·Captain: mikedeng1

Additivity properties of a Gaussian channel: the maximal output k-norm of m uses of the classical-noise channel N_n is [(n+1)^k − n^k]^(−m/k), attained by coherent product statesResearch Paper

A quantum channel can carry classical information at a rate given by its Holevo capacity C1C_1C1​ for one use. If a sender may encode messages in states that are entangled across mmm uses, the capacity per use could in principle exceed C1C_1C1​, and the ultimate classical capacity then requires a limit m→∞m\to\inftym→∞ (Holevo; Schumacher–Westmoreland). Whether this…

12 thms3 active usersReviewed
Quantum Information·Captain: Goku

Universal recovery map for approximate Markov chainsResearch Paper

A central question in quantum information theory is to determine how well lost information can be reconstructed. Crucially, the corresponding recovery operation should perform well without knowing the information to be reconstructed. In this work, we show that the quantum conditional mutual information measures the performance of such recovery operations.…

20 thms3 active usersReviewed
Quantum Information·Captain: Goku

Compression of sources of probability distributions and density operatorsResearch Paper

We study the problem of efficient compression of a stochastic source of probability distributions. It can be viewed as a generalization of Shannon's source coding problem. It has relation to the theory of common randomness, as well as to channel coding and rate--distortion theory: in the first two subjects ``inverses'' to established coding theorems can be…

24 thms3 active usersReviewed
Quantum Information·Captain: Goku

Quantum Channel Capacity of Very Noisy ChannelsResearch Paper

We present a family of additive quantum error-correcting codes whose capacities exceeds that of quantum random coding (hashing) for very noisy channels. These codes provide non-zero capacity in a depolarizing channel for fidelity parameters fff when f>.80944f> .80944f>.80944. Random coding has non-zero capacity only for f>.81071f>.81071f>.81071; by analogy to the classical Shannon coding…

12 thms3 active usersReviewed
Quantum Information·Captain: Goku

Classical capacity of a noiseless quantum channel assisted by noisy entanglementResearch Paper

We derive the general formula for the capacity of a noiseless quantum channel assisted by an arbitrary amount of noisy entanglement. In this capacity formula, the ratio of the quantum mutual information and the von Neumann entropy of the sender's share of the noisy entanglement plays the role of mutual information in the completely classical case. A…

11 thms3 active usersReviewed
Quantum Information·Captain: Goku

Theoretical Guarantees for Permutation-Equivariant Quantum Neural NetworksResearch Paper

Despite the great promise of quantum machine learning models, there are several challenges one must overcome before unlocking their full potential. For instance, models based on quantum neural networks (QNNs) can suffer from excessive local minima and barren plateaus in their training landscapes. Recently, the nascent field of geometric quantum machine…

22 thms3 active usersReviewed
Quantum Information·Captain: Goku

Classical codes for quantum broadcast channelsResearch Paper

We present two approaches for transmitting classical information over quantum broadcast channels. The first technique is a quantum generalization of the superposition coding scheme for the classical broadcast channel. We use a quantum simultaneous nonunique decoder and obtain a proof of the rate region stated in [Yard et al., IEEE Trans. Inf. Theory 57…

12 thms3 active usersReviewed
Quantum Information·Captain: Goku

One-Shot Classical-Quantum Capacity and Hypothesis TestingResearch Paper

The one-shot classical capacity of a quantum channel quantifies the amount of classical information that can be transmitted through a single use of the channel such that the error probability is below a certain threshold. In this work, we show that this capacity is well approximated by a relative-entropy-type measure defined via hypothesis testing. Combined…

13 thms3 active usersReviewed
Quantum Information·Captain: Goku

Capacity of the Bosonic Wiretap Channel and the Entropy Photon-Number InequalityResearch Paper

Determining the ultimate classical information carrying capacity of electromagnetic waves requires quantum-mechanical analysis to properly account for the bosonic nature of these waves. Recent work has established capacity theorems for bosonic single-user and broadcast channels, under the presumption of two minimum output entropy conjectures. Despite…

17 thms3 active usersReviewed
CombinatoricsMathematical PhysicsQuantum Information+1·Captain: mikedeng1

Extendibility of Werner States: Two-Sided Extendibility of Werner States Is Decided by a Minimum over Pairs of Young DiagramsResearch Paper

A bipartite quantum state ρ\rhoρ shared by Alice and Bob is (nA,nB)(n_A,n_B)(nA​,nB​)-extendible if there is a state on nAn_AnA​ copies of Alice's system and nBn_BnB​ copies of Bob's system whose reduced state on every pair (one Alice copy, one Bob copy) is ρ\rhoρ. Extendibility (also called shareability) measures how much the correlations of ρ\rhoρ can be shared among many parties. Only…

17 thms3 active usersReviewed
Linear algebraQuantum Error CorrectionQuantum Information·Captain: mikedeng1

Towards a Unified Framework for Approximate Quantum Error Correction: The Transpose Channel Corrects a Subsystem Code up to the Operator Norm of the PerturbationResearch Paper

Quantum error correction protects quantum information from noise by storing it in a code and undoing the damage with a recovery operation. The textbook theory, the Knill–Laflamme conditions, characterizes codes that can be corrected perfectly. Real noise rarely admits perfect correction, and codes that are only approximately correctable can perform better…

14 thms3 active usersReviewed
Quantum Information·Captain: Goku

Quantum information can be negativeResearch Paper

Given an unknown quantum state distributed over two systems, we determine how much quantum communication is needed to transfer the full state to one system. This communication measures the "partial information" one system needs conditioned on it's prior information. It turns out to be given by an extremely simple formula, the conditional entropy. In the…

17 thms3 active usersReviewed
Quantum Information·Captain: Goku

Quantum states representing perfectly secure bits are always distillableResearch Paper

It is proven that recently introduced states with perfectly secure bits of cryptographic key (private states representing secure bit) [K. Horodecki et al., Phys. Rev. Lett. 94, 160502 (2005)] as well as its multipartite and higher dimension generalizations always represent distillable entanglement. The corresponding lower bounds on distillable entanglement…

19 thms3 active usersReviewed
Quantum Information·Captain: Goku

Optimal quantum source coding with quantum information at the encoder and decoderResearch Paper

Consider many instances of an arbitrary quadripartite pure state of four quantum systems ABCD. Alice holds the AC part of each state, Bob holds B, while D represents all other parties correlated with ABC. Alice is required to redistribute the C systems to Bob while asymptotically preserving the overall purity. We prove that this is possible using Q qubits…

20 thms3 active usersReviewed
Quantum Information·Captain: Goku

"Squashed Entanglement" - An Additive Entanglement MeasureResearch Paper

In this paper, we present a new entanglement monotone for bipartite quantum states. Its definition is inspired by the so-called intrinsic information of classical cryptography and is given by the halved minimum quantum conditional mutual information over all tripartite state extensions. We derive certain properties of the new measure which we call "squashed…

34 thms3 active usersReviewed
Information TheoryQuantum Information·Captain: mikedeng1

Entropy and Optimal Decompositions of States Relative to a Maximal Commutative Subalgebra: Equivalent Characterizations of a Symmetric Optimal Pair for Transposition-Invariant Rank-Two StatesResearch Paper

In finite dimensional quantum information, a state of a full matrix algebra can be restricted to a smaller algebra of observables. The resulting entropy depends on which observables are retained. For a maximal commutative subalgebra, the retained observables are equivalent to measurements in a fixed orthonormal basis. The restriction has an ordinary…

9 thms3 active usersReviewed
AlgebraQuantum InformationRepresentation Theory·Captain: mikedeng1

Structure and Properties of the Algebra of Partially Transposed Permutation Operators: A = M ⊕ S, M = ⊕ U(α) with U(α) ≅ M(rank Q(α), ℂ), and S ≅ ⊕_{h(ν)<d} M(dim ψ^ν, ℂ)Research Paper

Permutation operators encode the symmetries of many identical quantum systems. When one tensor factor is transposed, the resulting operators occur in questions about the commutant of mixed tensor representations and about partially transposed quantum states. The usual symmetric-group algebra no longer describes their multiplication: a product can acquire a…

10 thms3 active usersReviewed
CombinatoricsQuantum InformationRepresentation Theory·Captain: mikedeng1

Optimal Quantum Purity Amplification: Removing the Bottom Box of the Last Column of Each Schur-Sampled Young Diagram Gives the Optimal Choi Matrix for Purifying n Depolarized QuditsResearch Paper

Quantum devices rarely prepare the state they are asked for. A procedure meant to output a pure state ∣ψ⟩|\psi\rangle∣ψ⟩ on ddd levels often outputs a mixed state ρ\rhoρ, the result of noise during preparation. If the procedure can be run nnn times, the copies ρ⊗n\rho^{\otimes n}ρ⊗n can be processed jointly into a single output closer to ∣ψ⟩|\psi\rangle∣ψ⟩. This task is quantum…

15 thms3 active usersReviewed
OptimizationQuantum InformationTheoretical Computer Science·Captain: mikedeng1

An Improved Approximation Algorithm for Quantum Max-Cut on Triangle-Free Graphs: Rounding Level-2 Lasserre to a Commuting Entangling Circuit Achieves Expected Energy at Least 0.582·‖H‖Research Paper

Quantum Max-Cut (QMC) asks for the maximum energy of a sum of two-qubit terms that project each edge of a weighted graph onto the singlet state. Its maximum-energy state is the ground state of the antiferromagnetic Heisenberg model, a standard model of magnetism, and computing that energy is QMA-hard (Piddock–Montanaro 2017, Cubitt–Montanaro 2016). QMC has…

17 thms3 active usersReviewed
PreviousPage 9 of 33Next

Top contributors

RankContributorAccepted solutionsSubmitted problems
1FIfizzyinc3287672
2SHshivm41212
3MAMazecto256251
4MRMrnaiq15939
5KMkmehltretter821516
6NINickrobbins9514852
7MAmarwahaha145198
8ECEthan Cheung Wang1370
9ALAlien608790
10MRmrfancypants760

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