Abstract
We propose a method to simulate exactly quantum dynamics for finite-dimensional quantum systems and analyze its complexity. We apply this method to the exact simulation of any unitary using the dynamics of a time-varying discrete quantum walk on a graph. For this example, in the special case where the graph is a cycle, we show that the complexity grows like Nlog N, N being the number of vertices of the graph.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
