Program

Schedule at a Glance

A PDF version of the complete program is available here: view the complete program (PDF).

Invited Speakers

• Ludovico Lami (click for more details)

  Affiliation: Scuola Normale Superiore

  Title: On some extensions of the generalised quantum Stein’s lemma

  Abstract

  The recent proofs of the generalised Stein’s lemma have introduced new techniques in quantum hypothesis testing, naturally raising the question of which further extensions these methods make possible. In this talk, I will review some of these developments, focusing in particular on the composite i.i.d. extension established in [Lami/Regula/Takagi, arXiv:2605.15174]. This result shows that, in quantum resource testing with a composite i.i.d. null hypothesis, the resulting Stein exponent is equal to the minimum of the corresponding individual Stein exponents. As a consequence, quantum resources can be transformed via asymptotically resource non-generating operations not only reversibly, but also universally: that is, through protocols that are agnostic to the input state.

  Biography

  Ludovico Lami graduated in physics from Scuola Normale Superiore in Pisa, Italy, in 2015, and earned his PhD from the Autonomous University of Barcelona, Spain, in 2017, under the supervision of Andreas Winter. He was an Alexander von Humboldt Research Fellow at the University of Ulm, Germany, from 2020 to 2022, and an Assistant Professor at the University of Amsterdam and QuSoft from 2022 to 2024. He is currently an Assistant Professor at Scuola Normale Superiore. In 2024, he was awarded an ERC Starting Grant. His research interests include quantum information, entanglement theory, quantum Shannon theory, and foundational aspects of quantum physics.
• Benjamin Lovitz (click for more details)

  Affiliation: Concordia University

  Title: Constructive counterexamples to the additivity of minimum output Rényi entropy of quantum channels for all p > 1

  Abstract

  The classical capacity of a quantum channel is defined as the asymptotic number of bits per channel use that can be sent over that channel. By a theorem of Holevo, Schumacher and Westmoreland, the classical capacity is equal to the regularized Holevo capacity of the channel. It is known that the regularization is necessary, i.e. there exist channels for which the classical capacity is not equal to the one-shot Holevo capacity. This is due to a randomized construction given in [Hastings 09]. It is an open question to derandomize Hastings’ construction. For this, it would suffice to find an explicit channel for which the minimum output entropy is strictly subadditive under the tensor product [Shor 04]. We make progress towards this goal by presenting explicit channels with strictly sub-additive minimum output Rényi entropy for all p > 1, improving upon prior constructions which handled p > 2. Our example is provided by explicit constructions of linear subspaces with high geometric measure of entanglement. This construction applies in both the bipartite and multipartite settings. As further applications, we use our construction to find entanglement witnesses with many highly negative eigenvalues, and to construct entangled mixed states that remain entangled after perturbation. This talk is based on joint work with Harm Derksen (arXiv:2510.07547).

  Biography

  Ben Lovitz is an assistant professor in the Department of Computer Science and Software Engineering at Concordia University. He completed his PhD at the University of Waterloo under the supervision of William Slofstra and John Watrous, and was a postdoctoral fellow with Harm Derksen at Northeastern University. His research lies at the intersection of quantum information theory, tensor decompositions, and optimization. He is generously supported by an NSERC Discovery Grant.
• Alexander Holevo (click for more details)

  Affiliation: Steklov Mathematical Institute

  Title: Convex closure of the output entropy and sharp entropy inequalities

  Delivery: Online

  Abstract

  A number of optimization problems in quantum information theory — (one-shot) constrained classical capacity of a quantum channel; entanglement of formation of a composite state; classical capacity of a quantum observable; accessible information of an ensemble of quantum states — can be formulated as calculation of the convex closure of the output entropy of certain quantum channel. This is a convex programming problem for which the dual problem along with the necessary and sufficient optimality conditions can be established. These optimality conditions imply new sharp lower bounds for Shannon entropy which are related to generalizations of the famous log-Sobolev inequality.

  Biography

  Alexander S. Holevo graduated from the Moscow Institute of Physics and Technology in 1966. Since 1969 he works in the Steklov Mathematical Institute, Moscow. Corresponding member of Russian Academy of Sciences — 2016, Full member — 2019. Scientific interests: mathematical theory of quantum communication channels; coding theorems of quantum information theory; noncommutative statistical decision theory; the structure of quantum Markov processes and semigroups. List of publications contains nearly 250 titles including the monographs: "Probabilistic and statistical aspects of quantum theory", "Statistical structure of quantum theory", "Quantum systems, channels, information". Awards: A.A. Markov Prize for the works on the noncommutative probability theory — 1997; International Quantum Communication Award — 1996; A. von Humboldt Research Award — 1999; Claude E. Shannon Award 2016; Sber Science Award — 2022. Invited speaker at the International Congresses of Mathematicians — Berkeley (1986), Madrid (2006), and many other international and national conferences.
• Salman Beigi (click for more details)

  Affiliation: Institute for Research in Fundamental Sciences, Tehran

  Title: Fermions are fundamentally more nonlocal than Bosons

  Delivery: Online

  Abstract

  Bell’s theorem shows that entangled quantum particles can exhibit correlations that classical particles cannot reproduce without an additional nonlocal resource, such as communication. In this sense, quantum particles are fundamentally more nonlocal than classical ones, and entanglement becomes unavoidable in physics. In this talk an analogous result within quantum theory itself is presented: indistinguishable fermions transmitted through a quantum network can generate correlations that distinguishable particles or indistinguishable bosons cannot reproduce without additional communication. In the same sense, fermions are fundamentally more nonlocal than bosons or distinguishable particles, motivating fermionic anticommutation and indistinguishability as unavoidable operational resources. This result further implies that fermions can strictly surpass all qubit-based protocols for certain distributed computing tasks, demonstrating that a complete understanding of information processing requires going beyond qubits to fermionic information carriers—febits.

  Biography

  Salman Beigi received the Ph.D. degree in applied mathematics from Massachusetts Institute of Technology in 2009. He is currently a Full Professor with the School of Mathematics, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran. His research interests include quantum information theory, particularly quantum Shannon theory, quantum algorithms, and foundations of quantum physics.
• Amin Aminzadeh Gohari (click for more details)

  Affiliation: The Chinese University of Hong Kong

  Title: The Auxiliary Receiver Approach in Network Information Theory

  Abstract

  In this talk, I will discuss recent advancements in the auxiliary receiver approach. This approach serves as a mathematical tool for deriving outer bounds in network information theory. It has proven to be highly effective, providing state-of-the-art outer bounds for a variety of settings in network information theory, including relay channels, interference channels, broadcast channels, key agreement, distributed hypothesis testing, and more.

  Biography

  Amin Gohari received his B.Sc. degree from Sharif University, Iran, in 2004 and his Ph.D. degree in electrical engineering from the University of California, Berkeley in 2010. Dr. Gohari received the 2010 Eli Jury Award from UC Berkeley's Department of Electrical Engineering and Computer Sciences for “outstanding achievement in the area of communication networks,” and the 2009-2010 Bernard Friedman Memorial Prize in Applied Mathematics from UC Berkeley's Department of Mathematics for “demonstrated ability to do research in applied mathematics.” He also received the Gold Medal from the 41st International Mathematical Olympiad (IMO 2000) and the First Prize from the 9th International Mathematical Competition for University Students (IMC 2002). He received the IEEE Iran Section Young Researcher Award in 2021. Dr. Gohari served as an Associate Editor for the IEEE Transactions on Information Theory from 2018-2021. He was also a finalist for the IEEE Jack Keil Wolf ISIT Student Paper Award for three consecutive years from 2008-2010 during his PhD.

Program

Talks Not Presented

• Discriminating idempotent quantum channels (this work will not be presented)
• Uncloneable encryption from decoupling (this work will not be presented)

Confirmed Poster Presentations

• Matthew Simon Tan: Tight contraction rates for primitive quantum channels
• Xia Liu: Dynamic local operations and classical communication for automated entanglement manipulation
• Ziao Tang: Simulation of adjoints and Petz recovery maps for unknown quantum channels
• Po-Chieh Liu: Sharp estimates of quantum covering problems via a novel trace inequality
• Guocheng Zhen: Structure, optimality, and symmetry in shadow unitary inversion
• Ian George: Local distinguishability of multipartite orthogonal quantum states: Generalized and simplified
• Junkai Zeng: Fundamental costs of noise-robust quantum control: Speed limits and complexity
• Ge Bai: Proper and improper mixed states serve as different prior beliefs for quantum state retrodiction
• Andrey Utkin: Tight norm inequalities for zero-sum vectors and their connection to the entropy inequalities
• Mingrui Jing: Programmable open quantum systems
• Dier Tang: Universal feature selection with noisy observations and weak symmetry conditions
• Xiaodie Lin: Quantum metrology under indistinguishable noise
• Lingna Wang: Tight tradeoff relation and optimal measurement for multi-parameter quantum estimation
• Jinshi Fu: Dimension free L1-Poincaré on qubits
• Jiayi Zhao: Distilling unitary operations: A no-go theorem and minimal realization
• Lijun Wang: Quantitative equivalence between hypercontractivity and strong data processing inequality for quantum channels
• Chengkai Zhu: Entanglement cost of bipartite quantum channel discrimination under positive partial transpose operations
• Entong He: Resource quantification for programming low-depth quantum circuits
• Filippo Girardi: Tumula information and doubly minimized Petz Rényi lautum information
• Hailey Murray: Genuine multipartite Rains entanglement
• Jihong Cai: The hidden nature of non-markovianity
• Longyun Chen: Optimal quantum metrology under energy constraints
• Matt Hoogsteder-Riera: Single-letter chain rules for quantum relative entropy
• Peijie Li: Quantum talagrand-type inequalities via variance decay
• Sujeet Bhalerao: Privacy-utility tradeoffs in quantum information processing
• Vishal Singh: Limiting one-way distillable secret key via privacy testing of extendible states
• Xueyuan Hu: Gaussian time-translation covariant operations: structure, implementation, and thermodynamics
• Long Zhao: Improved lower bounds on MLSI constants of depolarizing semigroups via Pimsner-Popa index
• Chenfeng Cao: Sudden death of entanglement, rebirth of magic