Maximally $ψ-$epistemic models cannot explain gambling with two qubits
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918140014755840 |
|---|---|
| author | Ray, Sagnik Chaturvedi, Anubhav Saha, Debashis |
| author_facet | Ray, Sagnik Chaturvedi, Anubhav Saha, Debashis |
| contents | We investigate the minimal proof for ruling out maximally $ψ-$epistemic interpretations of quantum theory, in which the indistinguishable nature of two quantum states is fully explained by the epistemic overlap of their corresponding distributions over ontic states. To this end, we extend the standard notion of epistemic overlap by considering a penalized distinguishability game involving two states and three possible answers, named as Quantum Gambling. In this context, using only two pure states and their equal mixture, we present an experimentally robust no-go theorem for maximally $ψ-$epistemic models, showing that qubit states achieve the maximal difference between quantum and epistemic overlaps. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_10437 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Maximally $ψ-$epistemic models cannot explain gambling with two qubits Ray, Sagnik Chaturvedi, Anubhav Saha, Debashis Quantum Physics We investigate the minimal proof for ruling out maximally $ψ-$epistemic interpretations of quantum theory, in which the indistinguishable nature of two quantum states is fully explained by the epistemic overlap of their corresponding distributions over ontic states. To this end, we extend the standard notion of epistemic overlap by considering a penalized distinguishability game involving two states and three possible answers, named as Quantum Gambling. In this context, using only two pure states and their equal mixture, we present an experimentally robust no-go theorem for maximally $ψ-$epistemic models, showing that qubit states achieve the maximal difference between quantum and epistemic overlaps. |
| title | Maximally $ψ-$epistemic models cannot explain gambling with two qubits |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2509.10437 |