相关论文: A Quantitative Measure of Interference
We study the influence of errors and decoherence on both the performance of Shor's factoring algorithm and Grover's search algorithm, and on the amount of interference in these algorithms using a recently proposed interference measure. We…
Quantitative measures are introduced for the indistinguishability $U$ of two quantum states in a given measurement and the amount of interference $I$ observable in this measurement. It is shown that these measures obey an inequality $U\geq…
We study a reduced quantum circuit computation paradigm in which the only allowable gates either permute the computational basis states or else apply a "global Hadamard operation", i.e. apply a Hadamard operation to every qubit…
Lately, much attention has been given to quantum algorithms that solve pattern recognition tasks in machine learning. Many of these quantum machine learning algorithms try to implement classical models on large-scale universal quantum…
We study the amount of interference in random quantum algorithms using a recently derived quantitative measure of interference. To this end we introduce two random circuit ensembles composed of random sequences of quantum gates from a…
Quantum interference is typically detected through the dependence of the interference signal on certain parameters (path length, Aharonov-Bohm flux, etc.), which can be varied in a controlled manner. The destruction of interference by a…
The effect of unitary noise on the performance of Grover's quantum search algorithm is studied. This type of noise may result from tiny fluctuations and drift in the parameters of the (quantum) components performing the computation. The…
Quantum algorithms are at the heart of the ongoing efforts to use quantum mechanics to solve computational problems unsolvable on ordinary classical computers. Their common feature is the use of genuine quantum properties such as…
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)…
There are quantum procedures that encode the solutions to a problem in the phases of quantum amplitudes. This happens in some quantum optimization algorithms in which the value of a function to be maximized or minimized is represented by a…
Emerging models of quantum computation driven by multi-photon quantum interference, while not universal, may offer an exponential advantage over classical computers for certain problems. Implementing these circuits via geometric phase gates…
Quantum computers have the potential to outperform classical computers in a range of computational tasks, such as prime factorisation and unstructured searching. However, real-world quantum computers are subject to noise. Quantifying noise…
Quantum interference can profoundly affect charge transport in single molecules, but experiments can usually measure only the conductance at the Fermi energy. Because in general the most pronounced features of the quantum interference are…
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,…
Considering its relevance in the field of cryptography, integer factorization is a prominent application where Quantum computers are expected to have a substantial impact. Thanks to Shor's algorithm this peculiar problem can be solved in…
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 states can in a sense be thought of as generalizations of classical probability distributions, but are more powerful than probability distributions when used for computation or communication. Quantum speedup therefore requires some…
Despite their inextricable quantum mechanical nature, events at a high energy particle collider experiment typically have very few unambiguous quantum signatures, due the type of data and the manner in which they are collected. We present a…
It is an open question how fast information processing can be performed and whether quantum effects can speed up the best existing solutions. Signal extraction, analysis and compression in diagnostics, astronomy, chemistry and broadcasting…
In this paper, we study the nature of entanglement in quantum Grover's and Shor's algorithms. So far, the authors who have been interested in this problem have approached the question quantitatively by introducing entanglement measures…