arXiv:1512.07617

Notes on Adiabatic Quantum Computers

Boaz Tamir, Eliahu Cohen

Published Dec 23, 2015• 0 citations

Abstract

We discuss in this chapter the basics of adiabatic computation, as well as some physical implementations. After a short introduction of the quantum circuit model, we describe quantum adiabatic computation, quantum annealing, and the strong relations between the three. We conclude with a brief presentation of the D-Wave computer and some future challenges.

DOI: 10.48550/arxiv.1512.07617

Related papers

A cross-disciplinary introduction to quantum annealing-based algorithms

Salvador Elías Venegas-Andraca, William Cruz-Santos, Catherine McGeoch +1 more

A central goal in quantum computing is the development of quantum hardware and quantum algorithms in order to analyse challenging scientific and engineering problems. Research in quantum computation involves contributions from both physics and computer science; hence this article presents a concise introduction to basic concepts from both fields that are used in annealing-based quantum computation, an alternative to the more familiar quantum gate model. We introduce some concepts from computer science required to define difficult computational problems and to realise the potential relevance of quantum algorithms to find novel solutions to those problems. We introduce the structure of quantum annealing-based algorithms as well as two examples of this kind of algorithms for solving instances of the max-SAT and Minimum Multicut problems. An overview of the quantum annealing systems manufactured by D-Wave Systems is also presented.

arXiv:1803.03372Contemporary PhysicsApr 3, 201883 citations

Adiabatic Quantum Computing

Juan José García‐Ripoll

In this chapter, we discuss the notion of a quantum simulator as a device that emulates a complex quantum many-body Hamiltonian, and a quantum annealer as an extension of such a paradigm that focuses on the preparation of the ground state in those Hamiltonians. Starting from the Landau–Zener processes and the adiabatic theorem, we illustrate how such ground states can be prepared by slow (adiabatic) deformations of a Hamiltonian. We discuss how this results in an adiabatic quantum computing algorithm and how, depending on the Hamiltonian we apply it to, we can solve problems of different classical and quantum complexity. The chapter closes with a thorough discussion of the D-Wave quantum annealer as a real-world superconducting quantum simulator of Ising-type models. This discussion centers both on the design of the superconducting annealers as well as on the conclusion from the literature on how this device works in practice, including how quantum operations are still possible even in the pressence of decoherence. We close the chapter with an outlook on the challenges that need to be overcome for making coherent quantum annealers and universal adiabatic quantum computers.

Cambridge University Press eBooksJul 31, 20222 citations

Guest Column

Cristian S. Calude, Elena Calude, Michael J. Dinneen

The paper presents a brief introduction to quantum computing with focus on the adiabatic model which is illustrated with the commercial D-Wave computer. We also include new theory and experimental work done on the D-Wave computer. Finally we discuss a hybrid method of combining classical and quantum computing and a few open problems.

ACM SIGACT NewsMar 9, 201525 citations

Quantum Annealing and Computation: A Brief Documentary Note

Asim Kumar Ghosh, Sudip Mukherjee

Major breakthrough in quantum computation has recently been achieved using quantum annealing to develop analog quantum computers instead of gate based computers. After a short introduction to quantum computation, we retrace very briefly the history of these developments and discuss the Indian researches in this connection and provide some interesting documents (in the Figs.) obtained from a chosen set of high impact papers (and also some recent news etc. blogs appearing in the Internet). This note is also designed to supplement an earlier note by Bose (Science and Culture, 79, pp. 337-378, 2013).

arXiv:1310.1339Oct 3, 20134 citations

Quantum annealing: an overview

Atanu Rajak, Sei Suzuki, Amit Dutta +1 more

In this review, after providing the basic physical concept behind quantum annealing (or adiabatic quantum computation), we present an overview of some recent theoretical as well as experimental developments pointing to the issues which are still debated. With a brief discussion on the fundamental ideas of continuous and discontinuous quantum phase transitions, we discuss the Kibble-Zurek scaling of defect generation following a ramping of a quantum many body system across a quantum critical point. In the process, we discuss associated models, both pure and disordered, and shed light on implementations and some recent applications of the quantum annealing protocols. Furthermore, we discuss the effect of environmental coupling on quantum annealing. Some possible ways to speed up the annealing protocol in closed systems are elaborated upon: we especially focus on the recipes to avoid discontinuous quantum phase transitions occurring in some models where energy gaps vanish exponentially with the system size. This article is part of the theme issue 'Quantum annealing and computation: challenges and perspectives'.

arXiv:2207.01827Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering SciencesDec 4, 2022170 citations

Quantum optimisation

Steven Herbert

Abstract Optimisation appears in the workflow of virtually every application and is often a computationally expensive step. Therefore, exploring whether quantum computing can offer an advantage in optimisation – even if only in certain circumstances – is extremely well-motivated from a practical perspective. Unlike the other algorithms covered in the book, which are expressed and analysed as quantum circuits, the most natural starting point for understanding quantum optimisation is the adiabatic model of quantum computation, which is introduced in this chapter. The quantum approximate optimisation algorithm, a gate-based algorithm inspired by quantum annealing (itself closely-related to adiabatic quantum computation), is also covered.

Dec 8, 20250 citations