REVIEW 2 cited by
Finding Exponential Product Formulas of Higher Orders
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Finding Exponential Product Formulas of Higher Orders
read the original abstract
In the present article, we review a continual effort on generalization of the Trotter formula to higher-order exponential product formulas. The exponential product formula is a good and useful approximant, particularly because it conserves important symmetries of the system dynamics. We focuse on two algorithms of constructing higher-order exponential product formulas. The first is the fractal decomposition, where we construct higher-order formulas recursively. The second is to make use of the quantum analysis, where we compute higher-order correction terms directly. As interludes, we also have described the decomposition of symplectic integrators, the approximation of time-ordered exponentials, and the perturbational composition.
Forward citations
Cited by 2 Pith papers
-
Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors
Quantum simulation methods for Thirring and Gross-Neveu fermionic models with arbitrary flavors, including gate complexity bounds and ground-state preparation up to 20 qubits.
-
Circuit-Efficient Randomized Quantum Simulation of Non-Unitary Dynamics with Observable-Driven and Symmetry-Aware Designs
A randomized compilation of LCHS for non-unitary dynamics, with an observable-driven variant and a symmetry-aware sampler, claims reduced ancilla and circuit depth at the cost of more repetitions.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.