Circuit-depth optimization of quantum partial-search algorithms

arXiv:2609.28147 · quant-ph · Submitted 2026-09-23 · Read on arXiv

quant-ph

Submitted: 2026-09-23

Updated: 2026-09-23

Terminology

• Query Complexity — 2× in this paper · explained in 2 episodes
• Accuracy — 1× in this paper · explained in 1 episode
• Quantum Circuits — 1× in this paper · explained in 2 episodes
• Trace — 1× in this paper · explained in 2 episodes
• Verification — 1× in this paper · explained in 2 episodes

Sources

• Quantum Amplitude Amplification and Estimation
• q-means: A quantum algorithm for unsupervised machine learning
• Asymptotic optimality of Grover-Radhakrishnan-Korepin algorithm
• Hardware Efficient Quantum Search Algorithm
• Palindromic structure of depth-efficient quantum search algorithms
• Quantum Search without Global Diffusion
• Elementary gates for quantum computation

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity