Sarvagya Upadhyay

Education

• 2005 – Present: Graduate Student
  David R. Cheriton School of Computer Science, University of Waterloo, Canada
  Supervisor: Prof. Richard Cleve


• 2001 – 2005: Bachelor of Technology in Computer Science and Engineering
  Institute of Technology, Banaras Hindu University, India
  Supervisor: Prof. Arun Agarwal

Research Interests

• Quantum Information Processing


• Computational Complexity Theory

Courses

• CS-667: Introduction to Quantum Information Processing
  Instructor: Prof. Richard Cleve


• CS-785: Intelligent Computer Interfaces
  Instructor: Prof. Robin Cohen


• CS-860: Advanced Topics in Algorithms and Complexity
  Instructor: Prof. Jonathan Buss


• CS-860: Advanced Topics in Algorithms and Complexity-Quantum Algorithms and Complexity
  Instructor: Prof. Andris Ambainis


• CS-882: Advanced Topics in Bioinformatics: Protein Folding
  Instructor: Prof. Ming Li

Preprints/Publications

• Richard Cleve, William Slofstra, Falk Unger and Sarvagya Upadhyay
  Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems [PS] [PDF]
  In Proceedings of the 22nd IEEE Conference on Computational Complexity (CCC), pages 109-114, 2007.

Talks

• Perfect Parallel Repetition Theorem for Quantum XOR Games, University of Waterloo, Waterloo, Canada, April 02, 2007


• Quantum Finite Automata, Institute of Technology, Banaras Hindu University, Varanasi, India, April 24, 2005


• Quantum Computation, Institute of Technology, Banaras Hindu University, Varanasi, India, September 17, 2004

Random Links