找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Approximability of Optimization Problems through Adiabatic Quantum Computation; William Cruz-Santos,Guillermo Morales-Luna Book 2014 Sprin

[復(fù)制鏈接]
查看: 21732|回復(fù): 38
樓主
發(fā)表于 2025-3-21 17:20:28 | 只看該作者 |倒序瀏覽 |閱讀模式
期刊全稱Approximability of Optimization Problems through Adiabatic Quantum Computation
影響因子2023William Cruz-Santos,Guillermo Morales-Luna
視頻videohttp://file.papertrans.cn/161/160356/160356.mp4
學(xué)科分類Synthesis Lectures on Quantum Computing
圖書封面Titlebook: Approximability of Optimization Problems through Adiabatic Quantum Computation;  William Cruz-Santos,Guillermo Morales-Luna Book 2014 Sprin
影響因子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

書目名稱Approximability of Optimization Problems through Adiabatic Quantum Computation影響因子(影響力)




書目名稱Approximability of Optimization Problems through Adiabatic Quantum Computation影響因子(影響力)學(xué)科排名




書目名稱Approximability of Optimization Problems through Adiabatic Quantum Computation網(wǎng)絡(luò)公開度




書目名稱Approximability of Optimization Problems through Adiabatic Quantum Computation網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Approximability of Optimization Problems through Adiabatic Quantum Computation被引頻次




書目名稱Approximability of Optimization Problems through Adiabatic Quantum Computation被引頻次學(xué)科排名




書目名稱Approximability of Optimization Problems through Adiabatic Quantum Computation年度引用




書目名稱Approximability of Optimization Problems through Adiabatic Quantum Computation年度引用學(xué)科排名




書目名稱Approximability of Optimization Problems through Adiabatic Quantum Computation讀者反饋




書目名稱Approximability of Optimization Problems through Adiabatic Quantum Computation讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:53:44 | 只看該作者
板凳
發(fā)表于 2025-3-22 01:37:29 | 只看該作者
地板
發(fā)表于 2025-3-22 05:45:39 | 只看該作者
1945-9726 f 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 solu
5#
發(fā)表于 2025-3-22 09:36:30 | 只看該作者
6#
發(fā)表于 2025-3-22 13:11:33 | 只看該作者
Wie Suchmaschinen funktionierenming, and artificial intelligence. Its importance is in modeling many branches of optimization problems into a general scheme based on quadratic forms. This general scheme can be used to design AQC algorithms by means of the Adiabatic Theorem in order to optimize the underlying pseudo-Boolean maps.
7#
發(fā)表于 2025-3-22 19:31:04 | 只看該作者
AQC for Pseudo-Boolean Optimization,ming, and artificial intelligence. Its importance is in modeling many branches of optimization problems into a general scheme based on quadratic forms. This general scheme can be used to design AQC algorithms by means of the Adiabatic Theorem in order to optimize the underlying pseudo-Boolean maps.
8#
發(fā)表于 2025-3-22 21:49:56 | 只看該作者
Synthesis Lectures on Quantum Computinghttp://image.papertrans.cn/b/image/160356.jpg
9#
發(fā)表于 2025-3-23 02:45:23 | 只看該作者
978-3-031-01391-1Springer Nature Switzerland AG 2014
10#
發(fā)表于 2025-3-23 09:01:56 | 只看該作者
Wie Suchmaschinen funktionierenming, and artificial intelligence. Its importance is in modeling many branches of optimization problems into a general scheme based on quadratic forms. This general scheme can be used to design AQC algorithms by means of the Adiabatic Theorem in order to optimize the underlying pseudo-Boolean maps.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-14 02:11
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
桐城市| 寿阳县| 漾濞| 自治县| 阳山县| 武夷山市| 子长县| 扎囊县| 边坝县| 东城区| 丹阳市| 甘孜| 乃东县| 舒兰市| 晋中市| 胶南市| 临湘市| 新安县| 阿拉善盟| 朝阳县| 台北县| 阳江市| 锡林郭勒盟| 崇明县| 吉隆县| 桦甸市| 治县。| 且末县| 颍上县| 墨玉县| 县级市| 永善县| 印江| 包头市| 屏东县| 蒙山县| 汉源县| 弥勒县| 井研县| 如东县| 天水市|