Non-equilibrium Quantum Monte Carlo Algorithm for Stabilizer Rényi Entropy in Spin Systems

• URL: http://arxiv.org/abs/2405.19577v1
• Date: Wed, 29 May 2024 23:59:02 GMT
• Title: Non-equilibrium Quantum Monte Carlo Algorithm for Stabilizer Rényi Entropy in Spin Systems
• Authors: Zejun Liu, Bryan K. Clark,
• Abstract summary: Quantum magic, or nonstabilizerness, provides a crucial characterization of quantum systems. We propose a novel and efficient algorithm for computing stabilizer R'enyi entropy, one of the measures for quantum magic, in spin systems with sign-problem free Hamiltonians.
• Score: 0.552480439325792
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Quantum magic, or nonstabilizerness, provides a crucial characterization of quantum systems, regarding the classical simulability with stabilizer states. In this work, we propose a novel and efficient algorithm for computing stabilizer R\'enyi entropy, one of the measures for quantum magic, in spin systems with sign-problem free Hamiltonians. This algorithm is based on the quantum Monte Carlo simulation of the path integral of the work between two partition function ensembles and it applies to all spatial dimensions and temperatures. We demonstrate this algorithm on the one and two dimensional transverse field Ising model at both finite and zero temperatures and show the quantitative agreements with tensor-network based algorithms. Furthermore, we analyze the computational cost and provide both analytical and numerical evidences for it to be polynomial in system size.

Related papers

• Tensor-network-based variational Monte Carlo approach to the non-equilibrium steady state of open quantum systems [0.0]
  We introduce a novel method of efficiently simulating the non-equilibrium steady state of large many-body open quantum systems. Our approach outperforms and offers several advantages over comparable algorithms.
  arXiv  Detail & Related papers  (2024-05-20T14:10:53Z)
• Quantum tensor networks algorithms for evaluation of spectral functions on quantum computers [0.0]
  We investigate quantum algorithms derived from tensor networks to simulate the static and dynamic properties of quantum many-body systems. We demonstrate algorithms to prepare ground and excited states on a quantum computer and apply them to molecular nanomagnets (MNMs) as a paradigmatic example.
  arXiv  Detail & Related papers  (2023-09-26T18:01:42Z)
• 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)
• Calculating the many-body density of states on a digital quantum computer [58.720142291102135]
  We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer. We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
  arXiv  Detail & Related papers  (2023-03-23T17:46:28Z)
• Adaptive variational quantum minimally entangled typical thermal states for finite temperature simulations [0.0]
  We describe and benchmark a quantum computing version of the minimally entangled typical thermal states (METTS) algorithm. The algorithm, which we name AVQMETTS, dynamically generates compact and problem-specific quantum circuits.
  arXiv  Detail & Related papers  (2023-01-06T16:40:06Z)
• Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature [0.0]
  We establish an efficient approximation algorithm for the partition functions of a class of quantum spin systems at low temperature. Our algorithm is based on combining the contour representation of quantum spin systems of this type due to Borgs, Koteck'y, and Ueltschi.
  arXiv  Detail & Related papers  (2022-01-17T17:27:13Z)
• Quantum algorithm for stochastic optimal stopping problems with applications in finance [60.54699116238087]
  The famous least squares Monte Carlo (LSM) algorithm combines linear least square regression with Monte Carlo simulation to approximately solve problems in optimal stopping theory. We propose a quantum LSM based on quantum access to a process, on quantum circuits for computing the optimal stopping times, and on quantum techniques for Monte Carlo.
  arXiv  Detail & Related papers  (2021-11-30T12:21:41Z)
• 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)
• Continuous-variable neural-network quantum states and the quantum rotor model [2.3398944692275476]
  We study neural-network quantum state algorithms for analyzing continuous-variable lattice quantum systems in first quantization. A family of continuous-variable trial wavefunctons is introduced which naturally generalizes the Boltzmann machine (RBM) wavefunction. Results are compared against those obtained from partial differential equation (PDE) based scalable eigensolvers.
  arXiv  Detail & Related papers  (2021-07-15T03:53:14Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21:00Z)

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.