Evaluating low-depth quantum algorithms for time evolution on fermion-boson systems

• URL: http://arxiv.org/abs/2106.03985v2
• Date: Fri, 18 Jun 2021 16:47:47 GMT
• Title: Evaluating low-depth quantum algorithms for time evolution on fermion-boson systems
• Authors: Nathan Fitzpatrick, Harriet Apel and David Mu\~noz Ramo
• Abstract summary: Simulating time evolution of quantum systems is one of the most promising applications of quantum computing. We propose the Jaynes-Cummings model and extensions to it as useful toy models to investigate time evolution algorithms on near-term quantum computers.
• Score: 0.0
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Simulating time evolution of quantum systems is one of the most promising applications of quantum computing and also appears as a subroutine in many applications such as Green's function methods. In the current era of NISQ machines we assess the state of algorithms for simulating time dynamics with limited resources. We propose the Jaynes-Cummings model and extensions to it as useful toy models to investigate time evolution algorithms on near-term quantum computers. Using these simple models, direct Trotterisation of the time evolution operator produces deep circuits, requiring coherence times out of reach on current NISQ hardware. Therefore we test two alternative responses to this problem: variational compilation of the time evolution operator, and variational quantum simulation of the wavefunction ansatz. We demonstrate numerically to what extent these methods are successful in time evolving this system. The costs in terms of circuit depth and number of measurements are compared quantitatively, along with other drawbacks and advantages of each method. We find that computational requirements for both methods make them suitable for performing time evolution simulations of our models on NISQ hardware. Our results also indicate that variational quantum compilation produces more accurate results than variational quantum simulation, at the cost of a larger number of measurements.

Related papers

• Trotterless Simulation of Open Quantum Systems for NISQ Quantum Devices [0.0]
  We propose a new simulation method based on the derivation of a Kraus operator series representation of the system. We identify a class of open quantum systems for which this method produces circuits of time-independent depth.
  arXiv  Detail & Related papers  (2024-10-04T18:37:49Z)
• Programmable quantum simulations on a trapped-ions quantum computer with a global drive [0.0]
  We experimentally demonstrate a method for quantum simulations on a small-scale trapped ions-based quantum computer. We measure the evolution of a quantum Ising ring and accurately reconstruct the Hamiltonian parameters, showcasing an accurate and high-fidelity simulation.
  arXiv  Detail & Related papers  (2023-08-30T13:49:05Z)
• Robust Extraction of Thermal Observables from State Sampling and Real-Time Dynamics on Quantum Computers [49.1574468325115]
  We introduce a technique that imposes constraints on the density of states, most notably its non-negativity, and show that this way, we can reliably extract Boltzmann weights from noisy time series. Our work enables the implementation of the time-series algorithm on present-day quantum computers to study finite temperature properties of many-body quantum systems.
  arXiv  Detail & Related papers  (2023-05-30T18:00:05Z)
• Stochastic Approximation of Variational Quantum Imaginary Time Evolution [0.716879432974126]
  In quantum computers, the imaginary-time evolution of quantum states is integral to various fields. Here, we suggest a approach to variational quantum imaginary-time evolution, which allows a significant reduction in runtimes. We demonstrate the efficiency of our algorithm in simulations and show a hardware experiment performing the imaginary-time evolution of the transverse field Ising model on 27 qubits.
  arXiv  Detail & Related papers  (2023-05-11T18:00: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)
• Time Evolution of Uniform Sequential Circuits [0.16385815610837165]
  We present a hybrid quantum-classical scaling algorithm for time evolving a one-dimensional uniform system in the thermodynamic limit. We show numerically that this anatzs requires a number of parameters in the simulation time for a given accuracy. All steps of the hybrid optimization are designed with near-term digital quantum computers in mind.
  arXiv  Detail & Related papers  (2022-10-07T18:00:01Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Measurement-Based Time Evolution for Quantum Simulation of Fermionic Systems [0.0]
  We show how measurement-based quantum simulation uses effective time evolution via measurement to allow runtime advantages. We construct a hybrid algorithm to find energy eigenvalues in fermionic models using only measurements on graph states.
  arXiv  Detail & Related papers  (2021-10-27T18:00:00Z)
• 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)
• 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)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)

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.