Abstract
In this work, we introduce different types of quantum simulations according to different operator topologies on a Hilbert space, namely, uniform, strong, and weak quantum simulations. We show that they have the same computational power that the efficiently solvable problems are in bounded-error quantum polynomial time. For the weak simulation, we formalize a general weak quantum simulation problem and construct an algorithm which is valid for all instances. Also, we analyze the computational power of quantum simulations by proving the query lower bound for simulating a general quantum process.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call