Quantum walk on a chimera graph
Shu Xu, Xiangxiang Sun, Jizhou Wu, Wei-Wei Zhang, Nigum Arshed and, Barry C. Sanders

TL;DR
This paper investigates continuous-time quantum walks on chimera graphs, revealing localization phenomena and analyzing symmetries to understand quantum behavior relevant for quantum annealer design.
Contribution
It introduces a symmetry-based framework to analyze quantum walks on chimera graphs and their variants, providing new insights into their spectral properties and localization effects.
Findings
Quantum walks exhibit localization on chimera graphs.
Symmetry operators classify the spectrum and stationary states.
Enhanced and diminished chimera graphs show distinct quantum behaviors.
Abstract
We analyze a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum-walk features such as localization that starkly distinguishes classical from quantum behavior. Motivated by technological thrusts, we study continuous-time quantum walks on enhanced variants of the chimera graph and on a diminished chimera graph with a random removal of sites. We explain the quantum walk by constructing a generating set for a suitable subgroup of graph isomorphisms and corresponding symmetry operators that commute with the quantum-walk Hamiltonian; the Hamiltonian and these symmetry operators provide a complete set of labels for the spectrum and the stationary states. Our quantum-walk characterization of the chimera graph and its variants yields valuable insights into graphs used for designing quantum-annealers.
| Vertex permutation | v | Eigenvalues of | ||||
|---|---|---|---|---|---|---|
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Quantum walk on a chimera graph
Shu Xu
Shanghai Branch, National Laboratory for Physical Sciences at Microscale, University of Science and Technology of China, Shanghai 201315, China
Xiangxiang Sun
Department of Modern Physics, University of Science and Technology of China, Hefei, Anhui 230026, China
Jizhou Wu
Shanghai Branch, National Laboratory for Physical Sciences at Microscale, University of Science and Technology of China, Shanghai 201315, China
Wei-Wei Zhang
Shanghai Branch, National Laboratory for Physical Sciences at Microscale, University of Science and Technology of China, Shanghai 201315, China
Nigum Arshed
Shanghai Branch, National Laboratory for Physical Sciences at Microscale, University of Science and Technology of China, Shanghai 201315, China
Barry C. Sanders
Shanghai Branch, National Laboratory for Physical Sciences at Microscale, University of Science and Technology of China, Shanghai 201315, China
Synergetic Innovation Center of Quantum Information and Quantum Physics, University of Science and Technology of China, Hefei, Anhui 230026, China
Institute for Quantum Science and Technology, University of Calgary, Alberta, Canada T2N 1N4
Program in Quantum Information Science, Canadian Institute for Advanced Research, Toronto, Ontario M5G 1Z8, Canada
Abstract
We analyze a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum walk features such as localization that starkly distinguishes classical from quantum behaviour. Motivated by technological thrusts, we study continuous-time quantum walk on enhanced variants of the chimera graph and on diminished chimera graph with a random removal of vertices. We explain the quantum walk by constructing a generating set for a suitable subgroup of graph isomorphisms and corresponding symmetry operators that commute with the quantum walk Hamiltonian; the Hamiltonian and these symmetry operators provide a complete set of labels for the spectrum and the stationary states. Our quantum walk characterization of the chimera graph and its variants yields valuable insights into graphs used for designing quantum-annealers.
pacs:
03.67.Ac
I Introduction
The chimera graph Boothby et al. (2016), which we henceforth call , is the hardware graph for D-Wave computers. This graph underpins the chip design for computational tasks such as optimization Neukart et al. (2017); Rosenberg et al. (2016); Nazareth and Spaans (2015), graph partitioning Ushijima-Mwesigwa et al. (2017), and machine learning O’Malley et al. (2017); Potok et al. (2016); Adachi and Henderson (2015), which classical computers and algorithms struggle to perform efficiently and accurately. D-Wave computers solve problems by converting the problem graph into its hardware graph, using the minor embedding technique of representing one logical qubit by several physical qubits Choi (2008, 2011); Klymko et al. (2014). Long-range connections in Katzgraber et al. (2014); Vinci et al. (2015) are absent due to implementation constraints Bunyk et al. (2014), which necessitates an embedding of problem graphs into the incomplete graph using the minor embedding technique Vinci et al. (2015); Bunyk et al. (2014); Venturelli et al. (2015). Therefore, modifying the current D-Wave computers graph structure is important, and studying the symmetries of may offer another perspective to give insights to reduce overheads or improve minor embedding technology.
The quantum walk (QW) Aharonov et al. (1993), which quantizes the ubiquitous classical random walk Noh and Rieger (2004), has become a rich area of theoretical Childs and Goldstone (2004); Childs (2009); Lovett et al. (2010) and experimental Dür et al. (2002); Zähringer et al. (2010); Izaac et al. (2017) study for quantum computation Farhi and Gutmann (1998); Nagaj (2010), quantum search Ambainis (2004), photosynthetic energy transfer Mohseni et al. (2008); Biggerstaff et al. (2016); Carrega et al. (2016), topological phases Kitagawa et al. (2010); Asbóth (2012), quantum algorithms Kendon (2006); Santha (2008), quantum transport Mülken and Blumen (2005); Bougroura et al. (2016) and the foundational quantum-classical divide Childs et al. (2002). Two equivalent versions are the discrete QW Aharonov et al. (2001); Shikano and Katsura (2010) and the continuous-time QW Farhi and Gutmann (1998); Mülken and Blumen (2011). For the discrete QW, the evolution operator is applied in discrete time steps, whereas the evolution operator is defined for all times for the continuous-time QW Venegas-Andraca (2012). In both discrete and continuous models, the topology on which QW is performed and its properties studied are discrete graphs Venegas-Andraca (2012). The topology of the graph has significant affect in the evolution.
Through simulating the continuous-time QW on and its variants with different boundary conditions and initial positions, we discover that QW localization behaviour is starkly different from the classical walk. We study symmetries of and the role they play in state evolution. The properties of the walker’s evolution on reflect the structures of the graphs thereby indicating that our QW approach could be used for state engineering and quantum-gate design. Our method provides a way to investigate the structure of graphs and sheds light on how to understand the symmetries of , which is used on the D-Wave machine. We are studying a single-particle QW, and quantum annealing on a graph involves the ground-state of a many-body Hamiltonian so how much we can learn from the single-particle QW is inherently limited. The nature of the many-body ground-state problem for classical Ising models Ceperley and Alder (1980) and quantum model White (1992) provides a rigorous and valuable complementary analyses for many-body cases.
The structure of our article is as follows. We provide relevant background regarding the continuous-time QW and in Section II. In Section III we present our numerical simulation of the continuous-time QW on and its variants. We discuss the graph symmetries and spectra of the QW Hamiltonian in Section IV. In Section V, we discuss the QW behaviour on chimera graph and its variants. We present our conclusions in Section VI.
II Background
In this section, we give a brief introduction regarding the continuous-time QW and .
II.1 Continuous-time quantum walk
The QW was originally motivated by the widespread use of the classical random walk in the design of randomized algorithms Kendon (2006); Santha (2008). A quantum walker’s evolution on a graph is described by the Schrdinger equation Venegas-Andraca (2012). In the continuous-time QW, a single-particle evolves over a connected graph , for the set of vertices of the graph and the set of edges where each edge e can be expressed by the pair of vertices it connects. The Hamiltonian determining the walker’s evolution corresponds to the adjacency matrix representation of the edges, and the edges can have weights , which are the couplings between pair of vertices.
The bridge from graphs to quantum dynamics is achieved by constructing the orthogonal vertex basis . The continuous-time QW evolution is generated by the adjacency matrix, serving as the Hamiltonian
[TABLE]
with the onsite frequency term, and the transition rates between vertices (edge weights), and and the intracell and intercell edges. Later we allow , and to be time-dependent to study adiabatic evolution Farhi et al. (2000), but initially we consider a time-independent whose rows and columns add to zero (thereby constraining ) in order to generate an evolution operator whose rows and columns sum to one analogous to the properties of a bistochastic matrix Marshall et al. (1979).
For a time-independent , the unitary evolution operator is starting at time (), and the evolving walker wavefunction is . If the walker starts at the vertex then the walker’s state at time is described by
[TABLE]
Unlike the classical random walk Noh and Rieger (2004), the walker in the QW is in a superposition of vertices. The transition amplitude from the vertex to at time is
[TABLE]
and the corresponding transition probability is Mülken and Blumen (2005)
[TABLE]
The long-time average of , which is known as the limiting probability Mülken and Blumen (2011)
[TABLE]
embodies a natural notion of QW convergence and captures the amount of time the walker spends in each subset of the nodes Aharonov et al. (2001).
II.2 Chimera Topology
The chimera graph , is the underlying topology for the D-Wave Two, D-Wave 2X, and D-Wave 2000Q King et al. (2017); Boothby et al. (2016). D-Wave Systems’ grid of unit cells is realized as a rectangular qubit array Boothby et al. (2016), denoted here as . The structure of is shown in Fig. 1, which has unit cells and qubits.
The chimera vertices shown in Fig. 1 are noted as
[TABLE]
for the cartesian coordinates of the unit cells and the vertex label for the cell with for left side and for the right side.
The edge set is
[TABLE]
Intracell edges are given by the complete bipartite graph Diestel (2016) connecting each left vertex to all right vertices and vice versa. Intercell edges are established by connecting each left vertex of a unit cell to the corresponding left vertex in the cells above and below and by connecting each right vertex to the corresponding right vertex in the neighboring unit cells left and right. Edges cross in , so , as well as the variants we consider, are nonplanar graphs.
The connectivity of affects the efficiency of quantum algorithms implemented on D-Wave computers. Motivated by technological thrusts, we study the continuous-time QW on ’s variants. Now we describe and its variants, with each considered under two different boundary-conditions indicated by superscripts: periodic, labelled , which is equivalent to the graph being on the torus, and reflecting, labelled . Our enhanced chimera graph, denoted by , adds vertical intracell connections: the top and bottom vertices are connected for on the left and right side; the top and bottom vertices are each connected to the middle vertex for on the left and right side; and, for , the top left and right are connected to the second-from-top left and right, respectively, and the bottom left and right are connected to the second-from-bottom left and right, respectively. We show in Fig. 1.
We also introduce the diminished chimera graph resulting from randomly deleting 2% of the vertices, which corresponds to the case of real-world quantum annealers with a certain fraction of its vertices not working properly, and 2% is the failure rate for the D-Wave 2000Q King et al. (2017). Open-system effects play an important role in how D-Wave quantum computers works and open-system dynamics can even be beneficial: quantum annealing could exploit a thermal environment to speed up compared with closed-system dynamics Dickson et al. (2013). Despite potential advantages of open-system dynamics, our focus is on the closed-system QW on chimera graph as the closed system is advantageous for unitary quantum computing and the chief advantage of the QW analysis is in discovering graph symmetries and effects of localization.
III Quantum walk on chimera graph and its variants
In this section, we study the continuous-time QW on and its variants with different boundary conditions and initial positions. We compare the continuous-time QW and the random walk on .
First we consider time-independent with in Eq. (1) and constrain by requiring that rows and columns add to zero. If the walker is initialized at a single vertex v in the left side of a cell, we observe that the QW is localized vertically as shown in Fig. 2(a), whereas initialization in the right side of a cell yields a horizontal localization as shown in Fig. 2(b) for the probability distribution
[TABLE]
and the limiting probability distribution
[TABLE]
In contrast, the classical random walk is seen to spread in all directions as shown in Fig. 2(c). The classical random walk probability distribution is for the stochastic walker’s likelihood to be at any vertex Mülken and Blumen (2005). The QW exhibits strong localization whereas the classical walk does not; this localization is evident in other QWs as well Keating et al. (2007); Kollár et al. (2015); Ambainis et al. (2016). The contrast between periodic and boundary conditions is evident when the walker has evolved to reach a boundary and shows different interference effects, shown as limiting probability distributions in Figs. 2(e,f).
The quantum walker on also shows the similar localization behaviour as on , that is, if the walker is initialized at a single vertex v in the left side of a cell, we observe that the QW is localized vertically as shown in Fig. 2(d) for the limiting probability distribution, whereas initialization in the right side of a cell yields a horizontal localization. The walker’s distribution inside unit cells of is divergent compared with on as shown in Figs. 2(d,f), which reflects the difference between the unit cell structures.
Consideration of is driven by the experimental problem where 2% vertices do not work King et al. (2017), Thus, we consider the class of random with uniform deletion of 2% of vertices, i.e., with 2% of vertices deleted. We observe that the effect of broken vertices can be divided into two cases. In the first case, we forbid any broken vertices sharing the same and as the walker, whose initial position is . In this case, broken vertices have little effect on the walker’s dynamics, as seen by comparing Fig. 3(a) to Fig. 2(f).
The only noticeable difference is in the low-probability features appearing as dark lines radiating orthogonal to the walker’s line of confinement and also diagonally in Fig. 2(f). but not in Fig. 3(a). Quantitatively, we calculate the 1-norm distance between these two limiting probability distributions as
[TABLE]
In the second case, we consider at least one broken vertex located with the same or or both. In this second case, the broken vertices have a significant effect on QW behaviour, seen by comparing Fig. 3(b) with Fig. 2(f). the distance between those two limiting probability distribution is
[TABLE]
and the qualitative structure of the curve has been dramatically changed.
IV Symmetry and spectrum analysis
From our simulation, we observe that the quantum walker is strongly localized, which is related to the structure of the graph. To analyze and explain the QW localized behaviour, we now determine the graph symmetries. Those symmetries manifest as self-adjoint operators that commute with , i.e.,
[TABLE]
These symmetry operators provide sufficient eigenvalues to lift the energy degeneracy for eigenstates of and thus label all eigenstates uniquely. In quantum mechanics, this set of operators is also known as a complete set of commuting observables. We construct by determining a sufficient set of symmetries of , arising from a sufficient generating set for a subgroup of ’s automorphism group, and we obtain this sufficient generating set.
A graph automorphism is constructed from a vertex permutation such that an edge exists if and only if is an edge in G. For each automorphism identified by vertex permutation , the corresponding symmetry operator is
[TABLE]
If matrix is not Hermitian, we replace by
[TABLE]
for the adjoint so we discuss operators as being self-adjoint below.
IV.1 Symmetry and spectrum analysis for
In this subsection we study the symmetries of the periodic chimera graph . Figure 1 shows the symmetries of . Specifically, is an intracell left-side (right-side) translation permutation symmetry, is an intracell left-side (right-side) mirror permutation symmetry, is a translation permutation along the () axis, and is a mirror permutation through the () axis. The symmetry operators are
[TABLE]
with matrices obtained from Eq. (13) and satisfying Eq. (12). Each is (not) Hermitian for even (odd) and replaced by for odd . Table 1 shows the detail of for . The first column shows the vertex permutation; the second column shows the vertex coordinate defined in Eq. (6); the third column shows the vertex coordinate after permutation; the fourth column gives the eigenvalues of corresponding to given by Eq. (13).
To analyze and explain the QW localized behaviour, we construct the spectrum and stationary states. Stationary states are eigenvectors, with each uniquely labeled by energy and spectrum
[TABLE]
We parameterize by unit-lattice coordinates
[TABLE]
expressed as a disjoint union of two three-dimensional unit lattices and one two-dimensional lattices. For
[TABLE]
these two three-dimensional lattices are
[TABLE]
and
[TABLE]
is the two-dimensional unit lattice.
Spectral labels are expressed as and . For a valid ,
[TABLE]
and the energy is
[TABLE]
The cardinalities are
[TABLE]
In this subsection, we have obtained the spectrum for the QW Hamiltonian. Also we divided the set of stationary states into three cases for interpretation in §V.
IV.2 Symmetry and spectrum analysis for
In this subsection we study the symmetries of the reflecting chimera graph . Both and have identical intracell symmetries; i.e., for , the vertex permutation symmetries still hold. However, due to reflecting boundary conditions, translation permutation symmetry along the () axis no longer holds in the reflecting case. In order to lift the intercell degeneracy of the QW , we need to construct other operators. Notice that the QW of the one-dimensional finite line has no degeneracy, so we write the matrix representation of directly as
[TABLE]
with the QW for the one-dimensional finite line with vertices.
The elements of are
[TABLE]
and the eigenvalues of are
[TABLE]
Thus, for , the symmetry operators are
[TABLE]
with matrices obtained from Eq. (13).
Stationary states are eigenvectors, with each uniquely labeled by energy and spectrum
[TABLE]
We parameterize by unit-lattice coordinates
[TABLE]
expressed as a disjoint union of two three-dimensional unit lattices
[TABLE]
and one two-dimensional unit lattice
[TABLE]
Spectral labels are expressed as and . For a valid ,
[TABLE]
and the energy is
[TABLE]
The cardinalities are the same as Eq. (27). In this subsection, we have obtained the spectrum of the QW Hamiltonian. Furthermore we divided the set of stationary states into three cases for interpretation in §V.
IV.3 Symmetry and spectrum analysis for
In this subsection we study the symmetries of the enhanced chimera graph . For , intracell translation permutation symmetry does not exist. The following demonstration is with as example.
Figure 4 shows the intracell symmetries of .
is an intracell left-side (right-side) permutation symmetry that permutes intracell vertices and ( and ) and simultaneously permutes intracell vertices and ( and ). is an intracell left-side (right-side) permutation symmetry that permutes intracell vertices and ( and ) and simultaneously permutes intracell vertices and ( and ). Intercell symmetries are the same as for , which are . The symmetry operators are
[TABLE]
with matrices obtained from Eq. (13).
Stationary states are eigenvectors, with each uniquely labeled by energy and spectrum
[TABLE]
We parameterize by unit-lattice coordinates
[TABLE]
expressed as a disjoint union of two four-dimensional unit lattices
[TABLE]
and one two-dimensional unit lattice
[TABLE]
Spectral labels are expressed as and . For a valid ,
[TABLE]
and the energy is
[TABLE]
The cardinalities are the same as Eq. (27). In this subsection, we obtained the spectrum of the QW Hamiltonian. Furthermore we divided the set of stationary states into three cases for interpretation in §V. For other values, one could consider symmetry operators such as
[TABLE]
but we do not study these because the method to lift the degeneracy is similar.
IV.4 Spectrum analysis for
In this subsection we study the spectrum for the diminished chimera graph . Symmetry analysis for is difficult as most symmetry operators fail to commute with the Hamiltonian corresponding to a graph with broken vertices. But we can compare with which we already study above.
First, we consider the case of just one broken vertex as the simplest example of broken vertices in the graph, and we compare the spectrum for for the unbroken reflecting graph vs the reflecting graph with one broken vertex, namely . The two spectra are compared in Fig. 5 with the entire spectrum shown as a zoom-in plot online and as a full-spectrum plot with partial spectrum plot as an inset.
By zooming in, we see that the unbroken reflecting graph has a doubly degenerate eigenvalue , which reduces to nondegeneracy arising from the broken vertex. This nondegeneracy is manifested as one eigenvalue shifting to a slightly lower value and the other eigenvalue moving to the slightly higher . This broken vertex only noticeably changes the degeneracy of this eigenvalue and leaves most other eigenvalue degeneracies intact, thereby showing how only a few stationary states are affected by breaking one vertex.
The reason why a few eigenvalues have shifted can be understood in the context of Anderson localization Anderson (1958), which we can see with the help of Fig. 6.
We consider one of eigenstates in the two-dimensional eigenspace corresponding to the eigenvalue , and this eigenstate is depicted in Fig. 6(a). We observe approximately two cycles at one frequency along the axis and a beat between two frequencies along the axis. Then we isolate, or break, the (1,1,1) vertex and show in Fig. 6(b) the eigenstate for the lower eigenvalue. Figures 6(a,b) look similar but differ markedly at the broken vertex. To elucidate this difference, we plot the arithmetic difference of the two eigenstates in Fig. 6(c), which shows clearly a spike at the (1,1,1) vertex. This spike shows that this peak is missing from the eigenstate for the broken-vertex case.
In Fig. 6(d), we depict the localized state with eigenvalue . This depiction shows the the effect of breaking a vertex, which is to lead to a completely localized eigenstate at (1,1,1). This shifting of an eigenvalue and corresponding revision of eigenstates to transition from no support to total support at the defect (broken vertex) is a manifestation of Anderson localization. Thus, the broken-vertex graph leads to quantum walks experiencing defects and thus Anderson localization.
V Results and discussion
When we lift the degeneracy of the QW , we analyze salient properties of the eigenstates according to the spectra. First we consider eigenstates belonging to the unit lattice , denoted by , where and according to Eq. (19). Through Eqs. (37) and (38), we have and . As and correspond to intracell right-side translation and mirror permutation symmetry, if we consider , we conclude that
[TABLE]
for any v and on the right side of the same unit cell. Notice that corresponds to intracell left-side translation symmetry. If , we must have
[TABLE]
for any v and on the right side of the same unit cell. Through the above analysis, we see that has nonzero component only on the left side of the unit cells as shown in Fig. 7(a). Similarly, has nonzero component only on the right side of the unit cells as shown in Fig. 7(b) and has nonzero component on both side of the cells as shown in Fig. 7(c). Eigenstates are oscillatory in both horizontal and vertical directions and are effective lattice “modes.”
We have a comprehensive description of the quantum-walk “modes” and thereby analyze the walker’s evolution on the graph, shown in Fig. 2(e) for . The mode description helps explain features such as the walker’s localization in Fig. 2. The walker’s state
[TABLE]
is supported by subspaces yielding orthogonal states , respectively. Initialization at v in the left side of a cell yields
[TABLE]
Similarly, the walker starting on the right side of the cell yields
[TABLE]
Thus, a walker starting on the left or on the right has vertex distribution supported by at least ; the remaining distribution is spread over all vertices and thus is a small nonzero “floor” for the distribution over all vertices.
In Fig. 2(e) we see that a walker starting at a vertex in the left side of a cell is not only confined to the left side but also stays in just one column with high probability. This transport is also clear from the two-dimensional Fourier transform in Fig. 8.
Localization is due to the flat momentum spectrum along the axis, and the spectrum is consistent with the momentum distribution for an ordinary QW on a circle Ambainis (2004). The walker is initialized on the left of thus has broadband support over all states drawn from resulting in the observed localization to one column of . This localized walk exhibits some (indiscernible) leakage outside the column due to support over as seen in Fig. 2(e).
The case of the walker localized at a vertex on the right is similar to the case of the walker localized to a cell on the left in that all states parametrized in are localized to the right side of the initial column cell instead of to the left side of the initial column cell. A walker commencing at a vertex on the right side has support over with weight and support over with weight . One contrast between localization on the right vs left is evident by comparing Figs. 2(a,b). If all the inter-cell coupling is increased equally, then the QW only changes by having the walker move more quickly and all the vertical and horizontal localization effects do not change. That only the speed, and not the features, changes is easily understood by recognizing that rescaling the coupling strengths does not change the graph symmetries.
The QW can be understood from spectral and stationary-state properties; now we use this knowledge to examine . The walker’s evolutions on and are similar at the cellular scale, which is evident by comparing the limiting probability distributions for in and in Figs. 2(d,f), respectively. This similarity between reflecting and enhanced graphs is readily understood from Eqs. (40) and (49) where we see that and share the same complete set of commuting observables except that energy differs. In fact, has many triply degenerate eigenvalues, and adding intracell edges to obtain the enhanced graph causes these triple degeneracies to split into single and double degeneracies that are still concentrated in the same cell. Thus, the effect of enhancing by adding intracell edges only spreads the walker within the cell but does not change the QW behaviour on the cellular scale.
Our approach could help with quantum annealer design by making graph symmetries, and consequences on localization and rate of spreading, quite clear and explicit. For example, according to Eqs. (54) and (55), increasing causes the walker to become more localized. Through symmetry analysis we can decide whether to increase or decrease the connections of in order to lift the degeneracy of the QW but without significantly changing the eigenstates of the QW .
Although the eigenstate so far are used to analyze properties of the QW, they can also be prepared. Preparation of these intricate eigenstates can be achieved by adiabatic evolution Farhi et al. (2000) beginning with an easy-to-prepare state and then varying , and in Eq. (1) as time-dependent labels. For distinct the initial Hamiltonian is , and the final Hamiltonian at time is
[TABLE]
for a transcendental number and as an example. Each initial evolves to a different mode adiabatically so each mode can be prepared.
VI Conclusion
We have studied the QW on the chimera graph and its variants, discovered intricate features and showed how a model, or eigenstate, analysis explains the QW behaviour. The features of QW localization are explained by spectral analysis, which builds on completely characterizing the graph symmetries. We show how these symmetry operators can be incorporated into a target Hamiltonian for adiabatically creating modal states from initial states localized at vertices.
Our analysis of the graph via QWs could possibly aid graph design for quantum annealing as the graph is used for designing the D-Wave chip. We caution, though, that our analysis is based on a single-particle QW, and quantum annealing is based on exploiting a many-body ground state Johnson et al. (2011). Our method thus helps to explore the symmetries of the quantum Hamiltonian with a graph structure that is founded on or one of its variants but not to ascertain the many-body ground state or the hardness therein.
Our enhanced shows that the walker spreads significantly only within the cell and not outside, and our diminished shows a high probability for a low-error graph to significantly diminish QW dynamics. Furthermore we have introduced powerful techniques that are useful for studying QWs on other graphs with intrinsic symmetries. Our approach provides a simple and general way to analyze the quantum walk on complicated graphs, which have applications to quantum transport and quantum algorithms, and to designing quantum annealers, which is one of the most significant directions in practical quantum computing. An experimental implementation of a two-dimensional quantum walk on the chimera graph could be envisaged for a Bose-Einstein condensate in an optical lattice Wu et al. (2016) or with photon interference Izaac et al. (2017). Vacuum noise and thermal effects clearly influence the walker’s behaviour and need further investigation. Our focus has been on the closed system as the closed-system analysis is intricate and reveals much about the role of symmetries and localization in quantum-walk behaviour on the chimera and related graphs.
Acknowledgements.
We thank S. K. Goyal for valuable discussions and acknowledge China’s 1000 Talent Plan and NSFC (Grant No. 11675164) for support. NA acknowledges support from CAS PIFI program (Grant No. 2016PT003) and BCS appreciates support from Alberta Innovates.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Boothby et al. (2016) T. Boothby, A. D. King, and A. Roy, Quantum Inf. Process. 15 , 495 (2016) . · doi ↗
- 2Neukart et al. (2017) F. Neukart, G. Compostella, C. Seidel, D. von Dollen, S. Yarkoni, and B. Parney, ar Xiv:1708.01625 (2017).
- 3Rosenberg et al. (2016) G. Rosenberg, P. Haghnegahdar, P. Goddard, P. Carr, K. Wu, and M. L. de Prado, IEEE J. Sel. Top. Signal Process. 10 , 1053 (2016).
- 4Nazareth and Spaans (2015) D. P. Nazareth and J. D. Spaans, Phys. Med. Biol. 60 , 4137 (2015) .
- 5Ushijima-Mwesigwa et al. (2017) H. Ushijima-Mwesigwa, C. F. A. Negre, and S. M. Mniszewski, ar Xiv:1705.03082 (2017).
- 6O’Malley et al. (2017) D. O’Malley, V. V. Vesselinov, B. S. Alexandrov, and L. B. Alexandrov, ar Xiv:1704.01605 (2017).
- 7Potok et al. (2016) T. E. Potok, C. D. Schuman, S. R. Young, R. M. Patton, F. Spedalieri, J. Liu, K.-T. Yao, G. Rose, and G. Chakma, in Proceedings of the Workshop on Machine Learning in High Performance Computing Environments (IEEE Press, Piscataway, 2016) pp. 47–55. · doi ↗
- 8Adachi and Henderson (2015) S. H. Adachi and M. P. Henderson, ar Xiv:1510.06356 (2015).
