Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
Share This Author
Anderson localization makes adiabatic quantum optimization fail
- B. Altshuler, H. Krovi, J. Roland
- Physics, Computer ScienceProceedings of the National Academy of Sciences
- 3 December 2009
TLDR
Hitting time for quantum walks on the hypercube (8 pages)
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…
Quantum Walks Can Find a Marked Element on Any Graph
- H. Krovi, F. Magniez, M. Ozols, J. Roland
- MathematicsAlgorithmica
- 11 February 2010
TLDR
Quantum walks with infinite hitting times
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.…
Routing entanglement in the quantum internet
TLDR
Efficient quantum algorithm for dissipative nonlinear differential equations
- Jin-Peng Liu, Herman Oie Kolden, H. Krovi, N. Loureiro, K. Trivisa, Andrew M. Childs
- Mathematics, Computer ScienceProceedings of the National Academy of Sciences
- 6 November 2020
TLDR
Quantum walks on quotient graphs
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…
Hitting time for the continuous quantum walk
- M. Varbanov, H. Krovi, T. Brun
- 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…
Rate-distance tradeoff and resource costs for all-optical quantum repeaters
- M. Pant, H. Krovi, D. Englund, S. Guha
- PhysicsPhysical Review A
- 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…
Adiabatic quantum optimization fails for random instances of NP-complete problems
- B. Altshuler, H. Krovi, J. Roland
- Physics, Computer ScienceArXiv
- 19 August 2009
TLDR
...
...