Establishing trust in quantum computations
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2022
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915738435977216 |
|---|---|
| author | Proctor, Timothy Seritan, Stefan Nielsen, Erik Rudinger, Kenneth Young, Kevin Blume-Kohout, Robin Sarovar, Mohan |
| author_facet | Proctor, Timothy Seritan, Stefan Nielsen, Erik Rudinger, Kenneth Young, Kevin Blume-Kohout, Robin Sarovar, Mohan |
| contents | Quantum computing hardware has grown sufficiently complex that it often can no longer be simulated by classical computers, but its computational power remains limited by errors. These errors corrupt the results of quantum algorithms, and it is no longer always feasible to use classical simulations to directly check the correctness of quantum computations. Without practical methods for quantifying the accuracy with which a quantum algorithm has been executed, it is difficult to establish trust in the results of a quantum computation. Here we solve this problem, by introducing a simple and efficient technique for measuring the fidelity with which an as-built quantum computer can execute an algorithm. Our technique converts the algorithm's quantum circuits into a set of closely related ``mirror circuits'' whose success rates can be efficiently measured. It enables measuring the fidelity of quantum algorithm executions both in the near-term, with algorithms run on hundreds or thousands of physical qubits, and into the future, with algorithms run on logical qubits protected by quantum error correction. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2204_07568 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Establishing trust in quantum computations Proctor, Timothy Seritan, Stefan Nielsen, Erik Rudinger, Kenneth Young, Kevin Blume-Kohout, Robin Sarovar, Mohan Quantum Physics Quantum computing hardware has grown sufficiently complex that it often can no longer be simulated by classical computers, but its computational power remains limited by errors. These errors corrupt the results of quantum algorithms, and it is no longer always feasible to use classical simulations to directly check the correctness of quantum computations. Without practical methods for quantifying the accuracy with which a quantum algorithm has been executed, it is difficult to establish trust in the results of a quantum computation. Here we solve this problem, by introducing a simple and efficient technique for measuring the fidelity with which an as-built quantum computer can execute an algorithm. Our technique converts the algorithm's quantum circuits into a set of closely related ``mirror circuits'' whose success rates can be efficiently measured. It enables measuring the fidelity of quantum algorithm executions both in the near-term, with algorithms run on hundreds or thousands of physical qubits, and into the future, with algorithms run on logical qubits protected by quantum error correction. |
| title | Establishing trust in quantum computations |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2204.07568 |