Quenching and annealing are extreme opposites in the time evolution of a quantum system: Annealing explores equilibrium phases of a Hamiltonian with slowly changing parameters and can be exploited as a tool for solving complex optimization problems. In contrast, quenches are sudden changes of the Hamiltonian, producing a non-equilibrium situation. Here, we investigate the relation between the two cases. Specifically, we show that the minimum of the annealing gap, which is an important bottleneck of quantum annealing algorithms, can be revealed from a dynamical quench parameter which describes the dynamical quantum state after the quench. Combined with statistical tools including the training of a neural network, the relation between quench and annealing dynamics can be exploited to reproduce the full functional behavior of the annealing gap from the quench data. We show that the partial or full knowledge about the annealing gap which can be gained in this way can be used to design optimized quantum annealing protocols with a practical time-to-solution benefit. Our results are obtained from simulating random Ising Hamiltonians, representing hard-to-solve instances of the exact cover problem.
Utilizing intermediate states in quantum annealing for multi-objective optimization
Graduate School of Science and Technology, Keio University(庆应义塾大学理工学研究科);Department of Applied Physics and Physico-Informatics, Keio University(庆应义塾大学应用物理及理化信息学系);Keio University Sustainable Quantum Artificial Intelligence Center (KSQAIC), Keio University(庆应义塾大学可持续量子人工智能中心);Human Biology-Microbiome-Quantum Research Center (WPI-Bio2Q), Keio University(庆应义塾大学生物人类学-微生物组-量子研究中心);Green Computing System Research Organization, Waseda University(早稻田大学绿色计算系统研究组织)
Dynamics of quantum Fisher and Wigner-Yanase skew information following a noisy quench
Ilam University(伊利姆大学);University of Kaiserslautern(凯泽斯劳滕工业大学);Beijing Institute of Mathematical Sciences and Applications(北京应用数学与物理研究所);Shanghai Jiao Tong University(上海交通大学)
Entanglement generation and scaling from noisy quenches across a quantum critical point
Institute for Advanced Studies in Basic Sciences (IASBS)(基础科学高级研究所);Institute for Research in Fundamental Sciences (IPM)(基本科学研究中心);University of Gothenburg(哥德堡大学);Ilam University(伊拉姆大学);Sharif University of Technology(谢里夫理工大学)
Quantum Computing Approaches for Mission Covering Optimization
我们研究量子计算算法来解决某些受限的资源分配问题,我们称之为任务覆盖优化(MCO)。我们分别使用以下度量标准在D-Wave和IBM机器上比较使用量子退火技术和量子交替算子Answer(Hadfield et al. arXiv:1709.03489v2,量子近似优化算法的广义算法,Farhi et al. arXiv:1411.4028v1)的约束优化问题的公式:成本,时间,约束保持和使用的量子位。我们提供了两种不同的MCO方案的结果和分析结果。
Kipu Quantum GmbH(基普量子有限公司);University of the Basque Country EHU(巴斯克大学);University of Luxembourg(卢森堡大学);Donostia International Physics Center(圣塞巴斯蒂安国际物理中心)
Optimizing the Production of Test Vehicles using Hybrid Constrained Quantum Annealing
预生产车辆配置的优化是汽车行业的挑战之一。给定一个需要具有某些特征的汽车的测试列表,希望找到覆盖测试并遵守配置规则的最少数量的汽车。在本文中,我们模型的可满足性的框架下,并解决它,利用新引入的混合约束二次模型(CQM)求解器提供的D-Wave。问题定义基于宝马量子计算挑战赛中给出的“优化测试车辆的生产”用例。我们制定了一个约束二次模型的问题,并使用贪婪算法来配置汽车。我们将CQM求解器的结果与CBC(Coin-or branch and cut)和Guidelines等经典求解器的结果进行基准测试。我们的结论是,CQM求解器的性能相比,经典的求解器在优化测试车辆的数量。作为问题的扩展,我们描述了如何调度的测试可以纳入模型。