How to Design a Classically Difficult Random Quantum Circuit for Quantum Computational Advantage Experiments
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_ | 1866909466802257920 |
|---|---|
| author | Huang, He-Liang Zhao, Youwei Guo, Chu |
| author_facet | Huang, He-Liang Zhao, Youwei Guo, Chu |
| contents | Quantum computational advantage is a critical milestone for near-term quantum technologies and an essential step towards building practical quantum computers. Recent successful demonstrations of quantum computational advantage owe much to specifically designed random quantum circuit (RQC) protocols that enable hardware-friendly implementation and, more importantly, pose great challenges for classical simulation. Here, we report the automated protocol design approach used for finding the optimal RQC in the \textit{Zuchongzhi} quantum computational advantage experiment [Phys. Rev. Lett. 127 (18), 180501 (2021)]. Without a carefully designed protocol, the classical simulation cost of the \textit{Zuchongzhi}'s 56-qubit 20-cycle RQC experiment would not be considerably higher than Google's 53-qubit 20-cycle experiment, even though more qubits are involved. For Google's latest RQC experiment using $70$ qubits and $24$ cycles [arXiv:2304.11119 (2023)], we estimate that its classical simulation cost can be increased by at least one order of magnitude using our approach. The proposed method can be applied to generic planar quantum processor architectures and addresses realistic imperfections such as processor defects, underpinning quantum computational advantage experiments in future generations of quantum processors. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_16035 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | How to Design a Classically Difficult Random Quantum Circuit for Quantum Computational Advantage Experiments Huang, He-Liang Zhao, Youwei Guo, Chu Quantum Physics Quantum computational advantage is a critical milestone for near-term quantum technologies and an essential step towards building practical quantum computers. Recent successful demonstrations of quantum computational advantage owe much to specifically designed random quantum circuit (RQC) protocols that enable hardware-friendly implementation and, more importantly, pose great challenges for classical simulation. Here, we report the automated protocol design approach used for finding the optimal RQC in the \textit{Zuchongzhi} quantum computational advantage experiment [Phys. Rev. Lett. 127 (18), 180501 (2021)]. Without a carefully designed protocol, the classical simulation cost of the \textit{Zuchongzhi}'s 56-qubit 20-cycle RQC experiment would not be considerably higher than Google's 53-qubit 20-cycle experiment, even though more qubits are involved. For Google's latest RQC experiment using $70$ qubits and $24$ cycles [arXiv:2304.11119 (2023)], we estimate that its classical simulation cost can be increased by at least one order of magnitude using our approach. The proposed method can be applied to generic planar quantum processor architectures and addresses realistic imperfections such as processor defects, underpinning quantum computational advantage experiments in future generations of quantum processors. |
| title | How to Design a Classically Difficult Random Quantum Circuit for Quantum Computational Advantage Experiments |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2501.16035 |