{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreidccmqtxpjlqflfsrunhfxdjlmvu7dtcs5hachmp3vf67zoh2rtxu",
    "uri": "at://did:plc:3fychdutjjusoqeq24ljch6q/app.bsky.feed.post/3mjw3wali4yx2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2604.15540v1",
  "publishedAt": "2026-04-20T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Álvaro Yángüez",
    "Noam Avidan",
    "Jan Kochanowski",
    "Thomas A. Hahn"
  ],
  "textContent": "**Authors:** Álvaro Yángüez, Noam Avidan, Jan Kochanowski, Thomas A. Hahn\n\nQuantum 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.",
  "title": "Accessible Quantum Correlations Under Complexity Constraints"
}