Hardware-Aware Realization of Deterministic Quantum-Walk Search on Complete Bipartite Graphs
Tao Rong, Meng Li, Xin Tong, Jianbin Cai, Yu Li, Naibin Zhou, Shaowei Li, Sirui Cao, Yuan Li, Yu Xu, Fusheng Chen, Ming Gong, Xiaoming Sun, Chen Zha
Abstract
Complete bipartite graphs offer a canonical platform for deterministic quantum search with quadratic speedup. We report the first experimental realization of deterministic discrete-time quantum-walk search over complete bipartite graphs, enabled by high-fidelity operations and a dynamical-phase compensation scheme, using a digital gate-based processor rather than an evolution-based platform. By compiling the search circuits to the native gate set and square-lattice topology, we implement full-space encoding to realize instances of graph sizes N = 4 and 8, with success probabilities of 97.6% and 70.8% for finding the marked vertex, respectively. We also realize resource-efficient exact instances up to size N = 16, the largest achieving 66% success probability. Separately, a reduced invariant-subspace encoding preserves the dynamics of the deterministic search algorithm on two qubits for nominal problem sizes up to N = 256, with the success probability approaching 50%. Resource analyses of logical, hardware-compiled, and fault-tolerant-gate-set-synthesized circuits show that circuit depth and size scale as N, with hardware overheads entering only as constant prefactors. For application-scale graphs (N 105), an effective gate-fidelity model requires per-gate infidelity near 10-7. These results establish a concrete algorithm-to-hardware pathway for deterministic structured quantum search on gate-based quantum processors.
Create a lesson
Related papers
High-temperature Gibbs states are uniformly Markovian and trivial
Andrew D. Kim, Tai Hsuan Yang, Jong Yeon Lee
Query-Optimal Quantum Minimum Finding from Numerical Estimators
Egil Bae
Fast, in-place, and ancilla-free quantum algorithms for integer multiplication and inversion
David Halpenny, Adithya Sireesh, Petros Wallden
High-Accuracy Neural-Network Quantum States via Randomized Real-Time Dynamics
John M. Martyn, Rod Rofougaran, Samuel Stein et al.
End-to-End Quantum Algorithm for Differential Equations: Application to Simulating a Biomolecular System
Mohsen Bagherimehrab, Daniyaal Farooqi, Gavin K. Brennen et al.
Classically Trained Quantum Generative Models with Shared Training and Fine Tuning for Quantum Matter
Mario Herrero-Gonzalez, Elham Kashefi, Mina Doosti