Error-Mitigated Hamiltonian Simulation: Complexity Analysis and Optimization for Near-Term and Early-Fault-Tolerant Quantum Computers

• URL: http://arxiv.org/abs/2603.11527v1
• Date: Thu, 12 Mar 2026 04:29:24 GMT
• Title: Error-Mitigated Hamiltonian Simulation: Complexity Analysis and Optimization for Near-Term and Early-Fault-Tolerant Quantum Computers
• Abstract summary: We analyze noisy Hamiltonian simulation with quantum error mitigation for Trotterized and randomized LCU-based Hamiltonian simulation algorithms.<n>We quantify the noise-characterization cost required for error mitigation via gate set tomography and the recently proposed space-time noise inversion method.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Simulating real-time dynamics under a Hamiltonian is a central goal of quantum information science. While numerous Hamiltonian-simulation quantum algorithms have been proposed, the effects of physical noise have rarely been incorporated into performance analysis, despite the non-negligible noise levels in quantum devices. In this work, we analyze noisy Hamiltonian simulation with quantum error mitigation for Trotterized and randomized LCU-based Hamiltonian simulation algorithms. We give an end-to-end comprehensive complexity analysis of error-mitigated Hamiltonian simulation algorithms using the mean-squared error. Because quantum error mitigation incurs an exponential cost with the number of layers in quantum algorithms, there is a trade-off between the sampling cost and the bias in simulation accuracy or the algorithmic sampling overhead. Optimizing this trade-off, we derive an analytic depth-selection rule and characterize the optimal end-to-end scaling as a function of target accuracy and noise parameters. We further quantify the noise-characterization cost required for error mitigation via gate set tomography and the recently proposed space-time noise inversion method, showing that the latter can significantly reduce the characterization overhead.

Related papers

• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
  Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Prospects of Quantum Error Mitigation for Quantum Signal Processing [0.0]
  This work explores the performance of zero-noise-extrapolation (ZNE) on a Hamiltonian simulation algorithm designed within quantum signal processing (QSP)<n>We quantify for which noise and depth regimes our ZNE protocol can recover an approximation of the noiseless expectation value.<n>We briefly discuss and present a numerical study on the region where ZNE is unusable, even given an unlimited sample budget.
  arXiv  Detail & Related papers  (2025-05-08T19:49:54Z)
• Exponentially Decaying Quantum Simulation Error with Noisy Devices [12.841022919599341]
  We show that noise in current quantum hardware poses a significant obstacle to quantum simulation.<n>We prove that the physical error but also the algorithmic error in a single Trotter step decreases exponentially with the circuit depth.<n>This work provides fresh and systematic insight on the practical quantum advantage through quantum simulation.
  arXiv  Detail & Related papers  (2025-04-14T14:10:24Z)
• Noise-resilient and resource-efficient hybrid algorithm for robust quantum gap estimation [0.0]
  We present a hybrid quantum algorithm for estimating gaps in many-body energy spectra.<n>We employ error mitigation strategies that optimize the utilization of quantum resources.<n>Results underscore the potential to enable accurate quantum simulations on near-term noisy quantum devices.
  arXiv  Detail & Related papers  (2024-05-16T17:57:15Z)
• Lindblad-like quantum tomography for non-Markovian quantum dynamical maps [46.350147604946095]
  We introduce Lindblad-like quantum tomography (L$ell$QT) as a quantum characterization technique of time-correlated noise in quantum information processors.<n>We discuss L$ell$QT for the dephasing dynamics of single qubits in detail, which allows for a neat understanding of the importance of including multiple snapshots of the quantum evolution in the likelihood function.
  arXiv  Detail & Related papers  (2024-03-28T19:29:12Z)
• Classical simulations of noisy variational quantum circuits [0.0]
  Noisely affects quantum computations so that they not only become less accurate but also easier to simulate classically as systems scale up. We construct a classical simulation algorithm, LOWESA, for estimating expectation values of noisy parameterised quantum circuits.
  arXiv  Detail & Related papers  (2023-06-08T17:52:30Z)
• 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)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• 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)
• Modeling and mitigation of cross-talk effects in readout noise with applications to the Quantum Approximate Optimization Algorithm [0.0]
  Noise mitigation can be performed up to some error for which we derive upper bounds. Experiments on 15 (23) qubits using IBM's devices to test both the noise model and the error-mitigation scheme. We show that similar effects are expected for Haar-random quantum states and states generated by shallow-depth random circuits.
  arXiv  Detail & Related papers  (2021-01-07T02:19:58Z)

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.