Compare Prices | Create Shopping Lists with Price Drop Alerts | Set Coupons, Promo Codes & Sales Alerts | Get Access to Exclusive Deals and Much More... All in One Place | Read all about it here

Approximability of Optimization Problems through Adiabatic Quantum Computation

Approximability of Optimization Problems through Adiabatic Quantum Computation

Brand
Springer Nature
Manufacturer
N/A
Part Number
0
GTIN
9783031013911
Condition
New
Product Description

The adiabatic quantum computation (AQC) is based on the adiabatic theorem to approximate solutions of the Schrdinger 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 2n 2n, 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. Table of Contents: Preface / Acknowledgments / Introduction / Approximability of NP-hard Problems / Adiabatic Quantum Computing / Efficient Hamiltonian Construction / AQC for Pseudo-Boolean Optimization / A General Strategy to Solve NP-Hard Problems / Conclusions / Bibliography / Authors' Biographies.

Available Colors
Available Sizes
1 Offer Price Range: $29.99 - $29.99
BEST PRICE

Single Product Purchase

$29.99
@ Link.springer.com     BUY Now

Price Comparison

Seller Contact Seller List Price On Sale Shipping Best Promo Final Price Volume Discount Financing Availability Seller's Page
BEST PRICE
1 Product Purchase
@ Link.springer.com
Contact Store Call Store Contact Support
$29.99 $29.99

$29.99
See Site In stock Visit Store

Similar Products

Politics After Morality

$54.99

Advanced Composites in Aerospace Engineering Applications

$149.00

Telenursing

$39.99

Software-Ergonomie 93

$84.99

What Does It Mean to be Kind?

$6.71

KI 2021: Advances in Artificial Intelligence

$84.99

The Israeli Third Sector

$109.99

Mechanik Aufgaben 1

$34.99

Abolition and Empire in Sierra Leone and Liberia

$99.00

Geisteswissenschaften

$59.99

Bronchitis Asthma Emphysem

$44.99

Situatedness and Place

$139.99

Ecosystem Organization of a Complex Landscape

$219.99

Quantitative Methoden in der Politikwissenschaft

$39.99

Iran at the Crossroads

$54.99

An Approach to the Selberg Trace Formula via the Selberg Zeta-Function

$29.99

Post-trauma and the Recovery Governance of Cultural Heritage

$139.99

Biographische Fallarbeit

$34.99

Current Concepts and Management of Eye Injuries

$84.99

Executive-Legislative Relations in Parliamentary Systems

$54.99

SCF and APC E3 Ubiquitin Ligases in Tumorigenesis

$39.99

The Corporate Newsroom

$54.99

kobilanzen

$39.99

Distribution Theory Applied to Differential Equations

$139.99

Theory of Mind and Science Fiction

$54.99

Beyond the Green Revolution

$39.99

Gestaltung mobiler Interaktionsgerte

$69.99

Persnlichkeitsstrungen im Jugendalter

$64.99

Biology of Fresh Waters

$54.99

Nonlinear Laser Chemistry

$84.99

Aspects of Homogeneous Catalysis

$39.99

Engineering Multi-Agent Systems

$84.99

Cerebral Ischemia and Calcium

$109.99

Contribution to Applied Statistics

$39.99

Graphene for Transparent Conductors

$54.99

Der Betafaktor

$89.99

Constructing 'Pakistan' through Knowledge Production in International Relations and Area Studies

$79.99

Technischer Lehrgang Hydraulik

$44.99

Rare Metal Technology 2019

$129.00

Boundary Element Analysis of Viscous Flow

$109.99