Header menu link for other important links
X
Solving a hidden subgroup problem using the adiabatic quantum-computing paradigm
Published in American Physical Society
2003
Volume: 67
   
Issue: 5
Pages: 523061 - 523066
Abstract
An abelian subgroup problem was solved using the adiabatic quantum-computing paradigm. The time step complexity was a polynomial in the number of input orbits. A Hamiltonian was constructed in such a way that its ground state encodes the required solution set.
About the journal
JournalData powered by TypesetPhysical Review A - Atomic, Molecular, and Optical Physics
PublisherData powered by TypesetAmerican Physical Society
ISSN10502947