Approximability of Optimization Problems through Adiabatic Quantum Computation - Synthesis Lectures on Quantum Computing (Paperback)
  • Approximability of Optimization Problems through Adiabatic Quantum Computation - Synthesis Lectures on Quantum Computing (Paperback)
zoom

Approximability of Optimization Problems through Adiabatic Quantum Computation - Synthesis Lectures on Quantum Computing (Paperback)

(author), (author)
£40.50
Paperback 113 Pages / Published: 30/09/2014
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket
The adiabatic quantum computation (AQC) is based on the adiabatic theorem to approximate solutions of the Schroedinger equation. The design of an AQC algorithm involves the construction of a Hamiltonian that describes the behavior of the quantum system. This Hamiltonian is expressed as a linear interpolation of an initial Hamiltonian whose ground state is easy to compute, and a final Hamiltonian whose ground state corresponds to the solution of a given combinatorial optimization problem. The adiabatic theorem asserts that if the time evolution of a quantum system described by a Hamiltonian is large enough, then the system remains close to its ground state. An AQC algorithm uses the adiabatic theorem to approximate the ground state of the final Hamiltonian that corresponds to the solution of the given optimization problem. In this book, we investigate the computational simulation of AQC algorithms applied to the MAX-SAT problem. A symbolic analysis of the AQC solution is given in order to understand the involved computational complexity of AQC algorithms. This approach can be extended to other combinatorial optimization problems and can be used for the classical simulation of an AQC algorithm where a Hamiltonian problem is constructed. This construction requires the computation of a sparse matrix of dimension 2? x 2?, by means of tensor products, where n is the dimension of the quantum system. Also, a general scheme to design AQC algorithms is proposed, based on a natural correspondence between optimization Boolean variables and quantum bits. Combinatorial graph problems are in correspondence with pseudo-Boolean maps that are reduced in polynomial time to quadratic maps. Finally, the relation among NP-hard problems is investigated, as well as its logical representability, and is applied to the design of AQC algorithms. It is shown that every monadic second-order logic (MSOL) expression has associated pseudo-Boolean maps that can be obtained by expanding the given expression, and also can be reduced to quadratic forms.

Publisher: Morgan & Claypool Publishers
ISBN: 9781627055567
Number of pages: 113
Weight: 209 g
Dimensions: 235 x 187 x 6 mm

You may also be interested in...

In Search Of Schrodinger's Cat
Added to basket
£9.99   £7.99
Paperback
The Quantum Age
Added to basket
£9.99
Paperback
Introducing Quantum Theory
Added to basket
How to Teach Quantum Physics to Your Dog
Added to basket
Quantum Physics
Added to basket
Quantum Theory Cannot Hurt You
Added to basket
30-Second Quantum Theory
Added to basket
Antimatter
Added to basket
£8.99
Paperback
The Elegant Universe
Added to basket
AS Physics Unit 1
Added to basket
£9.75
Paperback
Our Mathematical Universe
Added to basket
Higgs
Added to basket
£9.99
Paperback

Reviews

Please sign in to write a review

Your review has been submitted successfully.