Sarvagya Upadhyay - Concepedia

Author

Sarvagya Upadhyay

University of Waterloo

Also Known As

Sarvagya Upadhyay, Upadhyay, Sarvagya

Publications

399

Citations

H-Index

Concepts

All Affiliations

University of Waterloo National University of Singapore Perimeter Institute Centre for Quantum Technologies Centrum Wiskunde & Informatica

About

Sarvagya Upadhyay is an author at University of Waterloo specializing in engineering, quantum science, and quantum computing.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	10	10	367
2	Computer Science	9	9	271
3	Computer Engineering	1	1	10
4	Combinatorial Optimization	1	1	10
5	Computer Architecture	1	1	10

Sarvagya Upadhyay

Publications

367

Citations

H-Index

Page 1

	Year	Citations
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems Richard Cleve, William Slofstra, Falk Unger, Computational Complexity Quantum ScienceQuantum LogicEngineeringQuantum ComputingQuantum Algorithm	2008	96
QIP = PSPACE Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, Journal of the ACM Theory Of ComputingQuantum ScienceQuantum ApplicationsExpressive PowerClassical Computing	2011	58
QIP = PSPACE Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, Quantum ScienceComputational Complexity TheoryEngineeringQuantum ComputingQuantum Optimization Algorithm	2010	55
Two-Message Quantum Interactive Proofs Are in PSPACE Rahul Jain, Sarvagya Upadhyay, John Watrous Mathematical ProgrammingQuantum ScienceQuantum CryptographyQuantum SecurityCertain Class	2009	45
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems Richard Cleve, William Slofstra, Falk Unger, Proceedings - IEEE Conference on Computational Complexity/Proceedings Quantum ScienceQuantum SecurityXor Proof SystemsQuantum ComputingXor Games	2007	28
Strong Parallel Repetition Theorem for Quantum XOR Proof Systems Richard Cleve, William Slofstra, Falk Unger, ArXiv.org Quantum ScienceQuantum SecurityXor Proof SystemsQuantum ComputingXor Games	2006	24
QIP = PSPACE Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, Communications of the ACM Quantum ScienceComputational Complexity TheoryEngineeringQuantum ComputingPost-quantum Cryptography	2010	20
QMA variants with polynomially many provers Sevag Gharibian, Jamie Sikora, Sarvagya Upadhyay Quantum Information and Computation Qma VariantsQuantum ScienceQuantum SecurityQuantum VerificationQuantum Computing	2013	16
Two-message quantum interactive proofs are in PSPACE Rahul Jain, Sarvagya Upadhyay, John Watrous ArXiv.org Mathematical ProgrammingEngineeringComputational ComplexityQuantum ComputingPost-quantum Cryptography	2009	15
Leveraging special-purpose hardware for local search heuristics Xiaoyuan Liu, Hayato Ushijima‐Mwesigwa, Avradip Mandal, Computational Optimization and Applications Local SearchEngineeringLocal Search (Optimization)Local Search HeuristicsComputer Engineering	2022	10

Page 1