most citedLaplacian versus Adjacency Matrix in Quantum Walk Search

58 citations · 108 across the 6 of their papers we have counts for

collaborators

6 papers

quant-ph2016★ 33 cited

Continuous-Time Quantum Search on Balanced Trees

Pascal Philipp, Luís Tarrataca, Stefan Boettcher

We examine the effect of network heterogeneity on the performance of quantum search algorithms. To this end, we study quantum search on a tree for the oracle Hamiltonian formulatio…

quant-ph2015★ 58 cited

Laplacian versus Adjacency Matrix in Quantum Walk Search

Thomas G. Wong, Luís Tarrataca, Nikolay Nahimov

A quantum particle evolving by Schrödinger's equation contains, from the kinetic energy of the particle, a term in its Hamiltonian proportional to Laplace's operator. In discrete s…

quant-ph2015★ 3 cited

Quantum Iterative Deepening with an application to the Halting problem

Luís Tarrataca, Andreas Wichert

Classical models of computation traditionally resort to halting schemes in order to enquire about the state of a computation. In such schemes, a computational process is responsibl…

cs.AI2015★ 2 cited

A Quantum Production Model

Luís Tarrataca, Andreas Wichert

The production system is a theoretical model of computation relevant to the artificial intelligence field allowing for problem solving procedures such as hierarchical tree search.…

cs.DS2015★ 2 cited

Can Quantum Entanglement Detection Schemes Improve Search?

Luís Tarrataca, Andreas Wichert

Quantum computation, in particular Grover's algorithm, has aroused a great deal of interest since it allows for a quadratic speedup to be obtained in search procedures. Classical s…

cs.DS2015★ 10 cited

Tree Search and Quantum Computation

Luís Tarrataca, Andreas Wichert

Traditional tree search algorithms supply a blueprint for modeling problem solving behaviour. A diverse spectrum of problems can be formulated in terms of tree search. Quantum comp…