Coping with Decoherence: Parallelizing the Quantum Fourier Transform

IF 0.5 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Parallel Processing Letters Pub Date : 2010-09-01 DOI:10.1142/S012962641000017X

Marius Nagy, S. Akl

引用次数: 13

Abstract

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 identifies practical instances of this computational paradigm in the procedures for computing the quantum Fourier transform and its inverse. 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.

查看原文本刊更多论文

处理退相干:并行化量子傅里叶变换

秩变计算复杂度(Rank-varying computational complexity)是指执行每一步的复杂度不是一个常量，而是作为每一步执行顺序的函数在整个计算过程中不断演化的计算[2]。本文在计算量子傅里叶变换及其逆的过程中确定了这种计算范式的实际实例。本文表明，在量子退相干的约束下，只有并行方法才能保证可靠的解，或者提高可扩展性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Parallel Processing Letters COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS-

CiteScore

0.90

自引率

25.00%

发文量

期刊介绍： Parallel Processing Letters (PPL) aims to rapidly disseminate results on a worldwide basis in the field of parallel processing in the form of short papers. It fills the need for an information vehicle which can convey recent achievements and further the exchange of scientific information in the field. This journal has a wide scope and topics covered included: - design and analysis of parallel and distributed algorithms - theory of parallel computation - parallel programming languages - parallel programming environments - parallel architectures and VLSI circuits