Phase estimation with partially randomized time evolution

• URL: http://arxiv.org/abs/2503.05647v1
• Date: Fri, 07 Mar 2025 18:09:32 GMT
• Title: Phase estimation with partially randomized time evolution
• Authors: Jakob Günther, Freek Witteveen, Alexander Schmidhuber, Marek Miller, Matthias Christandl, Aram Harrow,
• Abstract summary: Quantum phase estimation combined with Hamiltonian simulation is the most promising algorithmic framework to computing ground state energies on quantum computers.<n>In this paper we use randomization to speed up product formulas, one of the standard approaches to Hamiltonian simulation.<n>We perform a detailed resource estimate for single-ancilla phase estimation using partially randomized product formulas for benchmark systems in quantum chemistry.
• Score: 36.989845156791525
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum phase estimation combined with Hamiltonian simulation is the most promising algorithmic framework to computing ground state energies on quantum computers. Its main computational overhead derives from the Hamiltonian simulation subroutine. In this paper we use randomization to speed up product formulas, one of the standard approaches to Hamiltonian simulation. We propose new partially randomized Hamiltonian simulation methods in which some terms are kept deterministically and others are randomly sampled. We perform a detailed resource estimate for single-ancilla phase estimation using partially randomized product formulas for benchmark systems in quantum chemistry and obtain orders-of-magnitude improvements compared to other simulations based on product formulas. When applied to the hydrogen chain, we have numerical evidence that our methods exhibit asymptotic scaling with the system size that is competitive with the best known qubitization approaches.

Related papers

• Parallel simulation for sampling under isoperimetry and score-based diffusion models [56.39904484784127]
  As data size grows, reducing the iteration cost becomes an important goal.<n>Inspired by the success of the parallel simulation of the initial value problem in scientific computation, we propose parallel Picard methods for sampling tasks.<n>Our work highlights the potential advantages of simulation methods in scientific computation for dynamics-based sampling and diffusion models.
  arXiv  Detail & Related papers  (2024-12-10T11:50:46Z)
• Hamiltonian simulation in Zeno subspaces [0.0]
  We investigate the quantum Zeno effect as a framework for designing and analyzing quantum algorithms for Hamiltonian simulation. We show that frequent projective measurements of an ancilla qubit register can be used to simulate quantum dynamics on a target qubit register with a circuit complexity similar to randomized approaches.
  arXiv  Detail & Related papers  (2024-05-22T12:35:57Z)
• Enhancing Scalability of Quantum Eigenvalue Transformation of Unitary Matrices for Ground State Preparation through Adaptive Finer Filtering [0.13108652488669736]
  Hamiltonian simulation is a domain where quantum computers have the potential to outperform classical counterparts.<n>One of the main challenges of such quantum algorithms is increasing the system size.<n>We present an approach to improve the scalability of eigenspace filtering for the ground state preparation of a given Hamiltonian.
  arXiv  Detail & Related papers  (2024-01-17T09:52:24Z)
• 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)
• Well-conditioned multi-product formulas for hardware-friendly Hamiltonian simulation [1.433758865948252]
  We show how to design MPFs that do not amplify the hardware and sampling errors, and demonstrate their performance. We observe an error reduction of up to an order of magnitude when compared to a product formula approach by suppressing hardware noise with Pauli Twirling, pulse efficient transpilation, and a novel zero-noise extrapolation based on scaled cross-resonance pulses.
  arXiv  Detail & Related papers  (2022-07-22T18:00:05Z)
• Hybridized Methods for Quantum Simulation in the Interaction Picture [69.02115180674885]
  We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations. Physical applications of these hybridized methods yield a gate complexity scaling as $log2 Lambda$ in the electric cutoff. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $lambda$ used to impose an energy cost.
  arXiv  Detail & Related papers  (2021-09-07T20:01:22Z)
• 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)
• Randomizing multi-product formulas for Hamiltonian simulation [2.2049183478692584]
  We introduce a scheme for quantum simulation that unites the advantages of randomized compiling on the one hand and higher-order multi-product formulas on the other. Our framework reduces the circuit depth by circumventing the need for oblivious amplitude amplification. Our algorithms achieve a simulation error that shrinks exponentially with the circuit depth.
  arXiv  Detail & Related papers  (2021-01-19T19:00:23Z)
• Concentration for random product formulas [4.071875179293035]
  qDRIFT is known to generate random product formulas for which the average quantum channel approximates the ideal evolution. Main results prove that a typical realization of the randomized product formula approximates the ideal unitary evolution up to a small diamond-norm error.
  arXiv  Detail & Related papers  (2020-08-26T18:21:51Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.