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

Full description

Saved in:

Bibliographic Details
Published in:	Quantum information processing Vol. 20; no. 1
Main Authors:	Xu, Guoliang, Qiu, Daowen
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.01.2021 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!