Approximating exponentials of commutators by optimized product formulas

• URL: http://arxiv.org/abs/2407.10533v2
• Date: Mon, 20 Jan 2025 12:10:54 GMT
• Title: Approximating exponentials of commutators by optimized product formulas
• Authors: F. Casas, A. Escorihuela-Tomàs, P. A. Moreno Casares,
• Abstract summary: 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.
• Score: 0.0
• License:
• Abstract: Trotter product formulas constitute a cornerstone quantum Hamiltonian simulation technique. However, the efficient implementation of Hamiltonian evolution of nested commutators remains an under explored area. In this work, we construct optimized product formulas of orders 3 to 6 approximating the exponential of a commutator of two arbitrary operators in terms of the exponentials of the operators involved. The new schemes require a reduced number of exponentials and thus provide more efficient approximations than other previously published alternatives. They can also be used as basic methods in recursive procedures to increase the order of approximation. We expect this research will improve the efficiency of quantum control protocols, as well as quantum algorithms such as the Zassenhaus-based product formula, Magnus operator-based time-dependent simulation, and product formula schemes with modified potentials.

Related papers

• High order schemes for solving partial differential equations on a quantum computer [0.0]
  We show that higher-order methods can reduce the number of qubits necessary for discretization, similar to the classical case. This result has important consequences for the practical application of quantum algorithms based on Hamiltonian evolution.
  arXiv  Detail & Related papers  (2024-12-26T14:21:59Z)
• Some improvements to product formula circuits for Hamiltonian simulation [0.0]
  We present improvements to the standard implementation of the ground state energy estimation algorithm. These include smaller circuit templates for each Hamiltonian term, parallelization of commuting controlled rotations, and more efficient scheduling.
  arXiv  Detail & Related papers  (2023-10-18T18:43:52Z)
• Noisy Tensor Ring approximation for computing gradients of Variational Quantum Eigensolver for Combinatorial Optimization [33.12181620473604]
  Variational Quantum algorithms have established their potential to provide computational advantage in the realm of optimization. These algorithms suffer from classically intractable gradients limiting the scalability. This work proposes a classical gradient method which utilizes the parameter shift rule but computes the expected values from the circuits using a tensor ring approximation.
  arXiv  Detail & Related papers  (2023-07-08T03:14:28Z)
• Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods [75.34939761152587]
  Efficient computation of the optimal transport distance between two distributions serves as an algorithm that empowers various applications. This paper develops a scalable first-order optimization-based method that computes optimal transport to within $varepsilon$ additive accuracy.
  arXiv  Detail & Related papers  (2023-01-30T15:46:39Z)
• Selection and improvement of product formulae for best performance of quantum simulation [0.0]
  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.
  arXiv  Detail & Related papers  (2022-10-28T01:01:52Z)
• Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
  We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra. A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
  arXiv  Detail & Related papers  (2022-09-28T20:24:53Z)
• Twisted hybrid algorithms for combinatorial optimization [68.8204255655161]
  Proposed hybrid algorithms encode a cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity. We show that for levels $p=2,ldots, 6$, the level $p$ can be reduced by one while roughly maintaining the expected approximation ratio.
  arXiv  Detail & Related papers  (2022-03-01T19:47:16Z)
• Efficient Product Formulas for Commutators and Applications to Quantum Simulation [4.523323031658363]
  We construct product formulas for exponentials of commutators. We show how to use the product formulas in a digital protocol for counterdiabatic driving.
  arXiv  Detail & Related papers  (2021-11-23T22:27:20Z)
• Speeding-Up Back-Propagation in DNN: Approximate Outer Product with Memory [26.687031691516797]
  We experimentally show that significant improvements in computational complexity as well as accuracy can indeed be obtained through Mem-AOPGD. Mem-AOPGD implements an approximation of the gradient descent by considering only a subset of the outer products involved in the matrix multiplications that encompass backpropagation.
  arXiv  Detail & Related papers  (2021-10-18T10:32:59Z)
• Compressing Many-Body Fermion Operators Under Unitary Constraints [0.6445605125467573]
  We introduce a numerical algorithm for performing factorization that has an complexity no worse than single particle basis transformations of the two-body operators. As an application of this numerical procedure, we demonstrate that our protocol can be used to approximate generic unitary coupled cluster operators.
  arXiv  Detail & Related papers  (2021-09-10T17:42:18Z)
• Sparse Orthogonal Variational Inference for Gaussian Processes [34.476453597078894]
  We introduce a new interpretation of sparse variational approximations for Gaussian processes using inducing points. We show that this formulation recovers existing approximations and at the same time allows to obtain tighter lower bounds on the marginal likelihood and new variational inference algorithms.
  arXiv  Detail & Related papers  (2019-10-23T15:01:28Z)

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.