Coping with Decoherence: Parallelizing the Quantum Fourier Transform

Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a function of the order of execution of each step 2 . This paper identi es a practical instance of this computational paradigm in the procedure for inverting the quantum Fourier transform. It is shown herein that under the constraints imposed by quantum decoherence, only a parallel approach can guarantee a reliable solution or, alternatively, improve scalability.

• Type: Journal
• Year: 2010
• Where: PPL
• Authors: Marius Nagy, Selim G. Akl
• Keywords: Computation, Computational Complexity, PPL 2010, Quantum Fourier