| 期刊全稱 | Approximability of Optimization Problems through Adiabatic Quantum Computation | | 影響因子2023 | William Cruz-Santos,Guillermo Morales-Luna | | 視頻video | http://file.papertrans.cn/161/160356/160356.mp4 | | 學(xué)科分類 | Synthesis Lectures on Quantum Computing | | 圖書(shū)封面 |  | | 影響因子 | 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 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 | | Pindex | Book 2014 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-14 02:30
發(fā)表于 2025-3-21 17:20:28
