Physics – Quantum Physics
Scientific paper
2006-11-22
Phys. Rev. Lett. 101, 140503 (2008)
Physics
Quantum Physics
5 pages, 2 figures, corrected typo
Scientific paper
10.1103/PhysRevLett.101.140503
In this Letter we make progress on a longstanding open problem of Aaronson and Ambainis [Theory of Computing 1, 47 (2005)]: we show that if A is the adjacency matrix of a sufficiently sparse low-dimensional graph then the unitary operator e^{itA} can be approximated by a unitary operator U(t) whose sparsity pattern is exactly that of a low-dimensional graph which gets more dense as |t| increases. Secondly, we show that if U is a sparse unitary operator with a gap \Delta in its spectrum, then there exists an approximate logarithm H of U which is also sparse. The sparsity pattern of H gets more dense as 1/\Delta increases. These two results can be interpreted as a way to convert between local continuous-time and local discrete-time processes. As an example we show that the discrete-time coined quantum walk can be realised as an approximately local continuous-time quantum walk. Finally, we use our construction to provide a definition for a fractional quantum fourier transform.
No associations
LandOfFree
Approximate locality for quantum systems on graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Approximate locality for quantum systems on graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate locality for quantum systems on graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-369343