{"id":78,"date":"2025-05-02T10:11:34","date_gmt":"2025-05-02T08:11:34","guid":{"rendered":"https:\/\/hebergement.universite-paris-saclay.fr\/maqi\/?page_id=78"},"modified":"2025-08-29T10:51:19","modified_gmt":"2025-08-29T08:51:19","slug":"program","status":"publish","type":"page","link":"https:\/\/hebergement.universite-paris-saclay.fr\/maqi\/index.php\/program\/","title":{"rendered":"Program"},"content":{"rendered":"<p><center> <iframe loading=\"lazy\" src=\"https:\/\/calendar.google.com\/calendar\/embed?height=600&#038;wkst=2&#038;ctz=Europe%2FParis&#038;mode=WEEK&#038;showTabs=0&#038;showCalendars=0&#038;title&#038;showPrint=0&#038;showNav=0&#038;src=ZTQ4M2FlZmIzYjNlN2Q3MGI4N2FkZDliMGQ5MGFlMGIwNWY0Zjc1YTE5OTdhMTgwN2ZlZDMzZDdhMDllMGE3MEBncm91cC5jYWxlbmRhci5nb29nbGUuY29t&#038;color=%23F09300&#038;hl=en_GB&#038;dates=20250616\/20250620\" style=\"border:solid 1px #777\" width=\"800\" height=\"600\" frameborder=\"0\" scrolling=\"no\"><\/iframe> <\/center><\/p>\n\n\n<details class=\"wp-block-details is-layout-flow wp-block-details-is-layout-flow\"><summary>Monday 16th May<\/summary>\n<p><strong>Introduction to quantum information and its mathematical language<\/strong><br><em><span style=\"text-decoration: underline;\">Timoth\u00e9e Hoffreumon<\/span>, Slovak Academy of Sciences<\/em><br>In this tutorial,&nbsp;we will learn how quantum systems are utilized&nbsp;to process and store information. Rather than focusing on their physical&nbsp;realization, we will focus on the mathematical model&nbsp;of \u2018quantum information\u2019. &nbsp;<\/p>\n\n\n\n<p>We will begin by covering the formalism of \u2018pure states\u2019&nbsp;and their circuit representations. This foundation will help us introduce&nbsp;the postulates of quantum theory as well as some of the main aspects of the \u2018quantum magic\u2019,&nbsp;namely superposition, no-cloning, entanglement, and non-locality. To illustrate these concepts, we will examine a few practical quantum protocols that make use of these phenomena.&nbsp;<\/p>\n\n\n\n<p>Next, we will move on to the &lsquo;mixed state&rsquo; formalism and its corresponding circuit representation.&nbsp;This more advanced presentation of quantum circuits allows&nbsp;to discuss the statistical properties of the quantum systems, which is necessary step to arrive at&nbsp;the theory of quantum information.&nbsp;If time permits, we will touch on the basic topics of quantum information, such as noise and error&nbsp;modelling, the entropy of states, and the capacity&nbsp;of channels.&nbsp;<\/p>\n\n\n\n<p><strong>Causation in quantum theory: from Bell&rsquo;s scenario to the general case<\/strong><br><em><a href=\"https:\/\/www.york.ac.uk\/maths\/people\/roger-colbeck\/\" data-type=\"link\" data-id=\"https:\/\/www.york.ac.uk\/maths\/people\/roger-colbeck\/\">Roger Colbeck<\/a><\/em>, <em>Department of Mathematics, University of York<\/em><br>I will introduce causal structures starting with an in-depth treatment of the Bell causal structure, explaining how to distinguish classical correlations, quantum correlations and those beyond, and that some quantum correlations are self-testing. I will then move on to more general causal structures, explaining why their analysis is more difficult, and illustrating a few techniques that are useful for deciding whether given correlations are compatible with the causal structure or not.<\/p>\n\n\n\n<p><strong>Poster session<\/strong><br>1 &#8211; <em>Bayesian Inference in Quantum Programs,<\/em> Christina Gehnen<br>2 &#8211; <em>Higher order quantum transformations for known input state<\/em>, Vanessa Brzi\u0107<br>3 &#8211; <em>Dynamic Routing in Software-Defined QKD Networks: Overview and Challenges<\/em>, Hamid Taramit<br>4 &#8211; <em>How Likely Are You to Observe Non-locality with Imperfect Detection Efficiency and Random Measurement Settings?<\/em>, Pawe\u0142 Cie\u015bli\u0144ski<br>5 &#8211; <em>Quantum-enhanced belief propagation<\/em>, Sheila M. P\u00e9rez Garc\u00eda<br>6 &#8211; <em>Observational entropy of quantum correlations<\/em>, Leonardo Rossetti<br>7 &#8211; <em>Variational Inference for Quantum HyperNetworks<\/em>, Alix Lh\u00e9ritier<br>8 &#8211; <em>Vacua in Discrete Spacetime<\/em>, Chaitanya Gupta<br>9 &#8211; <em>Does the Unclonable Bit Exist?<\/em>, Pierre Botteron<br>10 &#8211; <em>Quantum Algorithms for Optimization Problems<\/em>, Raneem Madani<br>11 &#8211; Transtatistics: Beyond Bosons And Fermions, Tristan Maleville<br>12 &#8211; <em>Discrete symetries in quantum circuits<\/em>, Maximilian Mansky<br>13 &#8211; <em>Witnessing PPT entanglement via rank properties of (sub)matrices<\/em>, Aabhas Gulati<br>14 &#8211; <em>Deriving Entanglement Generation and Swapping Policies in Quantum Networks<\/em>, \u00c1lvaro Troyano Olivas<br>15 &#8211; <em>Magic States for GKP Qubits<\/em>, Sharon David<\/p>\n\n\n\n<p><\/p>\n<\/details>\n\n\n\n<details class=\"wp-block-details is-layout-flow wp-block-details-is-layout-flow\"><summary>Tuesday 17th May<\/summary>\n<p><strong>Causation in quantum theory: from Bell&rsquo;s scenario to the general case <\/strong><br><em><a href=\"https:\/\/www.york.ac.uk\/maths\/people\/roger-colbeck\/\" data-type=\"link\" data-id=\"https:\/\/www.york.ac.uk\/maths\/people\/roger-colbeck\/\">Roger Colbeck<\/a>, Department of Mathematics, University of York<\/em><br>I will introduce causal structures starting with an in-depth treatment of the Bell causal structure, explaining how to distinguish classical correlations, quantum correlations and those beyond, and that some quantum correlations are self-testing. <\/p>\n\n\n\n<p>I will then move on to more general causal structures, explaining why their analysis is more difficult, and illustrating a few techniques that are useful for deciding whether given correlations are compatible with the causal structure or not.<\/p>\n\n\n\n<p><strong>Higher Order Quantum Theory <\/strong><br><em><a href=\"https:\/\/scholar.google.com\/citations?hl=en&amp;user=yxBffXIAAAAJ&amp;view_op=list_works&amp;sortby=pubdate\" data-type=\"link\" data-id=\"matthew.wilson@centralesupelec.fr\">Matthew Wilson<\/a><\/em>,<em> CentraleSup\u00e9lec, Universit\u00e9 Paris-Saclay<\/em><br>Higher order quantum operations can be motivated in at-least three ways. First, one might simply ask a mathematical question, \u201cwhich operations can be applied to part of a quantum channel to return a new one\u201d. Second, one might ask, \u201cwhat are the most general causal correlations compatible with local quantum theory\u201d. Third, one might ask, \u201cwhat is the right generalisation of non-markovian processes to the quantum regime\u201d. In either case, one lands on variants of the same mathematical objects called higher order quantum operations. In this lecture we will review the motivations and basic theory of higher order processes, along with current open questions in the field.&nbsp;<\/p>\n\n\n\n<p><strong>Randomness, entropy and accumulation<\/strong><br><em><a href=\"https:\/\/peterjbrown519.github.io\/\" data-type=\"link\" data-id=\"https:\/\/peterjbrown519.github.io\/\">Peter Brown<\/a>, T\u00e9l\u00e9com Paris, Institut Polytechnique de Paris.<\/em><br>Quantum random number generators are already a commercially viable quantum technology. However, to claim these random number generators are secure we need rigorous mathematical security proofs. In this lecture we&rsquo;ll explore the question of what it means for a quantum random number generator to be \u00ab\u00a0secure\u00a0\u00bb. We&rsquo;ll then relate security of the quantum random number generator to a problem of quantifying entropy and finally we&rsquo;ll explore how entropy accumulation theorems help to solve these quantification problems.<\/p>\n\n\n\n<p><strong>Network non-locality<\/strong><br><em><span style=\"text-decoration: underline;\"><a href=\"https:\/\/mweilenmann.github.io\/\" data-type=\"link\" data-id=\"https:\/\/mweilenmann.github.io\/\">Mirjam Weilenmann<\/a><\/span><\/em>, <em>INRIA Saclay<\/em><br>Building on the discussion of classical and quantum correlations earlier in the day, this lecture will introduce techniques to distinguish classical from quantum correlations in network scenarios. We will introduce different methods to derive compatibility constraints for network scenarios, where we will focus on the most successful technique or this purpose: the inflation technique. We will further look into the topic of memory attacks and see what these imply for the network topologies needed for applications.<\/p>\n<\/details>\n\n\n\n<details class=\"wp-block-details is-layout-flow wp-block-details-is-layout-flow\"><summary>Wednesday 18th May<\/summary>\n<p><strong>An introduction to Stochastic Master Equation (SME) for open quantum systems<\/strong><br><em><a href=\"https:\/\/cas.minesparis.psl.eu\/~rouchon\/\" data-type=\"link\" data-id=\"https:\/\/cas.minesparis.psl.eu\/~rouchon\/\">Pierre Rouchon<\/a>, LPENS, Mines Paris-PSL, Inria, ENS-PSL, Universit\u00e9 PSL, CNRS, Sorbonne Universit\u00e9<\/em><br><br>-1- SME of the photon box: wave-function\/density-operator formulation, dispersive\/resonant propagator, Markov model, quantum Monte-Carlo trajectories, (super)-martingales, Quantum Non-Demolition (QND) measurement of photons, Bayesian inference to include measurement imperfections and decoherence, &nbsp; simulation and convergence analysis.<br><br>-2- Structure of dynamical models describing open quantum systems including measurement back-action and decoherence: discrete-time models based on quantum channels and left stochastic matrices; &nbsp;continuous-time models driven by Wiener processes (weak measurement) or Poisson processes (quantum jump and counting measurement), and their time-discretization.<\/p>\n\n\n\n<p><strong>Poster session<\/strong><br>1 &#8211; <em>Overlap Gap Property limits limit swapping in QAOA<\/em>, Mark Gosh<br>2 &#8211; <em>Security of DIQKD from multipartite information causality<\/em>, Lucas Pollyceno<br>3 &#8211; <em>Evaluating different Quantum Hardwares for Graph Cut Optimization<\/em>, Ali Abbassi<br>4 &#8211; <em>Complexities of mixed Schatten norms of quantum maps<\/em>, Jan Kochanowski<br>5 &#8211; <em>Benchmarking quantum devices beyond classical capabilities<\/em>, Marcin Rudzi\u0144ski<br>6 &#8211; <em>Emulation Capacity between Idempotent Channels<\/em>, Idris Delsol<br>7 &#8211; <em>UniqueNESS: Graph Theory Approach to the Uniqueness of Non-Equilibrium Steady-States &amp; Self-Similarity in the Thermodynamic Limit<\/em>, Martin Seltmann<br>8 &#8211; <em>Quantum oblivious transfer and coherent-one-way quantum key distribution<\/em>, Juan Jos\u00e9 Romero<br>9 &#8211; <em>Ergodic Properties of Quantum Markov Semigroups<\/em>, Nicolas Mousset<br>10 &#8211; <em>Efficient Classical Simulations via a Beyond-Quantum Many Body Representation<\/em>, Peter Martin<br>11 &#8211; <em>Quantifying the diabatic error in coupled photonic waveguides<\/em>, Ankit Singh Bhadauriya<br>12 &#8211; <em>Graphon Quantum Filtering system<\/em>, Sofiane Chalal<br>13- <em>Towards Efficient Resource Management in MadQCI<\/em>, Leduin Jos\u00e9 Cuenca Macas<br>14- <em>Orthogonal Faces in the CHSH Scenario<\/em>, Andrea Zingarofalo<br>15- <em>Resourcefulness of non-classical continuous-variable quantum gates<\/em>, Antoine Debray<\/p>\n\n\n\n<p><\/p>\n\n\n\n<p><\/p>\n\n\n\n<p><strong>Zero-error communication under discrete-time Markovian dynamics<\/strong><br><em><a href=\"https:\/\/www.damtp.cam.ac.uk\/user\/nila\/\" data-type=\"link\" data-id=\"https:\/\/www.damtp.cam.ac.uk\/user\/nila\/\">Nilanjana Datta<\/a><\/em>, <em>Faculty of Mathematics, University of Cambridge, Pembroke <\/em>College<br>Consider an open quantum system with (discrete-time) Markovian dynamics. Our task is to store information in the system in such a way that it can be retrieved perfectly, even after the system is left to evolve for an arbitrarily long time. We show that this is impossible for classical (resp. quantum) information precisely when the dynamics is mixing (resp. asymptotically entanglement breaking). Furthermore, we provide tight universal upper bounds on the minimum time after which any such dynamics \u2018scrambles\u2019 the encoded information beyond the point of perfect retrieval. On the other hand, for dynamics that are not of this kind, we show that information must be encoded inside the peripheral space associated with the dynamics in order for it to be perfectly recoverable at any time in the future. This allows us to derive explicit formulas for the maximum amount of information that can be protected from noise in terms of the structure of the peripheral space of the dynamics.<\/p>\n\n\n\n<p><strong>CANCELED &#8211; <s>Quantum entropy power inequalities, recent developments and open problems<\/s><\/strong><br><em><a href=\"https:\/\/salmanbeigi.github.io\/index.html\" data-type=\"link\" data-id=\"https:\/\/salmanbeigi.github.io\/index.html\">Salman Beigi<\/a>, School of Mathematics, Institute for Research in Fundamental Sciences<\/em><br>Entropy power inequalities are significant tools in information theory, probability theory and geometric analysis. Generalization of these inequalities in the quantum realm goes back to more than fifteen years ago. This tutorial is devoted to a review of these inequalities and their significance, technical tools for proving them, and some open problems.\u00a0<br><\/p>\n<\/details>\n\n\n\n<details class=\"wp-block-details is-layout-flow wp-block-details-is-layout-flow\"><summary>Thursday 19th May<\/summary>\n<p><strong>Quantum Feedback Networks: Theory and Applications in Quantum Control Systems <\/strong><br><em><a href=\"https:\/\/users.aber.ac.uk\/jug\/\">John Gough<\/a><\/em>, <em>Aberystwyth University<\/em><br>We review the theory of quantum feedback networks and show how it gives a framework for a system theoretic description applicable to quantum engineering. The network rules are presented along with an overview of feedback based control. There are two main approaches: feedback by the observed output signal; and feedback by the actual quantum output itself. We will illustrate this with several current examples from quantum technology, in particular, quantum optics and super-conducting qubits. We introduce the &nbsp;Hudson-Parthasarathy quantum stochastic calculus and the input-output theory for open quantum systems (known as the \u00ab\u00a0SLH\u00a0\u00bb formalism), and review the theory of quantum feedback networks. We will give an overview of feedback techniques, including current directions in quantum measurement-based and quantum coherent feedback control.<\/p>\n\n\n\n<p><strong>Optimal estimation of quantum Markov chains using coherent absorbers and displaced-null measurements <\/strong><br><em><a href=\"https:\/\/www.maths.nottingham.ac.uk\/plp\/pmzmig\/index.html\">Madalin Guta<\/a><\/em>, <em>School of Mathematics, University of Nottingham<\/em><br>In this presentation I will discuss the problem of estimating dynamical parameters of a quantum Markov chain. The key tool will be the use of a coherent quantum absorber which transforms the problem into a simpler one pertaining to a system with a pure stationary state at a reference parameter value. Motivated by the proposal in [1] I will consider counting output measurements and show how the statistics of the counts can be used to compute a simple, asymptotically optimal estimator of the unknown parameter. For this, I will introduce translationally invariant modes (TIMs) of the output and show that these modes are Gaussian in the limit of large times and capture the entire quantum&nbsp; Fisher information of the output. Moreover, the counting measurement provides an effective joint measurement of the TIMs number operators. The unknown parameter is estimated using a two stage estimation procedure. A rough estimator is first computed using a simple measurement, and is used to set the absorber parameter. Due to non-identifiability issues of the counting measurement the reference parameter needs to be shifted away from the initial rough estimator, as shown in the displaced-null measurements theory [2]. Finally, an optimal estimator is computed in terms of the total number of excitations of the TIMs, avoiding the need for expensive estimation procedures. Details can be found in [3].<br>&nbsp;<br>&nbsp;[1] D. Yang, S. F. Huelga, and M. B. Plenio PRX Quantum 13, 031012 (2023)&nbsp;<br>&nbsp;[2] F. Girotti, A. Godley and M. Guta, arXiv:J. Phys. A 57 245304 (2024)<br>&nbsp;[3] F. Girotti, A. Godley and M. Guta, arXiv: <a href=\"https:\/\/www.google.com\/url?q=https:\/\/arxiv.org\/abs\/2408.00626&amp;sa=D&amp;source=calendar&amp;usd=2&amp;usg=AOvVaw1_mY8WRU0NmAaV4duGqo6Y\" target=\"_blank\" rel=\"noreferrer noopener\">2408.00626<\/a><\/p>\n\n\n\n<p><strong>Quantum simulations of quantum many-body systems<\/strong><br><em><a href=\"https:\/\/www.cambyserouz\u00e9.fr\/\">Cambyse Rouz\u00e9<\/a>, Inria, T\u00e9l\u00e9com Paris, Institut Polytechnique de Paris<\/em><br>Envisioned by Richard Feynman forty years ago, one of the most promising applications where quantum computers are expected to outperform classical ones is the prediction of physical properties in complex quantum systems. Such advancements have the potential to transform industries like pharmaceuticals and semiconductor chip design,&nbsp;where the expected runtime of classical simulations currently poses a major bottleneck.<\/p>\n\n\n\n<p>In this tutorial, I will discuss key simulation tasks centered on time-evolved, ground, and Gibbs states of geometrically local quantum Hamiltonians, with particular emphasis on their comparison to classical simulation methods. I will then provide a concise overview of the main quantum algorithms used for preparing these states. If time allows, I will conclude with a recent proposal for ground and Gibbs state preparation that promises both quantum advantage and enhanced implementation robustness.<\/p>\n\n\n\n<p><strong>Quantum Query Complexity<\/strong><br><em><a href=\"https:\/\/www.lix.polytechnique.fr\/Labo\/Titouan.CARETTE\/\" data-type=\"link\" data-id=\"https:\/\/www.lix.polytechnique.fr\/Labo\/Titouan.CARETTE\/\">Titouan Carette<\/a>, LIX, Ecole Polytechnique, Institut Polytechnique de Paris<\/em><br>Quantifying quantum advantage is a necessary task that can be accomplished in many ways, different definitions leading to more or less optimist views on quantum computing. From the theoretical point of view, the most successful approach so far is query complexity, where strict separation between classical and quantum complexity are known. In this tutorial, we&rsquo;ll outline the main definitions and results in this field as well as interesting recent results on more exotic quantum computational models.<\/p>\n<\/details>\n\n\n\n<details class=\"wp-block-details is-layout-flow wp-block-details-is-layout-flow\"><summary>Friday 20th May<\/summary>\n<p><strong>Quantum Programming languages with classical control<\/strong><br><em><a href=\"https:\/\/www.monoidal.net\/\" data-type=\"link\" data-id=\"https:\/\/www.monoidal.net\/\">Benoit Valiron<\/a>, LMF, Universit\u00e9 Paris-Saclay<\/em><br>This lecture is devoted to the programming model of circuit description languages. We first overview a few typical structures found in quantum algorithms and derive the necessary constructors for implementing them. We then analyse several standard approaches found both in the literature and in concrete programming languages. We finally focus on the typical type systems used for quantum circuit description languages.<\/p>\n\n\n\n<p><strong>Quantum programming languages with quantum control<\/strong><br><em><a href=\"https:\/\/members.loria.fr\/ADiazCaro\/\">Alejandro Diaz-Caro<\/a>, INRIA, LORIA<\/em><br>In this lecture, we explore an alternative approach to defining quantum programming languages, in which programs\u2014just like data\u2014can be superposed. This perspective enables the natural representation of interesting configurations, such as the quantum switch. Moreover, such languages are natural candidates for serving as proof languages for substructural logics, such as linear logic, or even for uncovering new kinds of logic.<\/p>\n\n\n\n<p><strong>Graphical languages for quantum computation <\/strong><br><em><a href=\"https:\/\/mdevisme.gitlab.io\/page_personnelle\/\">Marc de Visme<\/a>, INRIA, LMF, Universit\u00e9 Paris-Saclay<\/em><br>In this lecture, we present graphical languages for quantum computation. While we focus on the most used ones, that is quantum circuits and the ZX calculus, we also give an overview of the diversity existing in graphical languages, the reasons why one might use graphical languages over textual languages, and the theoretical framework underlying.<\/p>\n\n\n\n<p><strong>Emulating Quantum Computation <\/strong><br><em><a href=\"https:\/\/scholar.google.com\/citations?user=upaq0vIAAAAJ&amp;hl=en\" data-type=\"link\" data-id=\"https:\/\/scholar.google.com\/citations?user=upaq0vIAAAAJ&amp;hl=en\">Simon Martiel<\/a><\/em>,<em> IBM Quantum, IBM France Lab,<\/em><br>In this lecture, we will investigate the different known quantum simulation algorithms, ranging from direct linear algebra simulation and tensor network contraction, to simulation of Clifford circuits through Tableau formalism. We will attempt to list classes of circuits for which efficient simulation techniques are known, and prove hardness of some other classes of circuits. The goal is to provide a collection of tools that can be used to explore quantum algorithms as efficiently as possible, and enough knowledge to discriminate between \u00ab\u00a0hard\u00a0\u00bb and \u00ab\u00a0easy\u00a0\u00bb quantum circuits.<\/p>\n\n\n\n<p><strong>Quantum algorithms for high performance computing<\/strong><br><em><a href=\"https:\/\/marcbab.github.io\/\" data-type=\"link\" data-id=\"https:\/\/marcbab.github.io\/\">Marc Baboulin<\/a><\/em>, <em>LMF, ENS Paris-Saclay, CNRS, Universit\u00e9 Paris-Saclay<\/em><br>In this lecture we explain how core tasks in scientific computing can be addressed by quantum algorithms, possibly combined with classical ones. In particular we describe recent advances in algorithms for decomposing and handling matrices (generic, or coming from PDE&rsquo;s) in quantum computers. We also present promising methods for the solution of linear systems of equations with improvement in terms of accuracy and cost for the solution.<\/p>\n<\/details>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-78","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/hebergement.universite-paris-saclay.fr\/maqi\/index.php\/wp-json\/wp\/v2\/pages\/78","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/hebergement.universite-paris-saclay.fr\/maqi\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/hebergement.universite-paris-saclay.fr\/maqi\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/hebergement.universite-paris-saclay.fr\/maqi\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/hebergement.universite-paris-saclay.fr\/maqi\/index.php\/wp-json\/wp\/v2\/comments?post=78"}],"version-history":[{"count":20,"href":"https:\/\/hebergement.universite-paris-saclay.fr\/maqi\/index.php\/wp-json\/wp\/v2\/pages\/78\/revisions"}],"predecessor-version":[{"id":124,"href":"https:\/\/hebergement.universite-paris-saclay.fr\/maqi\/index.php\/wp-json\/wp\/v2\/pages\/78\/revisions\/124"}],"wp:attachment":[{"href":"https:\/\/hebergement.universite-paris-saclay.fr\/maqi\/index.php\/wp-json\/wp\/v2\/media?parent=78"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}