Catalog
All records
105 records covering 104 distinct questions. Filter counts refer to records.
-
Polynomial-time quantum algorithm for approximate Shortest Vector Problem
Does the polynomial-factor approximate Shortest Vector Problem admit a polynomial-time quantum algorithm?
Unsolved -
Additivity of the relative entropy of entanglement
Does the relative entropy of entanglement of every bipartite state equal its regularization, or is regularization genuinely necessary?
Solved -
Additivity of the entanglement of purification
Is the entanglement of purification additive on tensor products?
Unsolved -
Smallest output dimension violating minimum output entropy additivity
What is the smallest output dimension in which the minimum output von Neumann entropy of quantum channels fails to be additive?
Unsolved -
QMA(2) versus QMA
Is every promise problem verifiable by a quantum Merlin-Arthur protocol with two unentangled witnesses also verifiable by a protocol with a single arbitrary witness, that is, is \(\mathsf{QMA}(2) = \mathsf{QMA}\) in the standard, unrelativized setting?
Unsolved -
Asymptotic growth of the stabilizer rank of T-state tensor powers
Does the exact stabilizer rank of the tensor powers of the single-qubit magic state \(|T\rangle\) grow polynomially in the number of copies, or is it not polynomially bounded?
Unsolved -
Squashed entanglement of the qubit depolarizing channel
What is the squashed entanglement \(E_{\mathrm{sq}}(\Lambda_p)\) of the qubit depolarizing channel, defined for a mixing parameter \(p\in[0,1]\) by
Unsolved -
Private capacity of the qubit depolarizing channel
What is the private classical capacity \(P(\Lambda_p)\) of the qubit depolarizing channel, defined for a mixing parameter \(p\in[0,1]\) by
Unsolved -
Polynomial-time quantum algorithm for Learning With Errors
Does the Learning With Errors problem in its standard worst-case-hard parameter regime admit a polynomial-time quantum algorithm?
Unsolved -
Parity is not in QAC0
Can polynomial-size constant-depth \(\mathsf{QAC}^0\) circuits compute the parity function, or equivalently, is \(\mathrm{PARITY}\notin\mathsf{QAC}^0\)?
Unsolved -
Polynomial-time quantum algorithm for the Dihedral Hidden Subgroup Problem
Does the Dihedral Hidden Subgroup Problem admit a quantum algorithm whose running time is polynomial in the input length?
Unsolved -
Closed-form nonadditivity of the Holevo capacity and entanglement of formation
Construct a simple closed-form or practically computable counterexample to additivity of the Holevo capacity or the entanglement of formation, together with a rigorous certificate of a strict violation.
Unsolved -
The PPT-squared conjecture
Must the composition of any two compatible PPT completely positive maps be entanglement breaking?
Unsolved -
Is bipartite Quantum Max-Cut in BPP?
Is the following bipartite Quantum Max-Cut promise problem in \(\mathrm{BPP}\)?
Unsolved -
Average-case approximation hardness of random Ising partition functions
Is it \(\#\mathrm{P}\)-hard to approximate \(|Z_R|^2\) to relative multiplicative error \(a+o(1)\) on a \(b\) fraction of random Ising instances?
Unsolved -
Average-case approximation hardness of squared normalized gaps of random cubic polynomials
Is it \(\#\mathrm{P}\)-hard to approximate \(\operatorname{ngap}(f)^2\) to relative multiplicative error \(a+o(1)\) on a \(b\) fraction of uniformly random degree-3 polynomials over \(\mathbb{F}_2\)?
Unsolved -
Average-case approximation hardness of random-circuit output probabilities
Does there exist a fixed family of \(n\)-qubit circuit layouts with \(m=\operatorname{poly}(n)\) one- and two-qubit gates for which the following task is \(\#\mathrm{P}\)-hard?
Unsolved -
Permanent-of-Gaussians Conjecture
Is the following estimation task \(\#\mathrm{P}\)-hard under randomized polynomial-time Turing reductions?
Unsolved -
Quantum query complexity of Triangle Finding
What is the bounded-error quantum query complexity of finding a triangle in an \(n\)-vertex graph given oracle access to its adjacency matrix?
Unsolved -
Polynomial-time quantum algorithm for Graph Isomorphism
Does the Graph Isomorphism problem admit a polynomial-time quantum algorithm?
Unsolved -
Strict inclusion of degradable channels in the less-noisy class
Do there exist finite-dimensional quantum channels that are less noisy in Watanabe’s regularized sense but are not degradable?
Equivalent question: Regularized less-noisy channels beyond degradability. Counted once in question totals.
Solved -
Regularized less-noisy channels beyond degradability
Does there exist a finite-dimensional regularized less-noisy quantum channel that is not degradable?
Equivalent question: Strict inclusion of degradable channels in the less-noisy class. Counted once in question totals.
Solved -
Multi-slot overhead of virtual channel conjugation
What is the optimal quasiprobability overhead of implementing the complex conjugate of an unknown quantum channel from \(n\) queries?
Unsolved -
Bidirectional classical-communication cost of bipartite channel simulation
What is the asymptotic classical-communication cost of simulating a bipartite quantum channel with bidirectional classical communication and non-signalling assistance?
Unsolved -
Closed-form exact PPT distillable entanglement
What computable expression, if any, equals the regularized exact PPT distillable entanglement of a bipartite state?
Unsolved -
Universal purification with classically simulable operations
Can classically simulable operations purify an unknown depolarized pure state from any number of copies?
Unsolved -
Advantage of fully general superchannel-discrimination strategies
Can a fully general adaptive strategy attain a larger Stein exponent than every nested-adaptive strategy for discriminating two quantum superchannels?
Unsolved -
Amortization collapse for superchannel divergences
Does amortization collapse for the max-relative entropy and geometric Rényi divergence of arbitrary finite-dimensional quantum superchannels?
Unsolved -
Uniformly efficient HSW pretty-good decoding
Can Holevo–Schumacher–Westmoreland codebooks operating at every rate below their ensemble Holevo information be chosen so that their square-root, or pretty-good, measurements have uniform quantum implementations whose cost is polynomial in the blocklength and…
Unsolved -
Multimode constrained output entropy of a pure-loss channel
Is Guha’s multimode Strong Conjecture 2 true for every correlated input state?
Unsolved -
Universal finite truncation of quantum and private capacities
Do there exist channel-independent finite integers \(m_Q\) and \(m_P\) that determine, respectively, the quantum capacity and the private classical capacity of every finite-dimensional quantum channel?
Solved -
Computability of ordinary quantum capacity
Is the ordinary unassisted quantum capacity a computable function of a finite description of a finite-dimensional quantum channel?
Unsolved -
Ordinary-Petz recovery bound for conditional mutual information
Does the ordinary, unrotated Petz map universally recover a tripartite state with fidelity controlled by its conditional mutual information?
Unsolved -
Candidate pure-loss second-order converse
Does the pure-loss bosonic channel admit the following candidate second-order classical converse under a maximum-photon-number occupation constraint?
Unsolved -
Parallel versus nested-adaptive superchannel discrimination
Can nested-adaptive strategies improve the Stein exponent for discriminating two finite-dimensional quantum superchannels?
Unsolved -
Exactly solvable nondegradable quantum channels
Does there exist a finite-dimensional quantum channel that is neither degradable nor antidegradable and whose unassisted quantum capacity is known exactly?
Solved -
Structural criterion for classical–entanglement trade-off advantage
Characterize the finite-dimensional quantum channels for which joint classical–entanglement coding strictly outperforms time sharing between unassisted and unlimited-entanglement classical communication.
Unsolved -
Strong converse for general mixed-state quantum compression
Does general finite-dimensional i.i.d.
Unsolved -
Ordinary-Petz fidelity remainder for relative-entropy data processing
Does the ordinary Petz recovery map give a universal fidelity remainder for monotonicity of quantum relative entropy?
Solved -
All-code exponential strong converse for degradable channels
Does every finite-dimensional degradable quantum channel satisfy an all-code exponential strong converse for quantum communication at its quantum capacity?
Solved -
Diamond-smoothed max-relative-entropy AEP for quantum channels
Does the max-relative entropy of finite-dimensional quantum channels satisfy an asymptotic equipartition property under uniform diamond-norm smoothing?
Unsolved -
Quantum capacity of the Gaussian random-displacement channel
What is the unconstrained, unassisted quantum capacity of the single-mode Gaussian random-displacement channel?
Unsolved -
Convergence of the JRF iteration for mixed-state discrimination
Does the Ježek–Řeháček–Fiurášek (JRF) iteration, initialized by the uniform POVM, converge to a globally optimal minimum-error measurement for every finite ensemble containing mixed quantum states?
Unsolved -
Minimum LU–LC counterexample for graph states
What is the least number of qubits for which two graph states can be locally unitary equivalent without being locally Clifford equivalent?
Solved -
Asymptotic metrology with quantum-controlled causal order
Does quantum control of causal order yield a persistent asymptotic metrological advantage over parallel access for some smooth finite-dimensional channel family?
Unsolved -
Equal-weight low-Choi-rank decompositions of quantum channels
Can every finite-dimensional quantum channel be written as the uniform mixture of \(d_B\) channels whose Choi ranks are at most the input dimension?
Unsolved -
Nontrivial mutually degradable channel pairs
Does there exist an integer \(d\geq2\) and a pair of distinct channels \(\mathcal M,\mathcal N:\mathcal L(A)\to\mathcal L(B)\), with \(A\simeq B\simeq\mathbb C^d\), that both have Choi rank exactly \(d\), are mutually degradable, and are each nondegradable?
Unsolved -
Umegaki relative entropy of local recovery
Does the conditional mutual information of every finite-dimensional tripartite state dominate its Umegaki relative entropy of local recovery?
Solved -
Entanglement of formation of generalized Bell-diagonal states
For every local dimension \(d\geq3\), determine the entanglement of formation of an arbitrary Weyl–Bell-diagonal state.
Unsolved -
Multiplicativity for polarized Werner–Holevo channels
For every integer \(d\geq3\), every \(x\in(0,1)\), and every \(1<p<2\), is the maximal output Schatten \(p\)-norm of the polarized Werner–Holevo channel multiplicative on two identical copies?
Unsolved -
The quantum PCP conjecture
Is the constant-relative-gap local Hamiltonian problem QMA-hard?
Unsolved -
Delayed-onset additivity violation for minimum output Rényi entropy
Does there exist a finite-dimensional quantum channel whose minimum output Rényi entropy is additive for every tensor power below some order and first becomes strictly subadditive at that order?
Unsolved -
Exponential strong converse for transpose-degradable channels
Does every finite-dimensional transpose-degradable channel satisfy an exponential strong converse for quantum communication at its single-letter quantum capacity?
Unsolved -
Transpose degradability beyond degradability
Does there exist a finite-dimensional transpose-degradable quantum channel that is not degradable?
Unsolved -
Minimal dimensions for strict transpose degradability
What are the componentwise-minimal dimension triples \((d_A,d_B,d_E)\) that admit a transpose-degradable but nondegradable channel?
Unsolved -
Fixed-error parallel Stein lemma for quantum channels
Let \(\mathcal N,\mathcal M:\mathcal L(A)\to\mathcal L(B)\) be quantum channels on finite-dimensional systems.
Unsolved -
Finite nontrivial LU moduli of AME states
Do there exist integers \(N,d\geq 2\) for which the absolutely maximally entangled states of \(N\) qudits of local dimension \(d\) form finitely many, but more than one, local-unitary equivalence classes?
Unsolved -
Generalized Stein lemma for fully quantum channel resources
Let \(\mathcal N:\mathcal L(A)\to\mathcal L(B)\) be a finite-dimensional quantum channel.
Unsolved -
POVM steering threshold of higher-dimensional Werner states
What is the exact steering threshold for arbitrary POVMs on a higher-dimensional Werner state?
Unsolved -
Secret key from every Bell-nonlocal behavior
Does every finite-alphabet Bell-nonlocal behavior have a strictly positive asymptotic secret-key rate against arbitrary individual nonsignalling attacks?
Unsolved -
Positivity threshold for thermal-attenuator quantum capacity
For \(0<\eta<1\) and \(0<\nu<\infty\), let the single-mode bosonic thermal attenuator be
Unsolved -
SIC-POVM existence in every dimension
Does a symmetric informationally complete positive-operator-valued measure exist in every finite dimension \(d\ge2\)?
Unsolved -
Unconditional classical verification with one quantum prover
Does every language \(L\in\mathsf{BQP}\) admit a single-prover interactive proof with a fully classical verifier, an efficient quantum honest prover, and information-theoretic soundness?
Unsolved -
Finite-alphabet nonsignalling simulation of entangled qubits
For every partially entangled two-qubit pure state, does some fixed finite-alphabet nonsignalling resource give an exact noncommunicating simulation of all local projective measurements?
Unsolved -
Unclassified existence parameters for homogeneous AME states
For which of the parameter pairs specified below does an absolutely maximally entangled state exist?
Unsolved -
Quantum capacity of a qubit Pauli channel
What is the quantum capacity \(\mathcal{Q}(\Lambda_{\mathbf p})\) of the qubit Pauli channel defined by
Unsolved -
Universal simulation with two PR boxes
Can shared randomness and at most two Popescu–Rohrlich boxes exactly simulate every pair of local projective measurements on every two-qubit state, without communication?
Unsolved -
Quantum LDPC codes at the Pauli hashing bound
For a probability vector \(\mathbf p=(p_I,p_X,p_Y,p_Z)\), the qubit Pauli channel is
Unsolved -
Gaussian entanglement of formation beyond bisymmetry
Does Gaussian entanglement of formation equal unrestricted entanglement of formation for every non-bisymmetric multimode Gaussian state?
Unsolved -
Achievability of the Rains bound under PPT-preserving channels
Consider distilling the bipartite Bell-diagonal state
Unsolved -
Resources for implementing Gibbs-preserving channels
What are the exact one-shot coherence and work costs of implementing an arbitrary Gibbs-preserving channel by thermal operations?
Unsolved -
Collective cost of tensor-power state preparation
Determine the asymptotic weighted circuit cost of preparing tensor powers of a known pure state, and characterize when collective preparation is cheaper per copy than independent preparation.
Unsolved -
One-bit simulation of partially entangled qubits
Can shared randomness and one classical bit exactly simulate every pair of local projective measurements on every pure entangled two-qubit state?
Unsolved -
Long-range vacuum CHSH violation
Does the vacuum of a massive free scalar Bose field violate the CHSH inequality between bounded localization regions at arbitrarily large spacelike separation?
Unsolved -
Weyl–Heisenberg-covariant SICs in every dimension
Does every finite dimension admit a symmetric informationally complete measurement that is a single Weyl–Heisenberg orbit?
Unsolved -
Trace-exponential lower bound for matrix-word averages
Is the normalized trace average of all words in two positive-definite matrices always bounded below by the corresponding trace exponential?
Unsolved -
NPT bound entanglement and the rank-five frontier
Does there exist a finite-dimensional bipartite state with non-positive partial transpose (NPT) that is undistillable by local operations and classical communication (LOCC)?
Unsolved -
Minimal-support frontier for absolutely maximally entangled states
Determine, for every integer \(d\geq 2\), the largest number \(\mathcal N(d)\) of \(d\)-level parties that admit an absolutely maximally entangled state of minimal computational-basis support.
Unsolved -
Entanglement cost of an amplitude-damping-channel Choi state
What is the entanglement cost of the Choi state of the qubit amplitude-damping channel
Unsolved -
Lockability of two-way distillable entanglement
Can discarding one local qubit reduce two-way distillable entanglement by an arbitrarily large amount?
Unsolved -
Quantum capacity of a bosonic thermal attenuator
Let \(\Phi_{\eta,\nu}\) be the single-mode bosonic thermal attenuator with transmissivity \(0<\eta<1\) and environmental mean photon number \(0<\nu<\infty\), defined by
Unsolved -
Polynomial shared-resource lower bounds for routing
Does an explicit total Boolean family require polynomial shared-state cost for bounded-error one-round \(f\)-routing?
Unsolved -
Statistical strength of CGLMP measurements
For every \(d\geq3\), do the standard CGLMP Fourier–phase measurements maximize the relative-entropy statistical strength against local realism among all projective \(d\)-outcome measurements on the fixed state \(\lvert\Phi_d\rangle=d^{-1/2}\sum_{j=0}^{d-1}\lvert j,j\rangle\), when the setting distribution is also optimized?
Unsolved -
Extensible causality and process purification
Is every finite-dimensional extensibly causal process matrix purifiable?
Unsolved -
Entanglement cost of a qubit Bell-diagonal state
What is the entanglement cost of a qubit Bell-diagonal state for an arbitrary probability vector \(\mathbf p=(p_I,p_X,p_Y,p_Z)\)?
Unsolved -
Absolute separability from spectra
Characterize the spectra of bipartite states that remain separable under every global unitary, and decide whether absolute separability equals absolute positivity under partial transpose in higher local dimensions.
Unsolved -
Existence of an eight-ququart perfect tensor
Does an absolutely maximally entangled state of eight ququarts exist?
Unsolved -
Tough error models
Determine \(c(e,n)\) and construct tough error models in the sense of [KW05].
Unsolved -
Semialgebraicity of closed quantum correlations
Is the closure of the finite-dimensional tensor-product correlation set semialgebraic in every fixed bipartite Bell scenario?
Unsolved -
Energy-constrained quantum capacity of a thermal attenuator
For \(0<\eta<1\) and \(0<\nu<\infty\), let the single-mode bosonic thermal attenuator be
Unsolved -
Distillable entanglement of Bell-diagonal states
What is the distillable entanglement \(D(\rho_{\mathbf p})\) under local operations and classical communication (LOCC) for the Bell-diagonal state
Unsolved -
Secret key from every entangled state
Does every finite-dimensional entangled bipartite state have positive asymptotic distillable secret key?
Unsolved -
Maximum number of mutually unbiased bases
For each integer \(d\geq2\), determine the maximum number \(\mu(d)\) of pairwise mutually unbiased orthonormal bases of \(\mathbb C^d\).
Unsolved -
Optimal CGLMP measurements for a maximally entangled state
For every \(d\geq3\), do the standard Fourier–phase measurements optimize the CGLMP violation of the maximally entangled state among all projective \(d\)-outcome measurements?
Unsolved -
Quantum violations of bipartite Bell facets
Must every nontrivial facet Bell inequality in a finite bipartite scenario have a quantum violation?
Unsolved -
Relative entropy of entanglement for two qubits
Find a closed formula for the relative entropy of entanglement of every two-qubit density operator \(\rho\), including an explicit closest separable state.
Unsolved -
Two-way quantum capacity: amplitude-damping channel
What is the two-way quantum capacity \(\mathcal{Q}_2(\mathcal A_p)\) of the qubit amplitude-damping channel
Unsolved -
Three-dimensional self-correcting quantum memory
Does there exist a passive self-correcting quantum memory in three spatial dimensions?
Unsolved -
Square-root remainder in generalized quantum equipartition
Let \(H\) be a \(d\)-dimensional Hilbert space.
Unsolved -
Complete facet descriptions for Bell polytopes
Determine complete facet descriptions for local-behavior polytopes beyond the presently solved Bell scenarios, either for a specified unresolved finite scenario or for a nontrivial infinite family with additional structure.
Unsolved -
Constant trace-distance separability testing
What is the computational complexity of testing bipartite separability with a constant trace-distance promise gap?
Unsolved -
Honest-party lockability of distillable key
Can loss of one qubit held by an honest party reduce the two-way distillable secret key by an arbitrarily large amount?
Unsolved -
Real four-quhex absolutely maximally entangled state
Does there exist an \(\operatorname{AME}(4,6)\) state whose coefficients are real in a product basis?
Unsolved -
Capacity-achieving codes for amplitude damping
What is the constructive quantum code for achieving the quantum capacity \(\mathcal{Q}(\mathcal A_p)\) of the qubit amplitude-damping channel
Solved -
Zauner-symmetric Weyl–Heisenberg SIC fiducials
Does every finite dimension admit a Weyl–Heisenberg SIC fiducial that is an eigenvector of a Zauner Clifford unitary?
Unsolved
No problems match these filters.