Adiabatic Quantum Simulators

In his famous 1981 talk, Feynman proposed that unlike classical computers, which would presumably experience an exponential slowdown when simulating quantum phenomena, a universal quantum simulator would not. An ideal quantum simulator would be error resistant, easily controllable, and built using e...

詳細記述

書誌詳細
主要な著者: Whitfield, J, Aspuru−Guzik, A
フォーマット: Journal article
出版事項: 2010
_version_ 1826277131651383296
author Whitfield, J
Aspuru−Guzik, A
author_facet Whitfield, J
Aspuru−Guzik, A
author_sort Whitfield, J
collection OXFORD
description In his famous 1981 talk, Feynman proposed that unlike classical computers, which would presumably experience an exponential slowdown when simulating quantum phenomena, a universal quantum simulator would not. An ideal quantum simulator would be error resistant, easily controllable, and built using existing technology. Moving away from gate-model and projective measurement based implementations of quantum computing may offer a less resource-intensive, and consequently a more feasible solution. Here we consider an adiabatic quantum simulator which simulates the ground state properties of sparse Hamiltonians consisting of one- and two-body interaction terms, using sparse Hamiltonians with at most three-body interactions. Properties of such Hamiltonians can be well approximated with Hamiltonians containing only two-local terms. The register holding the simulated ground state is brought adiabatically into interaction with a probe qubit, followed by a single diabatic gate operation on the probe which then undergoes free evolution until measured. This allows one to recover e.g. the ground state energy of the Hamiltonian being simulated. Given a ground state, this scheme can be used to verify the QMA-complete problem LOCAL HAMILTONIAN, and is therefore likely more powerful than classical computing.
first_indexed 2024-03-06T23:24:17Z
format Journal article
id oxford-uuid:69d63bec-aaf2-4acf-8b67-c7e066c58ef9
institution University of Oxford
last_indexed 2024-03-06T23:24:17Z
publishDate 2010
record_format dspace
spelling oxford-uuid:69d63bec-aaf2-4acf-8b67-c7e066c58ef92022-03-26T18:53:31ZAdiabatic Quantum SimulatorsJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:69d63bec-aaf2-4acf-8b67-c7e066c58ef9Department of Computer Science2010Whitfield, JAspuru−Guzik, AIn his famous 1981 talk, Feynman proposed that unlike classical computers, which would presumably experience an exponential slowdown when simulating quantum phenomena, a universal quantum simulator would not. An ideal quantum simulator would be error resistant, easily controllable, and built using existing technology. Moving away from gate-model and projective measurement based implementations of quantum computing may offer a less resource-intensive, and consequently a more feasible solution. Here we consider an adiabatic quantum simulator which simulates the ground state properties of sparse Hamiltonians consisting of one- and two-body interaction terms, using sparse Hamiltonians with at most three-body interactions. Properties of such Hamiltonians can be well approximated with Hamiltonians containing only two-local terms. The register holding the simulated ground state is brought adiabatically into interaction with a probe qubit, followed by a single diabatic gate operation on the probe which then undergoes free evolution until measured. This allows one to recover e.g. the ground state energy of the Hamiltonian being simulated. Given a ground state, this scheme can be used to verify the QMA-complete problem LOCAL HAMILTONIAN, and is therefore likely more powerful than classical computing.
spellingShingle Whitfield, J
Aspuru−Guzik, A
Adiabatic Quantum Simulators
title Adiabatic Quantum Simulators
title_full Adiabatic Quantum Simulators
title_fullStr Adiabatic Quantum Simulators
title_full_unstemmed Adiabatic Quantum Simulators
title_short Adiabatic Quantum Simulators
title_sort adiabatic quantum simulators
work_keys_str_mv AT whitfieldj adiabaticquantumsimulators
AT aspuruguzika adiabaticquantumsimulators