Searching via walking: How to find a marked subgraph of a graph using quantum walks

Searching via walking: How to find a marked subgraph of a graph using quantum walks

Mark Hillery Department of Physics, Hunter College of the City University of New York, 695 Park Avenue, New York, NY 10021    Daniel Reitzner Research Center for Quantum Information, Slovak Academy of Sciences, Dúbravská cesta 9, 845 11 Bratislava, Slovakia    Vladimír Bužek Research Center for Quantum Information, Slovak Academy of Sciences, Dúbravská cesta 9, 845 11 Bratislava, Slovakia
Abstract

We show how a quantum walk can be used to find a marked edge or a marked complete subgraph of a complete graph. We employ a version of a quantum walk, the scattering walk, which lends itself to experimental implementation. The edges are marked by adding elements to them that impart a specific phase shift to the particle as it enters or leaves the edge. If the complete graph has vertices and the subgraph has vertices, the particle becomes localized on the subgraph in steps. This leads to a quantum search that is quadratically faster than a corresponding classical search. We show how to implement the quantum walk using a quantum circuit and a quantum oracle, which allows us to specify the resource needed for a quantitative comparison of the efficiency of classical and quantum searches — the number of oracle calls.

pacs:
03.67.-a, 03.67.Ac, 05.40.Fb, 42.50.Ex

A quantum walk is a quantum version of a classical random walk. A classical random walk is described in terms of probabilities; a particle “sitting” (localized) on a vertex of a graph has certain probabilities to leave that vertex along different edges. A quantum walk is described in terms of probability amplitudes, and that means that there are interference effects in quantum walks, which are completely absent in classical random walks. The time evolution in these walks can either be in discrete steps AhDaZa93 (); AhAmKeVa01 () or continuous FaGu98b (). Both types of quantum walks have proven to be fruitful sources of quantum algorithms ambainis07 (); ChEi05 (); ChClDeFaGuSp03 (); FaGoGu07 (). A summary of both the properties of quantum walks and their algorithmic applications can be found in a review kendon07 ().

Recently, quantum walks have entered the realm of experiment. Theoretical predictions for the quantum walk on a line have been confirmed in various physical systems — with an ion in a linear trap performing three “quantum” steps in Ref. ScMaScGlEnHuSc09 (), with neutral atoms in an optical lattice in Ref. KaFoChStAlMeWi09 () or with photons in waveguide lattices with negligible decoherence in Ref. PeLaPoSoMoSi08 (). Interesting realizations are also those exploiting the fact, that the most important ingredient in quantum walks is the interference. To this end the wave nature of classical light was exploited in Refs. KnRoSi03 (); JePaKi04 () to propose an analog of a quantum walk, and this analog had been experimentally realized in Ref. BoMaKaScWo99 () though for other purposes. The use of interferometers to realize quantum walks has also been proposed JePaKi04 () and also recently accomplished ScCaPo09 ().

Quantum walks on a line have abundance of interesting properties (see e.g. kendon07 ()), but quantum walks, when considered on more complex graphs provide us with deeper understanding of quantum dynamics and provide us with new insights and hints how to construct new quantum algorithms. In particular, quantum walks have been used to investigate searches on a number of different graphs. In these searches, one of the vertices is distinguished, and the objective is to find that specific (marked) vertex. The graphs considered so far have been grids and hypercubes of different dimensions and the complete graph ShKeWh03 (); AmKeRi05 (); ChGo04 (). However, up to now, there has been no experimental realization of a search by means of a quantum walk. One way to achieve this goal may be the adoption of the scattering quantum walk formalism introduced in Ref. HiBeFe03 () which is based on an interferometric analogy of a scattering process. For this type of a walk, multiport devices are needed. Optically these can be constructed from simpler devices, such as beam splitters, and there is work ongoing to construct multiports for atoms CoHaDu09 ().

Suppose, that instead of finding a distinguished (marked) vertex, one is interested in finding a distinguished edge or even a distinguished subgraph. The case of an edge can be viewed as finding two elements in a list that have a particular relation. More specifically, let us suppose that and are elements of a set, , and that is a classical boolean oracle function on , such that

(1)

where . This function then gives us the answer to the question of whether the two elements, and , satisfy the relation. Hence, we are interested in finding pairs such that . There might be a single such pair, which would correspond to finding a single edge, or there might be several.

We shall pursue this study by using the formalism of scattering quantum walks (HiBeFe03 ()) in which the particle resides on the edges of a graph rather than on its vertices. In Ref. ReHiFeBu09 () we used this formalism to study searches on graphs with high symmetry, including complete graphs and various versions of multipartite graphs.

Having a graph on which the walk is defined, with being the set of vertices and the set of edges, the Hilbert space is defined as

This definition implies, that the Hilbert space is given by the span of all edge states, i.e. position states interpreted as a particle going from vertex to vertex , with being an edge of the graph . These edge states form an orthonormal basis of the Hilbert space, which we shall call the canonical basis.

In this Hilbert space the unitary evolution is given by a set of local unitary evolutions defined for each vertex. If we specify (for every ) , the set of all edge states originating on vertex , and , the set of all edge states ending on vertex , then local unitary evolutions act as . The overall unitary step operator, , acting on the system is represented by the combined action of the local unitary evolutions, that is, the restriction of to is just . Given the initial state of the system is , the state after steps is and the probability of finding the particle (walker) in state is then .

Let us consider a walk on a complete graph with vertices given by the set containing elements. The initial state is taken to be the equal superposition of all the edge states

(2)

This choice of initial state is motivated by the fact that we have no a priori knowledge about which edges are marked. The local unitary evolution associated with vertices that are not attached to any of the marked edges is given by

(3)

where and are reflection and transmission coefficients whose values are

This choice of local unitary operators for the scattering walk is analogous to the choice of the Grover coin, see Ref. MaBaStSa02 (), in a coined quantum walk.

The target edges are marked by placing “phase shifters” on both ends. These have the effect of modifying the local unitary operations associated with the vertices to which the edge is attached. A particle entering or leaving the edge picks up a phase factor of , and one that is reflected back into the edge picks up a factor of . In more detail, if the edge between vertices and is the only marked edge in the graph, we will have

Figure 1: An example of a complete graph with vertices out of which are special (white ones). The edge between two such vertices is considered to be special and it performs a phase shift for particle either entering or leaving it (grey bars).

Let us now consider a specific type of relation,, between vertices (see Eq. [1)]. We specify a subset of vertices, and two vertices satisfy if they are both in the specified subset. These vertices, and the edges connecting them, will form a complete subgraph. Consequently, we consider the problem of a scattering quantum walk on a complete graph with a marked complete subgraph (see Fig. 1). In particular, let the set of vertices of the complete graph be , and the set of vertices connected by marked edges and forming a complete subgraph be . A quantum walk on this graph starting from the initial state given in Eq. (2) will take place in a small subspace of the overall Hilbert space of the walk. This phenomenon, the reduction of the effective dimension due to the symmetry of the graph, has been analyzed in detail for coined walks by Krovi and Brun KrBr07 () and for the scattering walk in Ref. ReHiFeBu09 (). We begin by defining four vectors:

These vectors form a basis of a subspace of the Hilbert space , which we shall denote by , which is invariant under the action of the unitary operator that advances the walk one step. The action of on the basis vectors of is given by

For the evolution to remain entirely within the initial state must be in this subspace as well. Our initial state [see Eq. (2)] can be expressed as

and is, therefore in . Consequently, in order to determine how this particular walk evolves, we need to only consider a four-dimenional problem. One simply finds the eigenvalues, and eigenstates , where , of restricted to , and finds the state after steps by exploiting expansion

We now need to specify the value of . For localizing the particle on the marked edges, we employ phase-shift . In the case the expression for the vector after steps reads

where the first entry is the component, the second is the component, and so on. In this expression,

and the terms that have been neglected are or smaller. We see that after steps, the particle is in the state , which means it is localized on the marked edges. After running the walk the proper number of steps to localize the particle on the marked edges, we complete the search by measuring the position of the walker to see on which edge it is located.

If we are searching for a single edge, i.e. , then the quantum search represents a quadratic speedup over what is possible classically. Classically we would just check each edge to see whether it is marked or not, and we would have to check edges in order to find the marked one (this will be made more precise shortly). This quantum advantage remains for small subgraphs. For example, if the subgraph is a triangle, our probability of finding all three vertices after running the quantum search twice is and the probability of finding all three vertices after no more than three runs of the search is . The expectation value of the number of searches necessary to find all three vertices is . Things become more complicated if the subgraph is a complete graph on four vertices, because there are more alternatives. After two runs of the search, the probability that we have found all four vertices is and the probability that we have found three out of four of them is . If we go to three runs, the probability of finding all four vertices becomes and the probability of finding three out of four becomes . Therefore, for small subgraphs, a small number of runs of the walk will allow us to find all vertices of the subgraph with high probability.

To provide a different perspective on the proposed evolution unitary , we rephrase the quantum walk in terms of a quantum circuit in which the procedure of checking an edge to see whether it is marked is a call to a quantum oracle, corresponding to the classical oracle given by Eq. (1). The quantum oracle can be interpreted as a unitary operation acting on a tripartite system as

(4)

for , where the first two subsystems are both dimensional, the last one is from a four-dimensional Hilbert space and is the addition modulo four. In this formulation, it becomes clearer what resources are being compared in the quantum and classical cases — the particular resource we are focussing on is the number of oracle calls. To find one pair marked by the oracle from Eq. (4), we would classically (when we are not allowed to use the interference) need to query the oracle times. In the quantum case, however, we have seen that only queries are needed to find the pair with high probability, because that is the number of steps a quantum walk would need to localize the particle on the marked edge, and, as we shall see, the oracle is called only twice per step.

Figure 2: A quantum circuit (network) that implements a single step of scattering quantum walk search, which makes use of the quantum oracle . The first input corresponds to a quantum walker originally prepared in the state . The second and third inputs represent the end vertices of the walker’s edge state, while the fourth input represents an ancillary processing subsystem prepared in the state given by Eq. (5).

The oracle is incorporated into the scattering quantum walk as shown in Fig. 2, where in addition to the walking Hilbert space we make use of the three ancillary systems that the quantum oracle acts upon. To obtain the information about the actual vertices we use a unitary gate , whose action can be expressed as the action of two controlled operations similar to those given in Ref. ReHiFeBu09 (). On the state , acts as

It is useful to prepare the last subsystem in a special state

(5)

The usefulness can be seen from equality

So we see, that the composed operation changes the state to the state . In this way the ancillary systems assist the evolution, but the ancillary systems do not themselves change, making it unnecessary to express them every time. This means, that this view is isomorphic to the one where we did not make use of the quantum oracle. As each step of the walk involves only two oracle calls, and with the number of oracle calls being a measure of the complexity of the problem, we conclude that fewer oracle calls are needed in the quantum case than in the classical for .

In Ref. ReHiFeBu09 () we considered scattering-quantum-walk searches on several examples of highly symmetric (complete, bipartite, and -partite) graphs where some of the vertices were special. In particular, the special vertices simply reflected the particle with a phase factor of . As is the case here, the symmetry of these graphs led to a significant reduction in the dimensionality of the problem. For all of the types of graphs we considered, we found a quadratic speedup over the classical search when the phase-shift of special vertices was taken to be . We see from our analysis here that if one wants to find an edge, a different phase shift is required.

In conclusion, we introduced a novel application of quantum walks. Specifically, quantum walks are used to find a marked edge, or a marked subgraph, in a complete graph. We proved that the quantum walk can perform the search (quadratically) faster than it is possible classically. One of the attractive features of our model is that it might be straightforwardly realized in simple scattering experiments.

Acknowledgements

Our work has been supported by projects QAP 2004-IST-FETPI-15848, HIP FP7-ICT-2007-C-221889, APVV QIAM, CE SAV QUTE and by the National Science Foundation under grant number PHY-0903660.

References

  • (1) Y. Aharonov, L. Davidovich, and N. Zagury, Phys. Rev. A 48(2), 1687 (1993).
  • (2) D. Aharonov, A. Ambainis, J. Kempe, and U. Vazirani, In Proc. of the 33rd ACM STOC, 50–59 (2001).
  • (3) E. Farhi, and S. Gutmann, Phys. Rev. A 58(2), 915 (1998).
  • (4) A. Ambainis, SIAM J. on Comp. 37(1), 210 (2007).
  • (5) A. Childs, and J. Eisenberg, Quantum Information and Computation 5(7), 593 (2005).
  • (6) A. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. Spielman, In Proc. of the 35th ACM STOC, 59–68 (2003).
  • (7) E. Farhi, J. Goldstone, and S. Gutmann, Preprint arXiv:quant-ph/0702144, (2007).
  • (8) V. Kendon, Math. Struct. in Comp. Sci. 17(06), 1169 (2007).
  • (9) H. Schmitz, R. Matjeschk, C. Schneider, J. Glueckert, M. Enderlein, T. Huber, and T. Schaetz, Phys. Rev. Lett. 103(9), 090504 (2009).
  • (10) M. Karski, L. Forster, J.-M. Choi, A. Steffen, W. Alt, D. Meschede, and A. Widera, Science 325(5937), 174–177 (2009).
  • (11) H.B. Perets, Y. Lahini, F. Pozzi, M. Sorel, R. Morandotti, and Y. Silberberg, Phys. Rev. Lett. 100(17), 170506 (2008).
  • (12) P.L. Knight, E. Roldán, J.E. and Sipe, Phys. Rev. A 68(2), 020301(R) (2003).
  • (13) D. Bouwmeester, I. Marzoli, G.P. Karman, W. Schleich, and J.P. Woerdman, Phys. Rev. A 61(1), 013410 (1999).
  • (14) H. Jeong, M. Paternostro, and M.S. Kim, Phys. Rev. A 69(1), 012310 (2004).
  • (15) A. Schreiber, K. N. Cassemiro, V. Potoček, A. Gabris, P. Mosley, E. Andersson, I. Jex, and Ch. Silberhorn, quant-ph/0910.2197.
  • (16) N. Shenvi, J. Kempe, and Birgitta K. Whaley, Phys. Rev. A 67(5), 052307 (2003).
  • (17) A. Ambainis, J. Kempe, and A. Rivosh, In Proc. of the 16th ACM-SIAM SODA, 1099–1108 (2005).
  • (18) A.M. Childs, and J. Goldstone, Phys. Rev. A 70(2), 022314 (2004).
  • (19) M. Hillery, J. Bergou, and E. Feldman, Phys. Rev. A 68(3), 032314 (2003).
  • (20) J. Cooper, D. Hallwood, and J. Dunningham, Journal of Physics B 42(10), 105301 (2009).
  • (21) D. Reitzner, M. Hillery, E. Feldman, and V. Bužek, Physical Review A 79(1), 012323 (2009).
  • (22) T. Mackay, S. Bartlett, L. Stephenson, and B. Sanders, Journal of Physics A 35(12), 2745 (2002).
  • (23) H. Krovi, and T.A. Brun, Physical Review A 75, 062332 (2007).
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
""
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
   
Add comment
Cancel
Loading ...
354817
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description