REVIEW 3 cited by
Faster quantum simulation by randomization
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
Faster quantum simulation by randomization
read the original abstract
Product formulas can be used to simulate Hamiltonian dynamics on a quantum computer by approximating the exponential of a sum of operators by a product of exponentials of the individual summands. This approach is both straightforward and surprisingly efficient. We show that by simply randomizing how the summands are ordered, one can prove stronger bounds on the quality of approximation for product formulas of any given order, and thereby give more efficient simulations. Indeed, we show that these bounds can be asymptotically better than previous bounds that exploit commutation between the summands, despite using much less information about the structure of the Hamiltonian. Numerical evidence suggests that the randomized approach has better empirical performance as well.
Forward citations
Cited by 3 Pith papers
-
Optimal Lower Bounds for Hamiltonian Simulation
There exist simple weighted-local Hamiltonians for which quantum simulation requires Ω(min over K of (Kt + t²λ_K²/ε)) gates — exactly matching the composite qDRIFT algorithm's cost.
-
Phase estimation with randomized Hamiltonians
Generalizes iterative phase estimation to randomized Hamiltonians per step plus importance sampling, yielding fewer terms and sometimes fewer qubits for gapped chemical Hamiltonians.
-
Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation
A symmetry-co-designed high-rate QEC architecture with parallel STAR injection on bivariate bicycle codes achieves ~5.5x space savings for TFIM and Fermi-Hubbard simulations versus surface-code STAR.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.