Abstract
The phase estimation algorithm (PEA), is the key to many quantum algorithms, allowing us to use a quantum computer to efficiently find the eigenvalue of a unitary matrix, U. The PEA can be made iterative [1], such that we can find the sequence of bits xk which define the eigenvalue’s phase:
© 2015 IEEE
PDF ArticleMore Like This
S. Paesani, A. A. Gentile, R. Santagati, J. Wang, N. Wiebe, S. Miki, T. Yamashita, H. Terai, M. Fujiwara, M. Sasaki, M. G. Tanner, C. M. Natarajan, R. H. Hadfield, D. Tew, J.L. O’Brien, and M. G. Thompson
FTu3G.5 Frontiers in Optics (FiO) 2016
A. A. Gentile, S. Paesani, R. Santagati, J. Wang, N. Wiebe, D. Tew, J. L. O’Brien, and M. G. Thompson
EB_6_2 European Quantum Electronics Conference (EQEC) 2017
R. Santagati, J. Wang, S. Paesani, A.A. Gentile, D. Bonneau, J.W. Silverstone, S. Morley-Short, X. Zhou, P.J. Shadbolt, N. Wiebe, S. Miki, T. Yamashita, M. Fujiwara, M. Sasaki, H. Terai, M.G. Tanner, C.M. Natarajan, R.H. Hadfield, D. Tew, J. L. O’Brien, and M. G. Thompson
FTh4C.3 CLEO: QELS_Fundamental Science (CLEO:FS) 2016