Zobrazeno 1 - 10
of 16
pro vyhledávání: '"J., Abhijith"'
Graphical models are widely used in science to represent joint probability distributions with an underlying conditional dependence structure. The inverse problem of learning a discrete graphical model given i.i.d samples from its joint distribution c
Externí odkaz:
http://arxiv.org/abs/2006.11937
Autor:
J., Abhijith, Patel, Apoorva
Publikováno v:
Quantum Information and Computation 19, 0555-0574 (2019)
The question of whether quantum spatial search in two dimensions can be made optimal has long been an open problem. We report progress towards its resolution by showing that the oracle complexity for target location can be made optimal, by increasing
Externí odkaz:
http://arxiv.org/abs/1810.12600
Autor:
J., Abhijith, Adedoyin, Adetokunbo, Ambrosiano, John, Anisimov, Petr, Casper, William, Chennupati, Gopinath, Coffrin, Carleton, Djidjev, Hristo, Gunter, David, Karra, Satish, Lemons, Nathan, Lin, Shizeng, Malyzhenkov, Alexander, Mascarenas, David, Mniszewski, Susan, Nadiga, Balu, O'Malley, Daniel, Oyen, Diane, Pakin, Scott, Prasad, Lakshman, Roberts, Randy, Romero, Phillip, Santhi, Nandakishore, Sinitsyn, Nikolai, Swart, Pieter J., Wendelberger, James G., Yoon, Boram, Zamora, Richard, Zhu, Wei, Eidenbenz, Stephan, Bärtschi, Andreas, Coles, Patrick J., Vuffray, Marc, Lokhov, Andrey Y.
Publikováno v:
ACM Transactions on Quantum Computing, Volume 3, Issue 4, 18 (2022)
As quantum computers become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classical computer programs for most of their careers. While currently available quantum comp
Externí odkaz:
http://arxiv.org/abs/1804.03719
Autor:
J., Abhijith, Patel, Apoorva
Publikováno v:
Quantum Information and Computation 18, 1295-1331 (2018)
We analyse the eigenvalue and eigenvector structure of the flip-flop quantum walk on regular graphs, explicitly demonstrating how it is quadratically faster than the classical random walk. Then we use it in a controlled spatial search algorithm with
Externí odkaz:
http://arxiv.org/abs/1801.01305
The number of quantum measurements $N$ required for a reasonable kernel estimate is a critical resource, both from complexity considerations and because of the constraints of near-term quantum hardware. A kernel evaluation up to a precision of $\epsi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c14a7ffe3c80ebe2dbbaac8b5684ed8b
Autor:
J Abhijith, Apoorva Patel
Publikováno v:
Quantum Information and Computation. 19:555-574
The question of whether quantum spatial search in two dimensions can be made optimal has long been an open problem. We report progress towards its resolution by showing that the oracle complexity for target location can be made optimal, by increasing
Autor:
Apoorva Patel, J Abhijith
Publikováno v:
Quantum Information and Computation. 18:1295-1331
We analyse the eigenvalue and eigenvector structure of the flip-flop quantum walk on regular graphs, explicitly demonstrating how it is quadratically faster than the classical random walk. Then we use it in a controlled spatial search algorithm with
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783319748078
Present world views the health of a person with great importance. This system uses real time sensor to sense the health condition of a person and uses GPS tracking to find his/her location. Women safety is a grave issue and it is the need of the hour
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f396c64e5311e79612a0242a0e8a8d6
https://doi.org/10.1007/978-3-319-74808-5_41
https://doi.org/10.1007/978-3-319-74808-5_41
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.