Deterministic algorithms for the hidden subgroup problem

The hidden subgroup problem (HSP) plays a crucial role in the field of quantum computing, since several celebrated quantum algorithms including Shor's algorithm have a uniform description in the framework of HSP. The problem is as follows: for a finite group G and a finite set X, given a functi...

Full description

Bibliographic Details

Published in:	Information and computation Vol. 289; p. 104975
Main Authors:	Ye, Zekun, Li, Lvzhou
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.11.2022
Subjects:	Deterministic algorithm Hidden subgroup problem Quantum computing Query complexity Hidden subgroup problem Quantum computing Query complexity Deterministic algorithm
ISSN:	0890-5401, 1090-2651
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!