REVIEW 1 cited by
Universal algorithm for transforming Hamiltonian eigenvalues
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
Universal algorithm for transforming Hamiltonian eigenvalues
read the original abstract
Manipulating Hamiltonians governing physical systems has found a broad range of applications, from quantum chemistry to semiconductor design. In this work, we provide a new way of manipulating Hamiltonians, by transforming their eigenvalues while keeping their eigenstates unchanged. We develop a universal algorithm that deterministically implements any desired (suitably differentiable) function on the eigenvalues of any unknown Hamiltonian, whose positive-time and negative-time dynamics are given as a black box. Our algorithm uses correlated randomness to efficiently combine two subroutines -- namely controlization and Fourier series simulation -- exemplifying a general compilation procedure that we develop. The time complexity of our algorithm is significantly reduced via said compilation technique compared to a na{\"i}ve concatenation of the subroutines and outperforms similar methods based on the quantum singular value transformation.
Forward citations
Cited by 1 Pith paper
-
Algebraic Speedups for Exact Inversion of Hamiltonian Evolutions
Known generator structure—additive eigenvalue relations and Wedderburn sector multiplicities—determines and often drastically lowers the exact query cost of reversing a Hamiltonian evolution.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.