Adiabatic quantum computation
Tameem AlbashInformation Sciences Institute, University of Southern California, Marina del Rey, California 90292, USA, Department of Physics and Astronomy, University of Southern California, Los Angeles, California 90089, USA, and Center for Quantum Information Science & Technology, University of Southern California, Los Angeles, California 90089, USADaniel A. LidarInformation Sciences Institute, University of Southern California, Marina del Rey, California 90292, USA, Department of Physics and Astronomy, University of Southern California, Los Angeles, California 90089, USA, and Center for Quantum Information Science & Technology, University of Southern California, Los Angeles, California 90089, USA
2018en
ABI
Аннотация
The simple act of slowly varying the parameters of a quantum system so that it remains always in its ground state is extremely rich from an information processing point of view. For an ideal, closed system, this adiabatic evolution is equivalent to full quantum computation, and it is convenient for establishing quantum algorithms for optimization. This review presents adiabatic quantum algorithms, proves the closed-system equivalence of the adiabatic and circuit models of quantum computation, reviews the placement of adiabatic quantum computation in the more general classification of computational complexity theory, and discusses the case of ``stoquastic'' quantum evolutions.
Перевод пока недоступен
Идентификаторы
Цитирования и источники
Цитирований: 2Использованных источников: 0