Selection and improvement of product formulae for best performance of quantum simulation

• URL: http://arxiv.org/abs/2210.15817v3
• Date: Fri, 10 Jan 2025 00:58:43 GMT
• Title: Selection and improvement of product formulae for best performance of quantum simulation
• Authors: Mauro E. S. Morales, Pedro C. S. Costa, Giacomo Pantaleoni, Daniel K. Burgarth, Yuval R. Sanders, Dominic W. Berry,
• Abstract summary: Quantum algorithms for simulation of Hamiltonian evolution are often based on product formulae. F fractal methods give a systematic way to find arbitrarily high-order product formulae, but result in a large number of exponentials. Product formulae with fewer exponentials can be found by numerical solution of simultaneous nonlinear equations.
• Score: 0.0
• License:
• Abstract: Quantum algorithms for simulation of Hamiltonian evolution are often based on product formulae. The fractal methods give a systematic way to find arbitrarily high-order product formulae, but result in a large number of exponentials. On the other hand, product formulae with fewer exponentials can be found by numerical solution of simultaneous nonlinear equations. It is also possible to reduce the cost of long-time simulations by processing, where a kernel is repeated and a processor need only be applied at the beginning and end of the simulation. In this work, we found thousands of new product formulae, and numerically tested these formulae, together with many formulae from prior literature. We provide methods to fairly compare product formulae of different lengths and different orders. For the case of 8th order, we have found new product formulae with exceptional performance, about two orders of magnitude better accuracy than prior work, both in the processed and non-processed cases. The processed product formula provides the best performance due to being shorter than the non-processed product formula. It outperforms all other tested product formulae over a range of many orders of magnitude in system parameters $T$ (time) and $\epsilon$ (allowable error). That includes reasonable combinations of parameters to be used in quantum algorithms, where the size of the simulation is large enough to be classically intractable, but not so large it takes an impractically long time on a quantum computer.

Related papers

• Faster Algorithmic Quantum and Classical Simulations by Corrected Product Formulas [0.06425840142026841]
  Hamiltonian simulation using product formulas is arguably the most straightforward and practical approach for algorithmic simulation on a quantum computer. We present corrected product formulas (CPFs), a variation of product formulas achieved by injecting auxiliary terms called correctors into standard product formulas. CPFs could be a valuable algorithmic tool for early fault-tolerant quantum computers with limited computing resources.
  arXiv  Detail & Related papers  (2024-09-12T17:56:43Z)
• Sum-of-Squares inspired Quantum Metaheuristic for Polynomial Optimization with the Hadamard Test and Approximate Amplitude Constraints [76.53316706600717]
  Recently proposed quantum algorithm arXiv:2206.14999 is based on semidefinite programming (SDP) We generalize the SDP-inspired quantum algorithm to sum-of-squares. Our results show that our algorithm is suitable for large problems and approximate the best known classicals.
  arXiv  Detail & Related papers  (2024-08-14T19:04:13Z)
• Approximating exponentials of commutators by optimized product formulas [0.0]
  Trotter product formulas constitute a cornerstone quantum Hamiltonian simulation technique. We construct optimized product formulas of orders 3 to 6 approximating the exponential of a commutator of two arbitrary operators.
  arXiv  Detail & Related papers  (2024-07-15T08:41:00Z)
• Multi-product Hamiltonian simulation with explicit commutator scaling [2.5677613431426978]
  The well-conditioned multi-product formula (MPF) is a simple high-order time-independent Hamiltonian simulation algorithm. We conduct a rigorous analysis of the MPF, demonstrating explicit commutator scaling and near-optimal time and precision dependence. Compared to post-Trotter methods, the MPF based on a second-order product formula can achieve a better scaling in system size, with only poly-logarithmic overhead in evolution time and precision.
  arXiv  Detail & Related papers  (2024-03-13T19:23:59Z)
• Efficient and practical Hamiltonian simulation from time-dependent product formulas [1.2534672170380357]
  We propose an approach for implementing time-evolution of a quantum system using product formulas. Our algorithms generate a decomposition of the evolution operator into a product of simple unitaries that are directly implementable on a quantum computer. Although the theoretical scaling is suboptimal compared with state-of-the-art algorithms, the performance of the algorithms we propose is highly competitive in practice.
  arXiv  Detail & Related papers  (2024-03-13T17:29: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)
• Doubling the order of approximation via the randomized product formula [12.547444644243544]
  We show that by applying randomized corrections, it is possible to more than double the order to 4k + 1. In practice, applying the corrections in a quantum algorithm requires some structure to the Hamiltonian.
  arXiv  Detail & Related papers  (2022-10-20T13:59:29Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Higher-order Derivatives of Weighted Finite-state Machines [68.43084108204741]
  This work examines the computation of higher-order derivatives with respect to the normalization constant for weighted finite-state machines. We provide a general algorithm for evaluating derivatives of all orders, which has not been previously described in the literature. Our algorithm is significantly faster than prior algorithms.
  arXiv  Detail & Related papers  (2021-06-01T19:51:55Z)
• Knowledge transfer across cell lines using Hybrid Gaussian Process models with entity embedding vectors [62.997667081978825]
  A large number of experiments are performed to develop a biochemical process. Could we exploit data of already developed processes to make predictions for a novel process, we could significantly reduce the number of experiments needed.
  arXiv  Detail & Related papers  (2020-11-27T17:38:15Z)
• 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.