Figure 1
From: On the complexity of quantum link prediction in complex networks

QLP Circuit. Example circuit to perform link prediction on a network with up to \(N=8\) nodes. The total number of gates for a network with size N is \(\log _2 N+2\) Hadamard gates and \(\log _2 N\) CNOT gates, plus the cost of implementing U(t), described as \((e^{-iAt})_n\) conditional on \(a=|0\rangle\) and \((e^{+iAt})_n\) conditional on \(a=|1\rangle\).