Related papers: Grover search under localized dephasing
We numerically simulate the effects of noise-induced sampling of alternative Hamiltonian paths on the ability of quantum adiabatic search (QuAdS) to solve randomly generated instances of the NP-Complete problem N-bit Exact Cover 3. The…
We extract the phase coherence of a qubit defined by singlet and triplet electronic states in a gated GaAs triple quantum dot, measuring on timescales much shorter than the decorrelation time of the environmental noise. In this non-ergodic…
We formulate a scheme for fault-tolerant quantum computation that works effectively against highly biased noise, where dephasing is far stronger than all other types of noise. In our scheme, the fundamental operations performed by the…
The angle coordinate of the Quantum Kicked Rotator problem is treated as if it were an extended coordinate. A new mechanism for destruction of coherence by noise is analyzed using both heuristic and formal approach. Its effectiveness…
A defining feature in the field of quantum computing is the potential of a quantum device to outperform its classical counterpart for a specific computational task. By now, several proposals exist showing that certain sampling problems can…
Continuous-time quantum walks may be exploited to enhance spatial search, i.e., for finding a marked element in a database structured as a complex network. However, in practical implementations, the environmental noise has detrimental…
Quantum algorithms for searching one or more marked items on a d-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms…
We present a scheme to neutralize the dephasing effect induced by classical noise on a qubit. The scheme builds upon the key idea that this kind of noise can be recorded by a classical device during the qubit evolution, and that its effect…
Building quantum devices using fixed operators is a must to simplify the hardware construction. Quantum search engine is not an exception. In this paper, a fixed phase quantum search algorithm that searches for M matches in an unstructured…
We introduce a simple diagrammatic approach for estimating how a randomly walking quantum particle searches on a graph in continuous-time, which involves sketching small weighted graphs with self-loops and considering degenerate…
In the current quantum computing paradigm, significant focus is placed on the reduction or mitigation of quantum decoherence. When designing new quantum processing units, the general objective is to reduce the amount of noise qubits are…
The Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to many areas in computer science and natural sciences. In this paper, we show that for the…
Quantum computational approaches to some classic target identification and localization algorithms, especially for radar images, are investigated, and are found to raise a number of quantum statistics and quantum measurement issues with…
Grover's Search algorithm was a breakthrough at the time it was introduced, and its underlying procedure of amplitude amplification has been a building block of many other algorithms and patterns for extracting information encoded in…
Quantum coherences are paramount resources for applications, such as quantum-enhanced light-harvesting or quantum computing, which are fragile against environmental noise. We here derive generalized quantum master equations using…
We present an information geometric characterization of Grover's quantum search algorithm. First, we quantify the notion of quantum distinguishability between parametric density operators by means of the Wigner-Yanase quantum information…
The idea that the search efficiency can be increased with the help of a number of autonomous agents is often relevant in many situations, which is known among biologists and roboticists as a stigmergy. This is due to the fact that, in any…
We formulate Grover's unstructured search algorithm as a chiral quantum walk, where transitioning in one direction has a phase conjugate to transitioning in the opposite direction. For small phases, this breaking of time-reversal symmetry…
In previous papers about searches on star graphs several patterns have been made apparent; the speed up only occurs when graphs are "tuned" so that their time step operators have degenerate eigenvalues, and only certain initial states are…
Grover's algorithm solves the unstructured search problem. Grover's algorithm can find the target state with certainty only if searching one out of four. Designing the deterministic search algorithm can avoid any repetition of the…