Back to Search
Start Over
COPING WITH DECOHERENCE:: PARALLELIZING THE QUANTUM FOURIER TRANSFORM.
- Source :
-
Parallel Processing Letters . Sep2010, Vol. 20 Issue 3, p213-226. 14p. 6 Diagrams. - Publication Year :
- 2010
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01296264
- Volume :
- 20
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Parallel Processing Letters
- Publication Type :
- Academic Journal
- Accession number :
- 53843835
- Full Text :
- https://doi.org/10.1142/S012962641000017X