H. Krovi

Publications
Influence

Hitting time for quantum walks on the hypercube (8 pages)

H. Krovi, T. Brun
Physics
18 October 2005

Hitting times for discrete quantum walks on graphs give an average time before the walk reaches an ending condition. To be analogous to the hitting time for a classical walk, the quantum hitting time… Expand

Quantum Walks Can Find a Marked Element on Any Graph

H. Krovi, F. Magniez, M. Ozols, J. Roland
Mathematics, Physics
Algorithmica
11 February 2010

We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. Expand

Anderson localization makes adiabatic quantum optimization fail

B. Altshuler, H. Krovi, J. Roland
Physics, Computer Science
Proceedings of the National Academy of Sciences
3 December 2009

We show that due to a phenomenon similar to Anderson localization, exponentially small gaps appear close to the end of the adiabatic algorithm for large random instances of NP-complete problems. Expand

Quantum walks with infinite hitting times

H. Krovi, T. Brun
Physics
10 June 2006

Hitting times are the average time it takes a walk to reach a given final vertex from a given starting vertex. The hitting time for a classical random walk on a connected graph will always be finite.… Expand

Hitting time for the continuous quantum walk

M. Varbanov, H. Krovi, T. Brun
Physics, Mathematics
11 March 2008

We define the hitting (or absorbing) time for the case of continuous quantum walks by measuring the walk at random times, according to a Poisson process with measurement rate $\lambda$. From this… Expand

Routing entanglement in the quantum internet

M. Pant, H. Krovi, +5 authors S. Guha
Mathematics, Physics
23 August 2017

We develop protocols for such quantum “repeater” nodes, which enable a pair to achieve large gains in entanglement rates over using a linear chain of quantum repeaters, by exploiting the diversity of multiple paths in the network. Expand

Rate-distance tradeoff and resource costs for all-optical quantum repeaters

M. Pant, H. Krovi, D. Englund, S. Guha
Physics
4 March 2016

We present a resource-performance tradeoff of an all-optical quantum repeater that uses photon sources, linear optics, photon detectors and classical feedforward at each repeater node, but no quantum… Expand

Quantum walks on quotient graphs

H. Krovi, T. Brun
Physics
23 January 2007

A discrete-time quantum walk on a graph {gamma} is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an… Expand

Adiabatic quantum optimization fails for random instances of NP-complete problems

B. Altshuler, H. Krovi, J. Roland
Mathematics, Computer Science
ArXiv
19 August 2009

We show that an exponentially small eigenvalue gap appears in the spectrum of the adiabatic Hamiltonian for large random instances, very close to the end of the algorithm. Expand

Quantum enigma machines and the locking capacity of a quantum channel

S. Guha, P. Hayden, +5 authors M. Wilde
Computer Science, Physics
ArXiv
19 July 2013

The locking effect is a phenomenon which is unique to quantum information theory and represents one of the strongest separations between the classical and quantum theories of information. Expand

Recommended Authors