From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm

In quantum computation, designing an optimal exact quantum query algorithm (i.e., a quantum decision tree algorithm) for any small input Boolean function is a fundamental and abstract problem. As we are aware, there is not a general method for this problem. Due to the fact that every Boolean functio...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Quantum information processing Ročník 20; číslo 1
Hlavní autori:	Xu, Guoliang, Qiu, Daowen
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.01.2021 Springer Nature B.V
Predmet:	Algorithms Boolean Boolean algebra Boolean functions Complexity Data Structures and Information Theory Decision trees Mathematical Physics Operators (mathematics) Physics Physics and Astronomy Polynomials Quantum Computing Quantum Information Technology Quantum Physics Queries Representations Spintronics Quantum query algorithm Boolean function Quantum computation Algorithm framework Sum-of-squares representation
ISSN:	1570-0755, 1573-1332
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!