Gate-efficient discrete simulations of continuous-time quantum query algorithms
pith:EG3IP4I2 Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{EG3IP4I2}
Prints a linked pith:EG3IP4I2 badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
We show how to efficiently simulate continuous-time quantum query algorithms that run in time T in a manner that preserves the query complexity (within a polylogarithmic factor) while also incurring a small overhead cost in the total number of gates between queries. By small overhead, we mean T within a factor that is polylogarithmic in terms of T and a cost measure that reflects the cost of computing the driving Hamiltonian. This permits any continuous-time quantum algorithm based on an efficiently computable driving Hamiltonian to be converted into a gate-efficient algorithm with similar running time.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Quantum algorithms based on quantum trajectories
Quantum trajectory algorithm achieves additive O(T + log(1/ε)) query complexity for simulating dissipative Lindbladians.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.