Minor-embedding in adiabatic quantum computation: I. The parameter setting problem

Choi, Vicky

doi:10.1007/s11128-008-0082-9

Record: found
Abstract: not found
Article: not found

Minor-embedding in adiabatic quantum computation: I. The parameter setting problem

Author(s): Vicky Choi

Publication date (Print): September 2008

Journal: Quantum Information Processing

Publisher: Springer Nature

Read this article at

ScienceOpenPublisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Abstract

Related collections

Most cited references 10

Record: found
Abstract: found
Article: found

Is Open Access

A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem

, , … (2001)

A quantum system will stay near its instantaneous ground state if the Hamiltonian that governs its evolution varies slowly enough. This quantum adiabatic behavior is the basis of a new class of algorithms for quantum computing. We test one such algorithm by applying it to randomly generated, hard, instances of an NP-complete problem. For the small examples that we can simulate, the quantum adiabatic algorithm works well, and provides evidence that quantum computers (if large ones can be built) may be able to outperform ordinary computers on hard sets of instances of NP-complete problems.