REVIEW 6 cited by
Well-conditioned multiproduct 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
abstract
Product formula approximations of the time-evolution operator on quantum computers are of great interest due to their simplicity, and good scaling with system size by exploiting commutativity between Hamiltonian terms. However, product formulas exhibit poor scaling with the time $t$ and error $\epsilon$ of simulation as the gate cost of a single step scales exponentially with the order $m$ of accuracy. We introduce well-conditioned multiproduct formulas, which are a linear combination of product formulas, where a single step has polynomial cost $\mathcal{O}(m^2\log{(m)})$ and succeeds with probability $\Omega(1/\operatorname{log}^2{(m)})$. Our multiproduct formulas imply a simple and generic simulation algorithm that simultaneously exploits commutativity in arbitrary systems and has a worst-case cost $\mathcal{O}(t\log^{2}{(t/\epsilon)})$ which is optimal up to poly-logarithmic factors. In contrast, prior Trotter and post-Trotter Hamiltonian simulation algorithms realize only one of these two desirable features. A key technical result of independent interest is our solution to a conditioning problem in previous multiproduct formulas that amplified numerical errors by $e^{\Omega(m)}$ in the classical setting, and led to a vanishing success probability $e^{-\Omega(m)}$ in the quantum setting.
Forward citations
Cited by 6 Pith papers
-
Trotter error compensation with polylogarithmic precision and nested-commutator scaling without ancillas
HNCC compensates Trotter errors at the channel level, achieving polylogarithmic precision dependence in circuit size while preserving nested-commutator scaling and requiring no ancillas.
-
High-order Magnus Expansion for Hamiltonian Simulation
Arbitrary-order Magnus expansion is shown to have commutator-scaling error bounds and a polynomial-cost quantum circuit, yielding a time-dependent Hamiltonian simulation algorithm with O~(αbar^{1+1/p} T^{1+1/p}/ε^{1/p...
-
Fast simulations of X-ray absorption spectroscopy for battery materials on a quantum computer
An optimized Trotter-based quantum algorithm reduces the estimated cost of simulating X-ray absorption spectra for a Li4Mn2O cathode cluster to 100 logical qubits and 3.1e8 Toffoli gates per circuit.
-
Stacking the Deck: Tunable Trainability in Stacked LCUs
Stacked LCUs of fermionic Gaussian unitaries give variance Ω(1/(n k^{3l})) against classical simulation O(k^{2l} n^3) and quantum gate count O(l k n^2), with layers l as the single dial.
-
COSMA: Communication-aware Optimization of Fermionic Simulation Kernels for Modular Quantum Architectures
COSMA jointly optimizes fermion-to-qubit mapping, Pauli scheduling, and multi-core allocation, cutting inter-core transfer cost by up to 2.5× (median ~1.7×) on molecular Trotter kernels.
-
Quantum Algorithm Software for Condensed Matter Physics
A review of quantum algorithm software that advertises a benchmark suite, yet the body contains no benchmarks, data, or code.
Discussion (0). Sign in to comment.