Abstract: In this session of the Quantum Information RIT, we will introduce the format and logistics for the rest of the semester, allow participants to get to know each other, and begin speaker signups.
Abstract: A cryptographic proof of quantumness is a hypothetical test that could be used to prove a quantum computational advantage based on hardness assumptions from cryptography. An experimental realization of such a test would be a major milestone in the development of quantum computation. However, error tolerance is a persistent challenge for implementing such tests: we need a test that not only can be passed by an efficient quantum prover, but one that can be passed by a prover that exhibits a certain amount of computational error. In this talk I will present a technique for improving the error-tolerance in a cryptographic proof of quantumness. The technique is based on hiding a Greenberger-Horne-Zeilinger (GHZ) state within a sequence of classical bits. After giving an overview of this new approach, I will discuss one of the central tools used in the security proof: a strengthened uncertainty principle for the discrete Fourier transform.
Reference: C. Miller, "Hidden-State Proofs of Quantumness," https://arxiv.org/abs/2410.06368
Abstract: In 1994, the field of quantum computing had a significant breakthrough when Peter Shor introduced a quantum algorithm that factors integers in (probabilistic) polynomial time. In these talks, I'll explain the mathematical aspects of Shor's algorithm. Part II will follow on 3/5.
Abstract: In 1994, the field of quantum computing had a significant breakthrough when Peter Shor introduced a quantum algorithm that factors integers in (probabilistic) polynomial time. In these talks, I'll explain the mathematical aspects of Shor's algorithm.
Abstract: The goal of this session is to find interesting mathematical content in the papers that were featured in the QIP 2025 conference (https://rsvp.duke.edu/event/qip2025/home) last month. The session will open with a report from Carl Miller about talks that he attended at QIP 2025. Links to some online papers from the conference will be provided, and then attendees will be invited to work together to summarize the math from these papers. We will try to identify avenues for future research.
Abstract: In this session, we will break out into subgroups to work through the mathematics in the paper "Hidden-State Proofs of Quantumness" (https://arxiv.org/abs/2410.06368).
Each group will have at least one person with familiarity in cryptography familiarity to guide the process.
Participants should read the paper before the session, but are not expected to have grasped all of its concepts.
4176 Campus Drive - William E. Kirwan Hall
College Park, MD 20742-4015
P: 301.405.5047 | F: 301.314.0827