Speakers on QIP Conference Website

Algorithmic Applications of Regev's Reduction

Mon, 01 Jan 0001 00:00:00 +0000

André Chailloux is a researcher at Inria Paris, working on quantum computing and post-quantum cryptography. His current focus is on quantum algorithms for problems used in post-quantum cryptography, particularly code-based and lattice-based problems.

Originating from the work of Chen, Liu, and Zhandry, a new family of quantum algorithms inspired by Regev’s reduction has been developed for lattice-based problems in post-quantum cryptography. These quantum algorithms are also at the heart of the Decoded Quantum Interferometry framework. In this tutorial, André Chailloux will present this family of quantum algorithms, the state of the art and recent developments, with a focus on applications to code-based problems and optimization problems.

Designs and pseudorandom unitaries

Mon, 01 Jan 0001 00:00:00 +0000

Thomas Schuster’s research lies at the interface of quantum information science and quantum many-body physics. His work focuses on quantum technologies and their potential applications. He is currently a Sherman Fairchild Postdoctoral Scholar at the California Institute of Technology and a Visiting Researcher at Google Quantum AI. He received his Ph.D. in Physics from the University of California, Berkeley, where he worked with Professor Norman Y. Yao.

When can quantum systems look completely random - and what does this reveal about quantum computing and physics? This tutorial examines these questions through the lens of unitary designs and pseudorandom unitaries. Thomas Schuster will survey the surprising behaviors and applications that have made random unitaries a cornerstone of quantum information science, and explore recent discoveries on their complexity and emergence.

Error Mitigation

Mon, 01 Jan 0001 00:00:00 +0000

Dorit Aharonov is a professor of computer science at the Hebrew University of Jerusalem and co-founder and CSO of QEDMA Quantum Computing. She co-proved the quantum fault-tolerance theorem and has made pioneering contributions in quantum algorithms, Hamiltonian complexity, and quantum cryptography. Aharonov is a recipient of the 2006 Krill prize and the 2014 Bruno award, and in 2024 she was elected to the U.S. National Academy of Sciences.

Noise and errors remain the main barrier to practical quantum computation. While recent demonstrations of small-scale fault-tolerant computations validate the long-term promise of error correction, the large qubit overheads and limited qubit counts in current devices delay its practical impact. Error mitigation is an approach to quantum error reduction that trades qubit overhead for additional quantum processing time, enabling larger circuits on today’s hardware. It has thus become the leading strategy toward near term quantum advantage.

Physical Review Referee Tutorial

Mon, 01 Jan 0001 00:00:00 +0000

Bio and talk description for Erin Knutson to be added.

Physical Review Referee Tutorial

Mon, 01 Jan 0001 00:00:00 +0000

Bio and talk description for Mauro Schiulaz to be added.

Plenary 1: Group Order is in QCMA

Mon, 01 Jan 0001 00:00:00 +0000

Bio and talk description for Harumichi Nishimura to be added.

Plenary 2: Multi-qubit Toffoli with Fewer T Gates

Mon, 01 Jan 0001 00:00:00 +0000

Bio and talk description for Robin Kothari to be added.

Plenary 3: f-Divergences & Quantum Hypothesis Testing / Quantum Channel Coding with Few Code Lengths

Mon, 01 Jan 0001 00:00:00 +0000

Bio and talk description for Christoph Hirche to be added.

Plenary 3: f-Divergences & Quantum Hypothesis Testing / Quantum Channel Coding with Few Code Lengths

Mon, 01 Jan 0001 00:00:00 +0000

Bio and talk description for Hao-Chung Cheng to be added.

Quantum Hypothesis Testing

Mon, 01 Jan 0001 00:00:00 +0000

Ludovico Lami is an Assistant Professor at the Scuola Normale Superiore, Pisa, Italy. He received his PhD from UAB (Barcelona, Spain) under the supervision of Andreas Winter. From 2022 to 2024, he was an Assistant Professor at the University of Amsterdam and QuSoft. His research, for which he received an ERC Starting Grant, focuses on quantum Shannon theory and entanglement theory.

Ludovico Lami will take you on a tour of quantum hypothesis testing, from the basic ideas to how quantities like the relative entropy and the Rényi divergences naturally emerge through the quantum Stein’s lemma and the quantum Chernoff bound. In the second part, he will move on to more advanced topics such as composite hypothesis testing. Along the way, the tutorial will highlight how hypothesis testing underpins many central tasks in quantum information. The tutorial assumes only basic familiarity with density matrices and quantum measurements.

Short Plenary 1: Constant Rate Quantum Computer on Line

Mon, 01 Jan 0001 00:00:00 +0000

Bio and talk description for Thiago Bergamaschi to be added.

Short Plenary 2: Additivity Counterexamples

Mon, 01 Jan 0001 00:00:00 +0000

Bio and talk description for Benjamin Lovitz to be added.

Short Plenary 3: Quantum Precomputation & Moore-Nilsson Conjecture

Mon, 01 Jan 0001 00:00:00 +0000

Bio and talk description for Joseph Slote to be added.

Short Plenary 4: Compressed Permutation Oracles

Mon, 01 Jan 0001 00:00:00 +0000

Bio and talk description for Joseph Carolan to be added.

Short Plenary 6: Few Single-Qubit Measurements for State Certification (Best Student Paper)

Mon, 01 Jan 0001 00:00:00 +0000

Bio and talk description for William He to be added.

Short Plenary 7: Code Switching Protocols

Mon, 01 Jan 0001 00:00:00 +0000

Bio and talk description for Louis Golowich to be added.

Short Plenary 7: Code Switching Protocols

Mon, 01 Jan 0001 00:00:00 +0000

Bio and talk description for Shi Jie Samuel Tan to be added.