Skip to main content

Measurement-driven analog of adiabatic quantum computation for frustration-free Hamiltonians

Zhao, Liming, Pérez-Delgado, Carlos A, Benjamin, Simon C., Fitzsimons, Joseph F. (2019) Measurement-driven analog of adiabatic quantum computation for frustration-free Hamiltonians. Physical Review A, 100 (3). ISSN 2469-9926. (doi:10.1103/PhysRevA.100.032331) (KAR id:78089)

PDF Author's Accepted Manuscript
Language: English
Download (217kB) Preview
PDF Pre-print
Language: English
Download (99kB) Preview
Official URL


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.

Item Type: Article
DOI/Identification number: 10.1103/PhysRevA.100.032331
Uncontrolled keywords: Quantum Computation, Quantum Measurement, Adiabatic Quantum Computation, Measurement-Based Quantum Computation, Quantum Zeno Effect
Subjects: Q Science > QC Physics > QC174.12 Quantum theory
Divisions: Faculties > Sciences > School of Computing
Depositing User: Carlos Perez Delgado
Date Deposited: 30 Oct 2019 23:06 UTC
Last Modified: 31 Oct 2019 14:06 UTC
Resource URI: (The current URI for this page, for reference purposes)
Pérez-Delgado, Carlos A:
  • Depositors only (login required):


Downloads per month over past year