DocumentCode :
2363063
Title :
Complexity considerations quantum computation
Author :
Accardi, Luigi
Author_Institution :
Centro Vito Volterra, Univ. degli Studi di Roma “Tor Vergata”, Rome, Italy
fYear :
2010
fDate :
7-10 Nov. 2010
Firstpage :
1
Lastpage :
14
Abstract :
It is usually claimed that quantum computer can outperform classical computer. Is this statement true? We discuss this issue, not in general, but in the context of the most famous algorithm of quantum computation: Shor´s algorithm.
Keywords :
quantum computing; Shor algorithm; quantum computation; quantum computer;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Applied Sciences in Biomedical and Communication Technologies (ISABEL), 2010 3rd International Symposium on
Conference_Location :
Rome
Print_ISBN :
978-1-4244-8131-6
Type :
conf
DOI :
10.1109/ISABEL.2010.5702891
Filename :
5702891
Link To Document :
بازگشت