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...

Celý popis

Podrobná bibliografia

Vydané v:	Information and computation Ročník 289; s. 104975
Hlavní autori:	Ye, Zekun, Li, Lvzhou
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.11.2022
Predmet:	Deterministic algorithm Hidden subgroup problem Quantum computing Query complexity Hidden subgroup problem Quantum computing Query complexity Deterministic algorithm
ISSN:	0890-5401, 1090-2651
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!