Related papers: Feasibility Analysis of Grover-meets-Simon Algorit…
Many quantum algorithms for attacking symmetric cryptography involve the rank problem of quantum linear equations. In this paper, we first propose two quantum algorithms for solving quantum linear systems of equations with coherent…
Quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size…
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,…
It is suggested that the individual outcomes of a measurement process can be understood within standard quantum mechanics in terms of the measuring apparatus, treated as a quantum computer, executing Grover's search algorithm.
A new approach to the classical limit of Grover's algorithm is discussed by assuming a very rapid dephasing of a system between consecutive Grover's unitary operations, which drives pure quantum states to decohered mixed states. One can…
Quantum algorithms are conventionally formulated for implementation on a single system of qubits amenable to projective measurements. However, in expectation value quantum computation, such as nuclear magnetic resonance realizations, the…
In this paper, we study decoherence on Grover's quantum searching algorithm using a perturbative method. We assume that each two-state system (qubit) suffers \sigma_{z} error with probability p (0\leq p\leq 1) independently at every step in…
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum…
This is continuation of the approach to performing quantum algorithms using geometric structures which was presented by Aerts and Czachor. We solve the Simon's problem which, next to the Shor's alghorithm, is a representative of a quantum…
Quantum algorithms designed for realistic quantum many-body systems, such as chemistry and materials, usually require a large number of measurements of the Hamiltonian. Exploiting different ideas, such as {importance sampling,} observable…
The Boolean satisfiability problem (SAT) is of central importance in both theory and practice. Yet, most provable guarantees for quantum algorithms rely exclusively on Grover-type methods that cap the possible advantage at only quadratic…
Run-times of quantum algorithms are often studied via an asymptotic, worst-case analysis. Whilst useful, such a comparison can often fall short: it is not uncommon for algorithms with a large worst-case run-time to end up performing well on…
Simon's problem is one of the most important problems demonstrating the power of quantum algorithms, as it greatly inspired the proposal of Shor's algorithm. The generalized Simon's problem is a natural extension of Simon's problem, and…
Limited by today's physical devices, quantum circuits are usually noisy and difficult to be designed deeply. The novel computing architecture of distributed quantum computing is expected to reduce the noise and depth of quantum circuits. In…
Simon's hidden subgroup algorithm was the first quantum algorithm to prove the superiority of quantum computing over classical computing in terms of complexity. Measurement-based quantum computing (MBQC) is a formulation of quantum…
We propose a quantum machine learning algorithm for efficiently solving a class of problems encoded in quantum controlled unitary operations. The central physical mechanism of the protocol is the iteration of a quantum time-delayed equation…
Grover's algorithm achieves a quadratic speedup over classical algorithms, but it is considered necessary to know the value of $\lambda$ exactly [Phys. Rev. Lett. 95, 150501 (2005); Phys. Rev. Lett. 113, 210501 (2014)], where $\lambda$ is…
Quantum image processing (QIP) means the quantum based methods to speed up image processing algorithms. Many quantum image processing schemes claim that their efficiency are theoretically higher than their corresponding classical schemes.…
Grover's quantum algorithm can find a marked item from an unstructured database faster than any classical algorithm, and hence it has been used for several applications such as cryptanalysis and optimization. When there exist multiple…
In symmetric cryptanalysis, the model of superposition queries has led to surprising results, with many constructions being broken in polynomial time thanks to Simon's period-finding algorithm. But the practical implications of these…