Descript 
1 online resource (ix, 83 pages) : illustrations 

text txt rdacontent 

computer rdamedia 

online resource cr rdacarrier 
Series 
Synthesis lectures on quantum computing, 19459734 ; #8


Synthesis lectures on quantum computing ; #8. 19459726

Note 
Description based on online resource; title from PDF title page (Morgan & Claypool, viewed on August 16, 2014) 

Includes bibliographical references (pages 7382) 

1. Introduction  1.1 What's inside  1.2 What happens next?  

2. Adiabatic quantum computation  2.1 Basics of quantum computation  2.2 Components of AQC algorithms  2.2.1 A simple example  2.2.2 The adiabatic theorem  2.3 An algorithm for exact cover  2.3.1 Runtime analysis  2.4 Complexity classes  2.4.1 AQC and related models  

3. Quantum annealing  3.1 Optimization and heuristic search  3.2 Classical implementations of QA  3.2.1 Ising model and related problems  3.2.2 General satisfiability  3.2.3 Traveling salesman problem  3.2.4 Factoring integers  

4. The Dwave platform  4.1 The user's view  4.2 The technology stack  4.2.1 Qubits and couplers  4.2.2 Topology  4.2.3 Control circuitry  4.3 Challenges  4.4 Some alternative quantum annealing systems  

5. Computational experience  5.1 What problems can it solve?  5.1.1 Training classifiers  5.1.2 Finding Ramsey numbers  5.1.3 Protein folding  5.1.4 General optimization  5.2 Is it quantum?  5.2.1 Quantum annealing vs. thermal annealing  5.2.2 Demonstration of entanglement  5.2.3 Signatures of quantum annealing  5.3 How fast is it?  5.4 Epilogue  

Bibliography  Author's biography 

Adiabatic quantum computation (AQC) is an alternative to the betterknown gate model of quantum computation. The two models are polynomially equivalent, but otherwise quite dissimilar: one property that distinguishes AQC from the gate model is its analog nature. Quantum annealing (QA) describes a type of heuristic search algorithm that can be implemented to run in the native instruction set of an AQC platform. DWave Systems Inc. manufactures quantum annealing processor chips that exploit quantum properties to realize QA computations in hardware. The chips form the centerpiece of a novel computing platform designed to solve NPhard optimization problems. Starting with a 16qubit prototype announced in 2007, the company has launched and sold increasingly larger models: the 128qubit DWave One system was announced in 2010 and the 512qubit DWave Two system arrived on the scene in 2013. A 1,000qubit model is expected to be available in 2014. This monograph presents an introductory overview of this unusual and rapidly developing approach to computation. We start with a survey of basic principles of quantum computation and what is known about the AQC model and the QA algorithm paradigm. Next we review the DWave technology stack and discuss some challenges to building and using quantum computing systems at a commercial scale. The last chapter reviews some experimental efforts to understand the properties and capabilities of these unusual platforms. The discussion throughout is aimed at an audience of computer scientists with little background in quantum computation or in physics 
Link 
Print version: Mcgeoch, Catherine Cole. Adiabatic quantum computation and quantum annealing.
San Rafael : Morgan & Claypool, 2014 1627053352
(OCoLC)889647475

Subject 
Quantum computers  Mathematics


Adiabatic invariants


COMPUTERS / Computer Literacy bisacsh


COMPUTERS / Computer Science bisacsh


COMPUTERS / Data Processing bisacsh


COMPUTERS / Hardware / General bisacsh


COMPUTERS / Information Technology bisacsh


COMPUTERS / Machine Theory bisacsh


COMPUTERS / Reference bisacsh


Quantum computers


Quantum theory


Simulated annealing (Mathematics)


Electronic books


Electronic books

