相关论文: Broken Promises and Quantum Algorithms

Deutsch's algorithm is the first quantum algorithm to show the advantage over the classical algorithm. Here we generalize Deutsch's problem to $n$ functions and propose a new quantum algorithm with indefinite causal order to solve this…

We propose a method for quantum algorithm design assisted by machine learning. The method uses a quantum-classical hybrid simulator, where a "quantum student" is being taught by a "classical teacher." In other words, in our method, the…

The existence of entangled quantum states gives extra power to quantum computers over their classical counterparts. Quantum entanglement shows up qualitatively at the level of two qubits. We show that if no entanglement is envolved then…

Quantum information processing has been one of the pillars of the new information age. In this sense, the control and processing of quantum information plays a fundamental role, and computers capable of manipulating such information have…

The well-known Deutsch Algorithm (DA) and Deutsch-Jozsha Algorithm (DJA) both are used as an evidence to the power of quantum computers over classical computation mediums. In these theoretical experiments, it has been shown that a quantum…

Quantum computing implementations under consideration today typically deal with systems with microscopic degrees of freedom such as photons, ions, cold atoms, and superconducting circuits. The quantum information is stored typically in…

A recent paper on quantum walks by Childs et al. [STOC'03] provides an example of a black-box problem for which there is a quantum algorithm with exponential speedup over the best classical randomized algorithm for the problem, but where…

Promise problems were mainly studied in quantum automata theory. Here we focus on state complexity of classical automata for promise problems. First, it was known that there is a family of unary promise problems solvable by quantum automata…

Quantum computing has shown promise for solving complex optimization problems in databases, such as join ordering and index selection. Prior work often submits formulated problems directly to black-box quantum or quantum-inspired solvers…

Deutsch-Jozsa algorithm has been implemented via a quantum adiabatic evolution by S. Das et al. [Phys. Rev. A 65, 062310 (2002)]. This adiabatic algorithm gives rise to a quadratic speed up over classical algorithms. We show that a modified…

We give and prove an optimal exact quantum query algorithm with complexity $k+1$ for computing the promise problem (i.e., symmetric and partial Boolean function) $DJ_n^k$ defined as: $DJ_n^k(x)=1$ for $|x|=n/2$, $DJ_n^k(x)=0$ for $|x|$ in…

We present a novel approach to quantum algorithms, by taking advantage of modular values, i.e., complex and unbounded quantities resulting from specific post-selected measurement scenarios. Our focus is on the problem of ascertaining…

The present work points out that the Deutsch-Jozsa algorithm was the first formal description of a quantum decider. In particular, it is studied here the class of languages whose indicator functions allow the Deutsch-Jozsa algorithm to…

We obtain the strongest separation between quantum and classical query complexity known to date -- specifically, we define a black-box problem that requires exponentially many queries in the classical bounded-error case, but can be solved…

Distributed quantum computing can give substantial noise reduction due to shallower circuits. An experiment illustrates the advantages in the case of Grover search. This motivates studying the quantum advantage of the distributed version of…

Quantum algorithms have demonstrated promising speed-ups over classical algorithms in the context of computational learning theory - despite the presence of noise. In this work, we give an overview of recent quantum speed-ups, revisit the…

A classical analogue of Deutsch and Jozsa's algorithm is given and its implications on quantum computing is discussed

Quantum algorithms and complexity have recently been studied not only for discrete, but also for some numerical problems. Most attention has been paid so far to the integration problem, for which a speed-up is shown by quantum computers…

Classical programming languages cannot model essential elements of complex systems such as true random number generation. This paper develops a formal programming language called the lambda-q calculus that addresses the fundamental…

The short-path quantum algorithm introduced by Hastings (Quantum 2018, 2019) is a variant of adiabatic quantum algorithms that enables an easier worst-case analysis by avoiding the need to control the spectral gap along a long adiabatic…