Numerical modeling of quantum dynamical processes

Date: Friday, June 16, 2023
Time: 12:15
Host: IFTiA Seminar, room 361
Speaker:  Janek Kozicki (Gdańsk University of Technology) Abstract In this talk I present a high-precision (15, 18 or 33 decimal places) C++ implementation of quantum dynamics time propagation algorithms for both time-independent and time-dependent Hamiltonian with an inhomogeneous source term. Moreover I present an extension of both algorithms for time propagation to handle arbitrary number […]

Catalysis in quantum optics

Date: Monday, June 12, 2023
Time: 14:15
Host: Quantum Chaos and Quantum Information (Jagiellonian University)
Passcode: please contact albertrico23 at
Speaker: Alexssandre de Oliveira Junior  (Faculty of Physics, UJ) Abstract Catalysis plays a key role in many scientific areas, most notably in chemistry and biology. In this talk, I will present a catalytic process in a paradigmatic quantum optics setup, namely the Jaynes-Cummings model, where an atom interacts with an optical cavity. The atom plays […]

A de Finetti theorem for quantum causal structures

Date: Wednesday, June 7, 2023
Time: 14:00
Host: ICTQT Seminar, room 411 New Rectorat
Speaker: Fabio Costa (University of Queensland) Abstract What does it mean for a causal structure to be “unknown”? Can we even talk about “repetitions” of an experiment without prior knowledge of causal relations? And under what conditions can we say that a set of processes are independent and identically distributed (i.i.d.)? Similar questions for classical […]

Exploring General Relativistic Approaches to Modeling Large-Scale Structure Formation in the Universe

Date: Wednesday, June 7, 2023
Time: 12:30
Passcode: 134595
Speaker: Ismael Delgado Gaspar (National Centre for Nuclear Research) Abstract The current era of precision cosmology has provided us with high-quality observational data across astrophysical and cosmological scales. Interpreting these data requires robust modeling of self-gravitating systems. However, the use of exact solutions of Einstein's equations and non-linear approaches has been less favored in examining […]

Semi-device independent nonlocality certification for near-term quantum networks

Date: Wednesday, May 31, 2023
Time: 14:30
Host: Quantum Information and Quantum Computing Working Group, Meeting ID: 844 2780 6931
Passcode: nisq
Speaker: Ana Costa (Federal University of Paraná) Abstract Verifying entanglement between parties is essential for creating a secure quantum network, and Bell tests are the most rigorous method for doing so. However, if there is any signalling between the parties, then the violation of these inequalities can no longer be used to draw conclusions about […]

Elements of the general boundary formulation and the composition of local measurements in quantum field theory

Date: Thursday, June 1, 2023
Time: 11:00
Host: ICTQT Seminar, room 215
Speaker: Adamantia Zampeli (Universidad Nacional Autónoma de México, Morelia) Abstract In this talk, I will introduce the main elements and ideas of the general boundary formulation [R. Oeckl. A local and operational framework for the foundations of physics. Advances in Theoretical and Mathematical Physics, 23(2):437–592, 2019. arXiv: 1610.09052.]. This is a formalism inspired by quantum […]

Quantum Foundations Meets Causal Inference

Date: Wednesday, May 31, 2023
Time: 14:00
Host: ICTQT Seminar, room 319
Speaker: Robert Spekkens (Perimeter Institute for Theoretical Physics) Abstract Can the effectiveness of a medical treatment be determined without the expense of a randomized controlled trial? Can the impact of a new policy be disentangled from other factors that happen to vary at the same time? Questions such as these are the purview of the […]

Easy-to-compute local Clifford invariant for graph states

Date: Monday, May 15, 2023
Time: 14:15
Host: Quantum Chaos and Quantum Information (Jagiellonian University)
Passcode: please contact albertrico23 at
Speaker: Adam Burchard (Amsterdam) Abstract Graph states are a cornerstone of quantum information theory. Existing invariants characterizing the local Clifford (LC) equivalence classes of graph states are however computationally inefficient and call for a more tractable approach. This paper introduces the foliage partition, an easy-to-compute LC-invariant of computational complexity O(n^3) in the number of qubits. […]