# A measurement driven analog of adiabatic quantum computation for frustration-free Hamiltonians

## TL;DR

This paper proposes a measurement-based approach to simulate adiabatic quantum computation for frustration-free Hamiltonians, potentially offering a more practical implementation in gate-based quantum computers.

## Contribution

It introduces a measurement-driven method to emulate adiabatic evolution using random Hamiltonian term measurements for frustration-free systems.

## Key findings

- Measurement of random Hamiltonian terms can mimic adiabatic evolution.
- Applicable to frustration-free Hamiltonians in gate-based architectures.
- Offers a new approach to implement adiabatic algorithms without continuous Hamiltonian control.

## Abstract

The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised 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 new, and potentially more viable, method of realising adiabatic evolution in gate-based quantum computer architectures.