Quantum-inspired search method for low-energy states of classical Ising Hamiltonians

• URL: http://arxiv.org/abs/2010.00180v2
• Date: Tue, 24 Aug 2021 07:22:30 GMT
• Title: Quantum-inspired search method for low-energy states of classical Ising Hamiltonians
• Authors: Hiroshi Ueda, Yuichi Otsuka and Seiji Yunoki
• Abstract summary: We develop a quantum-inspired numerical procedure for searching low-energy states of a classical Hamiltonian composed of two-body fully-connected random Ising interactions. We consider 120 instances of the random coupling realizations for the random Ising Hamiltonian with $N$ up to 600 and search the 120 lowest-energy states for each instance.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We develop a quantum-inspired numerical procedure for searching low-energy states of a classical Hamiltonian composed of two-body fully-connected random Ising interactions and a random local longitudinal magnetic field. In this method, we introduce infinitesimal quantum interactions that do not commute with the original Ising Hamiltonian, and repeatedly generate and truncate direct product states, inspired by the Krylov subspace method, to obtain the low-energy states of the original classical Ising Hamiltonian. The computational cost is controlled by the form of infinitesimal quantum interactions (e.g., one-body or two-body interactions) and the numbers of infinitesimal interaction terms introduced, different initial states considered, and low-energy states kept during the iteration. For a demonstrate of the method, here we introduce as the infinitesimal quantum interactions pair products of Pauli $X$ operators acting on different sites and on-site Pauli $X$ operators into the random Ising Hamiltonian, in which the numerical cost is $O(N^3)$ per iteration with the system size $N$. We consider 120 instances of the random coupling realizations for the random Ising Hamiltonian with $N$ up to 600 and search the 120 lowest-energy states for each instance. We find that the time-to-solution by the quantum-inspired method proposed here, with parallelization in terms of the different initial states, for searching the ground state of the random Ising Hamiltonian scales approximately as $N^5$ for $N$ up to 600. We also examine the basic physical properties such as the ensemble-averaged ground-state and first-excited energies and the ensemble-averaged number of states in the low-energy region of the random Ising Hamiltonian.

Related papers

• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Quantum random power method for ground state computation [0.0]
  We present a quantum-classical hybrid random power method that approximates a Hamiltonian ground state. We show that our method converges to an approximation of a ground state of the Hamiltonian.
  arXiv  Detail & Related papers  (2024-08-16T06:41:16Z)
• Hamiltonians for Quantum Systems with Contact Interactions [49.1574468325115]
  We show that in the limit one obtains the one-body Hamiltonian for the light particle subject to $N$ (non-local) point interactions placed at fixed positions. We will verify that such non-local point interactions do not exhibit the ultraviolet pathologies that are present in the case of standard local point interactions.
  arXiv  Detail & Related papers  (2024-07-09T14:04:11Z)
• Beating Grover search for low-energy estimation and state preparation [0.23034630097498876]
  Estimating ground state energies of many-body Hamiltonians is a central task in many areas of quantum physics. In this work, we give quantum algorithms which, given any $k$-body Hamiltonian $H$, compute an estimate for the ground state energy.
  arXiv  Detail & Related papers  (2024-07-03T12:47:06Z)
• Observing super-quantum correlations across the exceptional point in a single, two-level trapped ion [48.7576911714538]
  In two-level quantum systems - qubits - unitary dynamics theoretically limit these quantum correlations to $2qrt2$ or 1.5 respectively. Here, using a dissipative, trapped $40$Ca$+$ ion governed by a two-level, non-Hermitian Hamiltonian, we observe correlation values up to 1.703(4) for the Leggett-Garg parameter $K_3$. These excesses occur across the exceptional point of the parity-time symmetric Hamiltonian responsible for the qubit's non-unitary, coherent dynamics.
  arXiv  Detail & Related papers  (2023-04-24T19:44:41Z)
• Parent Hamiltonian Reconstruction via Inverse Quantum Annealing [0.0]
  Finding a local Hamiltonian $hatmathcalH$ having a given many-body wavefunction $|psirangle$ as its ground state, i.e. a parent Hamiltonian, is a challenge of fundamental importance in quantum technologies. We introduce a numerical method that efficiently performs this task through an artificial inverse dynamics. We illustrate the method on two paradigmatic models: the Kitaev fermionic chain and a quantum Ising chain in longitudinal and transverse fields.
  arXiv  Detail & Related papers  (2023-03-20T15:32:51Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Dynamical Self-energy Mapping (DSEM) for quantum computing [0.0]
  For noisy intermediate-scale quantum (NISQ) devices only a moderate number of qubits with a limited coherence is available. We present how to bypass this challenge in practical molecular chemistry simulations on NISQ devices by employing a classical-quantum hybrid algorithm.
  arXiv  Detail & Related papers  (2020-10-12T04:12:21Z)
• Variational Monte Carlo calculations of $\mathbf{A\leq 4}$ nuclei with an artificial neural-network correlator ansatz [62.997667081978825]
  We introduce a neural-network quantum state ansatz to model the ground-state wave function of light nuclei. We compute the binding energies and point-nucleon densities of $Aleq 4$ nuclei as emerging from a leading-order pionless effective field theory Hamiltonian.
  arXiv  Detail & Related papers  (2020-07-28T14:52:28Z)
• Quantum Zeno approach for molecular energies with maximum commuting initialHamiltonians [0.0]
  We use a quantum adiabatic and simulated-annealing framework to compute the ground state of small molecules. In addition to the ground state, the low lying excited states canbe obtained using this quantum Zeno approach with equal accuracy to that of the ground state.
  arXiv  Detail & Related papers  (2020-06-01T16:43:22Z)

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.