betaFeedback

WorksPhysics and Astronomy

Hardware-Aware Realization of Deterministic Quantum-Walk Search on Complete Bipartite Graphs

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=4N = 4 and 88, 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=16N = 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=256N = 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\sqrt{N}, with hardware overheads entering only as constant prefactors. For application-scale graphs (N∼105N \sim 10^5), an effective gate-fidelity model requires per-gate infidelity near 10−710^{-7}. These results establish a concrete algorithm-to-hardware pathway for deterministic structured quantum search on gate-based quantum processors.

Introduction—

Complete bipartite graphs model two-mode interaction systems across recommendation, biological, and quantum spin networks, where the absence of intra-class edges imposes a spectral symmetry shaping all dynamical processes, while bipartition and marked-set asymmetry yield richer interference dynamics that better reflect structured real-world systems [1, 2]. Although complete bipartite graphs are highly symmetric, bipartite quadratic assignment problem-type problems remain NP-hard on them [3]. This motivates our study of search algorithms for complete bipartite graphs.

Quantum walks, realized in continuous and discrete forms across platforms [4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16], achieve quadratic and even exponential speedups for certain structured search problems [17, 18, 19, 20, 21, 22, 23, 24]. Yet their success probabilities oscillate, preventing deterministic retrieval, which motivates schemes concentrating all probability at a prescribed time. Such ideas are well developed for Grover-type search [25, 26] and extended to several continuous-time quantum-walk (CTQW) models [27, 28, 29]. However, CTQW’s Hamiltonian formulation aligns less naturally with gate-based, fault-tolerant computing, whereas discrete-time quantum-walk (DTQW) maps directly to circuits. DTQW achieves deterministic search on complete graphs [25, 26], but this does not transfer to complete bipartite graphs, where bipartition and marked-set asymmetry break the simple two-state dynamics. Building on this, a recent deterministic DTQW search algorithm [30] overcomes the obstacle using a generalized Grover coin and a tunable phase oracle, mapping the dynamics onto an effective four-state (or eight-state) model and concentrating all probability on the marked vertex at a prescribed time, thereby achieving unit success probability with quadratic speedup.

Nevertheless, translating this ideal algorithm into executable circuits on gate-based hardware is nontrivial, requiring edge-space encoding, oracle and coin synthesis, conditional-shift implementation, hardware compilation and fidelity analysis.

We validate this full pipeline on the gate-based hardware [31], compiling the resulting circuits to the native gate set and square-lattice topology to analyze how circuit depth, gate count, and required gate fidelity scale with graph size.

We then report the first experimental realization of quantum-walk search on a complete bipartite graph, with a success probability exceeding the same-query classical baseline [32] at graph size N=8N = 8, and introduce a reduced invariant-subspace encoding that extends the accessible range on two qubits for the scalability benchmark. Together, these results identify circuit depth and accumulated gate errors—not Hilbert-space dimension alone—as the dominant scaling bottleneck. This work establishes an explicit algorithm-to-hardware pathway for structured quantum search on future processors.

Algorithm Setting and Circuit Construction—

The deterministic search protocol is naturally formulated as a discrete-time quantum walk on the edge space of a complete bipartite graph. Following Ref. [30], we consider G(V,E)G(V,E) as a complete bipartite graph with vertex partition V=V1∪V2V = V_1 \cup V_2, where ∣V1∣=N1|V_1| = N_1 and ∣V2∣=N2|V_2| = N_2. The walk acts on the edge Hilbert space spanned by {∣v,u⟩:(v,u)∈E}\{|v,u\rangle: (v,u) \in E\}.

The one-step walk search operator is U(α,β)=SC(α)Q(β)U(\alpha,\beta) = SC(\alpha)Q(\beta), with the coin operator C(α)∣v,u⟩=∣v⟩⊗Gv(α)∣u⟩C(\alpha)|v,u\rangle= |v\rangle\otimes G_v(\alpha)|u\rangle and Gv(α)=(1−e−iα)∣sv⟩⟨sv∣−IG_v(\alpha) = (1-e^{-i\alpha})|s_v\rangle\langle s_v|-I, where ∣sv⟩=1dv∑(v,u)∈E∣u⟩|s_v\rangle= \frac{1}{\sqrt{d_v}}\sum_{(v,u)\in E}|u\rangle and dvd_v represents the degree of vertex vv. The conditional shift satisfies S∣v,u⟩=∣u,v⟩S|v,u\rangle= |u,v\rangle, and the oracle acts as

Q(β)∣v,u⟩={eiβ∣v,u⟩,v∈M,∣v,u⟩,v∉M,Q(\beta)|v,u\rangle= \begin{cases} e^{i\beta}|v,u\rangle, & v \in M,\\ |v,u\rangle, & v \notin M, \end{cases}

for marked set M⊂VM \subset V.

With M⊂V1M \subset V_1 and ∣M∣=n1>0|M|=n_1>0 known, the following four states span a U(α,β)U(\alpha,\beta)-invariant subspace:

∣ϕ1⟩=1n1N2∑v∈M,u∈V2∣v,u⟩,|\phi_1\rangle= \frac{1}{\sqrt{n_1N_2}}\sum_{v\in M,u\in V_2}|v,u\rangle,
∣ϕ2⟩=1(N1−n1)N2∑v∈V1∖M,u∈V2∣v,u⟩,|\phi_2\rangle= \frac{1}{\sqrt{(N_1-n_1)N_2}}\sum_{v\in V_1\setminus M,u\in V_2}|v,u\rangle,
∣ϕ3⟩=1n1N2∑v∈V2,u∈M∣v,u⟩,|\phi_3\rangle= \frac{1}{\sqrt{n_1N_2}}\sum_{v\in V_2,u\in M}|v,u\rangle,
∣ϕ4⟩=1(N1−n1)N2∑v∈V2,u∈V1∖M∣v,u⟩.|\phi_4\rangle= \frac{1}{\sqrt{(N_1-n_1)N_2}}\sum_{v\in V_2,u\in V_1\setminus M}|v,u\rangle.

With appropriate parameters {αj,βj}\{\alpha_j,\beta_j\}, the initial state ∣ψ(0)⟩=12N1N2∑v∈V,(v,u)∈E∣v,u⟩|\psi(0)\rangle= \frac{1}{\sqrt{2N_1N_2}}\sum_{v\in V,(v,u)\in E}|v,u\rangle evolves to unit success probability after O(N1/n1)O(\sqrt{N_1/n_1}) walk steps [30].

As a practical motivation, the National Resident Matching Program (NRMP) [33, 34] maps naturally onto a complete bipartite graph, with applicants and residency positions as the two vertex sets, as shown in Figure 1(a). Locating a marked applicant or position is therefore a structured-search task on this graph. We assess the viability of the deterministic DTQW protocol by estimating the resources required after hardware compilation and running the hardware-compiled circuits of Figure 1(c) on the quantum experiment platform depicted in Figure 1(b), including both the general full-space encoding and the exact n1/N1=1/4n_1/N_1=1/4 resource-efficient instance.

Figure 1. Overview of the experimental platform and algorithm implementation. (a) Schematic representation of embedding an NRMP problem into a complete bipartite graph, where the top nodes represent all active applicants and the bottom nodes represent all available positions. (b) Square-lattice topology and physical qubit connectivity of the quantum processor used in this work. (c) Full algorithmic quantum circuits for the general and special cases.

Resource scaling and gate-fidelity requirements—

To assess the practical feasibility of the deterministic DTQW search algorithm, we analyze how its resource cost grows with graph size after realistic hardware compilation. We focus on the general full-space construction, since it directly realizes the original search problem and therefore governs the asymptotic cost. The special case, by contrast, has a fixed circuit structure and does not probe the same bottleneck. For this analysis we adopt the balanced encoding N1=N2=2nN_1=N_2=2^n, giving a total size N=2n+1N=2^{n+1}, where nn is the bit length of one partition and is distinct from the marked-set size n1=∣M∣n_1=|M|. The vertex/edge-register encoding and the oracle, coin, and shift definitions are detailed in the Supplemental Material [35].

To distinguish algorithmic scaling from hardware overhead, we compare three circuit representations up to N≃1.3×105N \simeq1.3\times10^5 (n=16n=16) in Figure 2(a,Figure 2b). The logical circuit has no connectivity constraint; the hardware-compiled circuit uses square-lattice connectivity and the native gate set {H,Rz,CZ}\{H,R_z,CZ\}; and the SK-synthesized circuit further applies Solovay–Kitaev (SK) synthesis [36] over {H,T,T†,Z}\{H,T,T^\dagger,Z\}, retaining CZ gates. The last stage projects resources for fault-tolerant implementations, excluding error-correction overhead; experiments use hardware-compiled circuits without SK synthesis. Multicontrolled phase rotations dominate each walk step, requiring O(log⁡n)O(\log n) depth and O(n)O(n) gates [37]. With O(2n)O(\sqrt{2^n}) search iterations, both total depth and size scale as N\sqrt{N} up to logarithmic factors. Over the investigated range, hardware compilation increases depth by a factor of 4–5 and size by 5–6, while SK synthesis adds a further factor of about 2 to both, preserving the leading N\sqrt{N} scaling.

Figure 2. Resource scaling and gate-fidelity requirements for the general complete-bipartite graph search circuit. (a) Circuit depth versus graph size for the logical circuit, the hardware-compiled circuit mapped to the square-lattice topology and native gate set, and the SK-synthesized circuit obtained by subsequent Solovay–Kitaev (SK) synthesis. (b) Corresponding circuit size versus graph size. (c) Required per-gate infidelity, 1−fg1-f_g, versus graph size under Ftot≥0.5F_{\mathrm{tot}} \ge0.5, estimated from fitted gate-count models for the logical and SK-synthesized circuits; the vertical dashed line indicates the current Zuchongzhi 3.1 graph-size limit estimated from calibrated one- and two-qubit gate fidelities using the effective gate-fidelity model.

Because a direct success-rate estimation becomes intractable at large NN, we use the total circuit fidelity Ftot=fgNgF_{\mathrm{tot}}=f_g^{N_g} as a scalable proxy for the hardware requirement, where fgf_g is the effective elementary-gate fidelity and NgN_g is a fitted gate count obeying log⁡Ng=an+blog⁡n+c\log N_g = an+b\log n+c. Taking Ftot≥0.5F_{\mathrm{tot}}\geq0.5 as an order-unity criterion, the comparison in Figure 2(c) shows that hardware compilation and SK synthesis tighten the required per-gate infidelity by roughly an order of magnitude relative to the logical estimate. Applying this model to the calibrated Zuchongzhi3.1Zuchongzhi 3.1 fidelities places the current device at only a small graph size, as marked by the vertical dashed line in Figure 2(c), confirming that present hardware only supports proof-of-principle full-space demonstrations. Reaching application scale is far more demanding. A graph size N∼105N\sim10^5, matching the latest NRMP instance [33, 34], already requires a per-gate infidelity near 10−710^{-7}, and N∼1010N\sim10^{10} requires the 10−910^{-9} level, setting concrete logical-gate performance targets for fault-tolerant implementations.

Experimental Results—

Following the circuit-level resource analysis, we implement both the general full-space circuit and the resource-efficient special-case circuit on the Zuchongzhi3.1Zuchongzhi 3.1 superconducting quantum processor. The logical walk operator U(α,β)U(\alpha,\beta) is compiled into the native gate set consisting of single-qubit π/2\pi/2 rotations and CZ gates, with circuit depth increasing with graph size. We experimentally realize circuits involving up to seven qubits, corresponding to a graph size of N=16N=16. To mitigate dephasing during long idle periods, dynamical-decoupling pulses are inserted throughout circuit execution. We further calibrate and compensate the dynamical phases induced by transient effects of the CZ control pulses using virtual-ZZ corrections, as detailed in the Supplemental Material [35].

In the general case, we performed search experiments for graph sizes N=4N = 4 and N=8N = 8, with the results shown in Figure 3(a) and (b), respectively. In both instances, the success probability increases with the number of walk steps, reaching final values of 97.6% and 70.8%, respectively. For the N=8N = 8 case, the measured success probability exhibits a sharp increase after t=1t = 1 and surpasses the classical success probability Pcl=t+1NP_{\mathrm{cl}} = \frac{t+1}{N} [32] in the final two steps, as shown in Figure 3(b), where tt denotes the number of oracle queries and NN is the graph size. These results demonstrate the effective accumulation of probability amplitude on the target vertex and provide a proof-of-principle experimental validation of deterministic full-space search on complete bipartite graphs, whose ideal success probability reaches unity. Scaling the general construction to N=16N = 16 already requires 743 CZ layers, exceeding the reliable depth of the present control hardware. This implementation limit is consistent with the resource analysis of Figure 2, where the hardware-compiled circuit depth is identified

Figure 3. Experimental realizations of deterministic DTQW search on complete bipartite graphs. Panels (a) and (b) correspond to the general case with graph sizes N=4N = 4 and N=8N = 8, respectively, and panels (c) and (d) correspond to the special case with N=8N = 8 and N=16N = 16, respectively. The processor layouts indicate the qubits and couplers of the Zuchongzhi 3.1 processor used in each experiment. The probability plots show the target-vertex success probability versus walk step; dashed lines denote theoretical predictions, symbols denote experimental data, and error bars represent one standard deviation estimated from 10510^5 measurement shots. The dash-dotted line in (b) denotes the classical success probability PclP_{\mathrm{cl}}. The colored complete-bipartite graphs show the vertex probability distributions at successive steps for the general case and at the final step for the special case.

as the dominant scaling overhead. The corresponding experiment was therefore not performed. This limitation identifies circuit depth and accumulated gate errors as the main bottlenecks for extending the direct full-space implementation to larger graphs.

For the special case n1/N1=1/4n_1/N_1 = 1/4, the logical circuit consists of an initial layer of Hadamard gates on the vertex and edge registers, followed by the fixed sequence Q(−π),S,Q(−π),C(π),S,Q(−3π/2),C(π)Q(-\pi), S, Q(-\pi), C(\pi), S, Q(-3\pi/2), C(\pi), as shown in Figure 1(c). We demonstrated search experiments for graph sizes N=8N = 8 and 16, yielding final success probabilities of 70.3% and 66.0%, respectively, as shown in Figure 3(c) and (d). Notably, the success probability in this case does not decrease significantly with increasing graph size. Together with the resource analysis of the general case, these results indicate that the principal limitation to scaling arises not merely from the growth of Hilbert-space dimension, but more critically from the accompanying increase in circuit depth. By substantially mitigating this depth overhead, the special-case construction provides a promising route toward scalable implementations of deterministic DTQW search on larger gate-based quantum processors.

Reduced-subspace scalability benchmark—

To further benchmark experimental scalability beyond the graph sizes accessible to the direct full-space encoding, we introduce the reduced-subspace construction illustrated in Figure 4(a) as an effective-size probe of the target walk dynamics. Although this construction does not encode all graph vertices explicitly, it faithfully reproduces the effective search dynamics of the original walk within its invariant subspace. It therefore provides a controlled way to test how the deterministic interference mechanism behaves as the nominal graph size and the corresponding walk schedule increase.

Figure 4. Reduced-subspace demonstration of scalable complete-bipartite DTQW search dynamics. (a) Subspace reduction via class aggregation from the original complete bipartite graph (left) to an effective three-vertex representation (right). (b) Quantum circuit for the reduced-subspace implementation. (c) Target-vertex success probability versus walk step for graph sizes N=2kN = 2^k (k=3,…,8k = 3, \ldots, 8), as indicated by the gray labels. Red dashed lines denote theoretical predictions, blue symbols denote experimental data, and green dash-dotted lines denote classical success probability PclP_{\mathrm{cl}}. Error bars represent one standard deviation estimated from 10510^5 measurement shots.

In this setting, the walk is restricted to the four-dimensional invariant subspace spanned by {∣ϕ1⟩,∣ϕ2⟩,∣ϕ3⟩,∣ϕ4⟩}\{|\phi_1\rangle, |\phi_2\rangle, |\phi_3\rangle, |\phi_4\rangle\} introduced above, so the evolution can be represented with two qubits, independent of the graph size. This reduced construction provides a compact setting for benchmarking the target walk dynamics and diagnosing hardware errors. Following the parameter schedule of [30], we construct a state-preparation block followed by a sequence of walk steps implementing U(αj,βj)=SC(αj)Q(βj)U(\alpha_j,\beta_j) = SC(\alpha_j)Q(\beta_j) on the reduced space. The corresponding logical circuit is shown in Figure 4(b).

In the subspace case, we clearly observe the search success probability rising as the number of walk steps increases for nominal graph sizes from N=23N = 2^3 to N=28N = 2^8, as shown in Figure 4(c). Specifically, the success probability for N=8N = 8 reaches 90%, and for N=16N = 16, 3232, and 6464, it remains around 80%, showing that the deterministic-search population transfer is preserved over a range of effective graph sizes. At larger nominal sizes, the deeper walk schedules lead to a gradual reduction of the peak probability, reaching about 60% for N=128N = 128 and approaching 50% for N=256N = 256, where decoherence drives the output close to a mixed state. These results indicate that the protocol is experimentally viable at the circuit level and that its effective search dynamics can be preserved over larger nominal graph sizes when the full encoding overhead is removed.

Conclusion—

We have demonstrated deterministic discrete-time quantum-walk search on complete bipartite graphs using a gate-based digital processor. By combining full-space and invariant-subspace encodings, we preserve exact search dynamics across a wide range of effective graph sizes, while our resource analysis identifies accumulated gate errors—rather than problem size alone—as the central scaling bottleneck. This establishes a concrete algorithm-to-hardware pathway for structured quantum search and motivates low-error gate synthesis and error mitigation for application-scale implementations.

Acknowledgments—

This research was supported by the Quantum Science and Technology–National Science and Technology Major Project (Grant No. 2024ZD0300500); the Quantum Science and Technology-National Science and Technology Major Project (Grant No. 2021ZD0300200); the National Natural Science Foundation of China (Grant Nos. 92476203, 92476001, 62325210, and 62301531); the New Cornerstone Science Foundation through the XPLORER PRIZE; the Jinan Science and Technology Bureau and the Jinan High-Tech Zone Management Committee; the Cultivation Project of the Shanghai Research Center for Quantum Sciences (Grant No. LZPY2024); the Beijing Natural Science Foundation (Grant No. 4252012); and the Taishan Scholars Program.

References

References

  1. [1]S. Cambie and R. Hämäläinen, Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing, Journal of Graph Theory 109, 52 (2025).arxiv.org/abs/2303.01944
  2. [2]Z. J. Bara, R. A. Rasid, and R. G. Artes Jr, Independent vertex neighborhood polynomials: Behavior of graphs and some applications, Advances & Applications in Discrete Mathematics 42, 47 (2025).DOI
  3. [3]A. P. Punnnen and Y. Wang, The bipartite quadratic assignment problem and extensions, European Journal of Operational Research 250, 715 (2016).DOI
  4. [4]C. A. Ryan, M. Laforest, J.-C. Boileau, and R. Laflamme, Experimental implementation of a discrete-time quantum random walk on an NMR quantum-information processor, Physical Review A—Atomic, Molecular, and Optical Physics 72, 062317 (2005).DOI
  5. [5]D. Lu, J. Zhu, P. Zou, X. Peng, Y. Yu, S. Zhang, Q. Chen, and J. Du, Experimental implementation of a quantum random-walk search algorithm using strongly dipolar coupled spins, Physical Review A—Atomic, Molecular, and Optical Physics 81, 022308 (2010).DOI
  6. [6]M. Gräfe, R. Heilmann, M. Leubgue, D. Guzman-Silva, A. Perez-Leija, and A. Szameit, Integrated photonic quantum walks, Journal of Optics 18, 103002 (2016).
  7. [7]L. Neves and G. Puentes, Photonic discrete-time quantum walks and applications, Entropy 20, 731 (2018).DOI
  8. [8]Z. Yan, Y.-R. Zhang, M. Gong, Y. Wu, Y. Zheng, S. Li, C. Wang, F. Liang, J. Lin, Y. Xu, et al., Strongly cor- related quantum walks with a 12-qubit superconducting processor, Science 364, 753 (2019).
  9. [9]M. Gong, S. Wang, C. Zha, M.-C. Chen, H.-L. Huang, Y. Wu, Q. Zhu, Y. Zhao, S. Li, S. Guo, et al., Quantum walks on a programmable two-dimensional 62-qubit superconducting processor, Science 372, 948 (2021).DOI
  10. [10]K. Zhou, J.-W. Xu, Q.-P. Su, Y. Zhang, X.-M. Yu, Z. Ma, H.-Y. Zhang, H.-Y. Shi, W. Zheng, S. Pan, et al., Demonstration of discrete-time quantum walks and observation of topological edge states in a superconducting qubit chain, Physical Review Letters 135, 250601 (2025).DOI
  11. [11]V. Dubovitskii, F. Utro, A. Bose, L. Parida, S. Maniscalco, and S. N. Filippov, Experimental implementation of a discrete-time quantum walk on biological networks, arXiv preprint arXiv:2602.24053 (2026).DOI
  12. [12]L. Razzoli, G. Cenedese, M. Bondani, and G. Benenti, Efficient implementation of discrete-time quantum walks on quantum computers, Entropy 26, 313 (2024).DOI
  13. [13]A. Shakeel, Efficient and scalable quantum walk algorithms via the quantum Fourier transform, Quantum Information Processing 19, 323 (2020).DOI
  14. [14]K. Georgopoulos, C. Emary, and P. Zuliani, Comparison of quantum-walk implementations on noisy intermediate-scale quantum computers, Physical Review A 103, 022408 (2021).DOI
  15. [15]A. Wing-Bocanegra and S. E. Venegas-Andraca, Circuit implementation of discrete-time quantum walks via the shunt decomposition method, Quantum Information Processing 22, 146 (2023).
  16. [16]V. Wadhia, N. Chancellor, and V. Kendon, Cycle discrete-time quantum walks on a noisy quantum computer, The European Physical Journal D 78, 29 (2024).
  17. [17]D. Aharonov, A. Ambainis, J. Kempe, and U. Vazirani, Quantum walks on graphs, in Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing (ACM, New York, NY, USA, 2001) pp. 50–59.
  18. [18]A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. A. Spielman, Exponential algorithmic speedup by a quantum walk, in Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (2003) pp. 59–68.
  19. [19]A. M. Childs and J. Goldstone, Spatial search by quantum walk, Physical Review A 70, 022314 (2004).DOI
  20. [20]S. Chakraborty, L. Novo, A. Ambainis, and Y. Omar, Spatial search by quantum walk is optimal for almost all graphs, Physical Review Letters 116, 100501 (2016).DOI
  21. [21]A. Ambainis, A. Gil yén, S. Jeffery, and D. Kokiānis, Quadratic speedup for finding marked vertices by quantum walks, in Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (ACM, New York, NY, USA, 2020) pp. 1119–1132.arxiv.org/abs/1903.07493
  22. [22]S. Apers, S. Chakraborty, L. Novo, and J. Roland, Quadratic speedup for spatial search by continuous-time quantum walk, Physical Review Letters 129, 160502 (2022).DOI
  23. [23]F. Peng, M. Li, and X. Sun, Search algorithm on strongly regular graph by lackadaisical quantum walk, Journal of Physics A: Mathematical and Theoretical 57, 135301 (2024).DOI
  24. [24]F. Peng, M. Li, and X. Sun, Lackadaisical discrete-time quantum walk on Johnson graph, Physica A: Statistical Mechanics and its Applications 635, 129495 (2024).DOI
  25. [25]P. Høyer, Arbitrary phases in quantum amplitude amplification, Physical Review A 62, 052304 (2000).DOI
  26. [26]G.-L. Long, Grover algorithm with zero theoretical failure rate, Physical Review A 64, 022307 (2001).DOI
  27. [27]S. Marsh and J. B. Wang, Deterministic spatial search using alternating quantum walks, Physical Review A 104, 022216 (2021).DOI
  28. [28]D. Qu, S. Marsh, K. Wang, L. Xiao, J. Wang, and P. Xue, Deterministic search on star graphs via quantum walks, Physical Review Letters 128, 050501 (2022).DOI
  29. [29]Q. Wang, Y. Jiang, S. Feng, and L. Li, Unifying quantum spatial search, state transfer, and uniform sampling on graphs, Physical Review A 111, 042608 (2025).DOI
  30. [30]F. Peng, M. Li, and X. Sun, Deterministic discrete-time quantum walk search on complete bipartite graphs, Physical Review Research 6, 033042 (2024).DOI
  31. [31]T. Jiang, J. Cai, J. Huang, N. Zhou, Y. Zhang, J. Bei, G. Cai, S. Cao, F. Chen, J. Chen, K. Chen, X. Chen, X. Chen, Z. Chen, Z. Chen, W. Chu, H. Deng, Z. Deng, P. Ding, X. Ding, Z. Ding, S. Dong, B. Fan, D. Fan, Y. Fu, D. Gao, L. Ge, J. Gui, C. Guo, S. Guo, X. Guo, L. Han, T. He, L. Hong, Y. Hu, H.-L. Huang, Y.-H. Huo, Z. Jiang, H. Jin, Y. Leng, D. Li, D. Li, F. Li, J. Li, J. Li, J. Li, N. Li, S. Li, W. Li, Y. Li, Y. Li, F. Liang, X. Liang, N. Liao, J. Lin, W. Lin, D. Liu, H. Liu, M. Liu, X. Liu, X. Liu, Y. Liu, H. Lou, Y. Ma, L. Meng, H. Mou, K. Nan, B. Nie, M. Nie, J. Ning, L. Niu, W. Peng, H. Qian, H. Rong, T. Rong, H. Shen, Q. Shen, H. Su, F. Su, C. Sun, L. Sun, T. Sun, Y. Sun, Y. Tan, J. Tan, L. Tang, W. Tu, J. Wang, B. Wang, C. Wang, C. Wang, C. Wang, J. Wang, L. Wang, R. Wang, S. Wang, X. Wang, X. Wang, X. Wang, Y. Wang, Z. Wei, J. Wei, D. Wu, G. Wu, X. J. Wu, Y. Wu, S. Xie, L. Xin, Y. Xu, C. Xue, K. Yan, W. Yang, X. Yang, Y. Yang, Y. Ye, Z. Ye, C. Ying, J. Yu, Q. Yu, W. Yu, X. Zeng, C. Zha, S. Zhan, F. Zhang, H. Zhang, K. Zhang, W. Zhang, Y. Zhang, Y. Zhang, L. Zhang, G. Zhao, P. Zhao, X. Zhao, Y. Zhao, Z. Zhao, L. Zheng, F. Zhou, L. Zhou, N. Zhou, S. Zhou, Z. Zhou, C. Zhou, C. Zhu, Q. Zhu, G. Zou, H. Zou, Q. Zhang, C.-Y. Lu, C.-Z. Peng, X. Yuan, M. Gong, X. Zhu, and J.-W. Pan, One- and two-dimensional cluster states for topological phase simulation and measurement-based quantum computation, Nature Physics 22, 430 (2026).DOI
  32. [32]B. Pokharel and D. A. Lidar, Better-than-classical Grover search via quantum error detection and suppression, npj Quantum Information 10, 23 (2024).arxiv.org/abs/2211.04543
  33. [33]A. E. Roth and E. Peranson, The redesign of the matching market for American physicians: Some engineering aspects of economic design, American economic review 89, 748 (1999).pubmed.ncbi.nlm.nih.gov/29115787
  34. [34]National Resident Matching Program, NRMP releases results of the 2026 main residency match for more than 38,000 future residents, https://www.nrmp.org/about/news/2026/03/nrmp-releases-results-of-the-2026-main-residency-match-for-more-than-38000-future-residents/ (2026), published March 20, 2026.
  35. [35]See Supplemental Material at [URL will be inserted by publisher] for additional theoretical and experimental details, which includes Refs. [38–40].
  36. [36]C. M. Dawson and M. A. Nielsen, The Solovay-Kitaev algorithm, Quantum Information and Computation 6, 81 (2006), arXiv:quant-ph/0505030.DOI
  37. [37]J. Nie, W. Zi, and X. Sun, Quantum circuit for multi-qubit Toffoli gate with optimal resource (2024), arXiv:2402.05053 [quant-ph].arxiv.org/abs/2402.05053

Paper details

vlnc:W_6b4w8qdf
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents