Results 1 to 10 of about 45,791 (263)
Isomer search or molecule enumeration refers to the problem of finding all the isomers for a given molecule. Many classical search methods have been developed in order to tackle this problem.
Jason P Terry +3 more
doaj +5 more sources
Electric-Circuit Realization of Fast Quantum Search [PDF]
Quantum search algorithm, which can search an unsorted database quadratically faster than any known classical algorithms, has become one of the most impressive showcases of quantum computation. It has been implemented using various quantum schemes. Here,
Naiqiao Pan +3 more
doaj +2 more sources
Edge States, Bulk Spectra, and Topological Phases of Szegedy’s Quantum Search on a One-Dimensional Cycle with Self-Loops [PDF]
Topological transitions are relevant for boundary conditions. Therefore, we investigate the bulk spectra, edge states, and topological phases of Szegedy’s quantum search on a one-dimensional (1D) cycle with self-loops, where the search operator can be ...
Mengke Xu +4 more
doaj +2 more sources
We investigate the problem of quantum searching on a noisy quantum computer. Taking a fault-ignorant approach, we analyze quantum algorithms that solve the task for various different noise strengths, which are possibly unknown beforehand.
Péter Vrana +3 more
doaj +6 more sources
Quantum global minimum finder based on variational quantum search [PDF]
The search for global minima is a critical challenge across multiple fields including engineering, finance, and artificial intelligence, particularly with non-convex functions that feature multiple local optima, complicating optimization efforts.
Mohammadreza Soltaninia, Junpeng Zhan
doaj +2 more sources
Design of Grover’s Algorithm over 2, 3 and 4-Qubit Systems in Quantum Programming Studio [PDF]
In this paper, we design and analyse the Circuit for Grover’s Quantum Search Algorithm on 2, 3 and 4-qubit systems, in terms of number of gates, representation of state vectors and measurement probability for the state vectors.
Diana Jingle +4 more
doaj +1 more source
In this work, the quantum random walk search algorithm with a walk coin constructed by generalized Householder reflection and phase multiplier has been studied. The coin register is one qudit with an arbitrary dimension.
Hristo Tonchev, Petar Danev
doaj +1 more source
Quantum circuit design search [PDF]
This article explores search strategies for the design of parameterized quantum circuits. We propose several optimization approaches including random search plus survival of the fittest, reinforcement learning both with classical and hybrid quantum classical controllers and Bayesian optimization as decision makers to design a quantum circuit in an ...
Mohammad Pirhooshyaran, Tamás Terlaky
openaire +2 more sources
Uncertainty Relation between Detection Probability and Energy Fluctuations
A classical random walker starting on a node of a finite graph will always reach any other node since the search is ergodic, namely it fully explores space, hence the arrival probability is unity.
Felix Thiel +3 more
doaj +1 more source
Generalised Quantum Tree Search [PDF]
This extended abstract reports on on-going research on quantum algorithmic approaches to the problem of generalised tree search that may exhibit effective quantum speedup, even in the presence of non-constant branching factors. Two strategies are briefly summarised and current work outlined.
Sequeira, André Manuel Resende +2 more
openaire +3 more sources

