File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Primality test via quantum factorization

TitlePrimality test via quantum factorization
Authors
KeywordsComputational Complexity
Pocklington-Lehmer N - 1 Primality Test
Quantum Computation
Quantum Factorization
Shor's Algorithm
Issue Date1997
PublisherWorld Scientific Publishing Co Pte Ltd. The Journal's web site is located at http://www.worldscinet.com/ijmpc/ijmpc.shtml
Citation
International Journal Of Modern Physics C, 1997, v. 8 n. 2, p. 131-138 How to Cite?
AbstractWe consider a probabilistic quantum implementation of a variation of the Pocklington-Lehmer N - 1 primality test using Shor's algorithm. O(log3 N log log N log log log N) elementary q-bit operations are required to determine the primality of a number N, making it (asymptotically) the fastest known primality test. Thus, the potential power of quantum mechanical computers is once again revealed.
Persistent Identifierhttp://hdl.handle.net/10722/80997
ISSN
2015 Impact Factor: 1.195
2015 SCImago Journal Rankings: 0.377
References

 

DC FieldValueLanguage
dc.contributor.authorChau, HFen_HK
dc.contributor.authorLo, HKen_HK
dc.date.accessioned2010-09-06T08:12:36Z-
dc.date.available2010-09-06T08:12:36Z-
dc.date.issued1997en_HK
dc.identifier.citationInternational Journal Of Modern Physics C, 1997, v. 8 n. 2, p. 131-138en_HK
dc.identifier.issn0129-1831en_HK
dc.identifier.urihttp://hdl.handle.net/10722/80997-
dc.description.abstractWe consider a probabilistic quantum implementation of a variation of the Pocklington-Lehmer N - 1 primality test using Shor's algorithm. O(log3 N log log N log log log N) elementary q-bit operations are required to determine the primality of a number N, making it (asymptotically) the fastest known primality test. Thus, the potential power of quantum mechanical computers is once again revealed.en_HK
dc.languageengen_HK
dc.publisherWorld Scientific Publishing Co Pte Ltd. The Journal's web site is located at http://www.worldscinet.com/ijmpc/ijmpc.shtmlen_HK
dc.relation.ispartofInternational Journal of Modern Physics Cen_HK
dc.subjectComputational Complexityen_HK
dc.subjectPocklington-Lehmer N - 1 Primality Testen_HK
dc.subjectQuantum Computationen_HK
dc.subjectQuantum Factorizationen_HK
dc.subjectShor's Algorithmen_HK
dc.titlePrimality test via quantum factorizationen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0129-1831&volume=8&spage=131&epage=138&date=1997&atitle=Primality+Test+Via+Quantum+Factorizationen_HK
dc.identifier.emailChau, HF: hfchau@hku.hken_HK
dc.identifier.authorityChau, HF=rp00669en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-0031531029en_HK
dc.identifier.hkuros22181en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0031531029&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume8en_HK
dc.identifier.issue2en_HK
dc.identifier.spage131en_HK
dc.identifier.epage138en_HK
dc.publisher.placeSingaporeen_HK
dc.identifier.scopusauthoridChau, HF=7005742276en_HK
dc.identifier.scopusauthoridLo, HK=7202085450en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats