The ITW 2026 plenary speakers are (in alphabetical order):
- Andrew Cross, IBM Research
- Meir Feder, Tel-Aviv University, Israel
- Anna Gilbert, Yale University, USA
- Daniela Tuninetti, UIC, USA
Andrew Cross (IBM Research)
Modular fault-tolerant architectures for superconducting qubits
Thursday, November 12th (11:30 – 12:30), Arizona Ballroom
Abstract: Error correction is central to building quantum computers that are orders of magnitude more reliable than their components. A fault-tolerant architecture specifies how qubits are connected, how syndromes are extracted and decoded, and how logical operations are performed, all while respecting physical constraints. I will describe a modular fault-tolerant architecture for superconducting qubits based on bivariate bicycle codes, including explicit instruction sets, logical error rates under circuit noise, and compilation strategies. Relative to surface code architectures, this provides roughly an order of magnitude more logical qubits for the same physical resources. Concatenated codes can extend the protection of the bicycle architecture without requiring larger modules or increased engineering complexity. As a step in this direction, I will discuss how to concatenate outer algebraic codes over high-rate inner quantum LDPC codes to construct a qubit-efficient fault-tolerant memory. These approaches have concrete hardware requirements, such as increased connectivity within a module, high-quality routing layers, and long-range couplers linking modules. I will comment on related hardware progress.

Bio: Andrew Cross received the B.Sc. degree from Case Western Reserve University and the Ph.D. degree in Electrical Engineering from the Massachusetts Institute of Technology in 2008. He is a Principal Research Scientist at the IBM T. J. Watson Research Center where he is technical lead for quantum error correction and fault-tolerant architecture. He has previously served as manager of the Theory of Quantum Computing and Information group. He has been recognized by IBM for his contributions to the development of the IBM Q Experience, the open quantum assembly language (QASM), and Qiskit open-source software for quantum computing. He is a Fellow of the American Physical Society (2025). His research interests include quantum computation, error correction, fault tolerance, and control of superconducting qubits.
Meir Feder (Tel-Aviv University, Israel)
Explaining Modern AI and Designing Its Future: An Information-Theoretic Blueprint
Tuesday, November 10th (14:00 – 15:00), Arizona Ballroom
Abstract: Modern AI architectures such as deep neural networks and transformers have vastly more parameters than training samples, yet they generalize. To an information theorist this looks impossible: universal prediction under log-loss yields uniform regret bounds that grow with the size of the model class, and for modern architectures such bounds are vacuous. This talk argues that the paradox dissolves once we exploit an object the theory has always contained: the prior induced by the architecture.
We propose the Bayesian mixture predictor and show that it is optimal, in a precise sense, for nearly every model in the class. Its regret obeys a non-uniform bound governed by a model-specific complexity — the prior mass within a small information distance of the data-generating process. An architecture is thus a prior over predictors, and its quality is captured by its complexity spectrum: broad enough to contain everything, biased enough to make natural signals cheap. Locally this complexity reduces to the Fisher information spectrum, which explains flat minima and effective dimension and shows why stochastic gradient methods approximate the Bayesian mixture at scale.
The framework is illustrated with two examples worked out in closed form: layered linear models, where depth acts as a low-rank prior with a finite optimal depth, and a layered simplex architecture for large alphabets, where depth reshapes the prior to make skewed sources cheap. These examples point to layering — with possible residual connections — as a general mechanism for engineering priors, and to information theory as a blueprint for the architectures to come.
Joint work with Rudiger Urbanke, Yaniv Fogel, Ofer Shayevitz, Itamar Shoshani and Nadav Shemesh.

Bio: Meir Feder received the B.Sc and M.Sc degrees in Electrical Engineering in 1980 and 1984 from Tel-Aviv University and the Sc.D degree in Electrical Engineering and Ocean Engineering in 1987 from the Massachusetts Institute of Technology (MIT) and the Woods Hole Oceanographic Institution (WHOI). After being a Research Associate and a Lecturer in MIT, he joined the School of Electrical Engineering, Tel-Aviv University, where he is now a Chaired Professor and the head of the newly established Tel-Aviv university center for Artificial intelligence and Data science (TAD). He is also a Visiting Professor with the Department of EECS, MIT. Parallel to his academic career, he is closely involved with the high-tech industry. He founded 5 companies, among them are Peach Networks that developed an interactive TV solution (Acq: MSFT) and Amimon that provided the highest quality, robust and no delay wireless high-definition A/V connectivity (Acq:LON.VTC). Recently, with his renewed interest in machine learning and AI, he cofounded Run:ai, a virtualization, orchestration, and acceleration platform for AI infrastructure. He is also an active angel investor and serves on the board/advisory board of several US and Israeli companies. Prof. Feder received several academic and professional awards including the IEEE Information Theory Society best paper award for his work on universal prediction, the “creative thinking” award of the Israeli Defense Forces, and the Research Prize of the Israeli Electronic Industry, awarded by the President of Israel. For the development of Amimon’s chip-set, that uses a unique MIMO implementation of joint source-channel coding for wireless video transmission he received the 2020 Scientific and Engineering Award of the Academy of Motion Picture Arts and Sciences.
Anna Gilbert (Yale University, USA)
Co-PEER: Auditing Mathematics with Proofs of Error
Friday, November 13th (11:30 – 12:30), Arizona Ballroom
Abstract:Mathematics is written and discussed in many forms: generated proofs, exchanges on Math Stack Exchange, and research papers developing new results. Co-PEER brings these settings together to study AI-assisted mathematical criticism. We assemble a collection of 285 objections to mathematical claims and proof steps across these sources, connecting each objection to the original argument, its assumptions, an explicit counterexample, and a formal certificate.
This talk follows the mathematical development of selected examples. A counterexample to an integer square-root program leads to an exact characterization of its failures and a correction proved correct for every natural-number input. Obstructions in graph coloring extend to infinite families of counterexamples. Other examples show why correcting a false sentence can still leave the surrounding proof incomplete, even when its intended conclusion is true.
These investigations distinguish three questions: Is the counterexample valid? Does it address the claim under its original assumptions? What follows for the surrounding argument? Experiments with model instructions and targeted reviews examine how such objections are produced and assessed. Together, the collection and its mathematical developments offer a foundation for AI as a mathematical peer: proposing objections that people can inspect, challenge, and turn into further mathematics.

Bio: Anna Gilbert received an S.B. degree from the University of Chicago and a Ph.D. from Princeton University, both in Mathematics. In 1997, she was a postdoctoral fellow at Yale University and AT&T Labs-Research. From 1998 to 2004, she was a member of technical staff at AT&T Labs-Research in Florham Park, NJ. From 2004 to 2020, she was with the Department of Mathematics (with a secondary appointment in Electrical and Computer Engineering) at the University of Michigan, where she was eventually the Herman H. Goldstine Collegiate Professor. In 2020, she moved to Yale University as the John C. Malone Professor of Mathematics and Professor of Statistics & Data Science. As of 2023, she is the John C. Malone Professor of Statistics & Data Science. She has received many awards, including a Sloan Research Fellowship (2006), an NSF CAREER award (2006), the National Academy of Sciences Award for Initiatives in Research (2008), the Association of Computing Machinery (ACM) Douglas Engelbart Best Paper award (2008), the EURASIP Signal Processing Best Paper award (2010), a National Academy of Sciences Kavli Fellow (2012), and the SIAM Ralph E. Kleinman Prize (2013). Her research interests include analysis, probability, and algorithms. She is especially interested in algorithms with applications to harmonic analysis, signal and image processing, and machine learning.
Daniela Tuninetti (UIC, USA)
When Cramér-Rao Bound Fails: Converse Bounds for Integrated Sensing and Communication
Wednesday, November 11th (11:30 – 12:30), Arizona Ballroom
Abstract:Integrated sensing and communication (ISAC) systems must balance two competing objectives: extracting information about the physical environment and delivering high-rate data to users. Characterizing the fundamental limits of this tradeoff requires converse bounds that remain valid across the range of operating conditions relevant to 6G networks, including low-SNR regimes, propagation blockage, and non-Gaussian or discrete parameter distributions where the classical Bayesian Cramér-Rao Bound (BCRB) is loose, restricted to mean square error (MSE), or altogether inapplicable. This talk presents an overview of the state of the art in ISAC converse bounds and reports on our own progress along two complementary directions. First, we develop a general rate-distortion bound (RDB) for the sensing-communication tradeoff that applies to arbitrary distortion measures and parameter alphabets without regularity conditions, extending converse guarantees beyond MSE-based criteria such as the BCRB to tasks like detection error probability; the RDB recovers the BCRB as a special case under MSE, while remaining informative in severe-fading regimes where the BCRB collapses to zero. Second, we extend the Ziv-Zakai bound to direction-of-arrival estimation in co-located MIMO radar, yielding a converse that remains tight across the full SNR range, from the prior-dominated regime to the classical Cramér-Rao-limited regime, and is therefore directly relevant to ISAC waveform design. Throughout, examples are shown in which each converse bound is compared against the performance of concrete achievable strategies, clarifying when and why the bound is tight and where a gap to achievability remains open.

Bio: Daniela Tuninetti received the Ph.D. degree in electrical engineering from ENST/Télécom ParisTech, Paris, France, in 2002, with research conducted at the Eurecom Institute in Sophia Antipolis, France. She was a postdoctoral research fellow at the Swiss Federal institute of Technologies in Lausanne (EPFL) Switzerland from 2022 to 2024. She joined the University of Illinois Chicago (UIC) in 2005, where she is currently Professor and Head of the Department of Electrical and Computer Engineering. Her research focuses on the fundamental performance limits of wireless interference networks; integrated communication and radar sensing; reconfigurable intelligent surface-aided networks, including near-field regimes; impact of hardware impairments on system performance; and private and secure cache-aided distributed coded computing. She received the Best Paper Award at the European Wireless Conference (2002), the NSF CAREER Award (2007), and was named a University of Illinois Scholar (2015). She served as Editor-in-Chief of the IEEE Information Theory Society Newsletter (2006–2008); Associate Editor for IEEE Communications Letters (2006–2009), IEEE Transactions on Wireless Communications (2011–2014), IEEE Transactions on Information Theory (2014–2017), and IEEE Transactions on Communications (2021–2022). She was a Distinguished Lecturer of the IEEE Information Theory Society (2020–2022). She is a Fellow of IEEE.

