Scaling and efficient classical simulation of the quantum fourier transform

被引：0

作者：

Woolfe, Kieran J. ^{[1
]}

Hill, Charles D. ^{[1
]}

Holienberg, Lloyd C. L. ^{[1
]}

机构：

[1] Center for Quantum Computation and Communication Technology, School of Physics, University of Melbourne, VIC,3010, Australia

来源：

Quantum Information and Computation | 2017年 / 17卷 / 1-2期

关键词：

Fourier transforms - Quantum optics - Quantum entanglement - Qubits - Matrix algebra;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

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. © Rinton Press.

引用

页码：1 / 14