| Barenco A, Ekert A, Suominen K A and Torma P, Approximate quantum Fourier transform and decoherence, Phys. Rev. A 54, 139--146, 1996 |
....of the elements, but quantum elements are much more fragile, and it is almost certain that quantum error corrections will be necessary in future quantum computers. It was shown that if the errors are not corrected during quantum computation, they soon accumulate and ruin the entire computation[57, 58, 17, 149]. Hence, a method to correct the effect of quantum noise is necessary. Physicists were pessimistic about the question of whether such a correction method exists[135, 189] The reason is that quantum information in general cannot be cloned[83, 200, 20] and so the information cannot be simply ....
....operate without any inaccuracies or errors. Unfortunately, in reality we cannot expect any system to be ideal. Quantum systems in particular tend to lose their quantum nature easily. Inaccuracies and errors may cause the damage to accumulate exponentially fast during the time of the computation[57, 58, 17, 19, 149]. In order to perform computations, one must be able to reduce the effects of inaccuracies and errors, and to correct the quantum state. Let us try to understand the types of errors and inaccuracies that might occur in a quantum computer. The simplest problem is that the gates perform unitary ....
Barenco A, Ekert A, Suominen K A and Torma P, Approximate quantum Fourier transform and decoherence, Phys. Rev. A 54, 139--146, 1996
....an example of a diffusion matrix for N=4. The diagonal terms have values and all other terms have values . EQ 15) A convenient method of implementing the diffusion matrix is to use the sequence of transformations FRF. F, as shown in Equation 16, is the single bit Fourier transformation matrix[BaEk96]. To perform the F transformation on the qubit register we apply the two by two transformation F 2 to each of the bits in . R is an NxN matrix transformation which negates the sign of all the states in the register except for the state . An example of R for N=4 is also shown in Equation 16. ....
A. Barenco, A. Ekert, K. Suominen, and P. Torma. "Approximate Quantum Fourier Transform and Decoherence" Submitted to Physical Review A. January 1996.
.... [40] which eOEciently computes the discrete Fourier transform in a time of order O(n log n) while the classical discrete Fourier Transform runs in a time of order O(n 2 ) This eOEcient classical algorithm needs to be re expressed in terms of unitary operations performed by a quantum dynamics [22, 3]. Algorithm 3.3.1 (Fast Fourier transform) 1. f [n] a n 1 , a n 2 , a 0 ) f(a) 2. For each j = n 1, n 2, 1, 0, calculate f [j] b n 1 , b n 2 , b j , a j 1 , a 0 ) 1 # 2 f [j 1] b n 1 , b n 2 , b j 1 , 0, a j 1 , a 0 ) ....
A. Barenco, A. Ekert, K.-A. Suominen, and P. T#rm#, Approximate quantum Fourier transform and decoherence, Los Alamos e-print archive quantph /9601018, Los Alamos, 1996.
No context found.
Barenco A, Ekert A, Suominen K A and Torma P, Approximate quantum Fourier transform and decoherence, Phys. Rev. A 54, 139--146, 1996
No context found.
Barenco A, Ekert A, Suominen K A and Torma P, Approximate quantum Fourier transform and decoherence, Phys. Rev. A 54, 139-146, 1996
No context found.
A. Barenco, A. Ekert, K. Suominen, and P. Torma. "Approximate Quantum Fourier Transform and Decoherence" Submitted to Physical Review A. January 1996.
No context found.
A. Barenco, A. Ekert, K. Suominen, and P. Torma. "Approximate Quantum Fourier Transform and Decoherence" Submitted to Physical Review A. January 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC