2014/06/04 by Kieran J. Woolfe, Woolfe, Kieran J., Charles D. Hill +3
Computer Science · #Computational Physics and Python Applications #FOS: Physical sciences #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.1406.0931
openalex publication_date 2014/06/04 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
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.