Abstract
We present an optimized version of the quantum random walk simulation algorithm. Our approach can be generalized to optimize any quantum simulation in which the linear combination rule is used to simulate a collection of constituent Hamiltonians. The method involves manipulation of the order in which the constituent Hamiltonians are simulated for small durations in the iterative step of the simulation algorithm. An analysis to illustrate the benefits of the new approach in oracle-based simulations is also given. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Küçük, U., & Cem Say, A. C. (2005). Improved simulation of quantum random walks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3733 LNCS, pp. 937–946). Springer Verlag. https://doi.org/10.1007/11569596_95
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
