Predicting Arbitrary State Properties from Single Hamiltonian Quench Dynamics

• URL: http://arxiv.org/abs/2311.00695v2
• Date: Fri, 15 Mar 2024 01:47:07 GMT
• Title: Predicting Arbitrary State Properties from Single Hamiltonian Quench Dynamics
• Authors: Zhenhuan Liu, Zihan Hao, Hong-Ye Hu,
• Abstract summary: We introduce the Hamiltonian shadow protocol, which estimates arbitrary state properties on analog quantum simulators. The protocol does not require sophisticated control and can be applied to a wide range of analog quantum simulators.
• Score: 0.8639941465436463
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Analog quantum simulation is an essential routine for quantum computing and plays a crucial role in studying quantum many-body physics. Typically, the quantum evolution of an analog simulator is largely determined by its physical characteristics, lacking the precise control or versatility of quantum gates. This limitation poses challenges in extracting physical properties on analog quantum simulators, an essential step of quantum simulations. To address this issue, we introduce the Hamiltonian shadow protocol, which uses a single quench Hamiltonian for estimating arbitrary state properties, eliminating the need for ancillary systems and random unitaries. Additionally, we derive the sample complexity of this protocol and show that it performs comparably to the classical shadow protocol. The Hamiltonian shadow protocol does not require sophisticated control and can be applied to a wide range of analog quantum simulators. We demonstrate its utility through numerical demonstrations with Rydberg atom arrays under realistic parameter settings. The new protocol significantly broadens the application of randomized measurements for analog quantum simulators without precise control and ancillary systems.

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)
• The Cost of Emulating a Small Quantum Annealing Problem in the Circuit-Model [2.287415292857564]
  We show that the overhead of emulation is substantial even for a simple problem. This supports using analog quantum computation for solving time-dependent Hamiltonian dynamics in the short and mid-term.
  arXiv  Detail & Related papers  (2024-02-27T16:41:54Z)
• SimuQ: A Framework for Programming Quantum Hamiltonian Simulation with Analog Compilation [10.500024141116675]
  We design and implement SimuQ, the first framework for quantum Hamiltonian simulation. SimuQ supports Hamiltonian programming and pulse-level compilation to heterogeneous analog quantum simulators. We demonstrate the advantages of exposing the Hamiltonian-level programmability of devices with native operations or interaction-based gates.
  arXiv  Detail & Related papers  (2023-03-05T21:28:05Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Measuring Arbitrary Physical Properties in Analog Quantum Simulation [0.5999777817331317]
  A central challenge in analog quantum simulation is to characterize desirable physical properties of quantum states produced in experiments. We propose and analyze a scalable protocol that leverages the ergodic nature of generic quantum dynamics. Our protocol excitingly promises to overcome limited controllability and, thus, enhance the versatility and utility of near-term quantum technologies.
  arXiv  Detail & Related papers  (2022-12-05T19:00:01Z)
• 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)
• Benchmarking Quantum Simulators using Ergodic Quantum Dynamics [4.2392660892009255]
  We analyze a sample-efficient protocol to estimate the fidelity between an experimentally prepared state and an ideal state. We numerically demonstrate our protocol for a variety of quantum simulator platforms.
  arXiv  Detail & Related papers  (2022-05-24T17:18:18Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19: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)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• Entanglement Hamiltonian Tomography in Quantum Simulation [0.0]
  Entanglement in quantum simulators is an outstanding challenge in today's era of intermediate scale quantum devices. Here we discuss an efficient tomographic protocol for reconstructing reduced density matrices and entanglement spectra for spin systems. We show the validity and efficiency of the protocol for a long-range Ising model in 1D using numerical simulations.
  arXiv  Detail & Related papers  (2020-09-18T18:12:22Z)

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.