Related papers: Multi-objective evolutionary algorithms for quantu…
Numerical calculus algorithms which estimate derivatives and integrals from data series acquired either via measurements or by sampling functions are essential in scientific computing. To date, a few quantum algorithms have been developed…
We present a computational method to automatically design the n-qubit realisations of quantum algorithms. Our approach leverages a domain-specific language (DSL) that enables the construction of quantum circuits via modular building blocks,…
The difference between classical and quantum algorithms (QA) is following: problem solved by QA is coded in the structure of the quantum operators. Input to QA in this case is always the same. Output of QA says which problem coded. In some…
Quantum process tomography is an experimental technique to fully characterize an unknown quantum process. Standard quantum process tomography suffers from exponentially scaling of the number of measurements with the increasing system size.…
Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms, such as machine learning or electronic structure simulation. The feasibility of these applications…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum…
Quantum algorithms use the principles of quantum mechanics, as for example quantum superposition, in order to solve particular problems outperforming standard computation. They are developed for cryptography, searching, optimisation,…
Consider the unstructured search of an unknown number l of items in a large unsorted database of size N. The multi-object quantum search algorithm consists of two parts. The first part of the algorithm is to generalize Grover's…
The architecture of circuital quantum computers requires computing layers devoted to compiling high-level quantum algorithms into lower-level circuits of quantum gates. The general problem of quantum compiling is to approximate any unitary…
Grover's algorithm is one of the most important quantum algorithms, which performs the task of searching an unsorted database without a priori probability. Recently the adiabatic evolution has been used to design and reproduce quantum…
In this paper, we propose a quantum algorithm that supports a real-valued higher-order unconstrained binary optimization (HUBO) problem. This algorithm is based on the Grover adaptive search that originally supported HUBO with integer…
The design of quantum circuits is often still done manually, for instance by following certain patterns or rule of thumb. While this approach may work well for some problems, it can be a tedious task and present quite the challenge in other…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. In effect, they follow the same logical paradigm as (multi-particle)…
Compilation and optimization of quantum circuits are critical components in the execution of algorithms on quantum computers. These components must successfully balance two competing priorities: minimizing the number of expensive resources,…
Gate-model quantum computers provide an experimentally implementable architecture for near term quantum computations. To design a reduced quantum circuit that can simulate a high complexity reference quantum circuit, an optimization should…
Digital quantum simulation is a promising application for quantum computers. Their free programmability provides the potential to simulate the unitary evolution of any many-body Hamiltonian with bounded spectrum by discretizing the time…
Optimizing high-degree of freedom robotic manipulators requires searching complex, high-dimensional configuration spaces, a task that is computationally challenging for classical methods. This paper introduces a quantum native framework…
We construct a classical algorithm that designs quantum circuits for algorithmic quantum simulation of arbitrary qudit channels on fault-tolerant quantum computers within a pre-specified error tolerance with respect to diamond-norm…
Quantum architecture search (QAS) is desired to construct a powerful and general QAS platform which can significantly accelerate quantum advantages in error-prone and depth limited quantum circuits in today Noisy Intermediate-Scale Quantum…
Traditional tree search algorithms supply a blueprint for modeling problem solving behaviour. A diverse spectrum of problems can be formulated in terms of tree search. Quantum computation, in particular Grover's algorithm, has aroused a…