On low-depth algorithms for quantum phase estimation
Quantum phase estimation is one of the critical building blocks of quantum computing. For early fault-tolerant quantum devices, it is desirable for a quantum phase estimation algorithm to (1) use a minimal number of ancilla qubits, (2) allow for inexact initial states with a significant mismatch, (3...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2023-11-01
|
| Series: | Quantum |
| Online Access: | https://quantum-journal.org/papers/q-2023-11-06-1165/pdf/ |
| _version_ | 1797635676303261696 |
|---|---|
| author | Hongkang Ni Haoya Li Lexing Ying |
| author_facet | Hongkang Ni Haoya Li Lexing Ying |
| author_sort | Hongkang Ni |
| collection | DOAJ |
| description | Quantum phase estimation is one of the critical building blocks of quantum computing. For early fault-tolerant quantum devices, it is desirable for a quantum phase estimation algorithm to (1) use a minimal number of ancilla qubits, (2) allow for inexact initial states with a significant mismatch, (3) achieve the Heisenberg limit for the total resource used, and (4) have a diminishing prefactor for the maximum circuit length when the overlap between the initial state and the target state approaches one. In this paper, we prove that an existing algorithm from quantum metrology can achieve the first three requirements. As a second contribution, we propose a modified version of the algorithm that also meets the fourth requirement, which makes it particularly attractive for early fault-tolerant quantum devices. |
| first_indexed | 2024-03-11T12:24:44Z |
| format | Article |
| id | doaj.art-6d523237da2a42b0b74bdc3dcdbb1200 |
| institution | Directory Open Access Journal |
| issn | 2521-327X |
| language | English |
| last_indexed | 2024-03-11T12:24:44Z |
| publishDate | 2023-11-01 |
| publisher | Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften |
| record_format | Article |
| series | Quantum |
| spelling | doaj.art-6d523237da2a42b0b74bdc3dcdbb12002023-11-06T13:09:35ZengVerein zur Förderung des Open Access Publizierens in den QuantenwissenschaftenQuantum2521-327X2023-11-017116510.22331/q-2023-11-06-116510.22331/q-2023-11-06-1165On low-depth algorithms for quantum phase estimationHongkang NiHaoya LiLexing YingQuantum phase estimation is one of the critical building blocks of quantum computing. For early fault-tolerant quantum devices, it is desirable for a quantum phase estimation algorithm to (1) use a minimal number of ancilla qubits, (2) allow for inexact initial states with a significant mismatch, (3) achieve the Heisenberg limit for the total resource used, and (4) have a diminishing prefactor for the maximum circuit length when the overlap between the initial state and the target state approaches one. In this paper, we prove that an existing algorithm from quantum metrology can achieve the first three requirements. As a second contribution, we propose a modified version of the algorithm that also meets the fourth requirement, which makes it particularly attractive for early fault-tolerant quantum devices.https://quantum-journal.org/papers/q-2023-11-06-1165/pdf/ |
| spellingShingle | Hongkang Ni Haoya Li Lexing Ying On low-depth algorithms for quantum phase estimation Quantum |
| title | On low-depth algorithms for quantum phase estimation |
| title_full | On low-depth algorithms for quantum phase estimation |
| title_fullStr | On low-depth algorithms for quantum phase estimation |
| title_full_unstemmed | On low-depth algorithms for quantum phase estimation |
| title_short | On low-depth algorithms for quantum phase estimation |
| title_sort | on low depth algorithms for quantum phase estimation |
| url | https://quantum-journal.org/papers/q-2023-11-06-1165/pdf/ |
| work_keys_str_mv | AT hongkangni onlowdepthalgorithmsforquantumphaseestimation AT haoyali onlowdepthalgorithmsforquantumphaseestimation AT lexingying onlowdepthalgorithmsforquantumphaseestimation |