Come to a meeting.

Scheduled for Friday, October 9, 2026 · 3-5pm · CDS 701

Harnessing Randomness on a Quantum Computer

Presenter: Maximus MorrisMaximus Morris is a graduate student studying computer science (data-centric computing) with a bachelors in Mathematics and Computer Science. (Boston University)

The goal of this presentation is to delve into the differences between quantum probability, and classical probability. The focus of this presentation will be on how to represent stateless memory such as Markov chains within quantum computing emulations. Start with an introduction of concepts that will be important such as Markov chains, and density matrices, describe similarities and differences. Delve into important quantum findings such as Bells inequality, and detailing how classical results cannot constrain quantum results. Density matrices, and how despite the trace being able to be mapped to probabilities what the difference behind this is versus say a Markov chain matrix. How randomness of classical bits helps play a role in finding faster solutions, and how quantum advantage can utilize randomness, but also much more to get stronger results.

Resources will be posted here after the meeting.

Scheduled for Friday, October 2, 2026 · 3-5pm · CDS 701

Runtime Lower Bounds for Quantum State Transfer with Imperfect Initialization

Presenter: Twesh UpadhyayaTwesh is a physics doctoral student advised by Nicole Yunger Halpern. He was a QuICS Lanczos Graduate Fellow from 2021 to 2023. (University of Maryland)

Quantum state transfer, the primitive of transporting an unknown state from one site of a lattice to another, is a crucial step in many quantum information processing tasks. Recent protocols use the intermediate lattice sites as ancillas to achieve fast state transfer. Understanding state transfer's fundamental limits in the presence of practical imperfections and developing protocols to overcome these imperfections remain pressing open questions. We initiate the study of state transfer's robustness to errors in the initial ancilla state. In the Heisenberg picture, state transfer grows operators supported on the final site such that they no longer commute with all operators on the starting site. We prove that increased robustness necessitates larger Schatten p-norms of the commutators between initial- and final-site operators. This generalizes the previously known cases of infinite p and p=2, which govern complete ancilla-state-dependence and independence; intermediate values of p govern partially ancilla-state-dependent transport. We exhibit saturating protocols establishing the tightness of our bounds. In 1D power-law systems, our commutator bounds combined with existing light cones give exponentially stronger runtime bounds in certain regimes. For thermal ancilla states, we observe a phase transition in state transfer runtimes with temperature. We also introduce new robust state transfer protocols, charting the landscape between complete state-dependence and state-independence.

Scheduled for Friday, September 25, 2026 · 3-5pm · CDS 701

From Quantum Curiosity to Quantum Utility: Roadmap to Real-World Impact

Presenter: Chris WildgooseChris Wildgoose is an IBM Quantum Ambassador and technologist with more than 20 years of experience in artificial intelligence, data, and emerging technologies. His career has included leadership roles at IBM, Hewlett Packard, and Deloitte, as well as founding and growing AI and analytics startups. At IBM, Chris works with organizations applying data and AI while collaborating with IBM Research and the broader quantum ecosystem to advance understanding of quantum computing and quantum-centric supercomputing. He is a member of IBM's Financial Services Quantum Guild, engaging with researchers, technologists, and industry practitioners on emerging quantum applications. Chris holds a bachelor's degree in Physics from St. Olaf College and a master's degree in Physics from Boston University. His work focuses on bridging scientific innovation and practical application across AI and quantum computing. (IBM)

How does a technology evolve from scientific curiosity to practical utility? This session explores IBM's vision for quantum computing, recent advances in quantum hardware and error correction, and the path toward large-scale, fault-tolerant quantum systems. Attendees will gain a practical understanding of the current state of the technology, the challenges that remain, and how quantum computing may transform scientific discovery and industry in the years ahead.

Scheduled for Friday, September 18, 2026 · 3-5pm · CDS 701

VQE for Quantum Chemistry

Presenter: Artem ArefevArtem Arefev is a sophomore undergraduate studying mathematics and physics at Boston University. (Boston University)

Learn about the implementation of the Variational Quantum Eigensolver for processing many-electron molecules. The talk will cover the Hartree-Fock method, second quantization, and the Jordan-Wigner mapping; we will get into the weeds! Some linear algebra and quantum experience is recommended.

Scheduled for Friday, September 11, 2026 · 3-5pm · CDS 701

Quantum Computing Basics Workshop

Presenter: Yebin SongYebin Song is a junior undergraduate studying data science at Boston University. (Boston University)

Learn about single qubit gates, two qubit gates, their mathematical representations, and how they can be applied.

Scheduled for Friday, September 4, 2026 · 3-5pm · CDS 701

The Variational Quantum Eigensolver

Presenter: Adam GodelAdam Godel is a senior undergraduate studying mathematics and computer science at Boston University. The primary goal of his research is to make computers run interesting and complex workloads under heavily constrained computational environments. He currently works on systems for quantum computation as well as secure computation. (Boston University)

Learn about an important quantum algorithm for optimization, which is largely functional even on the very small-scale, noisy quantum computers that exist today. No prior experience in quantum computing is required!