default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHari Krovi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j2]Hari Krovi
:
Improved quantum algorithms for linear and nonlinear differential equations. Quantum 7: 913 (2023)- 2016
- [j1]Hari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland:
Quantum Walks Can Find a Marked Element on Any Graph. Algorithmica 74(2): 851-907 (2016)
Conference and Workshop Papers
- 2014
- [c5]Hari Krovi, Saikat Guha, Zachary Dutton, Marcus P. da Silva:
Optimal measurements for symmetric quantum states with applications to optical quantum communication. ISIT 2014: 336-340 - 2013
- [c4]Masahiro Takeoka, Hari Krovi, Saikat Guha:
Achieving the Holevo capacity of a pure state classical-quantum channel via unambiguous state discrimination. ISIT 2013: 166-170 - 2010
- [c3]Hari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland:
Finding Is as Easy as Detecting for Quantum Walks. ICALP (1) 2010: 540-551 - [c2]Mark M. Wilde, Hari Krovi, Todd A. Brun:
Convolutional entanglement distillation. ISIT 2010: 2657-2661 - 2008
- [c1]Hari Krovi, Martin Rötteler:
An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups. MMICS 2008: 70-88
Informal and Other Publications
- 2024
- [i10]Hari Krovi:
Quantum algorithms to simulate quadratic classical Hamiltonians and optimal control. CoRR abs/2404.07303 (2024) - 2022
- [i9]Hari Krovi:
Improved quantum algorithms for linear and nonlinear differential equations. CoRR abs/2202.01054 (2022) - [i8]Hari Krovi:
Average-case hardness of estimating probabilities of random quantum circuits with a linear scaling in the error exponent. CoRR abs/2206.05642 (2022) - 2018
- [i7]Hari Krovi:
An efficient high dimensional quantum Schur transform. CoRR abs/1804.00055 (2018) - 2013
- [i6]Saikat Guha, Patrick M. Hayden, Hari Krovi, Seth Lloyd, Cosmo Lupo, Jeffrey H. Shapiro, Masahiro Takeoka, Mark M. Wilde:
Quantum enigma machines and the locking capacity of a quantum channel. CoRR abs/1307.5368 (2013) - 2012
- [i5]Hari Krovi, Alexander Russell:
Quantum Fourier Transforms and the Complexity of Link Invariants for Quantum Doubles of Finite Groups. CoRR abs/1210.1550 (2012) - 2009
- [i4]Boris Altshuler, Hari Krovi, Jérémie Roland:
Adiabatic quantum optimization fails for random instances of NP-complete problems. CoRR abs/0908.2782 (2009) - [i3]Boris Altshuler, Hari Krovi, Jérémie Roland:
Anderson localization casts clouds over adiabatic quantum optimization. CoRR abs/0912.0746 (2009) - 2008
- [i2]Hari Krovi, Martin Rötteler:
An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups. CoRR abs/0810.3695 (2008) - 2007
- [i1]Mark M. Wilde, Hari Krovi, Todd A. Brun:
Convolutional Entanglement Distillation. CoRR abs/0708.3699 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
