Quantum computation is an exciting field which is attracting increasing attention
unremittingly since the early 1980s. This field rests on the shoulder of a giant because …

We provide two sufficient and necessary conditions to characterize any n-bit partial Boolean
function with exact quantum query complexity 1. Using the first characterization, we present …

In quantum computation, designing an optimal exact quantum query algorithm (ie, a
quantum decision tree algorithm) for any small input Boolean function is a fundamental and …

Deutsch–Jozsa problem (D–J) has exact quantum 1-query complexity (“exact” means no
error), but requires super-exponential queries for the optimal classical deterministic decision …

Early in 1992, Deutsch-Jozsa algorithm computed a symmetric partial Boolean function with
a single quantum query, and thus achieved the best separation between classical …

Understanding quantum speed-up over classical computing is fundamental for the
development of efficient quantum algorithms. In this paper, we study such problem within the …

This paper overviews the development of the quantum information technology and the
quantum computing over the years, highlighting its potential promising applications in …

This book covered the essential concepts and fundamental algorithms of quantum
computing. The reader that followed the book until the end should be able to follow the …

In theoretical quantum computer science, understanding where and how computational
speed-ups occur while applying quantum properties is a primary goal. In this paper, we …