Approximability of optimization problems through adiabatic quantum computation /
| Main Authors: | , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
San Rafael, California (1537 Fourth Street, San Rafael, CA 94901 USA) :
Morgan & Claypool,
2014.
|
| Series: | Synthesis lectures on quantum computing ;
# 9. |
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
| Abstract: | The adiabatic quantum computation (AQC) is based on the adiabatic theorem to approximate solutions of the Schrodinger 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 x 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. |
|---|---|
| Physical Description: | 1 online resource (xv, 97 pages) : illustrations. Also available in print. |
| Format: | Mode of access: World Wide Web. System requirements: Adobe Acrobat Reader. |
| Bibliography: | Includes bibliographical references (pages 87-95). |
| ISBN: | 9781627055574 |
| ISSN: | 1945-9734 ; |
| DOI: | 10.2200/S00596ED1V01Y201409QMC009 |
| Access: | Abstract freely available; full-text restricted to subscribers or individual document purchasers. |