Quantum information advantage based on Bell inequalities
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908873085943808 |
|---|---|
| author | Jain, Rahul Kundu, Srijita |
| author_facet | Jain, Rahul Kundu, Srijita |
| contents | Recently, Kretschmer et al. [KGD+25] presented an experimental demonstration of a proposed quantum information advantage protocol.
We present an alternate proposal based on a relation derived from parallel-repeated CHSH games. Our memory measure is based on an information measure and is different from [KGD+25], where they count the number of qubits. Our proposal has an efficient verifier and a noise-robust quantum prover which is arguably much more efficient compared to [KGD+25]. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_07930 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Quantum information advantage based on Bell inequalities Jain, Rahul Kundu, Srijita Quantum Physics Computational Complexity Recently, Kretschmer et al. [KGD+25] presented an experimental demonstration of a proposed quantum information advantage protocol. We present an alternate proposal based on a relation derived from parallel-repeated CHSH games. Our memory measure is based on an information measure and is different from [KGD+25], where they count the number of qubits. Our proposal has an efficient verifier and a noise-robust quantum prover which is arguably much more efficient compared to [KGD+25]. |
| title | Quantum information advantage based on Bell inequalities |
| topic | Quantum Physics Computational Complexity |
| url | https://arxiv.org/abs/2603.07930 |