Mitigating Errors in Analog Quantum Simulation by Hamiltonian Reshaping or Hamiltonian Rescaling

• URL: http://arxiv.org/abs/2410.23719v1
• Date: Thu, 31 Oct 2024 08:10:51 GMT
• Title: Mitigating Errors in Analog Quantum Simulation by Hamiltonian Reshaping or Hamiltonian Rescaling
• Authors: Rui-Cheng Guo, Yanwu Gu, Dong E. Liu,
• Abstract summary: This work introduces two novel error mitigation strategies -- Hamiltonian reshaping and Hamiltonian rescaling -- in analog quantum simulation. Hamiltonian reshaping uses random unitary transformations to generate new Hamiltonians with identical eigenvalues but varied eigenstates. Hamiltonian rescaling mitigates errors by comparing eigenvalue estimates from energy-scaled Hamiltonians.
• Score: 0.0
• License:
• Abstract: Simulating quantum many-body systems is crucial for advancing physics and chemistry but poses substantial challenges for classical computers. Quantum simulations overcome these limitations, with analog simulators offering unique advantages over digital methods, such as lower systematic errors and reduced circuit depth, making them efficient for studying complex quantum phenomena. However, unlike their digital counterparts, analog quantum simulations face significant limitations due to the absence of effective error mitigation techniques. This work introduces two novel error mitigation strategies -- Hamiltonian reshaping and Hamiltonian rescaling -- in analog quantum simulation for tasks like eigen-energy evaluation. Hamiltonian reshaping uses random unitary transformations to generate new Hamiltonians with identical eigenvalues but varied eigenstates, allowing error reduction through averaging. Hamiltonian rescaling mitigates errors by comparing eigenvalue estimates from energy-scaled Hamiltonians. Numerical calculations validate both methods, demonstrating their significant practical effectiveness in enhancing the accuracy and reliability of analog quantum simulators.

Related papers

• Reducing circuit depth in adaptive variational quantum algorithms via effective Hamiltonian theories [8.24048506727803]
  We introduce a new transformation in the form of a product of a linear combination of excitation operators to construct the effective Hamiltonian with finite terms. The effective Hamiltonian defined with this new transformation is incorporated into the adaptive variational quantum algorithms to maintain constant-size quantum circuits.
  arXiv  Detail & Related papers  (2022-01-23T09:38:46Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Variational Adiabatic Gauge Transformation on real quantum hardware for effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
  We introduce the Variational Adiabatic Gauge Transformation (VAGT) VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit. The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
  arXiv  Detail & Related papers  (2021-11-16T20:50:08Z)
• 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)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• 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)
• Exploiting anticommutation in Hamiltonian simulation [21.306196108171164]
  Quantum computing can efficiently simulate Hamiltonian dynamics of many-body quantum physics. The hardness lies at the ubiquitous anti-commutative relations of quantum operators. We find that, contrary to our intuition, anti-commutative relations could also reduce the hardness of Hamiltonian simulation.
  arXiv  Detail & Related papers  (2021-03-14T18:13:15Z)
• Engineering analog quantum chemistry Hamiltonians using cold atoms in optical lattices [69.50862982117127]
  We benchmark the working conditions of the numerically analog simulator and find less demanding experimental setups. We also provide a deeper understanding of the errors of the simulation appearing due to discretization and finite size effects.
  arXiv  Detail & Related papers  (2020-11-28T11:23:06Z)
• Digital-Analog Quantum Simulations Using The Cross-Resonance Effect [0.0]
  Digital-analog quantum computation aims to reduce the currently infeasible resource requirements needed for near-term quantum information processing. We consider superconducting architectures and extend the cross-resonance effect, up to first order in theory, from a two-qubit interaction to an analog Hamiltonian acting on 1D chains and 2D square lattices.
  arXiv  Detail & Related papers  (2020-11-20T17:07:28Z)
• 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)
• Term Grouping and Travelling Salesperson for Digital Quantum Simulation [6.945601123742983]
  Digital simulation of quantum dynamics by evaluating the time evolution of a Hamiltonian is the initially proposed application of quantum computing. The large number of quantum gates required for emulating the complete second quantization form of the Hamiltonian makes such an approach unsuitable for near-term devices. We propose a new term ordering strategy, max-commute-tsp, that simultaneously mitigates both algorithmic and physical errors.
  arXiv  Detail & Related papers  (2020-01-16T18:33:24Z)

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.