Sarvagya Upadhyay is a Member of Research Staff at Fujitsu Research of America focusing on high performance computing, machine learning, optimization techniques and quantum computing. He holds a PhD from David R. Cheriton School of Computer Science at University of Waterloo and B. Tech. from Indian Institute of Technology, Banaras Hindu University. He also held postdoctoral positions at National University of Singapore and Nanyang Technological University through Centre for Quantum Technologies. Prior to joining FRA, he was a member of Australia and New Zealand Banking Group Limited (Singapore) in capacity of a front office quant.
Sarvagya has been a recipient of Best Paper Award at 42th ACM Symposium on Theory of Computing (STOC 2010) for his paper “QIP = PSPACE” co-authored with Rahul Jain, Zhengfeng Ji, and John Watrous. It was also invited and appeared as a Research Highlights in Communications of the ACM. He has also received prestigious scholarships during his doctoral studies.
- 1. Sevag Gharibian, Jamie Sikora, and Sarvagya Upadhyay. QMA Variants with Polynomially Many Provers. Quantum Information and Computation, 13(1--2): 0135--0157, 2013.
- 2. Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, and John Watrous. QIP} = PSPACE. Journal of the ACM, 58(6): Article 30, 2011. A preliminary version appeared in Proceedings of the 42nd Annual ACM Symposium on Theory of Computing, June 5--8, 2010, pages 573--581, 2010, Cambridge, USA. Also appeared as Research Highlights in Communications of the ACM, 53(12):102—109.
- 3. Rahul Jain, Sarvagya Upadhyay, and John Watrous. Two--Message Quantum Interactive Proofs are in PSPACE}. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, pages 534--543, October 24--27, 2009, Atlanta, USA.
- 4. Richard Cleve, William Slofstra, Falk Unger, and Sarvagya Upadhyay. Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems. Computational Complexity, 17(2): 282--299, 2008 (Special Issue: “Conference on Computational Complexity 2007”). A preliminary version appeared in Proceedings of the 22nd Annual IEEE Conference on Computational Complexity, pages 109--114, June 13--16, 2007, San Diego, USA.