Scaling and efficient classical simulation of the quantum Fourier transform
Quantum Information and Computation · 2017-01 · 17 (1&2) · 1-14
DOI: 10.26421/qic17.1-2-1 ↗Kurz gefasst
Fachartikel in der Zeitschrift Quantum Information and Computation, 2017-01. Verfasst von Kieran J. Woolfe und 2 weiteren Autor:innen. Die Arbeit wurde bisher 8-mal zitiert (Crossref).
Abstract (Originalsprache)
We provide numerical evidence that the quantum Fourier transform can be efficiently represented in a matrix product operator with a size growing relatively slowly with the number of qubits. Additionally, we numerically show that the tensors in the operator converge to a common tensor as the number of qubits in the transform increases. Together these results imply that the application of the quantum Fourier transform to a matrix product state with n qubits of maximum Schmidt rank χ can be simulated in O(n (log(n))2 χ 2 ) time. We perform such simulations and quantify the error involved in representing the transform as a matrix product operator and simulating the quantum Fourier transform of periodic states.
Zitieren
APA
Woolfe, K. J., Hill, C. D., & Hollenberg, L. C. L. (2017). Scaling and efficient classical simulation of the quantum Fourier transform. Quantum Information and Computation, 17(1&2), 1-14. https://doi.org/10.26421/qic17.1-2-1
Vancouver
Woolfe KJ, Hill CD, Hollenberg LCL. Scaling and efficient classical simulation of the quantum Fourier transform. Quantum Information and Computation. 2017;17(1&2):1-14. doi:10.26421/qic17.1-2-1
BibTeX
@article{Woolfe2017,
author = {Woolfe, Kieran J. and Hill, Charles D. and Hollenberg, Lloyd C. L.},
title = {Scaling and efficient classical simulation of the quantum Fourier transform},
journal = {Quantum Information and Computation},
year = {2017},
volume = {17},
number = {1&2},
pages = {1--14},
doi = {10.26421/qic17.1-2-1}
}
EUVIMED