Events

Events at Physics

<< Summer 2023 Fall 2023 Spring 2024 >>
Subscribe your calendar or receive email announcements of events

Events on Thursday, September 21st, 2023

NPAC (Nuclear/Particle/Astro/Cosmo) Forum
Neutrino interaction measurements at the short baseline neutrino program
Time: 2:30 pm - 3:30 pm
Place: CH5310 /
Speaker: Prof. Andy Furmanski, University of Minnesota
Abstract: The discovery of neutrino oscillations has led to the development of large accelerator-based neutrino experiments, often spanning hundreds of miles with multi-kiloton detectors. The desire for precision measurements of neutrino oscillations leads to the need for a precise understanding of how neutrinos interact with nuclei - this lack of understanding is currently one of the largest uncertainties in long-baseline neutrino experiments like T2K and NOvA. The short baseline program at Fermilab provides a wealth of data for understanding neutrino-argon interactions, which will be critical for DUNE. Using the power of liquid argon detectors, coupled with innovative measurement techniques, we are able to measure nuclear structure with neutrinos, and enabling future precision measurements of oscillations including the search for CP violation.
Host: Adam Lister
Add this event to your calendar
Wisconsin Quantum Institute Colloquium
Entangled quantum cellular automata, physical complexity, and Goldilocks rules
Time: 3:30 pm - 5:00 pm
Place: Discovery Building, DeLuca Forum
Speaker: Lincoln Carr, Colorado School of Mines
Abstract:

Cellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in the sense of the complexity science that describes biology, sociology, and economics. QCA exhibit complexity when evolving under 'Goldilocks rules' that we define by balancing activity and stasis. Our Goldilocks rules generate robust dynamical features (entangled breathers), network structure and dynamics consistent with complexity, and persistent entropy fluctuations. Present-day experimental platforms—Rydberg arrays, trapped ions, and superconducting qubits—can implement our Goldilocks protocols, making testable the link between complexity science and quantum computation exposed by our QCA. The inability of classical computers to simulate large quantum systems is a hindrance to understanding the physics of QCA, but quantum computers offer an ideal simulation platform. I will discuss our recent experimental realization of QCA on a digital quantum processor, simulating a one-dimensional Goldilocks QCA rule on chains of up to 23 superconducting qubits. Employing low-overhead calibration and error mitigation techniques, we calculate population dynamics and complex network measures indicating the formation of small-world mutual information networks. Unlike random states, these networks decohere at fixed circuit depth independent of system size, the largest of which corresponds to 1,056 two-qubit gates. This quantum circuit depth result presents a strong contrast to the quantum volume concept used to characterize many current quantum computers in industry. Such computations may open the door to the employment of QCA in applications like the simulation of strongly-correlated matter or beyond-classical computational demonstrations.

This event starts at 3:30pm with refreshments, followed at 3:45pm by a short presentation by Linipun Phuttitarn (PhD student Saffman group) titled "Enhanced Measurement of Neutral Atom Qubits with Machine Learning". The invited presentation starts at 4pm.

Host: Mark Saffman
Add this event to your calendar
R. G. Herb Condensed Matter Seminar
Entangled quantum cellular automata, physical complexity, and Goldilocks rules
Time: 3:30 pm
Place: Discovery Building, DeLuca Forum
Speaker: Lincoln Carr, Colorado School of Mines
Abstract: Cellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in the sense of the complexity science that describes biology, sociology, and economics. QCA exhibit complexity when evolving under 'Goldilocks rules' that we define by balancing activity and stasis. Our Goldilocks rules generate robust dynamical features (entangled breathers), network structure and dynamics consistent with complexity, and persistent entropy fluctuations. Present-day experimental platforms—Rydberg arrays, trapped ions, and superconducting qubits—can implement our Goldilocks protocols, making testable the link between complexity science and quantum computation exposed by our QCA. The inability of classical computers to simulate large quantum systems is a hindrance to understanding the physics of QCA, but quantum computers offer an ideal simulation platform. I will discuss our recent experimental realization of QCA on a digital quantum processor, simulating a one-dimensional Goldilocks QCA rule on chains of up to 23 superconducting qubits. Employing low-overhead calibration and error mitigation techniques, we calculate population dynamics and complex network measures indicating the formation of small-world mutual information networks. Unlike random states, these networks decohere at fixed circuit depth independent of system size, the largest of which corresponds to 1,056 two-qubit gates. This quantum circuit depth result presents a strong contrast to the quantum volume concept used to characterize many current quantum computers in industry. Such computations may open the door to the employment of QCA in applications like the simulation of strongly-correlated matter or beyond-classical computational demonstrations.
Host: Mark Saffman
Add this event to your calendar