REVIEW 8 cited by
A random compiler for fast Hamiltonian simulation
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
A random compiler for fast Hamiltonian simulation
abstract
The dynamics of a quantum system can be simulated using a quantum computer by breaking down the unitary into a quantum circuit of one and two qubit gates. The most established methods are the Trotter-Suzuki decompositions, for which rigorous bounds on the circuit size depend on the number of terms $L$ in the system Hamiltonian and the size of the largest term in the Hamiltonian $\Lambda$. Consequently, Trotter-Suzuki is only practical for sparse Hamiltonians. Trotter-Suzuki is a deterministic compiler but it was recently shown that randomised compiling offers lower overheads. Here we present and analyse a randomised compiler for Hamiltonian simulation where gate probabilities are proportional to the strength of a corresponding term in the Hamiltonian. This approach requires a circuit size independent of $L$ and $\Lambda$, but instead depending on $\lambda$ the absolute sum of Hamiltonian strengths (the $\ell_1$ norm). Therefore, it is especially suited to electronic structure Hamiltonians relevant to quantum chemistry. Considering propane, carbon dioxide and ethane, we observe speed-ups compared to standard Trotter-Suzuki of between $306\times$ and $1591\times$ for physically significant simulation times at precision $10^{-3}$. Performing phase estimation at chemical accuracy, we report that the savings are similar.
Forward citations
Cited by 8 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.
-
Quantum Eigenvalue Transformation via Linear Combination of Hamiltonian Simulation: A Weyl Calculus Approach
Develops Weyl-calculus-based LCHS formulas for analytic f(A) yielding O(log 1/ε) quantum eigenvalue transformation and 2.1× cheaper time-dependent ODE simulation.
-
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.
-
An Oracle-Free Quantum Algorithm for Nonadiabatic Quantum Molecular Dynamics
An oracle-free Trotter-based quantum algorithm for nonadiabatic molecular dynamics achieves circuit depth advantages over QROM architectures and retains T-gate scalability compared to quantum signal processing.
-
Randomized Subsystem Descent for Fermion-to-Qubit Mapping
Randomized Subsystem Descent reduces weighted Pauli weight in fermion-to-qubit mappings for Hubbard models up to 16x16 sites and molecular Hamiltonians with 54 modes.
-
Generative Circuit Design for Quantum-Selected Configuration Interaction
A Transformer policy optimizes quantum circuit ansatzes for QSCI, yielding up to 98% reduction in two-qubit gates while reaching chemical accuracy on N2 and competitive compactness with classical methods.
-
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.