Content deleted Content added
m link adjacency matrix using Find link |
|||
Line 83:
==== Adjacency matrix model ====
When considering quantum computation of the solution to directed directed graph problems, there are two important query models to understand. First, there is the [[adjacency matrix]] model, where the graph of the solution is given by the adjacency matrix: <math>M \in \{0,1\}a^{n\Chi n} </math>, with <math>M_{ij}=1 </math>, if and only if <math>(v_{i},v_{j})\in E </math>.<ref name=":0">{{Cite journal|last1=Durr|first1=Christoph|last2=Heiligman|first2=Mark|last3=Hoyer|first3=Peter|last4=Mhalla|first4=Mehdi|date=January 2006|title=Quantum query complexity of some graph problems|journal=SIAM Journal on Computing|volume=35|issue=6|pages=1310–1328|doi=10.1137/050644719|arxiv=quant-ph/0401091|s2cid=27736397|issn=0097-5397}}</ref>
==== Adjacency array model ====
| |||