Application-level Benchmarking of Quantum Computers using Nonlocal Game Strategies
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911026717392896 |
|---|---|
| author | Furches, Jim Chehade, Sarah Hamilton, Kathleen Wiebe, Nathan Marrero, Carlos Ortiz |
| author_facet | Furches, Jim Chehade, Sarah Hamilton, Kathleen Wiebe, Nathan Marrero, Carlos Ortiz |
| contents | In a nonlocal game, two noncommunicating players cooperate to convince a referee that they possess a strategy that does not violate the rules of the game. Quantum strategies allow players to optimally win some games by performing joint measurements on a shared entangled state, but computing these strategies can be challenging. We present a variational quantum algorithm to compute quantum strategies for nonlocal games by encoding the rules of a nonlocal game into a Hamiltonian. We show how this algorithm can generate a short-depth optimal quantum strategy for a graph coloring game with a quantum advantage. This quantum strategy is then evaluated on fourteen different quantum hardware platforms to demonstrate its utility as a benchmark. Finally, we discuss potential sources of errors that can explain the observed decreased performance of the executed task and derive an expression for the number of samples required to accurately estimate the win rate in the presence of noise. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_01363 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Application-level Benchmarking of Quantum Computers using Nonlocal Game Strategies Furches, Jim Chehade, Sarah Hamilton, Kathleen Wiebe, Nathan Marrero, Carlos Ortiz Quantum Physics In a nonlocal game, two noncommunicating players cooperate to convince a referee that they possess a strategy that does not violate the rules of the game. Quantum strategies allow players to optimally win some games by performing joint measurements on a shared entangled state, but computing these strategies can be challenging. We present a variational quantum algorithm to compute quantum strategies for nonlocal games by encoding the rules of a nonlocal game into a Hamiltonian. We show how this algorithm can generate a short-depth optimal quantum strategy for a graph coloring game with a quantum advantage. This quantum strategy is then evaluated on fourteen different quantum hardware platforms to demonstrate its utility as a benchmark. Finally, we discuss potential sources of errors that can explain the observed decreased performance of the executed task and derive an expression for the number of samples required to accurately estimate the win rate in the presence of noise. |
| title | Application-level Benchmarking of Quantum Computers using Nonlocal Game Strategies |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2311.01363 |