Improving Quantum Search on Simple Graphs by <i>Pretty Good</i> Structured Oracles
Quantum search algorithms provide a way to speed up combinatorial search, and have found several applications in modern quantum technology. In particular, spatial search on graphs, based on continuous-time quantum walks (CTQW), represents a promising platform for the implementation of quantum search...
Main Authors: | Matteo G. A. Paris, Claudia Benedetti, Stefano Olivares |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-01-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/13/1/96 |
Similar Items
-
Searching via Nonlinear Quantum Walk on the 2D-Grid
by: Giuseppe Di Molfetta, et al.
Published: (2020-11-01) -
Scattering as a Quantum Metrology Problem: A Quantum Walk Approach
by: Francesco Zatelli, et al.
Published: (2020-11-01) -
Quantum search degeneration under amplitude noise in queries to the oracle
by: Rastegin, A.E, et al.
Published: (2022) -
Subdivided Phase Oracle for NISQ Search Algorithms
by: Takahiko Satoh, et al.
Published: (2020-01-01) -
Generalizations Of The Quantum Search Algorithm
by: Tulsi, Tathagat Avatar
Published: (2010)