M. Mosca. Quantum searching and counting by eigenvector analysis. In Proceedings of Randomized Algorithms, Workshop of MFCS 98, 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Fast parallel circuits for the quantum Fourier transform - Cleve, Watrous (2000) (6 citations) (Correct)
.... known extensions and variants of these algorithms (see, e.g. Kitaev [24] Boneh and Lipton [7] Grigoriev [19] and Cleve, Ekert, Macchiavello, and Mosca [11] The QFT also plays a key role in extensions of Grover s quantum searching technique [20] due to Brassard, Hyer, and Tapp [8] and Mosca [28]. Research partially supported by Canada s NSERC. y Dept. of Computer Science, University of Calgary, Calgary, Alberta, Canada T2N 1N4. fcleve; jwatrousg cpsc.ucalgary.ca Let us recall the discrete Fourier transform (DFT) for a given dimension m the DFT is a linear operator on C m ....
M. Mosca. Quantum searching and counting by eigenvector analysis. In Proceedings of Randomized Algorithms, Workshop of MFCS 98, 1998.
Fast parallel circuits for the quantum Fourier transform - Cleve, Watrous (2000) (6 citations) (Correct)
.... variants of these algorithms (see, e.g. Kitaev [25] Boneh and Lipton [7] Grigoriev [20] and Cleve, Ekert, Macchiavello, and Mosca [10] The quantum Fourier transform also plays a key role in extensions of Grover s quantum searching technique [21] due to Brassard, Hyer, and Tapp [8] and Mosca [29]. In order to discuss the quantum Fourier transform in greater detail we recall the discrete Fourier transform (DFT) for a given dimension m the discrete Fourier transform is a linear operator on Email: cleve cpsc.ucalgary.ca y Email: jwatrous cpsc.ucalgary.ca z Department of Computer ....
M. Mosca. Quantum searching and counting by eigenvector analysis. In Proceedings of Randomized Algorithms, Workshop of MFCS 98, 1998.
Quantum Networks for Concentrating Entanglement - Kaye, Mosca (2001) Self-citation (Mosca) (Correct)
No context found.
M. Mosca, \Quantum searching and counting by eigenvector analysis ", in Proceedings of Randomized Algorithms, Workshop of MFCS98, Brno, Czech Republic, (1998)
Quantum Amplitude Amplification and Estimation - Brassard, Høyer, Mosca, .. (2000) (9 citations) Self-citation (Michele) (Correct)
....To estimate this period, it is a natural approach [5] to apply Fourier analysis like Shor [15] does for a classical function in his factoring algorithm. This approach can also be viewed as an eigenvalue estimation [12, 7] and is best analysed in the basis of eigenvectors of the operator at hand [13]. By Equation 4, the eigenvalues of Q on the subspace spanned by j 1 i and j 0 i are = e 2 a and = e 2 a . Thus we can estimate a simply by estimating one of these two eigenvalues. Errors in our estimate a for a translate into errors in our estimate a = sin 2 ( a ) ....
Mosca, Michele, \Quantum searching and counting by eigenvector analysis", Proceedings of Randomized Algorithms, Satellite Workshop of 23rd International Symposium on Mathematical Foundations of Computer Science, Brno, Czech Republic, August 1998, pp. 90 - 100.
Fast parallel circuits for the quantum Fourier transform - Richard Cleve John (Correct)
No context found.
M. Mosca. Quantum searching and counting by eigenvector analysis. In Proceedings of Randomized Algorithms, Workshop of MFCS 98, 1998.
Fast parallel circuits for the quantum Fourier transform - Richard Cleve John (Correct)
No context found.
M. Mosca. Quantum searching and counting by eigenvector analysis. In Proceedings of Randomized Algorithms, Workshop of MFCS 98, 1998.
Continuous-time Quantum Algorithms: Searching and Adiabatic.. - Ioannou (2002) (Correct)
No context found.
M. Mosca. \Quantum Searching and Counting by Eigenvector Analysis", Proceedings of Randomized Algorithms, Workshop of MFCS98, Brno, Czech Republic. 1998.
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