Published June 2018
| Submitted
Journal Article
Open
Entanglement of approximate quantum strategies in XOR games
- Creators
- Ostrev, Dimiter
- Vidick, Thomas
Abstract
We show that for any ε > 0 there is an XOR game G = G(ε) with Θ(ε^(−1/5)) inputs for one player and Θ(ε^(−2/5)) inputs for the other player such that Ω(ε^(−1/5)) ebits are required for any strategy achieving bias that is at least a multiplicative factor (1−ε) from optimal. This gives an exponential improvement in both the number of inputs or outputs and the noise tolerance of any previously-known self-test for highly entangled states. Up to the exponent −1/5 the scaling of our bound with ε is tight: for any XOR game there is an ε-optimal strategy using ⌈ε^(−1)⌉ ebits, irrespective of the number of questions in the game.
Additional Information
© 2018 Rinton Press. Research supported by NSF CAREER Grant CCF-1553477 and the IQIM, an NSF Physics Frontiers Center (NFS Grant PHY-1125565) with support of the Gordon and Betty Moore Foundation (GBMF-12500028).Attached Files
Submitted - 1609.01652.pdf
Files
1609.01652.pdf
Files
(159.5 kB)
Name | Size | Download all |
---|---|---|
md5:4563e8b259b82d3ef5dda66eea35d895
|
159.5 kB | Preview Download |
Additional details
- Eprint ID
- 89955
- Resolver ID
- CaltechAUTHORS:20180926-101512002
- NSF
- CCF-1553477
- Institute for Quantum Information and Matter (IQIM)
- NSF
- PHY-1125565
- Gordon and Betty Moore Foundation
- GBMF-12500028
- Created
-
2018-09-26Created from EPrint's datestamp field
- Updated
-
2023-06-02Created from EPrint's last_modified field
- Caltech groups
- Institute for Quantum Information and Matter