arXiv (All)
open access
Circuit-depth optimization of quantum partial-search algorithms
Grover's algorithm is optimal in terms of oracle queries. We can trade accuracy for speed, which gives rise to the quantum partial-search algorithm. The partial-search algorithm is implemented using two kinds of Grover operators, global and local, where the former is the standard Grover operator for
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA#1011048
- Feedback-based quantum optimization with low depth and measurement#1116764
- Transformers as Intrinsic Optimizers for Quantum Approximate Optimization Algorithm#1013987
- Managing Iterative Hybrid Quantum-Classical Optimization as a First-Class Scientific Workflow#1104731
- Factorized Boolean representations for efficient quantum synthesis#819473
Record · ID 1064691
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive