Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

Product formulas for Q-representatives

Peter Kasperkovitz

Published Apr 6, 2008• 0 citations
Publisher
DOI
10.1007/3-540-54040-7_152

Related papers

Zeno Product Formula Revisited

Pavel Exner, Takashi Ichinose, Hagen Neidhardt +1 more

arXiv:math-ph/0411036•Integral Equations and Operator Theory•May 2, 2006•17 citations

Finding Exponential Product Formulas of Higher Orders

Naomichi Hatano, Masuo Suzuki

arXiv:math-ph/0506007•Lecture notes in physics•Nov 16, 2005•329 citations

Trotter error compensation with polylogarithmic precision and nested-commutator scaling without ancillas

Xinzhao Wang, Shuo Zhou, Ziruo Wang +5 more

Product formulas are among the most practical approaches to Hamiltonian simulation, requiring no ancillary qubits and exhibiting error bounds governed by nested commutators rather than only by Hamiltonian norms. Their circuit size, however, scales polynomially with the inverse precision. We develop a high-order nested-commutator compensation (HNCC) algorithm that preserves the main advantages of product formulas while achieving polylogarithmic precision dependence in the circuit size and the standard $\mathcal{O}(\varepsilon^{-2})$ sampling cost. HNCC uses a truncated Baker--Campbell--Hausdorff expansion to represent high-order Trotter errors by products of nested commutators and compensates these errors at the channel level through randomly sampled Pauli-rotation channels, avoiding Hadamard tests and ancillary qubits. For a fixed $K$-th order product formula applied to a $k$-local Hamiltonian on $N$ qubits with $Γ$ Pauli terms and local interaction strength $g_0$, HNCC estimates $\operatorname{tr}[Oe^{-i tH}ρe^{i tH}]$ to additive precision $\varepsilon\|O\|$ using $\mathcal{O}(\varepsilon^{-2})$ repetitions. Its maximum gate count per circuit is $\mathcal{O}\bigl( kN^{\frac{1}{2K+1}} Γ^{1-\frac{1}{2K+1}} \max\{Γ,N\log(1/\varepsilon)\}^{\frac{1}{2K+1}} (kg_0t\log(1/\varepsilon))^{1+\frac{1}{2K+1}} \bigr)$. Finite-size resource estimates for the periodic Heisenberg chain indicate that HNCC has the lowest estimated $T$-gate count per circuit among the product-formula-based methods considered.

quant-pharXiv:2607.11856•Jul 14, 2026•1 citation

Exponential product formulas and quantum analysis

Masuo Suzuki

東京大学 eBooks•Jan 1, 1996•1 citation

A Product Formula and Its Application to the Schrödinger Equation

Takashi Ichinose

A product formula is given which represents the unitary group for the form sum of a pair of nonnegative selfadjoint operators in a Hilbert space.

Publications of the Research Institute for Mathematical Sciences•Aug 31, 1980•15 citations

Well-conditioned multi-product formulas for hardware-friendly Hamiltonian simulation

Almudena Carrera Vazquez, Daniel J. Egger, David Ochsner +1 more

Simulating the time-evolution of a Hamiltonian is one of the most promising applications of quantum computers. Multi-Product Formulas (MPFs) are well suited to replace standard product formulas since they scale better with respect to time and approximation errors. Hamiltonian simulation with MPFs was first proposed in a fully quantum setting using a linear combination of unitaries. Here, we analyze and demonstrate a hybrid quantum-classical approach to MPFs that classically combines expectation values evaluated with a quantum computer. This has the same approximation bounds as the fully quantum MPFs, but, in contrast, requires no additional qubits, no controlled operations, and is not probabilistic. We show how to design MPFs that do not amplify the hardware and sampling errors, and demonstrate their performance. In particular, we illustrate the potential of our work by theoretically analyzing the benefits when applied to a classically intractable spin-boson model, and by computing the dynamics of the transverse field Ising model using a classical simulator as well as quantum hardware. 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. The MPF methodology reduces the circuit depth and may therefore represent an important step towards quantum advantage for Hamiltonian simulation on noisy hardware.

arXiv:2207.11268•Quantum•Jul 25, 2023•40 citations
Product formulas are among the most practical approaches to Hamiltonian simulation, requiring no ancillary qubits and exhibiting error bounds governed by nested commutators rather than only by Hamiltonian norms. Their circuit size, however, scales polynomially with the inverse precision. We develop a high-order nested-commutator compensation (HNCC) algorithm that preserves the main advantages of product formulas while achieving polylogarithmic precision dependence in the circuit size and the standard O(ε−2)\mathcal{O}(\varepsilon^{-2})O(ε−2) sampling cost. HNCC uses a truncated Baker--Campbell--Hausdorff expansion to represent high-order Trotter errors by products of nested commutators and compensates these errors at the channel level through randomly sampled Pauli-rotation channels, avoiding Hadamard tests and ancillary qubits. For a fixed KKK-th order product formula applied to a kkk-local Hamiltonian on NNN qubits with ΓΓΓ Pauli terms and local interaction strength g0g_0g0​, HNCC estimates tr⁡[Oe−itHρeitH]\operatorname{tr}[Oe^{-i tH}ρe^{i tH}]tr[Oe−itHρeitH] to additive precision ε∥O∥\varepsilon\|O\|ε∥O∥ using O(ε−2)\mathcal{O}(\varepsilon^{-2})O(ε−2) repetitions. Its maximum gate count per circuit is O(kN12K+1Γ1−12K+1max⁡{Γ,Nlog⁡(1/ε)}12K+1(kg0tlog⁡(1/ε))1+12K+1)\mathcal{O}\bigl( kN^{\frac{1}{2K+1}} Γ^{1-\frac{1}{2K+1}} \max\{Γ,N\log(1/\varepsilon)\}^{\frac{1}{2K+1}} (kg_0t\log(1/\varepsilon))^{1+\frac{1}{2K+1}} \bigr)O(kN2K+11​Γ1−2K+11​max{Γ,Nlog(1/ε)}2K+11​(kg0​tlog(1/ε))1+2K+11​). Finite-size resource estimates for the periodic Heisenberg chain indicate that HNCC has the lowest estimated TTT-gate count per circuit among the product-formula-based methods considered.
Simulating the time-evolution of a Hamiltonian is one of the most promising applications of quantum computers. Multi-Product Formulas (MPFs) are well suited to replace standard product formulas since they scale better with respect to time and approximation errors. Hamiltonian simulation with MPFs was first proposed in a fully quantum setting using a linear combination of unitaries. Here, we analyze and demonstrate a hybrid quantum-classical approach to MPFs that classically combines expectation values evaluated with a quantum computer. This has the same approximation bounds as the fully quantum MPFs, but, in contrast, requires no additional qubits, no controlled operations, and is not probabilistic. We show how to design MPFs that do not amplify the hardware and sampling errors, and demonstrate their performance. In particular, we illustrate the potential of our work by theoretically analyzing the benefits when applied to a classically intractable spin-boson model, and by computing the dynamics of the transverse field Ising model using a classical simulator as well as quantum hardware. 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. The MPF methodology reduces the circuit depth and may therefore represent an important step towards quantum advantage for Hamiltonian simulation on noisy hardware.