Shallow-Depth Quantum Circuit for Unstructured Database Search
Grover’s search algorithm (GSA) offers quadratic speedup in searching unstructured databases but suffers from exponential circuit depth complexity. Here, we present two quantum circuits called HX and Ry layers for the searching problem. Remarkably, both circuits maintain a fixed circuit depth of two...
Saved in:
| Main Author: | Junpeng Zhan |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-10-01
|
| Series: | Quantum Reports |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2624-960X/6/4/37 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Mixed Grover: A Hybrid Version to Improve Grover's Algorithm for Unstructured Database Search
by: Romain Piron, et al.
Published: (2025-01-01) -
Quantum Feasibility Labeling for NP-Complete Vertex Coloring Problem
by: Junpeng Zhan
Published: (2025-01-01) -
Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems
by: Rei Sato, et al.
Published: (2025-01-01) -
Characterizing Grover search algorithm on large-scale superconducting quantum computers
by: Muhammad AbuGhanem
Published: (2025-01-01) -
Demonstration of Grover’s algorithm for retrieving secret keys in a basic SPN block cipher
by: Minh Thang Vu, et al.
Published: (2024-10-01)