Results 1 to 10 of about 164 (49)
Playing Pool with $|ψ\rangle$: from Bouncing Billiards to Quantum Search [PDF]
In ``Playing Pool with $\pi$'' \cite{Galperin}, Galperin invented an extraordinary method to learn the digits of $\pi$ by counting the collisions of billiard balls.
Adam R. Brown
doaj +1 more source
A Parallel Quantum Circuit Implementations of LSH Hash Function for Use with Grover’s Algorithm
Grover’s search algorithm accelerates the key search on the symmetric key cipher and the pre-image attack on the hash function. To conduct Grover’s search algorithm, the target cipher algorithm should be efficiently implemented in a quantum circuit ...
Gyeongju Song +3 more
doaj +1 more source
Improving D2p Grover's algorithm to reach performance upper bound under phase noise
The original Grover's algorithm has a success probability to output a correct solution, while deterministic Grover's algorithms improve the success probability to 100%.
Jian Leng, Fan Yang, Xiang-Bin Wang
doaj +1 more source
SPEEDY Quantum Circuit for Grover’s Algorithm
In this paper, we propose a quantum circuit for the SPEEDY block cipher for the first time and estimate its security strength based on the post-quantum security strength presented by NIST.
Gyeongju Song +7 more
doaj +1 more source
Quantum Attacks on Sum of Even–Mansour Construction with Linear Key Schedules
Shinagawa and Iwata are considered quantum security for the sum of Even–Mansour (SoEM) construction and provided quantum key recovery attacks by Simon’s algorithm and Grover’s algorithm.
Ping Zhang
doaj +1 more source
Basis for a neuronal version of Grover’s quantum algorithm
Grover’s quantum (search) algorithm exploits principles of quantum information theory and computation to surpass the strong Church-Turing limit governing classical computers.
Kevin Bradley Clark, Kevin Bradley Clark
doaj +1 more source
The Quantum Binding Problem in the Context of Associative Memory. [PDF]
We present a method to solve the binding problem by using a quantum algorithm for the retrieval of associations from associative memory during visual scene analysis.
Andreas Wichert
doaj +1 more source
On Hitting Times for General Quantum Markov Processes [PDF]
Random walks (or Markov chains) are models extensively used in theoretical computer science. Several tools, including analysis of quantities such as hitting and mixing times, are helpful for devising randomized algorithms. A notable example is Schöning's
Lorenzo Laneve +2 more
doaj +1 more source
Resource Efficient Boolean Function Solver on Quantum Computer [PDF]
Nonlinear boolean equation systems play an important role in a wide range of applications. Grover's algorithm is one of the best-known quantum search algorithms in solving the nonlinear boolean equation system on quantum computers.
Xiang Li +3 more
doaj +1 more source
Gate-based quantum computing for protein design.
Protein design is a technique to engineer proteins by permuting amino acids in the sequence to obtain novel functionalities. However, exploring all possible combinations of amino acids is generally impossible due to the exponential growth of ...
Mohammad Hassan Khatami +3 more
doaj +1 more source

