PTER removes Trotter errors in quantum Hamiltonian simulation via quasi-probabilistic reversal of the error dynamics, producing unbiased results with constant overhead.
Efficient quantum algorithms for simulating sparse Hamiltonians
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
abstract
We present an efficient quantum algorithm for simulating the evolution of a sparse Hamiltonian H for a given time t in terms of a procedure for computing the matrix entries of H. In particular, when H acts on n qubits, has at most a constant number of nonzero entries in each row/column, and |H| is bounded by a constant, we may select any positive integer $k$ such that the simulation requires O((\log^*n)t^{1+1/2k}) accesses to matrix entries of H. We show that the temporal scaling cannot be significantly improved beyond this, because sublinear time scaling is not possible.
years
2026 3verdicts
UNVERDICTED 3representative citing papers
SYK disorder is shown to be an approximate unitary k-design for poly(N) k; under the planted-SYK hardness conjecture this yields gravitationally pseudorandom unitaries, implying cryptographic censorship in JT gravity with the regularized maximal geodesic length as distinguisher.
Proves intractability of DQPT estimation on quantum computers but equivalence of subsystem DQPT decision to quantum circuit simulation, with quadratic speedup for critical time search.
citing papers explorer
-
Unbiased Hamiltonian Simulation by Reversing Trotter Error Dynamics
PTER removes Trotter errors in quantum Hamiltonian simulation via quasi-probabilistic reversal of the error dynamics, producing unbiased results with constant overhead.
-
Pseudorandom Dynamics in the SYK Model and Cryptographic Censorship in JT Gravity
SYK disorder is shown to be an approximate unitary k-design for poly(N) k; under the planted-SYK hardness conjecture this yields gravitationally pseudorandom unitaries, implying cryptographic censorship in JT gravity with the regularized maximal geodesic length as distinguisher.
-
Provable Quantum Advantage for Dynamical Phase Transition
Proves intractability of DQPT estimation on quantum computers but equivalence of subsystem DQPT decision to quantum circuit simulation, with quadratic speedup for critical time search.