Seminars | LIP6 - QI Team

Francisco Escudero Gutierrez - Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances Room

Wed, 08 Jul 2026 00:00:00 +0000

Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances

Room This seminar, given by Francisco Escudero Gutierrez, will happend on 08 July 2026, at 12:0. It will take place in Room 24-25/405.

Find a map of the campus here.

Abstract

We study the problem of learning Hamiltonians (H) that are (s)-sparse in the Pauli basis, given access to their time evolution. Although Hamiltonian learning has been extensively investigated, two issues recur in much of the existing literature: the absence of matching lower bounds and the use of mathematically convenient but physically opaque error measures.

We address both challenges by introducing two physically motivated distances between Hamiltonians and designing a nearly optimal algorithm with respect to one of these metrics. The first, time-constrained distance, quantifies distinguishability through dynamical evolution up to a bounded time. The second, temperature-constrained distance, captures distinguishability through thermal states at bounded inverse temperatures.

This seminar, given by Michele Grossi, will happend on 29 May 2026, at 8:0. It will take place in Room 25-26/105.

Find a map of the campus here.

Abstract

This year CERN celebrates its 70th Anniversary, and the 60th anniversary of Bell’s theorem, a result that arguably had the single strongest impact on modern foundations of quantum physics, both at the conceptual and methodological level, as well as at the level of its applications in information theory and technology.CERN with its Quantum Technology Initiative is looking into how this revolutionary technological change could align with CERN research and collaboration objectives. After a preliminary introduction about the promise of quantum technologies with focus on computing, we will discuss main research directions and results from theoretical foundations of quantum algorithms to application in several areas of High Energy Physics. //////////////////////////////////////// Speaker: Stefano Pirandola

Title: The Evolution of Quantum Networks Abstract: This seminar will present quantum networks as a sequence of successive technological developments, from near-term secure communication infrastructures to future distributed quantum computing platforms. We begin with quantum-safe networks, based on post-quantum cryptography or quantum key distribution, discussing their respective advantages, limitations, and deployment scenarios. We then consider cloud quantum computing, where multiple quantum processors are accessed classically and managed through workload orchestrators. The next stage is represented by quantum-networked clouds, in which local clusters of quantum computers are interconnected by quantum links, potentially involving transducers in hybrid architectures. Finally, we discuss distributed quantum clouds, where remote quantum computers are connected through quantum repeaters, opening the way to long-distance distributed quantum information processing.

Stefano Pirandola - Quantum computing in high energy physics: state of the art

Fri, 29 May 2026 00:00:00 +0000

Quantum computing in high energy physics: state of the art

This seminar, given by Stefano Pirandola, will happend on 29 May 2026, at 8:0. It will take place in Room 25-26/105.

Bo Yang - Verifiable blind observable estimation

CHSH violation with optimal resources and partial information

This seminar, given by Flavien Hirsch, will happend on 09 September 2025, at 13:0. It will take place in Room 26-00/534.

Find a map of the campus here.

Abstract

Entanglement is necessary for Bell nonlocality. In the case of the CHSH inequality/game, Bell pairs i.e. two-qubit maximally entangled states are known to be optimal to reach the Tsirelson bound. Nevertheless, from an informational perspective, one might wonder if Alice and Bob both need to exactly know the state they share to play CHSH optimally, or if some degree of epistemic ignorance is allowed. In this talk, we consider a variation of the standard Bell bipartite scenario, where Alice and Bob play the CHSH with optimal resources i.e. Bell pairs, but imperfect information about them, in order to answer the question How ignorant can Alice and Bob be about the optimal resources they share and still reach the Tsirelson bound, or at least violate the Bell-local bound?

All the best, Marco

Iria W. Wang - Designing Fault-Tolerant Blind Quantum Computation

This seminar, given by Adriano Innocenzi, will happend on 20 June 2025, at 14:0. It will take place in Room Not specified.

Find a map of the campus here.

Abstract

Secret sharing is a fundamental primitive in cryptography, and it can be achieved even with perfect security. However, the distribution of shares requires computational assumptions, which can compromise the overall security of the protocol. While traditional Quantum Key Distribution (QKD) can maintain security, its widespread deployment in general networks would incur prohibitive costs. In this work, we present a quantum protocol for distributing additive secret sharing of 0, which we prove to be composably secure within the

Lucas Hanouz - Security of a secret sharing protocol on the Qline

Fri, 20 Jun 2025 00:00:00 +0000

This seminar, given by Lucas Hanouz, will happend on 20 June 2025, at 14:0. It will take place in Room Not specified.

Find a map of the campus here.

Abstract

Abstract

Abstract

Abstract

Find a map of the campus here.

Abstract

Not specified