Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Sarvagya Upadhyay"'
Autor:
Sarvagya Upadhyay
Publikováno v:
ACM SIGACT News. 51:6-10
The area of property testing is concerned with designing methods to decide whether an input object possesses a certain property or not. Usually the problem is described as a promise problem: either the input object has the property or the input objec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5cb19cd09e19c3cf9397e4c9e3e1f7e0
https://doi.org/10.1145/3444815.3444818
https://doi.org/10.1145/3444815.3444818
Autor:
Sarvagya Upadhyay
Publikováno v:
ACM SIGACT News. 52:9-11
Over the past two decades, machine learning has seen tremendous development in practice. Technological advancement and increased computational resources have enabled several learning algorithms to become quite useful in practice. Although many famili
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f01e9c3bb7f35621ff5eb677b9149778
https://doi.org/10.1145/3457588.3457591
https://doi.org/10.1145/3457588.3457591
Publikováno v:
DCC
CF
CF
Recent hardware advances in quantum and quantum-inspired annealers promise substantial speedup for solving NP-hard combinatorial optimization problems compared to general-purpose computers. These special-purpose hardware are built for solving hard in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dbfbcd0948de10632f3c25808c37983a
https://doi.org/10.1109/dcc47342.2020.00090
https://doi.org/10.1109/dcc47342.2020.00090
Autor:
Xiaoyuan Liu, Hayato Ushijima-Mwesigwa, Avradip Mandal, Sarvagya Upadhyay, Ilya Safro, Arnab Roy
As we approach the physical limits predicted by Moore's law, a variety of specialized hardware is emerging to tackle specialized tasks in different domains. Within combinatorial optimization, adiabatic quantum computers, CMOS annealers, and optical p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d1fb4ff8609922fad7f6045c2b80da75
Publikováno v:
Journal of the ACM. 58:1-27
This work considers the quantum interactive proof system model of computation, which is the (classical) interactive proof system model’s natural quantum computational analogue. An exact characterization of the expressive power of quantum interactiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68b5f62ccb7997d4f4e85cec12549bd9
https://doi.org/10.1145/2049697.2049704
https://doi.org/10.1145/2049697.2049704
Autor:
Sarvagya Upadhyay
Publikováno v:
ACM SIGACT News. 41:38-42
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a17608c1fa733d17311a12e9ee19839e
https://doi.org/10.1145/1907450.1907521
https://doi.org/10.1145/1907450.1907521
Publikováno v:
Communications of the ACM. 53:102-109
The interactive proof system model of computation has been studied extensively in computational complexity theory and theoretical cryptography for more than 25 years, and has driven the development of interesting new techniques and insights in those
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::881f8b7f4a4fa69ef1663abc7608483d
https://doi.org/10.1145/1859204.1859231
https://doi.org/10.1145/1859204.1859231
Publikováno v:
Computational Complexity, 17(2), 282-299. Birkhauser Verlag Basel
Computational Complexity, 17(2), 282-299
IEEE Conference on Computational Complexity
Computational Complexity, 17(2), 282-299
IEEE Conference on Computational Complexity
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier's verdict is a function of the XOR of the two bits received. We show that, when the provers are allowed to coordinate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::06c320d7d3a096339fd71242052f2b86
https://hdl.handle.net/11245/1.298222
https://hdl.handle.net/11245/1.298222
We study three variants of multi-prover quantum Merlin-Arthur proof systems. We first show that the class of problems that can be efficiently verified using polynomially many quantum proofs, each of logarithmic-size, is exactly MQA (also known as QCM
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::79d64b1cbfbfa8e36021119bb250d669