Header menu link for other important links
X
Solving a hidden subgroup problem using the adiabatic quantum-computing paradigm
Published in
2003
Volume: 67
   
Issue: 5
Abstract
We present and solve a restricted Abelian hidden subgroup problem using the adiabatic quantum-computing paradigm. The time step complexity is shown to be a polynomial in the number of input qubits. This paper is a step towards looking at the Abelian hidden subgroup problem from a quantum adiabatic standpoint. © 2003 The American Physical Society.
About the journal
JournalPhysical Review A - Atomic, Molecular, and Optical Physics
ISSN10502947