Quantum many-body simulation of finite-temperature systems with sampling a series expansion of a quantum imaginary-time evolution

• URL: http://arxiv.org/abs/2409.07070v2
• Date: Sun, 27 Oct 2024 05:44:18 GMT
• Title: Quantum many-body simulation of finite-temperature systems with sampling a series expansion of a quantum imaginary-time evolution
• Authors: Norifumi Matsumoto, Shoichiro Tsutsui, Yuya O. Nakagawa, Yuichiro Hidaka, Shota Kanasugi, Kazunori Maruyama, Hirotaka Oshima, Shintaro Sato,
• Abstract summary: Quantum computers are expected to enable us to simulate large systems at finite temperatures. We propose a method suitable for quantum devices in this early stage to calculate the thermal-equilibrium expectation value of an observable at finite temperatures.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Simulating thermal-equilibrium properties at finite temperature is crucial for studying quantum many-body systems. Quantum computers are expected to enable us to simulate large systems at finite temperatures, overcoming challenges faced by classical computers, like the sign problem of the quantum Monte-Carlo technique. Conventional methods suitable for fault-tolerant quantum computing (FTQC) devices are designed for studying large-scale quantum many-body systems but require a large number of ancilla qubits and a deep quantum circuit with many basic gates, making them unsuitable for the early stage of the FTQC era, at which the availability of qubits and quantum gates is limited. In this paper, we propose a method suitable for quantum devices in this early stage to calculate the thermal-equilibrium expectation value of an observable at finite temperatures. Our proposal, named the Markov-chain Monte Carlo with sampled pairs of unitaries (MCMC-SPU) algorithm, involves sampling simple quantum circuits and generating the corresponding statistical ensembles. This approach addresses the issues of resource demand and the decay in probability associated with postselection of measurement outcomes on ancilla qubits. We validate our proposal with numerical simulation on the one-dimensional transverse-field Ising model as an illustrative example.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Variational quantum simulation of the quantum critical regime [0.0]
  We propose a variational approach, which minimizes the variational free energy, to simulate and locate the quantum critical regime on a quantum computer. Our work suggests a practical way as well as a first step for investigating quantum critical systems at finite temperatures on quantum devices with few qubits.
  arXiv  Detail & Related papers  (2023-02-15T02:59:41Z)
• 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)
• 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)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Kernel-Function Based Quantum Algorithms for Finite Temperature Quantum Simulation [5.188498150496968]
  We present a quantum kernel function (QKFE) algorithm for solving thermodynamic properties of quantum many-body systems. As compared to its classical counterpart, namely the kernel method (KPM), QKFE has an exponential advantage in the cost of both time and memory. We demonstrate its efficiency with applications to one and two-dimensional quantum spin models, and a fermionic lattice.
  arXiv  Detail & Related papers  (2022-02-02T18:00:04Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Thermal variational quantum simulation on a superconducting quantum processor [15.94135317202682]
  We present experiments to demonstrate a hybrid quantum-classical simulation of thermal quantum states. By combining a classical probabilistic model and a 5-qubit programmable superconducting quantum processor, we prepare Gibbs states and excited states of Heisenberg XY and XXZ models. We show that the approach is scalable in the number of qubits, and has a self-verifiable feature, revealing its potentials in solving large-scale quantum statistical mechanics problems.
  arXiv  Detail & Related papers  (2021-07-13T16:37:54Z)
• Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale [57.84751206630535]
  We present a modernized version of the Quantum Virtual Machine (TNQVM) which serves as a quantum circuit simulation backend in the e-scale ACCelerator (XACC) framework. The new version is based on the general purpose, scalable network processing library, ExaTN, and provides multiple quantum circuit simulators. By combining the portable XACC quantum processors and the scalable ExaTN backend we introduce an end-to-end virtual development environment which can scale from laptops to future exascale platforms.
  arXiv  Detail & Related papers  (2021-04-21T13:26:42Z)
• 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)
• Continuous-variable assisted thermal quantum simulation [1.6530012863603747]
  We present an experimentally feasible quantum algorithm assisted with continuous-variable simulating for quantum systems at finite temperatures. It is found that the important crossover phase diagram of the Kitaev ring can be accurately simulated by a quantum computer with only a few qubits. We propose a protocol implementable with superconducting or trapped ion quantum computers.
  arXiv  Detail & Related papers  (2020-05-31T09:04:02Z)

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.