Measurement-driven analog of adiabatic quantum computation for frustration-free Hamiltonians
The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realized in systems which support Hamiltonian evolution rather than discrete gates. We explore an alternative approach in w...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Published: |
American Physical Society
2019
|
| _version_ | 1826277332304789504 |
|---|---|
| author | Zhao, L Pérez-Delgado, C Benjamin, S Fitzsimons, J |
| author_facet | Zhao, L Pérez-Delgado, C Benjamin, S Fitzsimons, J |
| author_sort | Zhao, L |
| collection | OXFORD |
| description | The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realized in systems which support Hamiltonian evolution rather than discrete gates. We explore an alternative approach in which slowly varying measurements are used to mimic adiabatic evolution. We show that, for certain Hamiltonians, which remain frustration free all along the adiabatic path, the necessary measurements can be implemented through the measurement of random terms from the Hamiltonian. This offers a potentially more viable method of realizing adiabatic evolution in gate-based quantum computer architectures. |
| first_indexed | 2024-03-06T23:27:18Z |
| format | Journal article |
| id | oxford-uuid:6ad0fc6a-f571-4fe9-8476-98de54de0e2d |
| institution | University of Oxford |
| last_indexed | 2024-03-06T23:27:18Z |
| publishDate | 2019 |
| publisher | American Physical Society |
| record_format | dspace |
| spelling | oxford-uuid:6ad0fc6a-f571-4fe9-8476-98de54de0e2d2022-03-26T18:59:52ZMeasurement-driven analog of adiabatic quantum computation for frustration-free HamiltoniansJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:6ad0fc6a-f571-4fe9-8476-98de54de0e2dSymplectic Elements at OxfordAmerican Physical Society2019Zhao, LPérez-Delgado, CBenjamin, SFitzsimons, JThe adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realized in systems which support Hamiltonian evolution rather than discrete gates. We explore an alternative approach in which slowly varying measurements are used to mimic adiabatic evolution. We show that, for certain Hamiltonians, which remain frustration free all along the adiabatic path, the necessary measurements can be implemented through the measurement of random terms from the Hamiltonian. This offers a potentially more viable method of realizing adiabatic evolution in gate-based quantum computer architectures. |
| spellingShingle | Zhao, L Pérez-Delgado, C Benjamin, S Fitzsimons, J Measurement-driven analog of adiabatic quantum computation for frustration-free Hamiltonians |
| title | Measurement-driven analog of adiabatic quantum computation for frustration-free Hamiltonians |
| title_full | Measurement-driven analog of adiabatic quantum computation for frustration-free Hamiltonians |
| title_fullStr | Measurement-driven analog of adiabatic quantum computation for frustration-free Hamiltonians |
| title_full_unstemmed | Measurement-driven analog of adiabatic quantum computation for frustration-free Hamiltonians |
| title_short | Measurement-driven analog of adiabatic quantum computation for frustration-free Hamiltonians |
| title_sort | measurement driven analog of adiabatic quantum computation for frustration free hamiltonians |
| work_keys_str_mv | AT zhaol measurementdrivenanalogofadiabaticquantumcomputationforfrustrationfreehamiltonians AT perezdelgadoc measurementdrivenanalogofadiabaticquantumcomputationforfrustrationfreehamiltonians AT benjamins measurementdrivenanalogofadiabaticquantumcomputationforfrustrationfreehamiltonians AT fitzsimonsj measurementdrivenanalogofadiabaticquantumcomputationforfrustrationfreehamiltonians |