Quantum-Inspired Algorithm for Classical Spin Hamiltonians Based on Matrix Product Operators
Graduate School of Engineering Science, The University of Osaka(大阪大学工学研究科);Center for Computational Quantum Physics, Flatiron Institute(平顿研究所计算量子物理中心);Center for Quantum Information and Quantum Biology, Osaka University(大阪大学量子信息与量子生物学中心);RIKEN Center for Computational Science (R-CCS)(理化学研究所计算科学中心)
Ryo Watanabe, Joseph Tindall, Shohei Miyakoshi, Hiroshi Ueda
We propose a tensor-network (TN) approach for solving classical optimization problems that is inspired by spectral filtering and sampling on quantum states. We first shift and scale an Ising Hamiltonian of the cost function so that all eigenvalues become non-negative and the ground states correspond to the the largest eigenvalues, which are then amplified by power iteration. We represent the transformed Hamiltonian as a matrix product operator (MPO) and form an immense power of this object via truncated MPO-MPO contractions, embedding the resulting operator into a matrix product state for sampling in the computational basis. In contrast to the density-matrix renormalization group, our approach provides a straightforward route to systematic improvement by increasing the bond dimension and is better at avoiding local minima. We also study the performance of this power method in the context of a higher-order Ising Hamiltonian on a heavy-hexagonal lattice, making a comparison with simulated annealing. These results highlight the potential of quantum-inspired algorithms for solving optimization problems and provide a baseline for assessing and developing quantum algorithms.
Partition Function Estimation: Quantum and Quantum-Inspired Algorithms
我们提出了两个算法,一个量子和一个经典的,估计配分函数的量子自旋哈密顿量。前者是一个DQC 1(一个干净量子位的确定性量子计算)算法,也是第一个用于复杂温度的算法。对于实际温度,后者实现了与最先进的DQC 1算法相当的性能[Chowdhury et al. Phys. Rev. A 103,032422(2021)]。我们的两个算法作为输入的哈密顿分解为一个线性组合泡利算子。我们表明,这种分解是DQC 1-硬为一个给定的哈密顿量,提供了新的见解估计配分函数的硬度。
Quantum annealing inspired algorithms for the NISQ Era
Jülich Supercomputing Centre, Forschungszentrum Jülich(于利希超级计算中心,于利希研究中心);RWTH Aachen University(亚琛工业大学);Modular Supercomputing and Quantum Computing, Goethe University Frankfurt(法兰克福歌德大学模块化超算与量子计算);Department of Computer Science, University of Cologne(科隆大学计算机科学系)
Beyond Ground States: Physics-Inspired Optimization of Excited States of Classical Hamiltonians
ICFO-Institut de Ciencies Fotoniques, The Barcelona Institute of Science and Technology(光子科学研究所,巴塞罗那科技研究所);ICREA-Institucio Catalana de Recerca i Estudis Avançats(加泰罗尼亚研究高级学院)
Reversible simulation of bipartite product Hamiltonians
考虑两个量子系统A和B按照乘积哈密顿量H = H_A x H_B相互作用。我们表明,任何两个这样的汉密尔顿都可以用来可逆地相互模拟(即,没有效率损失)。因此,乘积哈密顿量的所有非定域特征--包括它可用于产生纠缠、传输经典或量子信息或模拟其他哈密顿量的速率--仅取决于单个参数。我们确定这个参数,并使用它来获得一个明确的表达的纠缠能力的所有产品的哈密顿量。最后,我们将展示如何模拟的概念导致一个自然的制定措施的强度的非局部哈密顿。
Ergodicity breaking in matrix-product-state effective Hamiltonians
School of Physics and Astronomy, University of Leeds(利兹大学物理与天文学院);University of Nottingham(诺丁汉大学);Centre for the Mathematics and Theoretical Physics of Quantum Non-Equilibrium Systems, University of Nottingham(诺丁汉大学量子非平衡系统数学与理论物理中心)
Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing
我们提出了两个量子算法的基础上的进化随机化,绝热量子计算的一个简单的变种,准备一个量子态$\vert x \rangle$,是成比例的线性方程组$A \vec{x}=\vec{b}$的系统的解决方案。我们的算法的时间复杂度是$O(κ^2 \log(κ)/ε)$和$O(κ\log(κ)/ε)$,其中$κ$是$A$的条件数,$ε$是精度。这两种算法都是使用家庭的哈密尔顿是线性组合的产品$A$,投影到初始状态$\vert b \rangle$,和单量子位泡利运营商。算法概念简单,易于实现。它们不是从门模型和绝热量子计算之间的等价关系得到的。它们不使用相位估计或可变时间幅度放大,并且不需要大型辅助系统。我们讨论了一个基于门的实现,通过哈密顿模拟,并证明我们的第二个算法几乎是最佳的$κ$。像以前的方法一样,我们的技术在一些假设下产生指数量子加速。我们的研究结果强调了基于哈密顿的量子计算模型在发现重要算法中的作用。
Physics-inspired transformer quantum states via latent imaginary-time evolution
Graduate School of Information Science and Technology, The University of Osaka(信息科学与技术研究生学校,大阪大学);Fujitsu Laboratories, Fujitsu Limited(富士通实验室,富士通有限公司);Center for Advanced Intelligence Project, RIKEN(先进智能项目中心,理化学研究所)
Heisenberg-Limited Quantum Hamiltonian Learning via Randomly Spread Product-States
ICFO - The Institute of Photonic Sciences(光子科学研究所);Forschungszentrum Jülich, Institute of Quantum Control, Peter Grünberg Institut (PGI-8)(于利希研究中心量子控制研究所彼得·格林伯格研究所);Quside Technologies SL(Quside科技有限公司)
Perturbation Theory for Parent Hamiltonians of Matrix Product States
本文研究了矩阵乘积态的正则母哈密顿量的基态子空间对局部扰动的稳定性。我们证明了这样的哈密顿量的谱隙在弱的局部扰动下保持稳定,即使在热力学极限下,整个扰动可能没有界。我们的讨论是基于D.A. Yarotsky以前的工作,该工作发展了经典哈密顿量的相对有界量子微扰的微扰理论。我们利用重整化过程,在大尺度上将矩阵乘积态的父哈密顿量转化为经典哈密顿量加上一些微扰。因此,我们可以推广D.A.Yarotsky的结果,为矩阵乘积态的母体哈密顿量提供一个微扰理论,并恢复了S. Michalakis等人[arXiv:1109.1588]和J. I. Cirac等人[arXiv:1306.4003]。
Traversability dynamics of minimal Sachdev-Ye-Kitaev Wormhole-inspired teleportation protocol with a parity-time ($\mathcal{PT}$)-symmetric non-Hermitian deformation
Indian Institute of Technology (Banaras Hindu University)(印度技术学院(贝拿勒斯印度教大学))
A Hamiltonian-Inspired Local-Operator Ansatz for Slimming Large Language Models
School of Physical Sciences, University of Chinese Academy of Sciences(中国科学院大学物理科学学院);Kavli Institute for Theoretical Sciences, University of Chinese Academy of Sciences(中国科学院大学理论科学研究院);Center for Quantum Physics and Intelligent Sciences, Department of Physics, Capital Normal University(首都师范大学量子物理与智能科学中心);Institute of Theoretical Physics, Chinese Academy of Sciences(中国科学院理论物理研究所)