Approximability of Optimization Problems through Adiabatic Quantum Computation  , Guillermo MoralesLuna
Not Available
This file is no longer available on Tradebit.
The adiabatic quantum computation (AQC) is based on the adiabatic theorem to approximate solutions of the Schrödinger 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 MAXSAT 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ⁿ × 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 pseudoBoolean maps that are reduced in polynomial time to quadratic maps. Finally, the relation among NPhard problems is investigated, as well as its logical representability, and is applied to the design of AQC algorithms. It is shown that every monadic secondorder logic (MSOL) expression has associated pseudoBoolean maps that can be obtained by expanding the given expression, and also can be reduced to quadratic forms. Table of Contents: Preface / Acknowledgments / Introduction / Approximability of NPhard Problems / Adiabatic Quantum Computing / Efficient Hamiltonian Construction / AQC for PseudoBoolean Optimization / A General Strategy to Solve NPHard Problems / Conclusions / Bibliography / Authors' Biographies
Author: CruzSantos, William
Author: MoralesLuna, Guillermo
Publisher: Morgan & Claypool Publishers
Illustration: n
Language: ENG
Title: Approximability of Optimization Problems through Adiabatic Quantum Computation
Pages: 00113 (Encrypted PDF)
On Sale: 20140901
SKU13/ISBN: 9781627055567
Category: Science : Physics  Quantum Theory
Author: CruzSantos, William
Author: MoralesLuna, Guillermo
Publisher: Morgan & Claypool Publishers
Illustration: n
Language: ENG
Title: Approximability of Optimization Problems through Adiabatic Quantum Computation
Pages: 00113 (Encrypted PDF)
On Sale: 20140901
SKU13/ISBN: 9781627055567
Category: Science : Physics  Quantum Theory
(ID 278196106)
File Data:
Contact Seller:
ebookreader,
US, Member since 09/08/2010
URL:
Embed:
More Files From This User
 100 Words Almost Everyone Mixes Up or Mangles
 One Raindrop at a Time: Environmental Peacebuilding and Education in Sur Baher, Jerusalem
 Inventology: How We Dream Up Things That Change the World  Pagan Kennedy
 On the Sexual Theories of Children  Sigmund Freud
 States and Markets  Susan Strange
Related Files

Designing And Programming Cics Applications  , Members Of The Cics Development Hursley

Raspberry Pi Super Cluster  Dennis Andrew K.

Arduino For The Cloud:: Arduino Yun And Dragino Yun Shield  Claus Kuhnel

Electronics Cookbook: Practical Electronic Recipes With Arduino And Raspberry Pi  Simon Monk

Practical Internet Of Things With Javascript: Build Standalone Exciting Iot Projects With Raspberry Pi 3 And Javascript (es5/es6)  Arvind Ravulavaru

System Performance Tuning  , Mike Loukides

Testing Ios Apps With Hadoopunit: Rapid Distributed Gui Testing  , Krissada Dechokul
Tradebit Reviews
Tradebit is the worlds largest marketplace for digital files, with over 2.5 million satisfied customers and millions of digital products. Online for over 12 years, Tradebit is the best place to find files like music, video tutorials, repair manuals, and more. If you're curious about how much our users love Tradebit, read reviews from real buyers!