Robust Quantum Search with Uncertain Number of Target States
The quantum search algorithm is one of the milestones of quantum algorithms. Compared with classical algorithms, it shows quadratic speed-up when searching marked states in an unsorted database. However, the success rates of quantum search algorithms are sensitive to the number of marked states. In...
Main Authors: | Yuanye Zhu, Zeguo Wang, Bao Yan, Shijie Wei |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-12-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/23/12/1649 |
Similar Items
-
Quantum-Solving Algorithm for d’Alembert Solutions of the Wave Equation
by: Yuanye Zhu
Published: (2022-12-01) -
Reducing number of gates in quantum random walk search algorithm via modification of coin operators
by: Hristo Tonchev, et al.
Published: (2023-03-01) -
Variational-state quantum metrology
by: Bálint Koczor, et al.
Published: (2020-01-01) -
Quantum Spatial Search with Electric Potential: Long-Time Dynamics and Robustness to Noise
by: Thibault Fredon, et al.
Published: (2022-12-01) -
Implementation of Grover’s Iterator for Quantum Searching With an Arbitrary Number of Qubits
by: Sihyung Lee, et al.
Published: (2024-01-01)