A measurement driven analog of adiabatic quantum computation for frustration-free Hamiltonians
arXiv:1706.02559 · doi:10.1103/PhysRevA.100.032331
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.
4 pages. Comments welcome
References in corpus (7)
- The density-matrix renormalization group in the age of matrix product states
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- Simulated Quantum Computation of Molecular Energies
- The power of quantum systems on a line
- A Direct Mapping of Max k-SAT and High Order Parity Checks to a Chimera Graph
- Stabilisers as a design tool for new forms of Lechner-Hauke-Zoller Annealer
- Freely Scalable Quantum Technologies using Cells of 5-to-50 Qubits with Very Lossy and Noisy Photonic Links