Related papers: Distributed exact quantum algorithms for Bernstein…

Numerous conceptually important quantum algorithms rely on a black-box device known as an oracle, which is typically difficult to construct without knowing the answer to the problem that the algorithm is intended to solve. A notable example…

Grover's quantum search algorithm provides a quadratic quantum advantage over classical algorithms across a broad class of unstructured search problems. The original protocol is probabilistic, returning the desired result with significant…

Simulating quantum circuits using classical computers can accelerate the development and validation of quantum algorithms. Our newly developed algorithm, variational quantum search (VQS), has shown an exponential advantage over Grover's…

The main approach to hybrid quantum-classical neural networks (QNN) is employing quantum computing to build a neural network (NN) that has quantum features, which is then optimized classically. Here, we propose a different strategy: to use…

The automated design of parameterized quantum circuits for variational algorithms in the NISQ era faces a fundamental limitation, as conventional differentiable architecture search relies on classical models that fail to adequately…

Recently several quantum search algorithms based on quantum walks were proposed. Those algorithms differ from Grover's algorithm in many aspects. The goal is to find a marked vertex in a graph faster than classical algorithms. Since the…

Grover's algorithm is a fundamental quantum algorithm that achieves a quadratic speedup for unstructured search problems of size $N$. Recent studies have reformulated this task as a maximization problem on the unitary manifold and solved it…

We introduce an iterative method to search for time-optimal Hamiltonians that drive a quantum system between two arbitrary, and in general mixed, quantum states. The method is based on the idea of progressively improving the efficiency of…

Quite often in database search, we only need to extract portion of the information about the satisfying item. Recently Radhakrishnan & Grover [RG] considered this problem in the following form: the database of $N$ items was divided into $K$…

Quantum advantage is the core of quantum computing. Grover's search algorithm is the only quantum algorithm with proven advantage to any possible classical search algorithm. However, realizing this quantum advantage in practice is quite…

Quantum aided Byzantine agreement (QBA) is an important distributed quantum algorithm with unique features in comparison to classical deterministic and randomized algorithms, requiring only a constant expected number of rounds in addition…

Dynamical decoupling (DD) is a low-overhead method for quantum error suppression. Despite extensive work in DD design, finding pulse sequences that optimally decouple computational qubits on noisy quantum hardware is not well understood. In…

Variational quantum algorithms (VQAs) have emerged as a promising near-term technique to explore practical quantum advantage on noisy intermediate-scale quantum (NISQ) devices. However, the inefficient parameter training process due to the…

We investigate a set of discrete-time quantum search algorithms on the n-dimensional hypercube following a proposal by Shenvi, Kempe and Whaley. We show that there exists a whole class of quantum search algorithms in the symmetry reduced…

The Bernstein-Vazirani (BV) algorithm is frequently taught as a canonical example of quantum parallelism, yet the standard interference-based explanation often obscures its underlying simplicity. We present a geometric reframing in which…

The distributed subgradient method (DSG) is a widely discussed algorithm to cope with large-scale distributed optimization problems in the arising machine learning applications. Most exisiting works on DSG focus on ideal communication…

This paper generalizes both the binary Deutsch-Jozsa and Grover algorithms to $n$-valued logic using the quantum Fourier transform. Our extended Deutsch-Jozsa algorithm is not only able to distinguish between constant and balanced Boolean…

Grover's algorithm is one of the most famous algorithms which explicitly demonstrates how the quantum nature can be utilized to accelerate the searching process. In this work, Grover's quantum search problem is mapped to a time-optimal…

The desired interference required for quantum computing may be modified by the wave function oscillations for the implementation of quantum algorithms[Phys.Rev.Lett.84(2000)1615]. To diminish such detrimental effect, we propose a scheme…

The Grover search algorithm performs an unstructured search of a marked item in a database quadratically faster than classical algorithms and is shown to be optimal. Here, we show that if the search space is divided into two blocks with the…