RIT on Quantum Information Archives for Fall 2024 to Spring 2025
A Mathematical Perspective on Quantum Information Science
When: Thu, October 12, 2023 - 1:00pmWhere: Kirwan Hall 3206
Speaker: Carl A. Miller (University of Maryland / NIST) - https://camiller.iacs.umd.edu
Abstract: Mathematical innovation has been crucial in quantum information science since its inception, and the relationship between the two fields is vital and evolving. While the theory of quantum information depends most directly on linear algebra and probability, other mathematical connections appear in quantum research that are diverse and often surprising. This talk will offer a personal perspective on the interaction between quantum and math. We will discuss an example from the field of quantum cryptography. The talk serves as a kickoff to a series of seminars under UMD's new MathQuantum RTG program ( https://mathquantum.umd.edu ).
Mathematical fundamentals of QIS
When: Thu, October 19, 2023 - 1:00pmWhere: Kirwan Hall 3206
Speaker: Maria Cameron (Mathematics) - https://www.math.umd.edu/~mariakc/
Abstract: TBA
Elements of quantum computing
When: Thu, November 2, 2023 - 1:00pmWhere: Kirwan Hall 3206
Speaker: Konstantina Trivisa (Mathematics and IPST) - https://www.math.umd.edu/~trivisa/
Abstract: TBA
Quantum numerical linear algebra, Part 1
When: Thu, November 16, 2023 - 1:00pmWhere: Kirwan Hall 3206
Speaker: Dong An (QuICS) - https://quics.umd.edu/people/dong
Abstract: TBA
Quantum numerical linear algebra, Part 2
When: Thu, November 30, 2023 - 1:00pmWhere: Kirwan Hall 3206
Speaker: Dong An (QuICS) - https://quics.umd.edu/people/dong
Abstract: TBA
Overview and Logistics
When: Mon, February 5, 2024 - 4:00pmWhere: Kirwan Hall 3206
Speaker: Maria Cameron, Konstantina Trivisa, Carl Miller, Daniel Serrano (UMD College Park) - https://mathquantum.umd.edu/rit
Abstract: First session of the Quantum Information RIT.
We will give an overview of the format for this semester, and plan
logistics for the rest of the term. This will include the option for
participants to start signing up for presentation slots.
The Quantum-Classical Boundary: Decoherence
When: Mon, February 12, 2024 - 4:00pmWhere: Kirwan Hall 3206
Speaker: Alicia Kollár (UMD Physics and JQI) - https://umdphysics.umd.edu/people/faculty/current/item/1165-akollar.html
Abstract: This talk will introduce fundamentals of quantum science that will be useful for better understanding mathematics of quantum information science
On the construction of an efficient quantum algorithm: A Toolbox
When: Mon, February 19, 2024 - 4:00pmWhere: Kirwan Hall 3206
Speaker: Konstantina Trivisa (UMD Mathematics and IPST) - https://www.math.umd.edu/~trivisa/
Abstract: On the construction of an efficient quantum algorithm: A Toolbox
Quantum Engineering 101: A Mathematical Perspective
When: Mon, February 26, 2024 - 4:00pmWhere: Kirwan Hall 3206
Speaker: David Roberts (UMD JQI) - https://hafezi.jqi.umd.edu/people/david-roberts
Abstract: The theory of noise, measurement, and amplification in quantum information processing devices deviates substantially from its counterparts in conventional engineering disciplines. Quantum-mechanical systems exhibit distinctly different behavior compared to their classical counterparts, necessitating a revised theoretical framework. In this talk, I will provide a mathematical viewpoint on the theory of quantum noise. As an illustrative example, I will study a quantum-information-theorist's version of a classical Markov chain and demonstrate how the theory deviates from classical expectations.
Introduction to Unclonable Quantum Cryptography
When: Mon, March 4, 2024 - 4:00pmWhere: Kirwan Hall 3206
Speaker: Yusuf Alnawakhtha (UMD CS/QuICS) - https://quics.umd.edu/people/yusuf-alnawakhtha
Abstract: The goal of this talk is to go over some of the intuition that lies behind quantum cryptography protocols. We will begin by addressing the advantages that quantum cryptography protocols have over classical cryptography as well as the difference between quantum and post-quantum cryptography. We will then highlight one of the advantages that quantum cryptography has, no-cloning, and discuss why it allows us to construct primitives that are impossible in the classical setting (such as position verification and unclonable encryption). A main goal of the talk is to demystify some of the vocabulary and concepts often used in this field, so questions are very much encouraged!
Quantum Cryptography from Computational Assumptions
When: Mon, March 25, 2024 - 4:05pmWhere: Kirwan Hall 3206
Speaker: Manasi Shingane (CS and QuICS) - https://quics.umd.edu/people/manasi-Shingane
Abstract: Cryptographic protocols with computational security are those that obtain security by restricting adversaries to only perform efficient actions. In the quantum setting, computational assumptions have been used to construct secure quantum protocols that utilize only classical communication. In this talk, I will focus on a primitive known as Trapdoor Claw-Free (TCF) Functions. TCFs have been used to construct many quantum protocols that only utilize classical communication. I will discuss their construction and explain how their properties can be used to obtain security against quantum adversaries.
The Quantum ALU: An Exploration of Arithmetic Methods for Quantum Computers
When: Mon, April 1, 2024 - 4:05pmWhere: Kirwan Hall 3206
Speaker: Addison Hanrattie (UMD CS and Math) -
Abstract: At the heart of math, physics, and computing is Arithmetic, a field that has been around throughout all of human history. However, today quantum computers provide a completely new landscape for the field. The requirements of quantum systems means that many of the standard operations one would find on a classical ALU cannot be easily implemented on quantum circuits. In this talk, I will speak on some of the new ways programmers and researchers must think when implementing arithmetic operations on quantum computers. I will also explore how new ideas from Quantum Information Science like the QFT have led to new ways of doing arithmetic.
Group Theory and the Post-Quantum Security of SHA-3
When: Mon, April 8, 2024 - 4:05pmWhere: Kirwan Hall 3206
Speaker: Joseph Carolan (CS and QuICS) - https://quics.umd.edu/people/joseph-carolan
Abstract: In this talk, I will describe a significant open problem in post-quantum cryptography: specifically the quantum security of the sponge construction with invertible permutations (which, among other things, underlies the international hash standard SHA-3). I will motivate the query model in which this problem is usually stated, and give intuition for why it is hard. Then we'll explore some recent progress on this question based on applying the theory of Young subgroups, explained in a beginner-friendly way.
Introduction to Quantum Error Correction via the 5 qubit Code
When: Thu, April 11, 2024 - 4:05pmWhere: Kirwan Hall 3206
Speaker: Eric Kubischta (AMSC and QuICS) - https://quics.umd.edu/people/eric-kubischta
Abstract: In this talk, I will focus on the smallest quantum error-correcting code: the perfect 5 qubit code found by Laflamme et al. I will write down the codewords and the stabilizer generators. I will talk about which errors are correctable and how to identify and correct them via a syndrome lookup table. I will discuss the probability of getting a logical error when using a depolarizing noise channel and the resulting pseudo-threshold. Lastly I will talk about implementing logical gates via naturally fault-tolerant transversal gates.
Circuit QED Lattices: From Synthetic Quantum Systems to Spectral Graph Theory
When: Mon, April 15, 2024 - 4:05pmWhere: Physical Sciences Complex 1136
Speaker: Alicia Kollár (Physics and JQI) - https://umdphysics.umd.edu/people/faculty/current/item/1165-akollar.html
Abstract: After two decades of development, superconducting circuits have emerged as a rich platform for quantum computation and simulation. When combined with superconducting qubits, lattices of coplanar waveguide (CPW) resonators can be used to realize artificial photonic materials or photon-mediated spin models. Here I will highlight the special properties of this hardware implementation that lead to these lattices naturally being described as line graphs. Elucidating this connection required combining theoretical and computational methods from both physics pure mathematics, and has lead not only to a new understanding of the physics of these devices [1,2], but also new results regarding spectral gaps of 3-regular graphs [3], and a framework for studying a new class of topologically-protected quantum error correcting codes [4].
[1] Kollár, Fitzpatrick, Houck, Nature 45, 571 (2019).
[2] Kollár, Fitzpatrick, Sarnak, Houck, Comm. Math. Phys. 376, 1909-1956 (2020).
[3] Kollár, Sarnak, Comm. AMS. 1, 1 (2021)
[4] Chapman, Flammia, Kollár, Quantum 3, 03021 (2022)
Minimizing Resources for Cryptographic Proofs of Quantumness
When: Mon, April 22, 2024 - 4:05pmWhere: Kirwan Hall 3206
Speaker: Carl Miller (UMD and NIST) - https://quics.umd.edu/people/carl-miller
Abstract: How can we reliably test whether a quantum computer has achieved an advantage over existing classical computers? A promising approach is to base these tests ("proofs of quantumness") on cryptographic hardness assumptions. Such assumptions are the foundation for encryption and authentication protocols, and as such they are well-studied. Brakerski et al. (arXiv:1804.00640) introduced an interactive proof quantumness based on a standard lattice-based assumption (learning with errors). What would it take to make cryptographic proofs of quantumness realizable on near-term devices? I will explore this question and exhibit some of the mathematics involved in this topic, with a focus on the paper "Depth-efficient proofs of quantumness" by Z. Liu and A. Gheorghiu (arXiv:2107.02163).
Introduction to Quantum Error Correction Part 2: Geometrically Local Quantum Codes
When: Mon, April 29, 2024 - 4:05pmWhere: Kirwan Hall 3206
Speaker: Xiaozhen Fu (Physics and QuICS) - https://quics.umd.edu/people/xiaozhen-fu
Abstract: The goal of this talk is to give an overview of the advantages and disadvantages of having geometric locality in quantum error-correcting codes. Starting with an introduction to the surface code, I will highlight the nice features of a geometrically local 2D stabilizer code. However, we will also examine the limitations that arise from imposing geometric locality, and how these limitations come about, particularly with regard to the code parameters and the allowable set of logical gates. Finally, we will explore some interesting techniques such as magic state distillation and code-switching that can be used to overcome these limitations.