Characterization of Exact One-Query Quantum Algorithms for Partial Boolean Functions

The query model (or black-box model) has attracted much attention from the communities of both classical and quantum computing. Usually, quantum advantages are revealed by presenting a quantum algorithm that has a better query complexity than its classical counterpart. In the history of quantum algo...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computer science and technology Vol. 38; no. 6; pp. 1423 - 1430
Main Authors:	Ye, Ze-Kun, Li, Lv-Zhou
Format:	Journal Article
Language:	English
Published:	Singapore Springer Nature Singapore 01.12.2023 Springer Springer Nature B.V
Subjects:	Algorithms Analysis Artificial Intelligence Boolean Boolean functions Codes Computer Science Data Structures and Information Theory Information Systems Applications (incl.Internet) Mathematical models Quantum computing Queries Regular Paper Software Engineering Theory of Computation quantum query complexity quantum algorithm quantum computing
ISSN:	1000-9000, 1860-4749
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!