Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.00789 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910009105842176 |
|---|---|
| author | Tanggara, Andrew Gu, Mile Bharti, Kishor |
| author_facet | Tanggara, Andrew Gu, Mile Bharti, Kishor |
| contents | In recent years, several experimental groups have claimed demonstrations of ``quantum supremacy'' or computational quantum advantage. A notable first claim by Google Quantum AI revolves around a metric called the Linear Cross Entropy Benchmarking (Linear XEB), which has been used in many quantum supremacy experiments since. The complexity-theoretic hardness of spoofing Linear XEB, however, depends on the Cross-Entropy Quantum Threshold (XQUATH) conjecture put forth by Aaronson and Gunn, which has been disproven for sublinear depth circuits. In the efforts on demonstrating quantum supremacy by quantum Hamiltonian simulation, a similar benchmarking metric called the System Linear Cross Entropy Score (sXES) holds firm in light of the aforementioned negative result due to its fundamental distinction with Linear XEB. Moreover, the complexity-theoretic hardness of spoofing sXES rests on the System Linear Cross-Entropy Quantum Threshold Assumption (sXQUATH), the formal relationship of which to XQUATH is unclear. Despite the promises offered by sXES for future demonstration of quantum supremacy, in this work we show that it can be classically simulated efficiently in certain regimes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_00789 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Classically Spoofing System Linear Cross Entropy Score Benchmarking Tanggara, Andrew Gu, Mile Bharti, Kishor Quantum Physics Computational Complexity In recent years, several experimental groups have claimed demonstrations of ``quantum supremacy'' or computational quantum advantage. A notable first claim by Google Quantum AI revolves around a metric called the Linear Cross Entropy Benchmarking (Linear XEB), which has been used in many quantum supremacy experiments since. The complexity-theoretic hardness of spoofing Linear XEB, however, depends on the Cross-Entropy Quantum Threshold (XQUATH) conjecture put forth by Aaronson and Gunn, which has been disproven for sublinear depth circuits. In the efforts on demonstrating quantum supremacy by quantum Hamiltonian simulation, a similar benchmarking metric called the System Linear Cross Entropy Score (sXES) holds firm in light of the aforementioned negative result due to its fundamental distinction with Linear XEB. Moreover, the complexity-theoretic hardness of spoofing sXES rests on the System Linear Cross-Entropy Quantum Threshold Assumption (sXQUATH), the formal relationship of which to XQUATH is unclear. Despite the promises offered by sXES for future demonstration of quantum supremacy, in this work we show that it can be classically simulated efficiently in certain regimes. |
| title | Classically Spoofing System Linear Cross Entropy Score Benchmarking |
| topic | Quantum Physics Computational Complexity |
| url | https://arxiv.org/abs/2405.00789 |