413 citations · 1.3k across the 36 of their papers we have counts for
4 papers · 1 filter
Entanglement can increase asymptotic rates of zero-error classical communication over classical channels
Debbie Leung, Laura Mancinska, William Matthews +2
It is known that the number of different classical messages which can be communicated with a single use of a classical channel with zero probability of decoding error can sometimes…
On the adiabatic condition and the quantum hitting time of Markov chains
Hari Krovi, Maris Ozols, Jérémie Roland
We present an adiabatic quantum algorithm for the abstract problem of searching marked vertices in a graph, or spatial search. Given a random walk (or Markov chain) on a graph…
Characterization of universal two-qubit Hamiltonians
Andrew M. Childs, Debbie Leung, Laura Mančinska +1
Suppose we can apply a given 2-qubit Hamiltonian H to any (ordered) pair of qubits. We say H is n-universal if it can be used to approximate any unitary operation on n qubits. Whil…
Quantum walks can find a marked element on any graph
Hari Krovi, Frédéric Magniez, Maris Ozols +1
We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set consists of a single verte…