Measurement-Based Time Evolution for Quantum Simulation of Fermionic Systems

• URL: http://arxiv.org/abs/2110.14642v2
• Date: Wed, 10 Aug 2022 14:02:25 GMT
• Title: Measurement-Based Time Evolution for Quantum Simulation of Fermionic Systems
• Authors: Woo-Ram Lee, Zhangjie Qin, Robert Raussendorf, Eran Sela, V.W. Scarola
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum simulation using time evolution in phase estimation-based quantum algorithms can yield unbiased solutions of classically intractable models. However, long runtimes open such algorithms to decoherence. We show how measurement-based quantum simulation uses effective time evolution via measurement to allow runtime advantages over conventional circuit-based algorithms that use real-time evolution with quantum gates. We construct a hybrid algorithm to find energy eigenvalues in fermionic models using only measurements on graph states. We apply the algorithm to the Kitaev and Hubbard chains. Resource estimates show a runtime advantage if measurements can be performed faster than gates, and graph states compactification is fully used. In this letter, we set the stage to allow advances in measurement precision to improve quantum simulation.

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)
• Hybrid Quantum Algorithm for Simulating Real-Time Thermal Correlation Functions [0.0]
  We present a hybrid Path Integral Monte Carlo (hPIMC) algorithm to calculate real-time quantum thermal correlation functions. We show that the component of imaginary-time evolution can be performed accurately using the recently developed Probabilistic Imaginary-Time Evolution (PITE) algorithm.
  arXiv  Detail & Related papers  (2024-05-30T01:30:13Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Simulating Markovian open quantum systems using higher-order series expansion [1.713291434132985]
  We present an efficient quantum algorithm for simulating the dynamics of Markovian open quantum systems. Our algorithm is conceptually cleaner, and it only uses simple quantum primitives without compressed encoding.
  arXiv  Detail & Related papers  (2022-12-05T06:02:50Z)
• 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)
• Improved algorithms of quantum imaginary time evolution for ground and excited states of molecular systems [0.0]
  Quantum imaginary time evolution (QITE) is a recently proposed quantum-classical hybrid algorithm that is guaranteed to reach the lowest state of system. We analyze the derivation of the underlying QITE equation order-by-order, and suggest a modification that is theoretically well founded. We also discuss how to accurately estimate the norm of an imaginary-time-evolved state, and applied it to excited state calculations.
  arXiv  Detail & Related papers  (2022-05-04T10:32:16Z)
• 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)
• Evaluating low-depth quantum algorithms for time evolution on fermion-boson systems [0.0]
  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.
  arXiv  Detail & Related papers  (2021-06-07T22:03:17Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48: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)
• Low-depth Hamiltonian Simulation by Adaptive Product Formula [3.050399782773013]
  Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer. Here, we propose an adaptive approach to construct a low-depth time evolution circuit. Our work sheds light on practical Hamiltonian simulation with noisy-intermediate-scale-quantum devices.
  arXiv  Detail & Related papers  (2020-11-10T18:00:42Z)

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.