Efficient Product Formulas for Commutators and Applications to Quantum Simulation

• URL: http://arxiv.org/abs/2111.12177v1
• Date: Tue, 23 Nov 2021 22:27:20 GMT
• Title: Efficient Product Formulas for Commutators and Applications to Quantum Simulation
• Authors: Yu-An Chen, Andrew M. Childs, Mohammad Hafezi, Zhang Jiang, Hwanmun Kim, Yijia Xu
• Abstract summary: We construct product formulas for exponentials of commutators. We show how to use the product formulas in a digital protocol for counterdiabatic driving.
• Score: 4.523323031658363
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We construct product formulas for exponentials of commutators and explore their applications. First, we directly construct a third-order product formula with six exponentials by solving polynomial equations obtained using the operator differential method. We then derive higher-order product formulas recursively from the third-order formula. We improve over previous recursive constructions, reducing the number of gates required to achieve the same accuracy. In addition, we demonstrate that the constituent linear terms in the commutator can be included at no extra cost. As an application, we show how to use the product formulas in a digital protocol for counterdiabatic driving, which increases the fidelity for quantum state preparation. We also discuss applications to quantum simulation of one-dimensional fermion chains with nearest- and next-nearest-neighbor hopping terms, and two-dimensional fractional quantum Hall phases.

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)
• 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)
• 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)
• Quantum state preparation without coherent arithmetic [5.478764356647437]
  We introduce a versatile method for preparing a quantum state whose amplitudes are given by some known function.magnitude existing approaches. We use a template quantum eigenvalue transformation circuit to convert a low cost block encoding of the sine function into the desired function.
  arXiv  Detail & Related papers  (2022-10-26T17:48:31Z)
• Structural aspects of FRG in quantum tunnelling computations [68.8204255655161]
  We probe both the unidimensional quartic harmonic oscillator and the double well potential. Two partial differential equations for the potential V_k(varphi) and the wave function renormalization Z_k(varphi) are studied.
  arXiv  Detail & Related papers  (2022-06-14T15:23:25Z)
• An Accurate Pentadiagonal Matrix Solution for the Time-Dependent Schr\"{o}dinger Equation [2.480301925841752]
  We invoke the highly accurate five-point stencil to discretize the wave function onto an Implicit-Explicit pentadiagonal Crank-Nicolson scheme. It is demonstrated that the resultant solutions are significantly more accurate than the standard ones.
  arXiv  Detail & Related papers  (2022-05-26T16:16:56Z)
• 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)
• 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)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Intrinsic decoherence dynamics in the three-coupled harmonic oscillators interaction [77.34726150561087]
  We give an explicit solution for the complete equation, i.e., beyond the usual second order approximation used to arrive to the Lindblad form.
  arXiv  Detail & Related papers  (2021-08-01T02:36:23Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)

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.