Simple Ways to improve Discrete Time Evolution

• URL: http://arxiv.org/abs/2309.03389v1
• Date: Wed, 6 Sep 2023 22:38:29 GMT
• Title: Simple Ways to improve Discrete Time Evolution
• Authors: Johann Ostmeyer
• Abstract summary: Suzuki-Trotter decompositions of exponential operators like $exp(Ht)$ are required in almost every branch of numerical physics. We demonstrate how highly optimised schemes originally derived for exactly two operators can be applied to such generic Suzuki-Trotter decompositions.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Suzuki-Trotter decompositions of exponential operators like $\exp(Ht)$ are required in almost every branch of numerical physics. Often the exponent under consideration has to be split into more than two operators, for instance as local gates on quantum computers. In this work, we demonstrate how highly optimised schemes originally derived for exactly two operators can be applied to such generic Suzuki-Trotter decompositions. After this first trick, we explain what makes an efficient decomposition and how to choose from the large variety available. Furthermore we demonstrate that many problems for which a Suzuki-Trotter decomposition might appear to be the canonical ansatz, are better approached with different methods like Taylor or Chebyshev expansions. In particular, we derive an efficient and numerically stable method to implement truncated polynomial expansions based on a linear factorisation using their complex zeros.

Related papers

• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose arbitrary exponentials into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions. We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• An Efficient Algorithm for Clustered Multi-Task Compressive Sensing [60.70532293880842]
  Clustered multi-task compressive sensing is a hierarchical model that solves multiple compressive sensing tasks. The existing inference algorithm for this model is computationally expensive and does not scale well in high dimensions. We propose a new algorithm that substantially accelerates model inference by avoiding the need to explicitly compute these covariance matrices.
  arXiv  Detail & Related papers  (2023-09-30T15:57:14Z)
• Efficient application of the factorized form of the unitary coupled-cluster ansatz for the variational quantum eigensolver algorithm by using linear combination of unitaries [0.0]
  The variational quantum eigensolver is one of the most promising algorithms for near-term quantum computers. It has the potential to solve quantum chemistry problems involving strongly correlated electrons.
  arXiv  Detail & Related papers  (2023-02-17T04:03:06Z)
• 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)
• Optimised Trotter Decompositions for Classical and Quantum Computing [0.0]
  Suzuki-Trotter decompositions of exponential operators like $exp(Ht)$ are required in almost every branch of numerical physics. We show how highly optimised schemes originally derived for exactly two operators $A_1,2$ can be applied to such generic Suzuki-Trotter decompositions.
  arXiv  Detail & Related papers  (2022-11-04T18:21:00Z)
• Fourier-based quantum signal processing [0.0]
  Implementing general functions of operators is a powerful tool in quantum computation. Quantum signal processing is the state of the art for this aim. We present an algorithm for Hermitian-operator function design from an oracle given by the unitary evolution.
  arXiv  Detail & Related papers  (2022-06-06T18:02:30Z)
• Constrained mixers for the quantum approximate optimization algorithm [55.41644538483948]
  We present a framework for constructing mixing operators that restrict the evolution to a subspace of the full Hilbert space. We generalize the "XY"-mixer designed to preserve the subspace of "one-hot" states to the general case of subspaces given by a number of computational basis states. Our analysis also leads to valid Trotterizations for "XY"-mixer with fewer CX gates than is known to date.
  arXiv  Detail & Related papers  (2022-03-11T17:19:26Z)
• Sparse Quadratic Optimisation over the Stiefel Manifold with Application to Permutation Synchronisation [71.27989298860481]
  We address the non- optimisation problem of finding a matrix on the Stiefel manifold that maximises a quadratic objective function. We propose a simple yet effective sparsity-promoting algorithm for finding the dominant eigenspace matrix.
  arXiv  Detail & Related papers  (2021-09-30T19:17:35Z)
• 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)
• Analytic gradients in variational quantum algorithms: Algebraic extensions of the parameter-shift rule to general unitary transformations [0.0]
  We propose several extensions of the parametric-shift-rule to formulating gradients as linear combinations of expectation values for generators with general eigen-spectrum. Our approaches are exact and do not use any auxiliary qubits, instead they rely on a generator eigen-spectrum analysis.
  arXiv  Detail & Related papers  (2021-07-16T21:37:31Z)
• Glushkov's construction for functional subsequential transducers [91.3755431537592]
  Glushkov's construction has many interesting properties and they become even more evident when applied to transducers. Special flavour of regular expressions is introduced, which can be efficiently converted to $epsilon$-free functional subsequential weighted finite state transducers.
  arXiv  Detail & Related papers  (2020-08-05T17:09: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.