Seminar

Monday, March 27, 2023 10:00 am - 11:30 am EDT (GMT -04:00)

Error correction in quantum computers and beyond

IQC Special Seminar Aleksander Kubica, Amazon Web Services Center for Quantum Computing

Quantum computers introduce a radically new paradigm of information processing and revolutionize our thinking about the world. However, designing and building quantum computers that operate properly even when some of their components malfunction and cause errors is a heroic endeavor.

Tuesday, March 21, 2023 10:30 am - 11:30 am EDT (GMT -04:00)

IQC Colloquim - Hsin-Yuan (Robert) Huang - California Institute of Technology

Learning in the Quantum Universe

Abstract: I will present recent progress in building a rigorous theory to understand how scientists, machines, and future quantum computers could learn models of our quantum universe. The talk will begin with an experimentally feasible procedure for converting a quantum many-body system into a succinct classical description of the system, its classical shadow. Classical shadows can be applied to efficiently predict many properties of interest, including expectation values of local observables and few-body correlation functions.

I will then build on the classical shadow formalism to answer two fundamental questions at the intersection of machine learning and quantum physics: Can classical machines learn to solve challenging problems in quantum physics? And can quantum machines learn exponentially faster than classical machines?

Bio: Hsin-Yuan (Robert) Huang is a Ph.D. student at Caltech, advised by John Preskill and Thomas Vidick. His research focuses on understanding how the theory of learning can provide new insights into physics, information, and quantum computing. His notable works include classical shadow tomography for learning large-scale quantum systems, provably efficient machine learning algorithms for solving quantum many-body problems, and quantum advantages in learning from experiments.

He has been awarded a Google Ph.D. fellowship, the Quantum Creator Prize, MediaTek research young scholarship, and the Kortschak scholarship.


Follow the link to attend this seminar on Zoom.

Please note: for the passcode, please email Joe Petrik no later than 10 a.m. day of.

Tuesday, March 21, 2023 12:00 pm - 1:00 pm EDT (GMT -04:00)

IQC Student Seminar featuring Aditya Jain

Improved diagnostics and implementation for quantum error correction

Abstract: Fault-tolerant quantum computing will require accurate estimates of the resource overhead, but standard metrics such as gate fidelity and diamond distance have been shown to be poor predictors of logical performance. We present a scalable experimental approach based on Pauli error reconstruction to predict the performance of concatenated codes. Numerical evidence demonstrates that our method significantly outperforms predictions based on standard error metrics for various error models, even with limited data. We illustrate how this method assists in the selection of error correction schemes.
Wednesday, March 22, 2023 2:00 pm - 3:00 pm EDT (GMT -04:00)

Space-Based Quantum Networking at JPL

IQC Special Seminar Featuring Makan Mohageg, NASA's Jet Propulsion Laboratory

JPL has been at the forefront of space-based quantum technologies. Cold Atom Lab is the first orbital experiment exploring the dynamics of Bose-Einstein condensates in micro-gravity. Deep Space Atomic Clock demonstrated that a trapped-Hg+ clock in space provides timing precision and accuracy required for improved spacecraft autonomous navigation.

Thursday, March 16, 2023 3:00 pm - 4:00 pm EDT (GMT -04:00)

Quantum divide and conquer

CS/Math Seminar - Daochen Wang QuICS, UMD

The divide-and-conquer framework, used extensively in classical algorithm design, recursively breaks a problem into smaller subproblems, along with some auxiliary work, to give a recurrence relation for the classical complexity. We describe a quantum divide-and-conquer framework that, in certain cases, yields quantum speedup through an analogous recurrence relation for the quantum query complexity....

Wednesday, March 15, 2023 11:00 am - 12:00 pm EDT (GMT -04:00)

Quantum Matters Seminar Series: Language Models for Quantum Simulation

Roger Melko: Language models for quantum simulation

Abstract: As the frontiers of artificial intelligence advance more rapidly than ever before, generative language models like ChatGPT are poised to unleash vast economic and social transformation. In addition to their remarkable performance on typical language tasks (such as writing undergraduate research papers), language models are being rapidly adopted as powerful ansatze states for quantum many-body systems.  In this talk, I will discuss the use of language models for learning quantum states realized in experimental Rydberg atom arrays. By combining variational optimization with data-driven learning using qubit projective measurements, I will show how language models are poised to become one of the most powerful computational tools in our arsenal for the design and characterization of quantum simulators and computers.

Thursday, March 9, 2023 3:00 pm - 4:00 pm EST (GMT -05:00)

Cryptography from Quantum Pseudorandomness

CS/Math Seminar - Luowen Qian, Boston University in person and on ZOOM

Pseudorandom states (PRS) are efficiently constructible states that are effectively Haar random against efficient observers. Recently, this notion has found its influence in many fields like quantum information, quantum gravity, and quantum complexity. ...

Wednesday, March 8, 2023 12:00 pm - 1:00 pm EST (GMT -05:00)

IQC Student Seminar featuring Ramy Tannous

So you want to build a satellite?

Are you curious about the Quantum Encryption and Science Satellite mission, also known as QEYSSat? Are you wondering "Why put quantum in space"? Or perhaps you are curious to know what it takes to put quantum hardware in space? In this talk, we will discuss why it is advantageous to have quantum in space. We will also explore the various design challenges that need to be considered for space hardware. Finally, we will discuss the history of quantum space activities at the Institute for Quantum Computing, particularly QEYSSat, which is a joint project between the Canadian Space Agency (CSA) and the University of Waterloo.

Yong-Baek Kim: Quantum Spin Liquids and Criticality in Multipolar Materials

Abstract: Multipolar quantum materials possess local moments carrying higher-rank quadrupolar or octupolar moments. These higher-rank multipolar moments arise due to strong spin-orbit coupling and local symmetry of the crystal-electric-field environment. In magnetic insulators, the interaction between multipolar local moments on frustrated lattices may promote novel quantum spin liquids. In heavy fermion systems, the interaction between multipolar local moments and conduction electrons may lead to unusual non-Fermi liquids and quantum criticality. In this talk, we first discuss a novel quantum spin ice state, a three-dimensional quantum spin liquid with emergent gauge field, that may have been realized in Ce2Zr2O7 and Ce2Sn2O7, where Ce3+ ions carry dipolar-octupolar moments. We present a theoretical analysis of possible quantum spin ice states in this system and compare the theoretical results of dynamical spin structure factors with recent neutron scattering experiments. Next, we present a theoretical model to describe the unusual Kondo effect and quantum criticality in Ce3Pd20Si6, where Ce3+ moments carry a plethora of dipolar, quadrupolar, and octupolar moments. We show that two consecutive Kondo-destruction-type phase transitions can occur with the corresponding Fermi surface reconstructions. We compare these results with existing experiments and suggest future ultrasound experiments for the detection of emergent quantum critical behaviors.

Thursday, March 2, 2023 3:00 pm - 4:00 pm EST (GMT -05:00)

Quantum Worst-Case to Average-Case Reductions for All Linear Problems

Math/CS Seminar - Vahid Asadi from IQC

In this talk, we study the problem of designing worst-case to average-case reductions for quantum algorithms. For all linear problems, we provide an explicit and efficient transformation of quantum algorithms that are only correct on a small (even sub-constant) fraction of their inputs into ones that are correct on all inputs. This stands in contrast to the classical setting, where such results are only known for a small number of specific problems or restricted computational models. En route, we obtain a tight Ω(n^2) lower bound on the average-case quantum query complexity of the Matrix-Vector Multiplication problem...