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

Entanglement-Assisted Classical Capacity of Noisy Quantum ChannelsResearch Paper

Prior entanglement between sender and receiver, which exactly doubles the classical capacity of a noiseless quantum channel, can increase the classical capacity of some noisy quantum channels by an arbitrarily large constant factor depending on the channel, relative to the best known classical capacity achievable without entanglement. The enhancement factor…

30 thms3 active usersReviewed
Captain: Goku

The operational meaning of quantum conditional informationResearch Paper

How correlated are two quantum systems from the perspective of a third? We answer this by providing an optimal quantum state redistribution protocol for multipartite product sources. Specifically, given an arbitrary quantum state of three systems, where Alice holds two and Bob holds one, we identify the cost, in terms of quantum communication and…

14 thms3 active usersReviewed
Captain: Goku

The capacity of the quantum depolarizing channelResearch Paper

The information carrying capacity of the d-dimensional depolarizing channel is computed. It is shown that this capacity can be achieved by encoding messages as products of pure states belonging to an orthonormal basis of the state space, and using measurements which are products of projections onto this same orthonormal basis. In other words, neither…

29 thms3 active usersReviewed
Captain: Goku

Capacities of Quantum Erasure ChannelsResearch Paper

The quantum analog of the classical erasure channel provides a simple example of a channel whose asymptotic capacity for faithful transmission of intact quantum states, with and without the assistance of a two-way classical side channel, can be computed exactly. We derive the quantum and classical capacities for the quantum erasure channel and related…

18 thms3 active usersReviewed
Captain: Goku

An additive and operational entanglement measure: conditional entanglement of mutual informationResearch Paper

Based on the monogamy of entanglement, we develop the technique of quantum conditioning to build an {\it additive} entanglement measure: the conditional entanglement of mutual information. Its {\it operational} meaning is elaborated to be the minimal net "flow of qubits" in the process of partial state merging. The result and conclusion can also be…

20 thms3 active usersReviewed
ProbabilityRandom Matrix Theory·Captain: mikedeng1

Asymptotics of random density matrices: The Rescaled Empirical Spectral Measure of an Induced Random Density Matrix Converges Almost Surely to the Marchenko–Pastur LawResearch Paper

In quantum mechanics, a system that interacts with an environment is described by a density matrix: a positive semidefinite complex matrix of trace one. When nothing is known about the joint state of the system and its environment, a natural model is to take that joint state to be a uniformly random pure state and to trace out the environment. The resulting…

12 thms3 active usersReviewed
OptimizationTheoretical Computer Science·Captain: mikedeng1

Optimizing Quantum Circuit Parameters via SDP: Algorithm 1 Is a 0.562-Approximation for Quantum Max CutResearch Paper

Quantum Max Cut asks for the highest energy of a two-qubit interaction Hamiltonian placed on the edges of a weighted graph. It is a quantum analogue of Max Cut: a classical cut assigns one of two labels to each vertex, while a quantum state can use correlations and entanglement across the qubits. Lee studies an approximation algorithm that first solves a…

13 thms3 active usersReviewed
Number TheoryTheoretical Computer Science·Captain: mikedeng1

Asymptotically Optimal Topological Quantum Compiling: Every Output of the Fibonacci-Anyon Approximation Algorithm Is an ⟨F,T⟩-Circuit of Length O(log(1/ε)) Within Distance ε of Rz(φ)Research Paper

Topological quantum computing represents a gate operation by moving anyons around one another. A compiler must turn a requested single-qubit unitary into a finite braid or gate word, with enough accuracy and a length that grows slowly as the error tolerance shrinks. For Fibonacci anyons, the matrices generated by the standard elementary braids have…

8 thms3 active usersReviewed
Mathematical PhysicsRepresentation Theory·Captain: mikedeng1

SU(2)-Irreducibly Covariant and EPOSIC Channels: EPOSIC Channels Are Exactly the Extreme Points of the Convex Set of SU(2)-Irreducibly Covariant ChannelsResearch Paper

A quantum channel is a completely positive, trace-preserving linear map between matrix algebras; it models the most general physical transformation of a quantum system. When a group GGG acts on the input and output systems, a channel is GGG-covariant if it commutes with the group action. Covariant channels appear whenever a physical process respects a symmetry:…

17 thms3 active usersReviewed
Linear algebraRepresentation Theory·Captain: mikedeng1

Commutant Structure of U⊗(n−1) ⊗ U* Transformations: The Operator Basis v^{ab}_{ij}(α) Is a Linear Combination of Partially Transposed Permutation Operators, and ConverselyResearch Paper

Operators on nnn copies of Cd\mathbb C^dCd that commute with every U⊗nU^{\otimes n}U⊗n, UUU unitary, are exactly the linear combinations of permutation operators V(σ)V(\sigma)V(σ), σ∈S(n)\sigma\in S(n)σ∈S(n) (Schur–Weyl duality). Many protocols in quantum information carry a different symmetry: the first n−1n-1n−1 systems transform by UUU and the last by the complex conjugate Uˉ\bar UUˉ. It is the…

11 thms3 active usersReviewed
Linear algebra·Captain: mikedeng1

On a Family of a Linear Maps from Mₙ(ℂ) to Mₙ²(ℂ): Φ[α, β] on M₃(ℂ) Is 2-Positive and Not Completely Positive Exactly When β ≤ −0.2 and α Lies in an Explicit IntervalResearch Paper

Positive linear maps on complex matrix algebras provide tests for quantum entanglement: applying such a map to one part of a bipartite state can expose a state that cannot be written as a mixture of product states. The distinction between ordinary positivity, positivity with an auxiliary matrix system, and complete positivity is therefore substantive.…

12 thms3 active usersReviewed
Captain: Goku

Norm-attaining tensors and nuclear operatorsResearch Paper

Given two Banach spaces XXX and YYY, we introduce and study a concept of norm-attainment in the space of nuclear operators N(X,Y)\mathcal{N}(X,Y)N(X,Y) and in the projective tensor product space X⊗^πYX \widehat{\otimes}_\pi YX⊗​π​Y. We exhibit positive and negative examples where both previous norm-attainment hold. We also study the problem of whether the class of elements which…

46 thms3 active usersReviewed
Captain: Goku

Structure of states which satisfy strong subadditivity of quantum entropy with equalityResearch Paper

We give an explicit characterisation of the quantum states which saturate the strong subadditivity inequality for the von Neumann entropy. By combining a result of Petz characterising the equality case for the monotonicity of relative entropy with a recent theorem by Koashi and Imoto, we show that such states will have the form of a so-called short quantum…

25 thms3 active usersReviewed
Captain: Goku

A numerical algorithm for the explicit calculation of SU(N) and SL(N,C) Clebsch-Gordan coefficientsResearch Paper

We present an algorithm for the explicit numerical calculation of SU(N) and SL(N,C) Clebsch-Gordan coefficients, based on the Gelfand-Tsetlin pattern calculus. Our algorithm is well-suited for numerical implementation; we include a computer code in an appendix. Our exposition presumes only familiarity with the representation theory of SU(2).

8 thms3 active usersReviewed
Captain: Goku

Synthesis of unitaries with Clifford+T circuitsResearch Paper

We describe a new method for approximating an arbitrary nnn qubit unitary with precision ε\varepsilonε using a Clifford and T circuit with O(4nn(log⁡(1/ε)+n))O(4^{n}n(\log(1/\varepsilon)+n))O(4nn(log(1/ε)+n)) gates. The method is based on rounding off a unitary to a unitary over the ring Z[i,1/2]\mathbb{Z}[i,1/\sqrt{2}]Z[i,1/2​] and employing exact synthesis. We also show that any nnn qubit unitary over the ring …

9 thms3 active usersReviewed
Captain: Goku

Quantum conditional mutual information and approximate Markov chainsResearch Paper

A state on a tripartite quantum system A⊗B⊗CA \otimes B \otimes CA⊗B⊗C forms a Markov chain if it can be reconstructed from its marginal on A⊗BA \otimes BA⊗B by a quantum operation from BBB to B⊗CB \otimes CB⊗C. We show that the quantum conditional mutual information I(A:C∣B)I(A: C | B)I(A:C∣B) of an arbitrary state is an upper bound on its distance to the closest reconstructed state. It thus…

52 thms3 active usersReviewed
Captain: Goku

Entanglement-Assisted Capacity of Quantum Multiple-Access ChannelsResearch Paper

We find a regularized formula for the entanglement-assisted (EA) capacity region for quantum multiple access channels (QMAC). We illustrate the capacity region calculation with the example of the collective phase-flip channel which admits a single-letter characterization. On the way, we provide a first-principles proof of the EA coding theorem based on a…

18 thms3 active usersReviewed
Captain: Goku

On entanglement-assisted classical capacityResearch Paper

This paper is essentially a lecture from the author's course on quantum information theory, which is devoted to the result of C. H. Bennett, P. W. Shor, J. A. Smolin and A. V. Thapliyal (quant-ph/0106052) concerning entanglement-assisted classical capacity of a quantum channel. A modified proof of this result is given and relation between…

26 thms3 active usersReviewed
Captain: Goku

Trace-Class and Nuclear OperatorsResearch Paper

This paper explores the long journey from projective tensor products of a pair of Banach spaces, passing through the definition of nuclear operators still on the realm of projective tensor products, to the of notion of trace-class operators on a Hilbert space, and shows how and why these concepts (nuclear and trace-class operators, that is) agree in the end.

18 thms3 active usersReviewed
Captain: Goku

Public and private resource trade-offs for a quantum channelResearch Paper

Collins and Popescu realized a powerful analogy between several resources in classical and quantum information theory. The Collins-Popescu analogy states that public classical communication, private classical communication, and secret key interact with one another somewhat similarly to the way that classical communication, quantum communication, and…

39 thms3 active usersReviewed
Captain: Goku

The Capacity of the Quantum Multiple Access ChannelResearch Paper

We define classical-quantum multiway channels for transmission of classical information, after recent work by Allahverdyan and Saakian. Bounds on the capacity region are derived in a uniform way, which are analogous to the classically known ones, simply replacing Shannon entropy with von Neumann entropy. For the single receiver case (multiple access…

16 thms3 active usersReviewed
Captain: Goku

Entanglement-assisted capacity of a quantum channel and the reverse Shannon theoremResearch Paper

The entanglement-assisted classical capacity of a noisy quantum channel is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have access to the resource of shared quantum entanglement, which may be used up by the communication protocol. We show that…

21 thms3 active usersReviewed
Captain: Goku

The asymptotic entanglement cost of preparing a quantum stateResearch Paper

We give a detailed proof of the conjecture that the asymptotic entanglement cost of preparing a bipartite state \rho is equal to the regularized entanglement of formation of \rho.

20 thms3 active usersReviewed
Captain: Goku

A father protocol for quantum broadcast channelsResearch Paper

A new protocol for quantum broadcast channels based on the fully quantum Slepian-Wolf protocol is presented. The protocol yields an achievable rate region for entanglement-assisted transmission of quantum information through a quantum broadcast channel that can be considered the quantum analogue of Marton's region for classical broadcast channels. The…

20 thms3 active usersReviewed
Captain: Goku

Distilling common randomness from bipartite quantum statesResearch Paper

The problem of converting noisy quantum correlations between two parties into noiseless classical ones using a limited amount of one-way classical communication is addressed. A single-letter formula for the optimal trade-off between the extracted common randomness and classical communication rate is obtained for the special case of classical-quantum…

31 thms3 active usersReviewed
PreviousPage 15 of 41Next

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