Hybrid Quantum Annealing via Molecular Dynamics
- URL: http://arxiv.org/abs/2004.03972v2
- Date: Mon, 19 Apr 2021 09:24:37 GMT
- Title: Hybrid Quantum Annealing via Molecular Dynamics
- Authors: Hirotaka Irie, Haozhao Liang, Takumi Doi, Shinya Gongyo, Tetsuo
Hatsuda
- Abstract summary: We introduce a Hamiltonian dynamics of the classical flux variables associated with the quantum spins of the transverse-field Ising model.
Molecular dynamics of the classical flux can be used as a powerful preconditioner to sort out the frozen and ambivalent spins for quantum annealers.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A novel quantum-classical hybrid scheme is proposed to efficiently solve
large-scale combinatorial optimization problems. The key concept is to
introduce a Hamiltonian dynamics of the classical flux variables associated
with the quantum spins of the transverse-field Ising model. Molecular dynamics
of the classical fluxes can be used as a powerful preconditioner to sort out
the frozen and ambivalent spins for quantum annealers. The performance and
accuracy of our smooth hybridization in comparison to the standard classical
algorithms (the tabu search and the simulated annealing) are demonstrated by
employing the MAX-CUT and Ising spin-glass problems.
Related papers
- Hybrid Tree Tensor Networks for quantum simulation [0.0]
We introduce a novel algorithm to perform ground state optimizations with hybrid Tree Networks (hTTNs)
We successfully demonstrate that hTTNs can improve upon classical equivalents with equal bond dimension in the classical part.
arXiv Detail & Related papers (2024-04-08T18:00:00Z) - Towards Efficient Quantum Hybrid Diffusion Models [68.43405413443175]
We propose a new methodology to design quantum hybrid diffusion models.
We propose two possible hybridization schemes combining quantum computing's superior generalization with classical networks' modularity.
arXiv Detail & Related papers (2024-02-25T16:57:51Z) - Hybrid Quantum-Classical Multilevel Approach for Maximum Cuts on Graphs [1.7720089167719628]
We introduce a scalable hybrid multilevel approach to solve large instances of Max-Cut.
We show that using QAOA within our framework is comparable to classical approaches.
arXiv Detail & Related papers (2023-09-15T23:54:46Z) - Improved precision scaling for simulating coupled quantum-classical
dynamics [0.17126708168238122]
We present a super-polynomial improvement in the precision scaling of quantum simulations for coupled classical-quantum systems.
By employing a framework based on the Koopman-von Neumann formalism, we express the Liouville equation of motion as unitary dynamics.
We demonstrate that these simulations can be performed in both microcanonical and canonical ensembles.
arXiv Detail & Related papers (2023-07-24T18:00:03Z) - Variational Quantum Algorithms for Simulation of Lindblad Dynamics [0.0]
We introduce a variational hybrid classical-quantum algorithm to simulate the Lindblad master equation and its adjoint for time-evolving Markovian open quantum systems and quantum observables.
We design and optimize low-depth variational quantum circuits that efficiently capture the unitary and non-unitary dynamics of the solutions.
arXiv Detail & Related papers (2023-05-04T13:25:44Z) - A hybrid quantum-classical algorithm for multichannel quantum scattering
of atoms and molecules [62.997667081978825]
We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions.
The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix.
We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
arXiv Detail & Related papers (2023-04-12T18:10:47Z) - A self-consistent field approach for the variational quantum
eigensolver: orbital optimization goes adaptive [52.77024349608834]
We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE)
This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
arXiv Detail & Related papers (2022-12-21T23:15:17Z) - Hybrid Quantum-Classical Algorithm for Hydrodynamics [0.0]
A new model of nonlinear charged quantum relativistic fluids is presented.
The model can be discretized into Discrete Time Quantum Walks (DTQWs)
A new hybrid (quantum-classical) algorithm is proposed for implementing these walks on NISQ devices.
arXiv Detail & Related papers (2022-02-02T08:46:35Z) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron
Correlation [58.720142291102135]
We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer.
We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
arXiv Detail & Related papers (2021-06-22T18:00:00Z) - Error mitigation and quantum-assisted simulation in the error corrected
regime [77.34726150561087]
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations.
We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
arXiv Detail & Related papers (2021-03-12T20:58:41Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.