Hybrid quantum-classical algorithm for the transverse-field Ising model in the thermodynamic limit

• URL: http://arxiv.org/abs/2310.07600v1
• Date: Wed, 11 Oct 2023 15:41:09 GMT
• Title: Hybrid quantum-classical algorithm for the transverse-field Ising model in the thermodynamic limit
• Authors: Sumeet, M. H\"ormann, K.P. Schmidt
• Abstract summary: We describe a hybrid quantum-classical approach to treat quantum many-body systems in the thermodynamic limit. This is done by combining numerical linked-cluster expansions (NLCE) with the variational quantum eigensolver (VQE)
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We describe a hybrid quantum-classical approach to treat quantum many-body systems in the thermodynamic limit. This is done by combining numerical linked-cluster expansions (NLCE) with the variational quantum eigensolver (VQE). Here, the VQE algorithm is used as a cluster solver within the NLCE. We test our hybrid quantum-classical algorithm (NLCE$+$VQE) for the ferromagnetic transverse-field Ising model on the one-dimensional chain and the two-dimensional square lattice. The calculation of ground-state energies on each open cluster demands a modified Hamiltonian variational ansatz for the VQE. One major finding is convergence of NLCE$+$VQE to the conventional NLCE result in the thermodynamic limit when at least $N/2$ layers are used in the VQE ansatz for each cluster with $N$ sites. Our approach demonstrates the fruitful connection of techniques known from correlated quantum many-body systems with hybrid algorithms explored on existing quantum-computing devices.

Related papers

• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• 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)
• Variational Coherent Quantum Annealing [0.0]
  We present a hybrid classical-quantum computing paradigm where the quantum part strictly runs within the coherence time of a quantum annealer. We introduce auxiliary Hamiltonians that vanish at the beginning and end of the evolution to increase the energy gap during the process. We achieve a substantial reduction in the ground-state error with just six variational parameters and a duration within the device coherence times.
  arXiv  Detail & Related papers  (2023-10-03T17:53:03Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• 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)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• Adapting the HHL algorithm to quantum many-body theory [0.0]
  We implement the Harrow-Hassidim-Lloyd (HHL) algorithm to make precise predictions of correlation energies for light molecular systems. We introduce the following variants of HHL for different eras of quantum computing. We demonstrate the ability of the NISQ variant of AdaptHHLite to capture correlation energy precisely.
  arXiv  Detail & Related papers  (2022-12-30T15:38:59Z)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• Hybrid Quantum Classical Simulations [0.0]
  We report on two major hybrid applications of quantum computing, namely, the quantum approximate optimisation algorithm (QAOA) and the variational quantum eigensolver (VQE) Both are hybrid quantum classical algorithms as they require incremental communication between a classical central processing unit and a quantum processing unit to solve a problem.
  arXiv  Detail & Related papers  (2022-10-06T10:49:15Z)
• Variational Quantum Eigensolver with Reduced Circuit Complexity [3.1158760235626946]
  We present a novel approach to reduce quantum circuit complexity in VQE for electronic structure calculations. Our algorithm, called ClusterVQE, splits the initial qubit space into subspaces (qubit clusters) which are further distributed on individual quantum circuits. The new algorithm simultaneously reduces the number of qubits and circuit depth, making it a potential leader for quantum chemistry simulations on NISQ devices.
  arXiv  Detail & Related papers  (2021-06-14T17:23:46Z)
• Simulating periodic systems on quantum computer [7.332046127518237]
  We present two schemes to improve the accuracy of quantum simulations for extended systems. One is a modified VQE algorithm, which introduces a unitary transformation of Hartree-Fock orbitals to avoid the complex Hamiltonian. The second is a Post-VQE approach combining VQE with the quantum subspace expansion approach (VQE/QSE)
  arXiv  Detail & Related papers  (2020-08-07T01:56:32Z)

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.