Accessible Quantum Correlations Under Complexity Constraints

arXiv:2604.1554016.5h-index: 3
Predicted impact top 76% in QUANT-PH · last 90 daysOriginality Highly original
AI Analysis

For quantum information theorists, this work formalizes how computational boundedness restricts the detection of quantum correlations, with potential implications for cryptography and quantum complexity.

The paper introduces a framework for quantum correlations under computational constraints, defining complexity-constrained min-entropy that recovers operational meanings like guessing probability for bounded observers. It shows exponential separations between information-theoretic and computational min-entropy for pure and mixed states, demonstrating that computational limits can drastically reduce observable quantum correlations.

Quantum systems may contain underlying correlations which are inaccessible to computationally bounded observers. We capture this distinction through a framework that analyses bipartite states only using efficiently implementable quantum channels. This leads to a complexity-constrained max-divergence and a corresponding computational min-entropy. The latter quantity recovers the standard operational meaning of the conditional min-entropy: in the fully quantum case, it quantifies the largest overlap with a maximally entangled state attainable via efficient operations on the conditional subsystem. For classical-quantum states, it further reduces to the optimal guessing probability of a computationally bounded observer with access to side information. Lastly, in the absence of side information, the computational min-entropy simplifies to a computational notion of the operator norm. We then establish strong separations between the information-theoretic and complexity-constrained notions of min-entropy. For pure states, there exist highly entangled families of states with extremal min-entropy whose efficiently accessible entanglement in terms of computational min-entropy is exponentially suppressed. For mixed states, the separation is even sharper: the information-theoretic conditional min-entropy can be highly negative while the complexity-constrained quantity remains nearly maximal. Overall, our results demonstrate that computational constraints can fundamentally limit the quantum correlations that are observable in practice.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes