Accession Number ADA572849
Title Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism.
Publication Date Jun 2007
Media Count 28p
Personal Author A. Russell C. Moore P. Sniady
Abstract It is known that any quantum algorithm for Graph Isomorphism that works within the framework of the hidden subgroup problem (HSP) must perform highly entangled measurements across (n log n) coset states. One of the only known models for how such a measure ...
Keywords Algorithms
Coset states
Graph isomorphism
Quantum algorithms
Quantum sieve
Quantum theory

Source Agency Non Paid ADAS
NTIS Subject Category 72B - Algebra, Analysis, Geometry, & Mathematical Logic
46 - Physics
Corporate Author New Mexico Univ., Albuquerque.
Document Type Technical report
Title Note Conference paper.
NTIS Issue Number 1317
Contract Number W911NF-05-1-0347 W911NF-04-R-0009

Science and Technology Highlights

See a sampling of the latest scientific, technical and engineering information from NTIS in the NTIS Technical Reports Newsletter

Acrobat Reader Mobile    Acrobat Reader