Sarvagya Upadhyay
Title
Cited by
Cited by
Year
Qip= pspace
R Jain, Z Ji, S Upadhyay, J Watrous
Communications of the ACM 53 (12), 102-109, 2010
1532010
Perfect parallel repetition theorem for quantum XOR proof systems
R Cleve, W Slofstra, F Unger, S Upadhyay
Computational Complexity 17 (2), 282-299, 2008
1122008
Two-message quantum interactive proofs are in PSPACE
R Jain, S Upadhyay, J Watrous
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 534-543, 2009
602009
QMA variants with polynomially many provers
S Gharibian, J Sikora, S Upadhyay
arXiv preprint arXiv:1108.0617, 2011
162011
On Modeling Local Search with Special-Purpose Combinatorial Optimization Hardware
X Liu, H Ushijima-Mwesigwa, A Mandal, S Upadhyay, I Safro, A Roy
arXiv preprint arXiv:1911.09810, 2019
12019
Quantum Information and Variants of Interactive Proof Systems
S Upadhyay
University of Waterloo, 2011
12011
Compressed Quadratization of Higher Order Binary Optimization Problems
A Mandal, A Roy, S Upadhyay, H Ushijima-Mwesigwa
arXiv preprint arXiv:2001.00658, 2020
2020
Quantum Computing-Article 30 (27 pages)-QIP= PSPACE
R Jain, Z Ji, S Upadhyay, J Watrous
Journal of the ACM-Association for ComputingMachinery 58 (6), 2011
2011
Review of concurrent zero-knowledge by Alon Rosen Springer-Verlag, 2006
S Upadhyay
ACM SIGACT News 41 (4), 38-42, 2010
2010
The system can't perform the operation now. Try again later.
Articles 1–9