76 citations · 224 across the 4 of their papers we have counts for
7 papers
Quantum searches on highly symmetric graphs
Daniel Reitzner, Mark Hillery, Edgar Feldman +1
We study scattering quantum walks on highly symmetric graphs and use the walks to solve search problems on these graphs. The particle making the walk resides on the edges of the gr…
Modifying quantum walks: A scattering theory approach
Edgar Feldman, Mark Hillery
We show how to construct discrete-time quantum walks on directed, Eulerian graphs. These graphs have tails on which the particle making the walk propagates freely, and this makes i…
Programmable quantum state discriminators with simple programs
Janos A. Bergou, Vladimir Buzek, Edgar Feldman +2
We describe a class of programmable devices that can discriminate between two quantum states. We consider two cases. In the first, both states are unknown. One copy of each of the…
Optimal unambiguous discrimination of two subspaces as a case in mixed state discrimination
Janos A. Bergou, Edgar Feldman, Mark Hillery
We show how to optimally unambiguously discriminate between two subspaces of a Hilbert space. In particular we suppose that we are given a quantum system in either the state ψ_{1},…
Quantum walks on graphs and quantum scattering theory
Edgar Feldman, Mark Hillery
We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making…
Scattering theory and discrete-time quantum walks
Edgar Feldman, Mark Hillery
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are int…