Presentations

Home Research Papers Talks Teaching

  • Equivalence of 2D Color Codes to Surface Codes
    2015 JTG Workshop, Bangalore
  • Quantum codes and symplectic matroids
    2014 IEEE International Symposium on Information Theory, Honolulu, USA, Jun 29-Jul 4, 2014.
  • Efficient quantum algorithm for computing the circumference of infrastructures
    Indian Institute of Technology Hyderabad, India, Jul 18, 2012.
  • Quantum codes, symplectic matroids and secret sharing
    Seminar on quantum topology and quantum computation, Department of Mathematics, Ohio State University, USA, May 24, 2011
  • Local Equivalence of Surface Code States
    Theory of Quantum Computation, Communication and Cryptography, University of Leeds, UK, April 13-15 2010.
  • Matroids in quantum computing and quantum cryptography
    Applications of Matroid Theory and Combinatroial Optimization to Coding Theory, Banff International Research Station, Banff, Aug 2-7, 2009.
  • Quantum secret sharing with CSS codes
    Quantum Information Seminar, Department of Physics and Astronomy, University of British Columbia, Vancouver, Apr 29, 2009
  • Sharing classical secrets with CSS codes
    Center for Advanced Studies, University of New Mexico, Nov 6, 2008
  • Asymmetric quantum LDPC codes
    2008 IEEE International Symposium on Information Theory, Toronto, Canada
  • Two approaches to sparse graph quantum codes
    Quantum information and graph theory: Emerging connections, Perimeter Institute for Theoretical Physics, Waterloo, Apr 28--May 2, 2008
  • Duadic codes
    2008 IEEE International Symposium on Information Theory, Seattle, Washington, 2006
  • Generalized quantum Reed-Muller codes
    2005 IEEE International Symposium on Information Theory, Adelaide, Asutralia, 2005
  • Subsystem codes
    Quantum computing seminar, Texas A&M University
  • Quantum leader election Review of Exact quantum algorithms for the leader election problem and Leader election and distributed consensus with quantum resources
    Quantum computing seminar, Texas A&M University
  • An exposition of Hallgren's algorithm for solving Pell's equation
    Quantum computing seminar, Texas A&M University