#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1963

2013

- This year (0)
- Last 5 years (1)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay
- computational complexity
- 2007

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â€¦ (More)

- Rahul Jain, Zheng-Feng Ji, Sarvagya Upadhyay, John Watrous
- J. ACM
- 2010

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â€¦ (More)

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. Suchâ€¦ (More)

- Rahul Jain, Sarvagya Upadhyay, John Watrous
- 2009 50th Annual IEEE Symposium on Foundations ofâ€¦
- 2009

We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient parallel algorithm,â€¦ (More)

- Sevag Gharibian, Jamie Sikora, Sarvagya Upadhyay
- Quantum Information & Computation
- 2013

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â€¦ (More)

The last few lectures were devoted to adversary lower bound and its various generalizations. We started with two simple adversary lower bound methods due to Ambainis [2] and then generalized it.â€¦ (More)

- Sarvagya Upadhyay
- SIGACT News
- 2010

For nearly 25 years, zero-knowledge proof systems have been a fascinating area to work in from both complexity-theoretic and cryptographic viewpoint. Roughly speaking, zero-knowledge proofs areâ€¦ (More)

- Rohit Satoskar, Suchi Bhandarkar, Sarvagya Upadhyay, Balaji S. Kulkarni
- Indian journal of medical sciences
- 1963

We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a parallelized form ofâ€¦ (More)

Suppose we have an n-bit string and we want to encode the string in fewer than n bits, so that any arbitrary bit from the n bit string can be retrieved with probability at least p. We call suchâ€¦ (More)

- â€¹
- 1
- â€º