WorksPhysics and Astronomy
Quantum adiabatic and diabatic optimization: A Hilbert space engineering strategy with Rydberg arrays
Abstract
Neutral-atom arrays provide a versatile platform for encoding combinatorial optimization problems with arbitrary graph connectivity [Nguyen et al., PRX Quantum 4, 010316 (2023)]. Although the dynamics of individual encoding gadgets has been studied [Bombieri et al., PRX Quantum 6, 020306 (2025)], understanding annealing bottlenecks in larger networks remains challenging. We investigate how engineering the Hilbert-space geometry controls quantum annealing in a family of blockaded-chain models motivated by these encodings. While boundary terms encode the target maximum independent set problem, the bulk geometry induces an auxiliary optimization problem associated with independent sets of cliques. Spectrally, the energetics of the quantum system can be approximated by physically derived clique weights. When the target problem and the auxiliary problems are consistent, the low-energy modes lie predominantly within the target subspace. This spectral structure motivates a diabatic annealing strategy that exploits target-compatible excited states, as tested on the diamond-chain graph family. These results provide a framework for predicting annealing bottlenecks, and demonstrate Hilbert-space engineering as a strategy for improving neutral-atom quantum optimization protocols.
Introduction
Quantum many-body systems can be exploited to solve combinatorial optimization problems. Within these encoding schemes, the optimal solution to the classical problem is mapped to the ground state of the quantum many-body system. One method to search for the ground state of a quantum many-body Hamiltonian in a quantum platform is through quantum annealing algorithm [1, 2]. The system is initialized in a known and easy-to-prepare state, and its parameters are slowly ramped toward the target. In the adiabatic limit, the state follows the instantaneous ground state. Revealing the source of bottleneck encountered in quantum annealing, and subsequently improving the annealing performance typically requires a comprehensive and oftentimes intractable study on the quantum many-body dynamics. Conceptually, departure from the instantaneous ground state need not imply failure to solve the encoded optimization problem. It is thus crucial to identify and utilize the compatibility of excitations with the target solution in the encoding.
Recently, neutral atom arrays have become a promising platform for quantum computing and quantum simulations, due to their rapid and substantial development in theoretical proposals and experimental techniques [3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 24, 25] [21]. The Rydberg blockade mechanism [26, 27] of neutral atoms provides a natural quantum encoding scheme for a family of combinatorial optimization problems [28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38], including the unweighted maximum independent set problems. The encoding scheme for these problems has been investigated theoretically [34, 36, 38, 39] and experimentally [29, 30, 31, 33, 37]. Recently, a strongly correlated and geometrically localized many-body bound state has been shown to be the major source of annealing bottlenecks within a building block of the network, called gadget. Correspondingly, a strategy controlling the effective shape and boundary conditions of the system has been proposed to alleviate the difficulty [35].
However, the effects of these dynamical bottleneck in more complex networks is yet to be unveiled.
In this work, we elucidate the low-energy dynamics of the Rydberg networks using the effective blockaded-chain models. While the boundary condition encodes the target optimization problem by design, the bulk of the system naturally encodes a pertinent auxiliary optimization problem. Specifically, quantum many-body bound states contribute characteristic energies, allowing competing many-body configurations to be organized through weighted cliques of the graph. In the quantum system, this corresponds to the energetic competition between quantum states lying in macroscopically distinct Hilbert subspaces, and leads to bottleneck in quantum annealing.
Compatibility between the target and auxiliary problems can favor low-energy states with substantial support in the target subspace. This spectral structure suggests that excitation out of the instantaneous ground state need not prevent eventual recovery of the desired target readout. We investigate this possibility through a diabatic annealing protocol on diamond-chain graphs, relating the observed dynamics to competition between target-compatible and suboptimal channels.
This work is structured as follows. Section II introduces the encoding, effective model, and performance diagnostics. § 2, § 3, § 3.1 develop the spectral description, and investigate how geometric constraints and quantum many-body effects like hybridization and binding lead to clique-based quantum states, and how different branches compete. Section VI examines the resulting dynamics on diamond-chain graphs, followed by implementation considerations and conclusions in Sec. VII.
Encoding scheme and Hamiltonian
Introduction to the graph theory problems
The maximum independent set (MIS) problem in graph theory provides a stage for examining quantum computing algorithms. A connected simple graph consists of a vertex set and an edge set connecting the vertices. Given a graph, a subset of vertices is said to be independent, when no pair of vertices share an edge. The MIS problem thus searches for the independent set with the largest cardinality, see Figure 1(a) for an example. This set, represented by the array , minimizes the loss function
Figure 1. Graph theoretical representation of quantum many-body states and dynamics for quantum annealing. (a) Maximum independent vertex and clique sets (MIS, MICS) of a graph. The two sets are consistent: choosing a vertex from each clique in MICS yields the MIS. (b,c) Schematics associating quantum annealing bottleneck to features of the graph. Along the annealing, the ground state behaves like boundary states representing the logical-zeros state and the target state in the initial and final stages, respectively. In the intermediate stage, the ground state spreads in the bulk of the system, encoding the solution to the maximum weight independent clique set (MWICS) problem. This solution can be (b) consistent with the MICS problem or (c) not, depending on the graph and the system parameters. Following the ground state (solid arrows) requires traversing narrow gaps and costs long time overheads. (b) Particularly, when MICS and MWICS are consistent, the low-energy quantum many-body spectrum allows a diabatic annealing scheme for reaching the target MIS state while bypassing the bottleneck. (d) The chain graph and its (red) maximum and (blue) suboptimal independent sets. (e) A realistic implementation using neutral atom arrays subject to Rydberg blockade mechanism for encoding the MIS problem. The filled circles are atoms, and the links between them indicate Rydberg blockade. Three configurations are shown representing (brown) logical-zero, (red) optimal solution, and (blue) suboptimal solution, respectively, in the classical limit. The Rydberg mode (ground mode) of the neutral atoms is occupied when the atom is colored (white). (f) The effective Hamiltonian describing the domain wall states in the low energy sector of the neutral atomic system shown in (e), which motivates our blockaded lattice model. Particularly, the dashed lines highlight the hoppings which are explicitly omitted in our blockaded lattice model. (g) Schematics illustrating the blockaded lattice model encoding the MIS problem on the chain graph , with .
Here, with denoting the occupancy of vertex , and is the cardinality of the graph. is the adjacency matrix encoding the edges, for and for . Generically, the MIS problem is NP-complete, and an exact and generic classical branching algorithm has a complexity scaling exponentially with the size of the graph , with [40].
Neutral atoms are subject to the Rydberg blockade mechanism, which can be effectively described by the PXP model in the hardcore limit [41, 42, 43, 44, 45]. The Rydberg states of two spatially adjacent atoms cannot be occupied simultaneously. This constraint on the quantum device is naturally reminiscent of the graph-theoretical constraint Eq. (1). This correspondence motivates a proposal for encoding the MIS problem on unit-disk graphs using arrays of neutral atoms [28, 31, 46]. Later, the mapping proposed in Ref. [32] generalizes the encoding scheme to graphs with arbitrary connectivity, and eventually motivates the model investigated in this work. Once quantum encoded, the solutions to the classical optimization problem can be read out from the ground states, which are to be solved by quantum annealing algorithms [1, 2]. The performance is determined by the low-energy dynamics of the instantaneous Hamiltonians along the entire annealing process.
In this work, we find that the quantum many-body dynamics can be inferred from a classical indicator, termed maximum weight independent clique set (MWICS), as illustrated in Figure 1(a). A clique is a fully connected subgraph of cardinality , satisfying . Here, the clique is represented by an array listing a set of vertices inducing the clique, . A set of cliques , is said to be independent, when vertices from these disjoint cliques are not connected by any edge, i.e., , and , . The MWICS problem associates each clique with a weight depending on its cardinality, and search for the independent clique set (ICS) with the largest weight. It minimizes the loss function
subject to
In the same spirit, MWICS is reduced to the maximum independent clique set (MICS) problem, by assigning weights , see Figure 1(a) for an example. MIS and MICS are naturally compatible with each other, and a MIS can be straightforwardly read out from a MICS. In this work, we will show that the annealing difficulty can be alleviated when MWICS is reduced to the MICS, see Figure 1(b,Figure 1c).
The blockaded chain Hamiltonian
We encode the MIS problem in the blockaded chain model,
Here, the bare Hamiltonian describes independent chains with nearest-neighbor hopping strength and local chemical potentials at the two edges.
This bare Hamiltonian describes non-interacting chains of length , with lattice sites denoted as , , . Notably, it can also be interpreted as an -dimensional lattice in the shape of a hypercube, and encodes the MIS problem for a graph consisting of unconnected vertices. The projection operator encodes the independent set constraint associated to the graph, by projecting out the relevant lattice sites from being occupied,
Particularly, refers to an edge between vertices and in the graph, and the projection operation can be viewed as an interaction between the th and th chains of infinite strength.
Given a specific graph, and are the two important control parameters. In this work, we refer to , as the hypercube limit, as the indent limit, and , as the PXP implementation. Particularly, for , the system can be treated as a continuum, and the ratio solely determines the shape of the Hilbert space. As an example, the lattice hosting is shown in Figure 1(g). Notably, being chain graphs of vertices, is the commonly discussed PXP model [47, 48, 49, 50].
We refer to as the -blockaded lattice model. It is motivated by experimentally relevant neutral atom arrays. A scheme for encoding the MIS problem on a general graph has been proposed in Ref. [32], which utilizes the Rydberg blockade mechanism of neutral atoms for naturally encoding the independent-set constraint on a quantum device. The crucial building blocks are the atom wires representing the graph vertices, and the gadgets lying at the wire crossings representing the connectivity between the two wires. The blockaded-chain model effectively captures the low-energy physics of these Rydberg networks, see Appendix B.
The quantum dynamics within these building blocks has been thoroughly investigated in Ref. [35]. Particularly, the low energy quantum dynamics of the system has been found to be governed by domain walls along the atom wires. For a two-vertex connected graph , the domain walls travel on a two-dimensional lattice, where part of the lattice sites are prohibited, forming an L-shaped lattice. A similar treatment for the graph leads to the Rydberg array illustrated in Figure 1(e), and the effective lattice model shown in Fig. 1(f). For simplicity, we impose that the gadget is placed at the same position along each wires, leading to a symmetric implementation. Experimentally, this corresponds to elongating the every wire along both directions at the same proportionality, making the size and detailed structures of the gadgets negligible in comparison to the entire wires. Moreover, hopping terms at the gadgets linking next-nearest-neighbor lattice sites are also omitted. These extra hopping terms have been shown not to exhibit essential contributions to quantum dynamics [35]. Taking all these considerations into account, the and are achieved, respectively. In Ref. [35], geometric confinement has been found as a substantial source of obstacle for a polynomial scaling of the annealing efficiency with respect to in the L-shaped domain associated to the two-vertex graph, . Nevertheless, the quantum annealing performance associated to for a more general graph is so far not yet explored.
Hilbert space
The blockaded chain model provides a suitable platform for solving the MIS problem in two perspectives. Straightforwardly, the ground states under selected boundary conditions are connected to logical configurations of the graph. When , the instantaneous ground state can be interpreted as logical-zero state,
while when , the quantum state is localized in the vicinity of the lattice site encoding the MIS solution ,
Nevertheless, the blockaded chain model encodes the optimization problem beyond its boundary, and also in its bulk. The compatibility between the boundary and the bulk fundamentally facilitates the quantum annealing processes. To gain a first insight, we inspect the structure of the intact -dimensional hypercube lattice projected out by in Eq. (5) from a constructive point of view [51, 52],
The construction is directly associated to the collection of maximal independent sets (mIS), , of the graph . They are ISs which are not a proper subset of another IS. Given an mIS, constructs an -dimensional hypercube, and its lengths along dimension is given by for . The projected Hilbert space can be constructed by merging hypercuboids of different mISs. The structure of the lattice mimics a Daisy cube [53, 54] generated by all mISs of the graph, particularly for the PXP implementation .
The structure of the Hilbert space of the blockaded chains alludes to quantum dynamics. A hypercuboid Hilbert subspace acts locally like an integrable system, and admits tractable quantum dynamics. Moreover, the MIS, being the classical optimal solution among all mISs, corresponds to the hypercuboid of the largest volume in this construction. Intuitively, this strongly facilitates the propagation of the quantum state and the annealing process for searching the MIS solution. This effect should be most prominent in the limit .
Logical annealing protocol and performance
The objective of the quantum annealing is to adiabatically evolve the quantum many-body state from the initial state to the target state in an unbiased manner. The unbiasedness requires that (i) the initial state is known and easy to prepare, which is fulfilled by Eq. (6); (ii) the structure and the parameters of the Hamiltonian is not biased toward/against certain solutions, e.g., a sequential ramping of boundary terms associated different vertices is prohibited; (iii) the annealing protocol should not be based on learned, non-universal features associated to a specific graph, e.g. slowing down the annealing for addressing a fine structure of the spectrum of a specific Hamiltonian is prohibited.
The logical annealing protocol proposed in Ref. [35] and shown in Figure 2 meets these criteria. It further provides a tractable arena for investigating the quantum dynamics within the blockaded chain model. In this protocol, the initial boundary chemical potential is first linearly turned off, and subsequently the final boundary chemical potential is linearly turned on. Particularly, the boundary terms of every chain are ramped simultaneously. Meanwhile, the hopping is kept fixed during the whole process, cf. Eq. (4). The logical protocol can be straightforwardly implemented upon the atom network, and allows for an intuitive analysis of quantum dynamics, see Appendix B.
Figure 2. Quantum annealing protocol and list of graphs. (a) The annealing parameters, , , and , as a function of annealing time in the logical protocol. (b) A list of small graphs used as examples for discussions in this work. An exhaustive atlas of small graphs with vertices is listed in Appendix A.
We characterize quantum annealing performance using complementary spectral and dynamical indicators. Spectrally, quantum adiabatic theorem [55, 56, 57] measures the performance using the minimum gap of the instantaneous Hamiltonians within the dynamically accessible branches. This is most clearly seen when the solution to the MIS problem is unique. In this case, due to the uniqueness of ground state, the annealing performance can be represented by the minimum gap between the instantaneous ground first excited state along the annealing, . However, when the MIS problem has degenerate solutions, there is no a general rule for assigning a gap for quantifying the performance, and we tentatively employ for this purpose. In this work, the spectrum is solved numerically using exact diagonalization of sparse matrices unless specified otherwise.
Dynamically, the quantum annealing performance can be measured by the success rate of the quantum state reaching the target state, or more generically, the target subspace. We propose the dephased density probability in the MIS subspace,
where are the instantaneous eigenmodes. projects onto (the union of) the logical hypercuboids associated with the MIS (degenerate MISs). Here, contains all vertices that are not in (any of the degenerate) MISs, and . Notably, measures the weight of the quantum state in the entire MIS subspace, rather than its fidelity to a particular state. It further averages out the phases between different to account for an average in time in dynamics. Complementary and experimentally relevant information can be further provided by marginal density distribution along a dimension associated to logical-one, see Appendix B.
Quantum annealing performance in hypercube limit
We proceed to investigate the quantum dynamics on the blockaded chain model along the logical protocol. The hypercube limit, , exhibits a high
degree of connectivity within the Hilbert space. This typically leads to highly delocalized quantum many-body states and improved annealing performance [46]. Counterintuitively, the annealing performance in this limit is fundamentally determined by the quantum dynamics of the PXP implementation, , . Connectivity in Hilbert space configurations alone is therefore insufficient to predict annealing performance.
Along the annealing, the gap exhibits universal behaviors, as depicted for the representative cases in Figure 3. It has one local minimum in the first and second half of the annealing, respectively. Given a specific graph and varying , the gaps as a function of the annealing parameters collapse upon a scaling of . This is shown for the paw graph, , in Figure 3(a).
Figure 3. Performance of quantum annealing in the hypercube limit . (a) The gap along the annealing for an implementation encoding the MIS problem on the paw graph . The two local minima for are indicated by arrows. (b) The relation between the minimum gaps for the hypercube limit and the PXP implementation for all small graphs with [58]. Results are shown for (for graphs with ), (), or (). The dashed lines with slopes are guides to the eyes highlighting the linearity.
The universal behavior can be elucidated through a mapping of onto spinor models, see Appendix C for details. The low energy dynamics can effectively be described by three modes along each chain, including two exponential modes, , , and a standing-wave mode, . The first minimum lies around , where the system transitions from the localized state to the delocalized state . Since any basis state formed by direct products of and is legitimate, the full Hamiltonian projecting onto this basis thus induces the Hamiltonian of a spin-, , with an effective hopping . Similarly for the second local minimum around , projecting onto the basis states of and leads to the PXP implementation of the same graph, . The gap behaviors thus inherit from . Our mapping can further be confirmed by comparing the minimum gap along protocol between the hypercube limit and the PXP implementation , , see Figure 3(b). Consistent with our analysis, a strong correlation can be seen between and . During the annealing, the bottleneck of the quantum annealing performance competes between the quantum dynamics of a spin- system, and that of the PXP implementation based on the graph, with ,
The quantum annealing performance in the hypercube limit is thus fundamentally determined by the quantum dynamics of the PXP implementation. Increasing Hilbert-space connectivity in the hypercube limit does not remove the graph-dependent PXP bottleneck.
Factorizability of quantum states in indent limit
In stark contrast to the hypercube limit, the indent limit of the blockaded-chain model manifests quantum dynamics distinct from the PXP implementation. Importantly, due to the characteristic structure of the Hilbert space, the quantum dynamics becomes tractable and can be attributed to a product-state ansatz. In the rest of this work, we focus on this implementation, and explore the potential for improvement of quantum annealing performance.
In indent limit, the structure of the Hilbert space as described by Eq. (10) chiefly governs the quantum many-body dynamics. These hypercuboid subspaces can be viewed individually as quasi-integrable subsystems, which are barely coupled with each others, and host independent dynamics. Specifically, in the low energy sector, the quantum many-body states are thus expected to follow the tentative -partite ansatz based on a mIS (not necessarily optimal), , of the graph,
Here, () are logical zero (one) modes, and corresponds to any vertex with () in the mIS. They span a one-dimensional lattice of () sites along the corresponding dimension , and are the harmonics of the Hamiltonian ().
Surprisingly, this convenient fully factorizable ansatz is already sufficient for describing the low-energy quantum dynamics in models based on a large number of graphs. For instance, it is consistent with the instantaneous ground states of , as shown in Figure 4. However, models based on graphs with permutation symmetries tend to host correlated quantum many-body dynamics. In the following, we progressively demonstrate these correlated effects with exact numerical solutions, and demonstrate examples which are fully factorizable, factorizable with quantum many-body bound states, and nontrivially correlated.
Figure 4. Densities of instantaneous ground states at several characteristic time points of the annealing protocol. (a) The lattice sites and boundary terms (red) and (blue) for the -blockaded chain model. (b-f) Densities of state along the quantum annealing. The majority of the density lies in the “flat” oblate hypercuboid subspace, and abstained from the “chimney” prolate subspace. Therefore, the wavefunction can be formulated as a product state.
Completely factorizable quantum states
We first examine the validity of the tentative ansatz at the homogeneous boundary condition . We mainly focus on the separability of the state and its projected densities along different dimensions. The separability of the quantum states can be quantified by its entanglement entropy. Given many-body state based on a lattice of dimensions and length , its entanglement entropy with respect to a specific dimension can be defined as
where the reduced density matrix
is traced over all dimensions other than . For the case of 3-chain graph , and an implementation with , , we show the entanglement spectrum with respect to the 1st dimension in Figure 5(a). The low-energy sector is indeed dominated by a family of states with zero entanglement, confirming the states are product states. Two arbitrary zero-entanglement excited states are visualized in Figure 5(b,Figure 5c), where their densities apparently exhibit higher harmonics among different dimensions. These states are also characterized by due to (anti)symmetric superposition.
Figure 5. Product-state ansatz with homogeneous boundary. (a) The entanglement spectrum of the system at midpoint of protocol, where the boundary is homogeneous , for graph . The entanglement entropy , cf. Eq. (14), is evaluated for each eigenstate. The low energy sector is dominated by a large family of product states with vanishing entanglement entropy, as marked by the orange crosses. (b,c) The densities of two arbitrarily chosen zero-entanglement states, marked by red crosses in panel (a). (d-f) The entanglement spectrum for the paw graph, . (g-o) The projection of (g-i) the ground state, (j-l) the first excited state, and (m-o) a low-lying excited state is consistent with the product state ansatz. Along the 3rd and 4th dimensions, the state is either (l,o) a superposition of two harmonics or (i) a bound state.
Intuitively, similar arguments apply straightforwardly to the case of paw graph , apart from its ground state.
In Figure 5(d-f), we show the entanglement spectra along different dimensions. Similar to the , there is a large family of states with , and , which confirms that they are product states. This can be further confirmed by the projected densities along different dimensions, as shown in Figure 5(g-o). Along the 1st and 2nd dimensions, the projected densities correspond to the basis states and , respectively. Particularly, and . Along the 3rd and 4th dimensions, the projected densities indicate that the first excited state [Figure 5(l)] and the low-lying excited state [Figure 5(o)] are superposition states .
The ground state, however, can not be fully captured by the tentative ansatz. This is the most obvious in its projected density along the 3rd and 4th dimensions. It resembles the bound state which appears in the model based on the 2-vertex graph , as studied in Ref. [35]. Correspondingly, its entanglement entropy along these two dimensions is [Figure 5(f)]. This example highlights the broad existence and importance of bound state dynamics in blockaded-chain models.
Clique-based bound states as factor basis states
The bound states are typically associated to complete subgraphs, or cliques. This motivates us to investigate the blockaded chain model based on complete graphs , e.g. , , , . Their Hilbert spaces have the shapes of a “claw”, which is composed by a “palm”, , and “fingers”, . The logical-zero sector of volume acts like a base, and logical-one sectors of volume are hypertubes individually attached to the based. Inherited from the graph, the Hilbert space also has a permutation symmetry of degree . Specifically, the two-dimensional case of a -shaped lattice has been studied thoroughly in Ref. [35], where a bound state of particularly low energy has been seen and attributed to quantum interference.
With homogeneous boundary, the existence of similar bound states in higher dimensions can be argued using energetic arguments for the ground states of . The variational principle for ground states dictates a strictly monotonic decrease in their energies, ,
where is the energy of the first harmonic mode spanning sites. This verifies that the ground states of are indeed exponentially decaying along the “fingers”, since [35], and localized around the “palm”, i.e., the logical-zero sector. The two-dimensional and three-dimensional bound states, and , are visualized in Figure 6.
Figure 6. Quantum bound states associated to cliques. Densities of clique states with homogeneous boundary with , for .
The ansatz for the quantum many-body state should thus take these bound states as indivisible factors. For instance, with homogeneous boundary, , we propose the following improved ansatz represented by an independent clique set (ICS), , and verify its fidelity against the exact quantum many-body ground state,
Here, , , and are the -dimensional bound states associated to .
We examine the ansatz for all small graphs with vertices in Figure 7 by computing their sum of single-dimension entropies and fidelity with respect to the ansatz , for varying at fixed . Particularly, when the graph possesses multiple MICSs, the equal-weight superposition is considered, .
Figure 7. Product-state ansatz for small graphs. (a) Total entanglement entropy and (b) fidelity with respect to the MICS-based product-state ansatz, Eq. (23), of the ground state with homogeneous boundary, , for different at fixed . A collapse in the behaviors can be observed in both observables. The curves are categorized into five groups according to the properties of the MICSs of the graphs for a clear presentation.
The behaviors of the quantum state is fully consistent with the ansatz when the graph has a unique MICS (blue, orange), or when the graph has multiple MICSs but all the MICSs are composed by single vertices as cliques (red). See Table I in Appendix A for a list of graphs. In these cases, the fidelity converges to 1 for large , while the entropy converges to values reflecting the bound states and/or the superposition states. For example, for large , because has a MICS of four individual vertices, because has a MICS consisting of a 2-clique, and because has a MICS consisting two pairs of equivalent vertices.
However, the quantum states go beyond the MICS product-state ansatz when the graph possesses multiple MICSs consisting of cliques of vertices. These MICSs can be either equivalent, e.g., , , , and , or inequivalent to each other, , , and . These graphs are characterized by high permutation symmetry, cf. Table I in Appendix A. In the quantum many-body system, this symmetry is inherited in the Hilbert space structure, and induces hybridization and binding effects. This leads to strong quantum correlations beyond the ansatz.
Hybridization and binding
The numerical evidences indicate that the ground state of the system at homogeneous implementation deviates from the tentative product state ansatz, Eq. (13), when the symmetry of the graph is high. We proceed to formally investigate how the interplay between symmetry of the Hilbert space and geometric constraints leads to hybridization and binding of the product states, and induces quantum correlations and potentially bound states.
Binding in the graphs
The bound states in complete graphs, , constitute the first effects of symmetry. They stem from coordinated enhancement of equivalent scattering channels induced by symmetry. The energy of the logical-zero state, , is significantly lowered and becomes the ground state of the system.
The Hamiltonian couples in the “palm” to lattice sites in the “fingers”, , where is the “border state”, and where is the hopping amplitude on the boundary, with the wavefunction on site . The border state thus provides a scattering channel composed symmetrically from equivalent and independent channels along the “fingers”.
The scattering channels effectively induce a self energy upon the bare state,
Here, is the propagator along a one-dimensional lattice with Hamiltonian and energy shifted by due to contribution from the factors in . The propagator further has an overall factor of instead of , which appears as an effective reduction of scattering channels.
The energy of the dressed state can thus be determined by the self-energy equation as , with
Its energy is reduced to below the threshold , and it is thus a bound state with wavefunctions decaying along the one-dimensional lattice.
Bound states are thus correlated quantum many-body states induced by symmetry and geometric constraints. Symmetry induces dressing through scattering channels to the bare logical-zero state, and significantly lowers its energy, while geometric constraints increase the energy cost for a propagating state. Detailed derivations are available in Appendix D.
Hybridization in the graph
Besides coordinated enhancement, symmetry leads to deviation to the product state ansatz through hybridization. The path graph, , has two equivalent MICSs, each of them consisting of a vertex and a 2-clique. It provides an example how coherent hybridization between the two symmetry-related MICS product states deforms the constituent pair wavefunctions.
The product state ansatz predicts two basis states related by the reflection symmetry , formally written as and . Specifically for , these components are and . The basis state () is an exact eigenstate of the Hamiltonian (), where projects out the non-MICS lattice sites . Nevertheless, applying the bare Hamiltonian on these states leads to leakage into the non-MICS Hilbert subspace, .
To appreciate the role of the reflection symmetry, we additionally consider the paw graph , which has an extra edge on top of . This graph has a single MICS, and is the product state ansatz for its unique ground state. This leakage is negligible compared to the energy difference between the MICS state and the suboptimal ICS state, . According to perturbation theory, thus serves a good approximation for the ground state in the indent and continuum limit, .
For , however, the reflection symmetry leads to degenerate basis product states. The tiny leakage can potentially induce significant deformation to the ground state while lifting the degeneracy. As a result, the exact ground state behaves differently from the symmetric superposition . We capture the effects of reflection symmetry by expanding the quantum state in the basis,
Here, [cf. Eq. (5)] describes the geometric constraint between the 2nd and 3rd dimensions. , with . The basis with . This basis is chosen, because the non-projected wavefunctions are orthonormal and nearly resonant with each other. The antisymmetric superposition does not couple into the basis. Particularly, the symmetric product state can be written as, .
The Schrödinger equation projected onto this basis, Eq. (20), is , with and the Gram matrix. The indices run over the three basis states, and the ground state is normalized as . The system thus hosts deformed eigenstate,
where , , .
In the absence of the projection operator , the three basis states in Eq. (20) remain orthonormal and decoupled by construction. The geometric constraint imposed by the projector thus introduces overlap of the basis states through , as well as a coupling between them through . This leads to non-perturbative hybridization of the quantum state, and thus deviation from the product state ansatz.
We quantify this geometric deformation by considering and varying from 10 to 80, see Figure 8(a). We evaluate the fidelity of the exactly solved quantum state against the symmetric composition of the product state , and the state solved within the three-state basis. Both fidelities deteriorate as increases, signaling an enhanced hybridization. This indicates that the hybridization is non-perturbative in indent limit. However, the energy of the exact quantum state converges to the product state ansatz in indent limit, see Figure 8(b). The decreasing gap indicates that, even though hybridization brings the energy of the state to below the propagating threshold, it does not lead to a bound state, since the nominal decaying length extends with the system length. More importantly, unlike binding, hybridization has no energetic contribution in indent limit. As a control comparison, the fidelity and energy for the quantum state are also shown. Indeed, due to the lack of degeneracy, the deviation of the exact quantum state from the product state ansatz is perturbative.
Figure 8. Hybridization of quantum state in graph. (a) The fidelity of the product state ansatz, Eq. (23), and the hybridized ansatz, Eq. (18) with respect to the exact quantum state for graph at homogeneous boundary. (b) The energy of the exact state compared to the energy of the product state ansatz. The gap between them vanishes in indent limit. For comparison, the control case of paw graph is also shown, where the product state ansatz is precise up to negligible perturbation.
Apart from complete graphs, genuine bound states are also found in the 5-cyclic graph , and the house graph among all graphs with vertices, cf. Table I in Appendix A. These graphs are later referred to binding motifs, and are all collected in the set . Cliques constitute a major family of motifs.
Product-state ansatz based on cliques and motifs
Bound states are generically associated to graphs with high symmetry, particularly complete graphs. They urge a modification to the tentative product-state ansatz for a comprehensive description of quantum dynamics along annealing in indent limit. Particularly, since hybridization induces weak energetic effects in indent limit, it is not explicitly taken into account in the ansatz. The quantum many-body state can be represented by a generic IS, , which is not necessarily maximal. Along the dimensions corresponding to occupied vertices, the state hosts the logical-one mode generated by a chain of sites with boundary term . Particularly, we denote the ground state and first excited state for logical-one mode for the instantaneous boundary condition as and , respectively. These notations are convenient for discussion on gap behaviors.
The rest of the vertices is further grouped into motifs , , such that the union is an independent motif set with . The quantum state ansatz then associates each motif to its corresponding basis state , subject to the boundary term . A motif-based bound state represents a classical configuration where the corresponding vertices are logical-zeros.
The final remaining vertices in are then assigned with the logical-zero mode . This is the ground state of a chain of sites subject to boundary term . The factor states and are identical to the ones entering the tentative ansatz, Eq. (13).
The comprehensive product state ansatz associated to and is thus
In the following, unless explicitly specified, we focus on the effects of cliques, , among all binding motifs. This improves the clarity of our discussion without losing the essential features of our system. The factor states are summarized as follows,
| Factor | Bulk | Boundary | Logic |
| 1D chain of length | 0 | ||
| 1D chain of length | 1 | ||
| -D lattice from motif | |||
| -D lattice from |
Table 20.
Energetics for solving MIS
With homogeneous boundary, the quantum blockaded-chain model thus selects the independent set energetically. To identify the ground state, we associate the cliques with weights determined by the energies of the bound states. The energy of a product state is , where is the energy of the bound state , and is the number of vertices not belonging to any clique. We can thus assign an effective weight to these cliques to account for this energy,
The weight increase strictly monotonically with , cf. Inequality (13), and decreases as the shape ratio approaches 0, i.e., the indent limit. They converge to , in indent limit, c.f., Eq. (19), with particularly [59]. These weights measure the boundedness of the quantum states, and provide an effective count of vertices inside the clique. At homogeneous boundary fields, maximizing the clique weight minimizes the energy within the clique-product ansatz. The ground state thus search for the ICS with the maximum effective number of vertices, i.e., the MWICS of the graph. A weight can be assigned to a general binding motif by replacing by .
We further investigate the performance of quantum annealing for a specific set of graphs. For clarity of discussion, we consider the family of triangle-free graphs. Per definition, these graphs do not host cliques with vertices. The dominant contributions from are thus a pair of connected vertices, . Besides, the graphs can also possibly host a binding motif of , or any other unexplored binding motifs with vertices. For simplicity of the discussion, we explicitly omit the contributions from these binding motifs momentarily. Effectively, the blockaded-chain model thus searches for the dissociation set which maximizes . In graph theory, a dissociation set contains single vertices and vertex pairs, which are independent from each other.
We clarify whether and when the effective optimization problem facilitates the search for MIS in triangle-free, cubic graphs. These graphs have lower bound for its independence number, [60]; and elementary edge counting yields an upper bound for its dissociation set, [61]. A failure for the effective optimization problem to reproduce the MIS solution can happen when . In other words, the MIS solution is produced for a triangle-free, cubic graph with vertices; and a suboptimal solution with vertices fewer than MIS can potentially be produced for a larger graph. Moreover, if the graph is further planar, [62], this threshold is increased to . Indeed, the important index is the density of the independent set, , since a tradeoff between single vertex and vertex pair becomes hindered by constraint with a dense MIS. If the MIS occupies more than half of the vertices of the graph, , the effective optimization produces the correct MIS solution. Our statements particularly apply for cubic graphs with girth at least 6, since cyclic graphs with vertices are not associated to bound states, .
Dominant product-state channel and clique-controlled gaps
When a single MWICS is energetically dominant, the low-energy spectrum is described by the approximately factorizable product states, cf. Eq. (23). Consequently, the energies of the many-body modes are approximately additive, and in particular, the gap behaviors are inherited from the spectra and gaps of the factor states.
The paw graph provides a representative example of this factorized structure, as evidenced by its spectrum
in indent limit shown in Figure 9(a). Its MICS consists of a single vertex and an edged pair . The few relevant lowest-lying modes can be factorized as,

Figure 9. Representative low-energy spectra in indent limit. (a) The spectrum of the blockaded-chain Hamiltonian based on the paw graph with , , compared against the energies of product states estimated by the ansatz Eq. (23). Specifically, the orange curve represents the state, red , green , purple , and brown . The color scheme encodes , cf. Eq. (11), and reflects whether the quantum state lies in the Hilbert subspace of correct MIS. (b,c) The spectra based on the graph, , (b) in indent limit and (c) away from indent limit . In (b), the orange curve represents the state, green , red , and purple , with . The color scheme encodes , and partially anti-symmetric states decoupled from the annealing, , are shown in gray.
| Vertex config. | Quantum state |
Table 22.
up to normalization.
In the early stage of the annealing, , the ground state is given by . The instantaneous states are localized around , and can be interpreted as logical zero, . The uniqueness of the quantum many-body ground state and the classical logical-zero configuration are consistent with each other. The first excited state is approximately four-fold degenerate, representing the four classical configurations , , , and . The energy difference between the ground state and these four states is roughly . As approaches , the degeneracy is slowly lifted. The state obtains a relatively higher energy than the state, because the latter hosts a bound state factor. Meanwhile, the symmetric and antisymmetric superposition states of and remain almost degenerate. The first gap minimum occurs near . The quantum state undergoes a localization-to-delocalization crossover in the dimension, while keeping the common factors in the other dimensions unchanged. Consequently, their energy separation approximately follows the gap between the two lowest eigenstates, and , of a one-dimensional chain. This product-state description reproduces the low-energy spectrum and eigenstates accurately, with comparatively more pronounced deviations near the gap minimum.
In the second half of the annealing, a second gap closure takes place around . This corresponds to a transition within the union of MICS hypercuboid subspace, where the and states become energetically more favorable than the state. This transition concerns essentially the bound state and the superposition state in the two-dimensional L-shaped domain along the and dimensions. Particularly, these are the ground state and the second excited state, while the first excited state is decoupled from the annealing since its anti-symmetric structure between the and dimensions.
Generically for factorizable quantum states, the behaviors of their gaps in the second half of the protocol are controlled by their cliques,
where refers to local minima. For factorizable quantum states, the quantum state already lies within the MICS hypercuboid subspace at the midpoint of the annealing. In the second half of the annealing, the factor clique-based bound state associated to each individual clique in transitions into superposition state independently. This dependence of gap behaviors on cliques is examined and confirmed for all small graphs with vertices in Figure 10(a,b). The minimum gap due to the cliques follows the behaviors of the corresponding complete graphs. For a few graphs with high symmetry, a deviation from the clique-based behaviors can be seen due to hybridization and binding.
Figure 10. Scaling behaviors of gaps. The gap in the second half of the annealing around shows spectral collapse associated to the largest clique in the MICS. These are shown (a) in the entire protocol in linear scale, and (b) in the vicinity of the minimum gap in logarithmic scale. This collapse is shown for all graphs with vertices, and for the implementation of , . Dashed curves indicate graphs, including , , , , , , . These graphs have high symmetry and subject to strong hybridization and/or binding effects, and their behaviors deviate from the generic scenarios. (c,d) Scaling behaviors of the minimum gap for complete graphs , computed using the recursive generation method. The minimum gap scales (c) exponentially with , and (d) polynomially with . These trends also apply to clique factors.
We analyse the behaviors of the minimum gap for different cliques. The low-energy spectrum associated to the complete graphs can be solved using the recursive generation method, as detailed in Appendix E. This method applies to a sequence of graphs which can be generated with a clear pattern, and assists us to probe the low-energy spectra for large and otherwise formidable with exact diagonalization. The minimum gap scales exponentially with and polynomially with as , see Figure 10(c,d). Particularly, the exponent coefficient goes from for to for . This is consistent with the results presented in Ref. [35]. See Appendix D for details. Our analysis is further supported by , Eq. (11), as illustrated by the color code in Figure 9.
The paw graph example illustrates the spectrum associated with a unique dominant MWICS. Consistent with our analysis for homogeneous boundary, hybridization effects between distinct MICS sectors are negligible. As a result, the low-energy problem admits an approximate reduction to the dynamics of its constituent factors. The gap behaviors is therefore controlled by the clique, leading to the clique-controlled behavior. As we clarify soon, this factorized description ceases to apply when several macroscopically distinct MWICS constructions become energetically competitive.
Competing channels and hybridization induced gap closing
We further investigate the case of competing ICSs, using graph as an example. This graph has one edge removed from the complete graph, and it has three competing ICSs: (i) a set of two vertices which is also the MIS, and (ii) two sets each consisting of a single 4-clique, which are second largest ICSs and referred to as suboptimal ICSs (subICSs). These relevant product states can be written as
| Vertex config. | Quantum state |
Table 1.
The first three groups describe modes in the MIS subspace. The fourth row is the fully symmetric combination of the two -based channels. The final group consists of three modes lying in the suboptimal ICS subspace, with , , .
The automorphism of the graph is isomorphic to the direct product of permutation groups and , . Here, permutes between vertices 1 and 2, and permutes among the vertices 3, 4, and 5. These permutation symmetries are inherited by the quantum system. For each permutation symmetry , there exist corresponding symmetry-related modes. Among them, a single fully symmetric mode is bright and coupled to the fully symmetric initial state, while the rest modes are dark and strictly inaccessible during the protocol. These include the antisymmetric superposition of and states, and the and superposition of , , and states. Consequently, only crossings between states in the accessible fully symmetric sector are dynamically relevant.
Within each orbit of symmetry-related channels, one trivial-irrep combination is bright and the remaining orthogonal combinations are dark.
In indent limit, the MICS has a larger weight. Correspondingly, the state is the ground state, and the low-energy quantum dynamics lies predominantly in the MIS hypercuboid. The spectrum for , as shown in Figure 9(b) supports this energetic picture, where the low-lying MICS-compatible quantum states are all characterized by as defined in Eq. (11).
Although the spectrum largely matches a fully factor-izable system, apparent deviation in the fully symmetric states can be observed at around . In this regime, the state and the states are almost degenerate, leading to hybridization between them. The hybridized spectrum preserves the overall branch structure inferred from the ansatz, but the anti-crossing in the vicinity of is substantially modified. Unlike the factor-controlled gap in § 3.1 E, this gap is not inherited from a single-chain spectrum, but rather controlled by the effective coupling between the two channels after taking their nonorthogonality into account. This gap scales according to the effective coupling , which is suppressed by spatially small mode overlap.
Away from the indent limit, competition between the two ICSs affects the spectrum in a more pronounced manner. This is illustrated by the spectrum for , in Figure 9(c). The low energy dynamics takes place predominantly in the subICS subspace, until the later stage of the annealing, , where it transitions into the MIS subspace. This is consistent with the fact that the subICS is energetically more favorable than the MICS at homogeneous boundary.
The two geometries in Figure 9(b,Figure 9c) encode the same MIS problem, but favor different clique arrangements. At , the two-vertex MICS is energetically favored, and its product state closely describes the midpoint ground state. At , the single-clique subICS has a slightly larger weight, but the ground state has substantial overlap with both arrangements. Thus the clique weights rank the product configurations, and changing the chain geometry tunes the competition without changing the encoded problem.
Dynamics towards target subspace
The spectral structure of the blockaded-chain model motivates a diabatic annealing scheme that preserves the MIS target even though the dynamics leaves the ground state due to small energy gaps. The family of diamond-chain graphs provide a concrete playground for investigating the effectiveness of the scheme.
Diamond chain graphs as a recursive family of competing sectors
The diamond chain graphs, , provide a paradigmatic example for investigating competition between different ISs in quantum annealing. As shown in Figure 11(a), is constructed by an initial vertex attached by a chain of 3-cyclic graphs , which adds up to vertices in total. The diamond-chain family provides a controlled setting for studying competition between independent set sectors. Each graph has a unique MIS with vertices, together with subISs with vertices. This exponential proliferation of almostoptimal configurations creates a competing landscape that can hinder annealing dynamics.
Figure 11. Diamond-chain graphs. (a-c) The first three diamond-chain graphs, , . (d,e) The maximum and suboptimal independent clique sets for , each possessing total weight and , respectively. The suboptimal solution is energetically more favorable when .
Meanwhile, the performance of quantum annealing depends on the weights of the cliques. For , the MICS of the graph is exactly the MIS, with ; while the subICS consists of two and , compatible to the subIS.
The two competing ICSs for are shown in Figure 11(d) and (e). When , the MICS has the largest weight. The diamond chain graphs follow a clear pattern. Therefore, their associated low-energy spectra and dynamics can be computed with the recursive generation method, allowing us to probe a larger range of and , see Appendix E for details.
The spectra shown in Figure 12 substantiate the relation between the quantum dynamics and the weights of the ICSs. Given fixed and , the spectrum associated to is characterized by a single gap closure, where the system transitions from the subICS state to the MICS state.

Figure 12. Diamond chain spectra. The spectra of the lowest 100 modes for the to diamond chain graphs for different with fixed . The color encodes whether the branch lies within the correct MICS subspace. The position of the minimum gap shifts towards an earlier stage as the indent limit is approached.
The position of this gap is shifted by the shape ratio. Away from the indent limit, , the subICS has a larger weight. As the indent limit is approached, the weights of different cliques become more uniform, and the MICS thus becomes eventually more favorable. Correspondingly, the quantum state at the midpoint of the protocol achieves the subICS configuration away from indent limit, and achieves the MICS configuration in indent limit. The gap minimum shifts towards earlier stage of the annealing with decreasing ratio of , for a given diamond-chain graphs , see Figure 12. Concomitantly, increasing number of low-energy modes lies in the MICS subspace, and all the relevant low-energy branches becomes MICS compatible for large . The spectrum structure crosses over between the scenarios illustrated in Figure 9(b) and (c). Particularly, the minimum possesses a roughly exponential scaling behaviors, similar to the spinor implementation [63, 64], while a more precise estimate of the scaling is not yet achievable.
Target-preserving diabatic annealing scheme
The spectra shown in Figure 12 motivate us to use the logical annealing protocol diabatically, c.f. Sec. II.D, for recovering quantum states representing the MIS solution. Away from the indent limit, the suboptimal ICS state is favored at the homogeneous midpoint, and the lowest branch acquires MIS character only after a narrow gap in the second half of the anneal. This spectral feature constrains the feasible annealing rate. Near the indent limit, the MICS state is favored energetically at the midpoint, together with several low-energy branches that carry substantial weight in the MIS sector. This structure suggests that diabatic transitions can deplete the instantaneous ground-state population while allowing substantial target weight to be recovered by the end of the anneal.
The target-preserving feature of the diabatic annealing can be verified with dynamical evolution using the recursive generation method, see Appendix E. We initialize the system at the instantaneous ground state at , and evolve it under a normalized ramping rate of () with the logical protocol, and compute the occupation of the MICS subspace, defined in Eq. (11), by the end of the annealing at .
The model implemented in indent limit , hosts characteristic dynamics compatible to its spectrum, see Figure 13(a). Along with the several small gaps in the spectrum, the weight of the evolving quantum state in the ground state, , and first excited state, , drops substantially in the first half of the protocol, close to . However, the quantum state does not leave the target subspace indefinitely. In fact, the instantaneous weight in the target subspace drops initially. This detour inherits from the dressing of the ground state by states. As the annealing approaches the homogeneous midpoint, the dressing effects become weak, and the state returns to the target subspace. As the annealing further proceeds, the weight of the state in excited states retains, but it remains substantially in the target subspace. We remark that the system does not need to be restrained in the ground state throughout the annealing to preserve its target by the end of the annealing.
Figure 13. Target-preserving dynamics in diamond-chain graphs. The system is prepared in the ground state at , and evolved along the logical protocol, cf. Figure 2, until . (a,b) The dynamics of the quantum state on implemented with , and ramp rate . (a) The quantum state leaves the ground state (orange curve, ) and first excited state (green curve, ), but eventually reaches the target subspace (blue curve, ). (b) The instantaneous experimentally relevant density readout along different vertices. Pairs like and are symmetric in the physical system, but asymmetry arises due to numerical truncation. They are shown by solid and dashed lines, respectively, of the same color. The shaded regime indicates that the mode truncation is numerically not fully converged. (c,d) The final dephased weight in the target subspace, , cf. Eq. (11), with various ramp rates , is shown for (c) varying for , and (d) for through at fixed . A mode truncation at is used, and the hollow points indicate that the corresponding numerical convergence is not fully converged.
The preservation of the target can be experimentally measured by the partial density distribution along different dimensions,
c.f. Eq. (15) and see Appendix. Appendix B for details. As shown in Figure 13(b), the targeted vertices, , has increasing readouts along the annealing, while the irrelevant vertices has eventual vanishing readouts. This confirms that target weight is compatible with experimentally measured solution readouts.
We further investigate the scaling of the ramp rate while changing the graph order and the system size . Given the graph , we increase from to at fixed , see Figure 13(c). Far from the indent limit, i.e., for , it takes exponentially slower ramp rates to reach the target subspace . This is consistent with the spectral structure of the system. In this case, the subICS is energetically more favorable at mid-protocol, and the system needs to go through the exponentially closing gap in the second half of the annealing, for entering the MICS subspace. At larger , the system achieves at roughly , and the required ramp rate is much less sensitive to the change in . This is consistent with the fact that the MICS subspace is always energetically more favorable in indent limit.
The annealing performance among different graphs at fixed , is shown in Figure 13(d). The majority of the system weight enters the target subspace for all probed ramp rates. There is further a drop of from to at around , and this drop takes place at slightly faster for larger graph order . This indicates the system achieves a fixed, substantial target weight through diabatic evolution within a ramp time scaling as , even in the presence of narrow intra-subspace gaps.
These results distinguish adiabatic ground-state preparation from target-compatible diabatic evolution. Although the ramp substantially depletes the lowest instantaneous modes, it recovers the target weight, while suppressing unwanted logical occupations. The resulting dynamics therefore involves a broader target manifold, rather than the single ground state.
The diabatic annealing implemented on diamond-chain graphs thus provides an example, where engineering the shape ratio of the system yields a spectral structure. This structure facilitates reaching the target MICS subspace associated to the correct classical solution. This scheme satisfies the unbiasedness criteria specified in Sec. II D. For sufficiently high-order diamond chains, the competing subICS becomes energetically favorable even in the indent limit, so the energetic rationale supporting the present protocol no longer applies. Since , the subICS has a larger weight than the MICS for with () for any choice of . By further comparison, the diabatic scheme of Ref. [64] employs an optimized detuning quench adapted to optimized quench parameters, to populate an excited branch that eventually connects to the final ground state.
Discussion and conclusions
We discuss the atomic overhead required by an experimentally relevant implementation. The standard Rydberg network construction for an -vertex graph requires around atoms [32], arranged into wires of length . To approach the indent regime, we extend the logical-one end of each wire, increasing the ratio in accordance to Figure 7. This requires additional atoms per wire, giving a total atom count of . Thus, for a fixed elongation ratio, the atomic overhead remains quadratic in .
When the target-compatible sector is energetically favorable, diabatic evolution populates excited states without necessarily compromising the final target weight. For a fixed normalized ramp factor , the protocol requires an annealing time scaling as , where we attain high final target weight. In Rydberg network implementation , the run-time overhead is therefore .
Additional avoided crossings arise from transitions involving bound states. For the clique examples studied at fixed , the corresponding minimum gaps decrease approximately exponentially with . Strategies for mitigating these spectral bottlenecks require further study. Nevertheless, failure to traverse such crossings adiabatically does not immediately invalidate the computation results in the final state. Within the factorized MICS description, retaining a bound state suppresses logical-one readouts within the corresponding vertices, without altering the readouts of the other factors. Consequently, the reported logical-one vertices form a partial independent set that can be reliably extended into an MIS. The partial solution from the quantum readout can significantly reduce the remaining classical optimization problem.
We propose further improvement to the encoding scheme that potentially alleviates the annealing bottleneck in a fundamental manner. The underlying mechanism of annealing performance lies in energetic competition, where suboptimal solutions potentially become more favorable due to quantum binding effects in the logical-zero sector . This observation motivates us to elevate the energy in that particular region by implementing an extra potential , with . The effectiveness of this extra potential for alleviating the bottleneck warrants future study.
To summarize, we have investigated the low-energy spectrum and annealing dynamics of blockaded-chain models, which encodes the maximum independent set problems. These systems host competing many-body configurations whose approximate energetics can be characterized by physically derived clique and binding motif weights. Engineering the Hilbert-space geometry controls the relative energies of target-compatible and competing configurations. From the graph theoretical perspective, it engineers a cost function which relies on the global configuration. In contrast, standard classical annealing can feasibly impose cost functions based on local graph structures, which is less sensitive to the global features of the graph. Diabatic protocols exploits the resulting spectral structure, during which the state leaves the instantaneous ground state yet recovers high final target-subspace weight. Our work indicates that solving a class of combinatorial optimization problems using quantum annealing in neutral atom networks can potentially improve annealing performance. The effectiveness and robustness of this approach in larger and more complex networks remain to be further explored.
Beyond optimization problems, neutral atom networks offer a flexible setting for investigating how engineered Hilbert-space geometry shapes localization and transport. This setup has thus demonstrated its flexibility in investigating many-body localization, and can facilitate future studies on geometric effects in Hilbert-space fragmentation [65, 66, 67], and quantum thermalization [68, 69].
Acknowledgments
I would like to thank Hannes Pichler for initial conceptualization, Zhongda Zeng and Roberto Tricarico for in-depth discussions, and Yuanyuan Zhao for inspirational discussion on the recursive generation algorithm.
List of graphs
For reference, we list all the small graphs with vertices [58] in Table I, together with the maximum independent sets and maximum independent clique sets.
Blockaded-chain model as effective low-energy model for Rydberg networks
We review the scheme using Rydberg network to encode the maximum independent set (MIS) problem [32], and then derive the blockaded chain model that we substantially investigate throughout this work.
In this encoding scheme, an array of neutral atoms subject to nearest-neighbor Rydberg interaction, also referred to as a Rydberg wire, encodes the occupation of a graph vertex, see Figure 14(a). In each wire, an even number of atoms are subject to uniform Rabi frequency

Figure 14. (a) A Rydberg wire of 6 atoms encoding the quantum degree of freedom associated to a vertex. (b) A crossing gadget not imposing constraint between the two vertices. (c) An edged gadget forbidding simultaneous occupation of the logical-one state of the two vertices. The arrow points to right, indicate that the logical-zero configuration is , while the logical-one configuration is .
| Graph | Maximum Independent Vertex Sets | Maximum Independent Clique Sets |
| 2-1 | ||
| 3-1 | ||
| 3-2 | ||
| 4-1 | ||
| 4-2 | ||
| 4-3 | ||
| 4-4 | ||
| 4-5 | ||
| 4-6 | ||
| 5-1 | ||
| 5-2 | ||
| 5-3 | ||
| 5-4 | ||
| 5-5 | ||
| 5-6 | ||
| 5-7 | ||
| 5-8 | ||
| 5-9 | ||
| 5-10 | ||
| 5-11 | ||
| 5-12 | ||
| 5-13 | ||
| 5-14 | ||
| 5-15 | ||
| 5-16 | ||
| 5-17 | ||
| 5-18 | ||
| 5-19 | ||
| 5-20 | ||
| 5-21 |
Table 1 (PDF p. 17). Atlas list of small graphs, and their maximum independent vertex and clique sets.
and detunings , such that each of the two configurations represents the logical-zero (unoccupied vertex) and logical-one (occupied vertex), respectively. Multiple wires are then arranged into a two-dimensional network,
such that any pair of wires crosses with each other. The crossings are always placed at -th and -th atoms of the wires. At the crossings, the atoms are arranged into patterns called gadgets. The crossing gadget does not implement additional constraint to the configurations of the two corresponding wires, and thus encode a pair of vertices not connected by an edge, see Figure 14(b). In contrast, the edge gadget imposes an additional constraint that the two wires cannot occupy the logical-one mode simultaneously, and thus encodes a pair of vertices connected by an edge, see Figure 14(c).
The Rydberg network can thus be formally described by a PXP Hamiltonian,
where sums over all neutral atoms in the network, are Pauli matrices acting on the atomic Rydberg level and ground level . The product in run over all wires, with run through all neighboring atoms; while the product in run over all pairs of wires, with following the blockade rule established by Figure 14(b,c). Here, projects out the simultaneous occupation of Rydberg levels of two blockaded atoms.
When , we can work in the domain wall limit [35]. The domain wall basis states are the highly degenerate ground states of the system when taking . For a single wire of atoms, these basis states are
We label these states by , and identify and to logical-zero and logical-one edges, respectively. When all gadgets are crossing gadgets and thus impose no constraint, they constitute domain-wall states, which can be labeled by coordinates , . In the presence of edged gadgets, the additional constraint thus forbids selected domain-wall states. Specifically, any states with coordinates become illegitimate.
Once is turned on, it provides a second-order perturbative channel, where one atom transitions from its Rydberg state to its ground state, while another atom transitions from its ground state to its Rydberg state. This perturbative process takes place for two neighboring atoms which are subject to the Rydberg blockade . In the domain-wall basis states, this effectively induces a hopping of domain wall with strength . Along the wires, this hopping involves neighboring states, leading to as defined in Eq. (4). In the vicinity of the gadgets, it induces local terms . As an example, for the realistic implementation shown in Figure 1(e), its effective domain-wall Hamiltonian is illustrated in Figure 1(f).
To achieve the final symmetric form of the blockaded-chain model as presented in Eq. (3) and investigated throughout this work, we further simplify the domain-wall model by omitting the gadget hoppings as detailed in Ref. [35], and the gadget structure by taking the idealized uniform gadget positioning limit, . This simplification is illustrated by Figure 1(g).
A complementary and experimentally relevant measurement for , Eq. (11), is provided by the coordinate-resolved density , Eq. (15). We can quantify whether the quantum state lies within the logical-one region by its single-body probability, . This quantity is experimentally accessible with Rydberg arrays. In the Rydberg array, this probability translates into the occupation of the Rydberg level of the th atoms, , which is easily accessible in experimental measurements.
Dynamics and mapping in hypercube limit
In the hypercube limit, , a graph edge excludes only the simultaneous occupation of the final sites of the two corresponding chains. Although the excluded fraction of the configuration space is small, the constraint can affect low-energy modes localized

Figure 15. Low-energy eigenstates and reconstructed basis in a two-dimensional model without blockade. Parameters are taken as , , .

Figure 16. Low-energy eigenstates and reconstructed basis in a two-dimensional model with blockade. Parameters are taken in hypercube limit, , , , .
near that boundary. To achieve an effective low energy description, we first solve the finite one-dimensional problem and identify its crossover energy scale. This effective energetic truncation of the blockaded-chain model leads to a two-mode variational description with the connectivity of the PXP implementation.
Finite-chain eigenstates
We solve the low-energy modes of a single chain. The one-dimensional Hamiltonian in Eq. (4b) leads to the bulk equation and boundary conditions . Along the logical protocol, see Figure 2, the local potential on one edge vanishes. We take and without loss of generality.
We are most interested in the regime , where the ground mode crosses over from a standing-wave mode to a exponentially decaying mode.
For much larger than , the ground mode is localized on the edge and decays exponentially along the chain,
and possesses an energy below the continuum band, ,
where the decay rate is fixed by boundary condition on edge as . When the length of the chain is much longer than the decay length, , the wavefunction and the energy obtain explicit forms
and
respectively. In the regime , , the energy can be further reduced to
When approaches , the ground mode becomes a standing-wave mode. Its wavefunction and energy are
and
where the wave vector is given by . In the regime , the wave vector can be approximated by
for ground mode and first excited mode . The energy becomes correspondingly
This indicates a crossover at , i.e., , as confirmed exactly by the boundary conditions. Indeed, at this point, the ground mode becomes linear,
with energy exactly at . Meanwhile, the first excited mode is a standing-wave mode with wave vector .
Two mode projection
In the hypercube limit, the blockaded-chain model can be projected onto two modes along each direction, and achieve generic scaling behaviors. We retain the two lowest exact eigenstates of each finite chain, and . Near the crossover, their separation is of order , giving rise to effective dynamics scaling in this order. Without blockade, these two states are exactly the two modes spanning the low energy dynamics.
A graph edge excludes simultaneous occupation of site on the two adjacent chains. This constraint leads to an effective overlap between the two modes. To look for an orthonormal basis and , we need a rotation
where relates the wavefunction at the edges of the original modes. Notably, this imposes an effective hopping between the two new basis modes,
where are the energies of original basis modes . In other words, we have spanned the system onto an effective two-mode basis,
The Pauli matrices are spanned within the basis of . The projection thus yields the PXP Hamiltonian on the same graph with renormalized hopping strengths. This reveals a minimum gap of the hypercube limit model given by the energy scale of , as confirmed numerically by Figure 17.
Figure 17. The classical hardness index, Eq. (44), compared to the minimum gap along protocol for the PXP implementation, , , for graphs with vertices.
Annealing difficulty for PXP implementation
The small-graph spectra also motivate an empirical indicator based on the degeneracies of competing independent-set families. We extract an empirical index,
Here, refers to the cardinality of the maximum or suboptimal independent set, and refers to the degeneracy. When the cardinality of the maximum and suboptimal independent sets differ by 1, the quantum annealing performance is mainly determined by the competition between these two independent sets. thus provides a rough estimate to the weight of the independent set, and motivated by the weight of a -clique when . The classical hardness index estimates the ratio between the weights of the maximum and suboptimal independent clique sets. When , the maximum set does not compete with the suboptimal one, and determines the gap on its own. This index indeed shows a clear correlation with the minimum gap along the annealing in Figure 17.
Binding in Kq graphs
This Appendix complements the discussion of bound states in complete graphs, , § 3.1 A, and we derive the bound state self-consistency equation, Eq. (19) in details.
To investigate the effects of coordination enhancement of scattering processes on the bare logical-zero state , we split the full Hilbert space into the low-energy subspace spanned solely by and its complement, . This allows us to write down the Feshbach equation,
Here is the energy of , is the effective coupling strength, and the self energy is
with , or explicitly
To reduce the dimensionality of the problem, we introduce a mapping onto one dimension. Specifically, we consider the variational ansatz generated by a one-dimensional wavefunction through the isometric map ,
where we impose . Particularly, the state can be generated using as . This mapping, , induces a relation between , and its one-dimensional counterpart, , as
The variational ansatz is split into contributions from one and logical-zero modes. Defining , the Feshbach equation becomes
where the factor of comes from the summation in and represents the different scattering processes, and
Here, we approximate the complementary-space resolvent by restricting it to the subspace generated by ,
This neglects virtual excursions outside the retained subspace. To proceed to evaluate the self energy, we need to transform it into the bare one-dimensional self energy without projector,
Splitting the one-dimensional Hamiltonian into , the Dyson equation relates the bare and projected self energies, and as
Substitution leads to
Since is the usual one-dimensional propagator, it can be straightforwardly evaluated.
The factor initially arises from the coherent coupling of the bare logical-zero state to equivalent scattering channels. After Dyson resummation, virtual processes going through are also taken into account, which reduces the factor from to .
However, this reduction is merely algebraic, and should not be interpreted as a reduction in scattering channels. The energy of the dressed state is directly associated to its density profile, particularly whether it is bound to the logical-zero sector or propagating outwards. Particularly, bound states are characterized energetically by , and their wavefunctions decay with rate along the lattice. Denoting , the propagator for a one-dimensional lattice can be written as
where is related to defined in § 3.1 A through . In other words, the wavefunction decays as . This further applies to the minimum gap for .
The recursive generation algorithm
The blockaded-chain models are solved typically using exact diagonalization with sparse matrices. This makes the required computational resources formidable as it scales with , where is the length of the lattice, and is the number of vertices in the graph. In our work, there are two families of graphs with clear patterns, the complete graphs and the diamond-chain graphs . These graphs themselves can be generated recursively. Utilizing the patterns, we can also generate their Hamiltonian and solve their spectra recursively. This method can easily be further generalized for other families of graphs. The algorithm comes in two major steps, mode truncation and iterative generation.
Mode truncation
The lattice of the blockaded-chain model has a shape given by Eq. (10). It can be split into multiple hypercuboids, and each hypercuboid admits a straightforward solution.
Formally, this can be treated by the following Hamiltonian,
where are Hamiltonians easily diagonalizable describing the sectors A, B, C, D,
where is a diagonal matrix containing the eigenvalues of . Furthermore, indicates a coupling between the two corresponding sectors. Generically for blockaded-chain models, this coupling is takes a uniform value of when it exists. In this particular example, it couples the sector pairs , , , and . It is thus possible to construct the overall transform matrix,
such that
The matrices encode the overlap between wavefunctions from the two neighbouring sub-systems. When the neighboring sectors share the same Hamiltonian , these matrices are trivially unities .
Upon this diagonalization, it is thus possible to truncate the full Hamiltonian , and drop the high-energy modes with large . This can significantly reduce the computational complexity.
Motivation from classical algorithm
We motivate the quantum algorithm from a classical algorithm for solving the MIS problem on the diamond chain graphs. The branching algorithm [40] generates the MIS iteratively, as illustrated in Figure 18. Starting with a single vertex as , in each iteration we attach a to for generating . The MIS for comes from either of the two branches:
Figure 18. The branching algorithm for classically solving the MIS problem on diamond chain graphs. The MIS solution to the -graph is given by the better solution between the two branches, and can thus be generated using the MIS solution to the -graph.
Either of the vertices or belongs to MIS of . In this case, cannot belong to the MIS. If we construct an auxiliary blockaded diamond chain graph , the MIS of can be constructed as the union of the MIS of the blockaded graph together with or ,
Neither of the vertices or belongs to MIS of . In this case, the MIS can be constructed as the union of the MIS of together with ,
The MIS is thus the one with more vertices,
The branching algorithm provides a recursive relation between the MISs of the full and blockaded graphs.
The recursive generation algorithm for the quantum problem
A similar strategy can be applied for solving the low-energy spectra of the blockaded chain models based on diamond chain graphs. After introducing an auxiliary blockaded Hamiltonian, an effective Hamiltonian for , denoted as , can be constructed using the spectrum of and . The strategy is illustrated in Figure 19. This method allows for truncation for the low-energy spectra, which significantly reduces the computational complexity.
Figure 19. Constructing the effective Hamiltonian for -graph from the spectrum of -graph. In each iteration, a full and a blockaded Hamiltonian are constructed and solved. For both of them, the red (blue) sites host the spectrum of the full (blockaded) Hamiltonian from the last iteration.
The “full” Hamiltonian is defined on lattice sites allowed by a fully connected -vertex graph. In other words, , and only one of them is allowed to be greater than , see Figure 19. The Hamiltonian thus reads
The effective local energy shift provided by the spectrum of the -graphs is
These two regions are colored in Figure 19 by red and blue, respectively. Here, . is the chemical potential on boundary condition, , where denotes the number of being or , respectively.
Moreover, the effective hopping is provided by the overlap between the eigenmodes of the -graphs,
In other words, within the same (blue or red) region, the effective coupling is unity between the same mode of neighboring sites, and is zero in all other cases. Along the boundary between the two regions, the effective coupling is given by the overlap between modes.
The “blockaded” Hamiltonian can be straightforwardly derived from the full one by blocking the prohibited region,
where is the projection operator onto , cf. Figure 19.
These two Hamiltonians together provide an iterative relation,
By choosing a sufficiently large truncation for the number of modes considered , we can successively obtain the low-energy spectrum for the implementations of different diamond-chain graphs. In our simulations, we obtain converged results with . The same algorithm can be straightforwardly generalized to any other series of graphs of clear pattern. In the main text, it is also applied to the complete graphs .
Dynamics in the truncated instantaneous basis
We simulate the real-time dynamics in the subspace spanned by the lowest instantaneous modes obtained from the recursive algorithm. The quantum state is propagated following an evolution-and-projection strategy. The coefficients between step and are related through
Here is a diagonal matrix containing the instantaneous spectrum at time , associated to the instantaneous modes . stores the overlaps between the instantaneous modes at time and , . For each step, this overlap matrix can be computed iteratively from to the required . Particularly, this numerical dynamical evolution is not exactly unitary due to mode truncation, and norms of the quantum states can decrease during a mode-unconverged evolution.
References
References
- [1]M. W. Johnson, M. H. S. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A. J. Berkley, J. Johansson, P. Bunyk, et al., Nature 473, 194 (2011), URL https://doi.org/10.1038/nature10012.
- [2]S. Kim, S-W. Ahn, I.-S. Suh, A. W. Dowling, E. Lee, and T. Luo, npj Quantum Information 11, 77 (2025), URL https://doi.org/10.1038/s41534-025-01020-1.
- [3]M. Saffman, T. G. Walker, and K. Mølmer, Rev. Mod. Phys. 82, 2313 (2010), URL https://link.aps.org/doi/10.1103/RevModPhys.82.2313.DOI
- [4]H. Labuhn, D. Barredo, S. Ravets, S. de Léséleuc, T. Macrì, T. Lahaye, and A. Browaeys, Nature 534, 667 (2016), URL https://doi.org/10.1038/nature18274.
- [5]S. Ebadi, T. T. Wang, H. Levine, A. Keesling, G. Se-meghini, A. Omran, D. Blüvstein, R. Samajdar, H. Pich-ler, W. W. Ho, et al., Nature 595, 227 (2021), URL https://doi.org/10.1038/s41586-021-03582-4.
- [6]F. Cesa and H. Pichler, Phys. Rev. Lett. 131, 170601 (2023), URL https://link.aps.org/doi/10.1103/PhysRevLett.131.170601.DOI
- [7]S. J. Evered, D. Blüvstein, M. Kalinowski, S. Ebadi, T. Manovitz, H. Zhou, S. H. Li, A. A. Geim, T. T. Wang, N. Maskara, et al., Nature 622, 268 (2023), URL https://doi.org/10.1038/s41586-023-06481-y.
- [8]D. S. Grün, S. J. M. White, A. Ortu, A. Di Carli, H. Edri, M. Lepers, M. J. Mark, and F. Ferlaino, Phys. Rev. Lett. 133, 233402 (2024), URL https://link.aps.org/doi/10.1103/PhysRevLett.133.223402.DOI
- [9]M. A. Norcia, H. Kim, W. B. Cairncross, M. Stone, A. Ryou, M. Jaffe, M. O. Brown, K. Barnes, P. Battaglino, T. C. Bohdanowicz, et al., PRX Quantum 5, 030316 (2024), URL https://link.aps.org/doi/10.1103/PRXQuantum.5.030316.DOI
- [10]G. Pichard, D. Lim, E. Bloch, J. Vaneecloo, L. Bourachot, G.-J. Both, G. Mériaux, S. Dutartre, R. Hostein, J. Paris, et al., Phys. Rev. Appl. 22, 024073 (2024), URL https://link.aps.org/doi/10.1103/PhysRevApplied.22.024073.DOI
- [11]Y. Cheng and H. Zhai, Nature Reviews Physics 6, 566 (2024), URL https://doi.org/10.1038/s42254-024-00749-6.
- [12]T. Zhang, Z. Chi, and J. Hu, PRX Quantum 5, 030345 (2024), URL https://link.aps.org/doi/10.1103/PRXQuantum.5.030345.DOI
- [13]H. J. Manetsch, G. Nomura, E. Bataille, X. Lv, K. H. Leung, and M. Endres, Nature 647, 60 (2025), URL https://doi.org/10.1038/s41586-025-09641-4.
- [14]R. Lin, H.-S. Zhong, Y. Li, Z.-R. Zhao, L.-T. Zheng, T.-R. Hu, H.-M. Wu, Z. Wu, W.-J. Ma, Y. Gao, et al., Phys. Rev. Lett. 135, 060602 (2025), URL https://link.aps.org/doi/10.1103/2ym8-vs82.DOI
- [15]N.-C. Chiu, E. C. Trapp, J. Guo, M. H. Abobeih, L. M. Stewart, S. Hollerith, P. L. Stroganov, M. Kalinowski, A. A. Geim, S. J. Evered, et al., Nature 646, 1075 (2025), URL https://doi.org/10.1038/s41586-025-09596-6.
- [16]M. Mohan, J. de Hond, and S. Kokkelmans, Phys. Rev. Appl. 23, 054074 (2025), URL https://link.aps.org/doi/10.1103/PhysRevApplied.23.054074.DOI
- [17]M. Qiao, G. Emperauger, C. Chen, L. Homeier, S. Hollerith, G. Bornet, R. Martin, B. Gély, L. Klein, D. Barredo, et al., Nature 644, 889 (2025), URL https://doi.org/10.1038/s41586-025-09377-1.
- [18]M. Qiao, R. Martin, L. Homeier, I. Morera, B. Gély, L. Klein, Y. T. Chew, D. Barredo, T. Lahaye, E. Demler, et al., Kinetically-induced bound states in a frustrated rydberg tweezer array (2025), 2510.17183, URL https://arxiv.org/abs/2510.17183.
- [19]T. Zhang, W. Wang, W. Zhang, Y. Wang, A. Du, Z. Li, Y. Wu, C. Li, J. Hu, H. Zhai, et al., Phys. Rev. Lett. 135, 093403 (2025), URL https://link.aps.org/doi/10.1103/2gwz-65w1.DOI
- [20]Y. Wang, Y. Liao, T. Zhang, Y. Tian, Y. Wu, A. Senoo, A. Baumgärtner, J. W. Lis, G. M. Vaidya, Z. Zeng, G. Giudici, H. Pichler, and A. M. Kaufman, Nature Physics 22, 903 (2026), URL https://doi.org/10.1038/s41567-026-03258-8.
- [22]Z. Zeng, G. Giudici, A. Senoo, A. Baumgärtner, A. M. Kaufman, and H. Pichler, Phys. Rev. Lett. 136, 120404 (2026), URL https://link.aps.org/doi/10.1103/z2tj-cwzb.DOI
- [23]F. Cesa, A. D. Fini, D. A. Korbany, R. Tricarico, H. Bernien, H. Pichler, and L. Piroli, Engineering discrete local dynamics in globally driven dual-species atom arrays (2026), 2601.16961, URL https://arxiv.org/abs/2601.16961.
- [24]R. White, V. Ramesh, A. Imperto, S. Anand, F. Cesa, G. Giudici, T. Iadecola, H. Pichler, and H. Bernien, Quantum cellular automata on a dual-species rydberg processor (2026), 2601.16257, URL https://arxiv.org/abs/2601.16257.
- [25]D. Bluvstein, A. Geim, S. H. Li, S. J. Evered, J. P. Bonilla Ataides, G. Baranes, A. Gu, T. Manovitz, M. Xu, M. Kalinowski, et al., Nature 649, 39 (2026), URL https://doi.org/10.1038/s41586-025-09848-5.
- [26]E. Urban, T. A. Johnson, T. Henage, L. Isenhower, D. D. Yavuz, T. G. Walker, and M. Saffman, Nature Physics 5, 110 (2009), URL https://doi.org/10.1038/nphys1178.
- [27]A. Browaeys and T. Lahaye, Nature Physics 16, 132 (2020), URL https://doi.org/10.1038/s41567-019-0733-z.
- [28]H. Pichler, S.-T. Wang, L. Zhou, S. Choi, and M. D. Lukin, Quantum optimization for maximum independent set using rydberg atom arrays (2018), 1808.10816, URL https://arxiv.org/abs/1808.10816.
- [29]M. Kim, K. Kim, J. Hwang, E.-G. Moon, and J. Ahn, Nature Physics 18, 755 (2022), URL https://doi.org/10.1038/s41567-022-01629-5.
- [30]A. Byun, M. Kim, and J. Ahn, PRX Quantum 3, 030305 (2022), URL https://link.aps.org/doi/10.1103/PRXQuantum.3.030305.DOI
- [31]S. Ebadi, A. Keesling, M. Cain, T. T. Wang, H. Levine, D. Bluvstein, G. Semeg hini, A. Omran, J.-G. Liu, R. Samajdar, et al., Science 376, 1209 (2022), https://www.science.org/doi/pdf/10.1126/science.abo6587, URL https://www.science.org/doi/abs/10.1126/science.abo6587.
- [32]M.-T. Nguyen, J.-G. Liu, J. Wurtz, M. D. Lukin, S.-T. Wang, and H. Pichler, PRX Quantum 4, 010316 (2023), URL https://link.aps.org/doi/10.1103/PRXQuantum.4.010316.DOI
- [33]A. G. de Oliveira, E. Diamond-Hitchcock, D. M. Walker, M. T. Wells-Pestell, G. Pelegrí, C. J. Picken, G. P. A. Malcolm, A. J. Daley, J. Bass, and J. D. Pritchard, PRX Quantum 6, 010301 (2025), URL https://link.aps.org/doi/10.1103/PRXQuantum.6.010301.DOI
- [34]M. J. A. Schuetz, R. S. Andrist, G. Salton, R. Yalovetzky, R. Raymond, Y. Sun, A. Acharya, S. Chakrabarti, M. Pistoia, and H. G. Katzgraber, Phys. Rev. Res. 7, 033107 (2025), URL https://link.aps.org/doi/10.1103/7dkh-crjj.DOI
- [35]L. Bombieri, Z. Zeng, R. Tricarico, R. Lin, S. Notarnicola, M. Cain, M. D. Lukin, and H. Pichler, PRX Quantum 6, 020306 (2025), URL https://link.aps.org/doi/10.1103/PRXQuantum.6.020306.DOI
- [36]P. Cazals, A. François, L. Henriet, L. Leclerc, M. Marin, Y. Naghmouchi, W. d. S. Coelho, F. Sikora, V. Vitale, R. Watignat, et al., Phys. Rev. Appl. 25, 034085 (2026), URL https://link.aps.org/doi/10.1103/8gjv-11lf.
- [37]A. G. de Oliveira, J. Kombe, G. Pelegrí, P. Schroff, M. T. Wells-Pestell, D. M. Walker, A. J. Daley, and J. D. Pritchard, A quantum wire approach to weighted combinatorial graph optimisation problems (2026), 2503.17115, URL https://arxiv.org/abs/2503.17115.
- [38]J. Kombe and J. D. Pritchard, Reducibility of native weighted graphs on rydberg arrays (2026), 2605.07952, URL https://arxiv.org/abs/2605.07952.
- [39]A. Byun, B. Klaver, A. De, P. Ildefonso, D. Khachatryan, A. Bylinskii, M. Schuler, and W. Lechner, Error-corrected quantum optimization via rydberg atom array embeddings (2026), 2610.39670, URL https://arxiv.org/abs/2610.39670.
- [40]X.-Z. Gao, Y.-J. Wang, P. Zhang, and J.-G. Liu, Automated discovery of branching rules with optimal complexity for the maximum independent set problem (2024), 2412.07685, URL https://arxiv.org/abs/2412.07685.
- [41]D. Jaksch, J. I. Cirac, P. Zoller, S. L. Rolston, R. Côté, and M. D. Lukin, Phys. Rev. Lett. 85, 2208 (2000), URL https://link.aps.org/doi/10.1103/PhysRevLett.85.2208.DOI
- [42]M. D. Lukin, M. Fleischhauer, R. Cote, L. M. Duan, D. Jaksch, J. I. Cirac, and P. Zoller, Phys. Rev. Lett. 87, 037901 (2001), URL https://link.aps.org/doi/10.1103/PhysRevLett.87.037901.DOI
- [43]A. Gaëtan, Y. Miroshnychenko, T. Wilk, A. Chotia, M. Viteau, D. Comparat, P. Pillet, A. Browaeys, and P. Grangier, Nature Physics 5, 115 (2009), URL https://doi.org/10.1038/nphys1183.
- [44]M. Serbyn, D. A. Abanin, and Z. Papić, Nature Physics 17, 675 (2021), URL https://doi.org/10.1038/s41567-021-01230-2.
- [45]G.-X. Su, H. Sun, A. Hudomal, J.-Y. Desaules, Z.-Y. Zhou, B. Yang, J. C. Halimeh, Z.-S. Yuan, Z. Papić, and J.-W. Pan, Phys. Rev. Res. 5, 023010 (2023), URL https://link.aps.org/doi/10.1103/PhysRevResearch.5.023010.DOI
- [46]M. Cain, S. Chattopadhyay, J.-G. Liu, R. Samajdar, H. Pichler, and M. D. Lukin, Quantum speedup for combinatorial optimization with flat energy landscapes (2023), 2306.13123, URL https://arxiv.org/abs/2306.13123.
- [47]D. Bluvstein, A. Omran, H. Levine, A. Keesling, G. Semeg hini, S. Ebadi, T. T. Wang, A. A. Michailidis, N. Maskara, W. W. Ho, et al., Science 371, 1355 (2021), URL https://www.science.org/doi/abs/10.1126/science.abg2530.
- [48]A. Hudomal, J.-Y. Desaules, B. Mukherjee, G.-X. Su, J. C. Halimeh, and Z. Papić, Phys. Rev. B 106, 104302 (2022), URL https://link.aps.org/doi/10.1103/PhysRevB.106.104302.DOI
- [49]G. Giudici, F. M. Surace, and H. Pichler, Phys. Rev. Lett. 133, 190404 (2024), URL https://link.aps.org/doi/10.1103/PhysRevLett.133.190404.DOI
- [50]H. K. Park and S. Lee, Phys. Rev. B 111, 085104 (2025), URL https://link.aps.org/doi/10.1103/PhysRevB.111.085104.DOI
- [51]B. Wu, H. Yu, and F. Wilczek, Phys. Rev. A 101, 012318 (2020), URL https://link.aps.org/doi/10. 1103/PhysRevA.101.012318
- [52]X. Zhao, P. Ge, H. Yu, L. You, F. Wilczek, and B. Wu, National Science Review 12, nwa f304 (2025), ISSN 2095-5138, https://academic.oup.com/nsr/article-pdf/12/9/nwaf304/63880869/nwaf304.pdf, URL https://doi.org/10.1093/nsr/nwaf304.
- [53]S. Klavžar and M. Mollard, Daisy cubes and distance cube polynomial (2017), 1705.08674, URL https://arxiv.org/abs/1705.08674.
- [54]A. Taranenko, European Journal of Combinatorics 85, 103058 (2020), ISSN 0195-6698, URL https://www.sciencedirect.com/science/article/pii/S0195669819301593.
- [55]G. Schaller, S. Mostame, and R. Schützhold, Phys. Rev. A 73, 062307 (2006), URL https://link.aps.org/doi/10.1103/PhysRevA.73.062307.DOI
- [56]S. Jansen, M.-B. Ruskai, and R. Seiler, Journal of Mathematical Physics 48, 102111 (2007), ISSN 0022-2488, URL https://doi.org/10.1063/1.2798382.
- [57]S. Boixo and R. D. Somma, Phys. Rev. A 81, 032308 (2010), URL https://link.aps.org/doi/10.1103/PhysRevA.81.032308.DOI
- [58]R. C. Read and R. J. Wilson, An Atlas of Graphs (Oxford University Press, Oxford, 2005).
- [59]F. Lenz, J. T. Londergan, E. J. Moniz, R. Rosenfelder, M. Stingl, and K. Yazaki, Annals of Physics 170, 65 (1986), ISSN 0003-4916, URL https://www.sciencedirect.com/science/article/pii/0003491686900886.
- [60]D. Dvořák, J.-S. Sereni, and J. Volec, Journal of the London Mathematical Society 89, 641 (2014), https://londmathsoc.onlinelibrary.wiley.com/doi/pdf/10.1112/jlms/jdt085, URL https://londmathsoc.onlinelibrary.wiley.com/doi/abs/10.1112/jlms/jdt085.
- [61]R. Diestel, Graph Theory, vol. 173 of Graduate Texts in Mathematics (Springer-Verlag, Heidelberg, 2025), 6th ed., ISBN 978-3-662-70106-5.
- [62]W. Cames van Batenburg, G. Joret, and J. Goedgebeur, Advances in Combinatorics (2020), URL https://doi.org/10.19086/aic.13667.
- [63]B. F. Schiffer, D. S. Wild, N. Maskara, M. Cain, M. D. Lukin, and R. Samajdar, Phys. Rev. Res. 6, 013271 (2024), URL https://link.aps.org/doi/10.1103/PhysRevResearch.6.013271.DOI
- [64]A. Lukin, B. F. Schiffer, B. Braverman, S. H. Cantu, F. Huber, A. Bylinskii, J. Amato-Grill, N. Maskara, M. Cain, D. S. Wild, et al., Quantum quench dynamics as a shortcut to adiabaticity (2024), 2405.21019, URL https://arxiv.org/abs/2405.21019.
- [65]S. Moudgalya, B. A. Bernevig, and N. Regnault, Reports on Progress in Physics 85, 086501 (2022), URL https://doi.org/10.1088/1361-6633/ac73a0.
- [66]S. Moudgalya and O. I. Motrunich, Phys. Rev. X 12, 011050 (2022), URL https://link.aps.org/doi/10.1103/PhysRevX.12.011050.DOI
- [67]Y. Li, P. Sala, and F. Pollmann, Phys. Rev. Res. 5, 043239 (2023), URL https://link.aps.org/doi/10.1103/PhysRevResearch.5.043239.DOI
- [68]J. M. Deutsch, Reports on Progress in Physics 81, 082001 (2018), URL https://doi.org/10.1088/1361-6633/aac9f1.
- [69]M. Ueda, Nature Reviews Physics 2, 669 (2020), URL https://doi.org/10.1038/s42254-020-0237-x.













