Archives: F2010-S2011 | F2011-S2012 | F2012-S2013 | F2013-S2014 | F2014-S2015 | F2015-S2016 | F2016-S2017 | F2017-S2018 | F2018-S2019 | F2019-S2020 | F2020-S2021 | F2021-S2022

• Organizational Meeting

  Speaker: Yusuf Alnawakhtha and Carl Miller (University of Maryland) -
  

  When: Thu, September 2, 2021 - 2:00pm
  Where: https://umd.zoom.us/j/92536585107
  

  View Abstract

  View Abstract

  Abstract: The IQC-QuICS Math and Computer Science Seminar is a joint effort between the University of Maryland the University of Waterloo. The seminar consists of speakers from various institutions presenting mathematical or theoretical computer science concepts that are used in the field of quantum information. The goal is for the audience to be able to widen their toolkit for use in their own research endeavours. More information can be found on our webpage: http://iqc-quics-seminar.umiacs.io
  
  This goal of this meeting will be to discuss fall semester plans (focusing on the UMD side of the seminar).
  
• Trapdoor claw-free functions in quantum cryptography

  Speaker: Carl Miller (University of Maryland) - https://camiller.iacs.umd.edu
  

  When: Thu, September 9, 2021 - 2:00pm
  Where: https://umd.zoom.us/j/91375701575
  

  View Abstract

  View Abstract

  Abstract: Trapdoor claw-free functions (TCFs) are central to a recent wave of groundbreaking work in quantum cryptography that was originated by U. Mahadev and other authors. TCFs enable protocols for cryptography that involve quantum computers and classical communication. In this expository talk I will present the definition of a TCF and its variants, and I will discuss quantum applications, including the recent paper "Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication" by T. Hiroka et al. (arXiv:2105.05393).
  
• Google's quantum experiment: a mathematical perspective

  Speaker: Gail Letzter (National Security Agency and University of Maryland) -
  

  When: Thu, November 4, 2021 - 2:00pm
  Where: https://umd.zoom.us/j/93192622019
  

  View Abstract

  View Abstract

  Abstract: In 2019, Google announced that they had achieved quantum supremacy: they performed a task on their newly constructed quantum device that could not be accomplished using classical computers in a reasonable amount of time. In this talk, we present the mathematics and statistics involved in the set-up and analysis of the experiment, sampling from random quantum circuits. We start with the theory of random matrices and explain how to produce a sequence of (pseudo) random unitary matrices using quantum circuits. We then discuss how the Google team compares quantum and classical approaches using cross entropy and the Porter-Thomas distribution. Along the way, we present other problems with potential quantum advantage and some of the latest results related to noisy near-term quantum computers.