Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2512.02131 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911297688305664 |
|---|---|
| author | Simon, William A. Love, Peter J. |
| author_facet | Simon, William A. Love, Peter J. |
| contents | Quantum computing promises the ability to compute properties of quantum systems exponentially faster than classical computers. Quantum advantage is achieved when a practical problem is solved more efficiently on a quantum computer than on a classical computer. Demonstrating quantum advantage requires a powerful quantum computer with low error rates and an efficient quantum algorithm that has a useful application. Despite rapid progress in hardware development, we still lack useful applications that are feasible for the next generation of quantum computers. Here we argue that an exponential quantum advantage exists in producing numerical resource estimates of larger quantum algorithms by accurately measuring simulation errors. We provide a quantum algorithm for measuring simulation errors of Trotter-based algorithms. Our results indicate that this method will reduce runtimes of quantum algorithms by approximately three orders of magnitude for one-hundred qubit systems. We also predict that these reductions will increase with system size. The methods we propose require relatively few qubits and operations, meaning the next generation of quantum computers could compute simulation errors for classically intractable systems. Since the underlying computations that lead to reduced resource estimates are infeasible for classical computers, this task is a candidate for demonstrating practical quantum advantage. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_02131 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum Advantage in Resource Estimation Simon, William A. Love, Peter J. Quantum Physics Quantum computing promises the ability to compute properties of quantum systems exponentially faster than classical computers. Quantum advantage is achieved when a practical problem is solved more efficiently on a quantum computer than on a classical computer. Demonstrating quantum advantage requires a powerful quantum computer with low error rates and an efficient quantum algorithm that has a useful application. Despite rapid progress in hardware development, we still lack useful applications that are feasible for the next generation of quantum computers. Here we argue that an exponential quantum advantage exists in producing numerical resource estimates of larger quantum algorithms by accurately measuring simulation errors. We provide a quantum algorithm for measuring simulation errors of Trotter-based algorithms. Our results indicate that this method will reduce runtimes of quantum algorithms by approximately three orders of magnitude for one-hundred qubit systems. We also predict that these reductions will increase with system size. The methods we propose require relatively few qubits and operations, meaning the next generation of quantum computers could compute simulation errors for classically intractable systems. Since the underlying computations that lead to reduced resource estimates are infeasible for classical computers, this task is a candidate for demonstrating practical quantum advantage. |
| title | Quantum Advantage in Resource Estimation |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2512.02131 |