Journées Informatique Quantique 2025 -- PEPR EPIQ

9:30 - 10:00 (30min)

Technical meeting EPIQ

10:00 - 10:30 (30min)

Pause café

10:30 - 11:00 (30min)

A rewriting theory for quantum lambda-calculus

Gaetan Lopez

11:00 - 11:30 (30min)

Generation of state-independent contextuality proofs from hypergraphs

Axel Muller

11:30 - 12:00 (30min)

Local equivalence of stabilizer states: a graphical characterisation

Nathan Claudet

12:00 - 14:00 (2h)

Déjeuner

14:00 - 14:30 (30min)

On linear optical circuits with finite-photon-number sources and detectors

Nicolas Heurtel

14:30 - 15:00 (30min)

Adapting Barrier Certificates for usage to verify Quantum Computers

Marco Lewis

15:00 - 15:30 (30min)

On the role of pseudo-entanglement in cryptography

Álvaro Yángüez

15:30 - 16:00 (30min)

Pause café

16:00 - 16:30 (30min)

Quantum property testing in sparse directed graphs

Daniel Szabo

16:30 - 17:00 (30min)

Directed st-connectivity with few paths is in quantum logspace

Roman Edenhofer

17:00 - 17:30 (30min)

Distributed Quantum Algorithms for Cycle Detection in Networks

Maël Luce

	Mar. 28	Mer. 29
09:00 10:00 11:00 12:00 13:00 14:00 15:00 16:00 17:00	Pause café 10:00 - 10:30 (30min) Pause café Quantum Cryptography and Lossy Reductions 10:30 - 11:00 (30min) Quantum Cryptography and Lossy Reductions Pouria Fallahpour Double-Logarithmic Depth Block-Encodings of Simple Finite Difference Method's Matrices 11:00 - 11:30 (30min) Double-Logarithmic Depth Block-Encodings of Simple Finite Difference Method's Matrices Sunheang Ty Noisy simulations of Quantum Walk and Quantum Walk search on the cycle and torus via QCA over circuit Quantum Electrodynamics emulator 11:30 - 12:00 (30min) Noisy simulations of Quantum Walk and Quantum Walk search on the cycle and torus via QCA over circuit Quantum Electrodynamics emulator Andrea Mammola Déjeuner 12:00 - 14:00 (2h) Déjeuner Graph state preparation on arbitrary hardware 14:00 - 14:30 (30min) Graph state preparation on arbitrary hardware Tristan Cam An architecture to reduce trust and costs of various quantum protocols 14:30 - 15:00 (30min) An architecture to reduce trust and costs of various quantum protocols Lucas Hanouz Efficient quantum routines for quantum algorithms 15:00 - 15:30 (30min) Efficient quantum routines for quantum algorithms Julien Zylberman Pause café 15:30 - 16:00 (30min) Pause café Permutation tests for quantum state identity 16:00 - 16:30 (30min) Permutation tests for quantum state identity Philip Verduyn Lunel On the welded tree problem 16:30 - 17:00 (30min) On the welded tree problem Shrinidhi Teganahally Sridhara Entanglement Swapping in Orbit: a Satellite Quantum Link Case Study 17:00 - 17:30 (30min) Entanglement Swapping in Orbit: a Satellite Quantum Link Case Study Paolo Fittipaldi	Technical meeting EPIQ 9:30 - 10:00 (30min) Technical meeting EPIQ Pause café 10:00 - 10:30 (30min) Pause café A rewriting theory for quantum lambda-calculus 10:30 - 11:00 (30min) A rewriting theory for quantum lambda-calculus Gaetan Lopez Generation of state-independent contextuality proofs from hypergraphs 11:00 - 11:30 (30min) Generation of state-independent contextuality proofs from hypergraphs Axel Muller Local equivalence of stabilizer states: a graphical characterisation 11:30 - 12:00 (30min) Local equivalence of stabilizer states: a graphical characterisation Nathan Claudet Déjeuner 12:00 - 14:00 (2h) Déjeuner On linear optical circuits with finite-photon-number sources and detectors 14:00 - 14:30 (30min) On linear optical circuits with finite-photon-number sources and detectors Nicolas Heurtel Adapting Barrier Certificates for usage to verify Quantum Computers 14:30 - 15:00 (30min) Adapting Barrier Certificates for usage to verify Quantum Computers Marco Lewis On the role of pseudo-entanglement in cryptography 15:00 - 15:30 (30min) On the role of pseudo-entanglement in cryptography Álvaro Yángüez Pause café 15:30 - 16:00 (30min) Pause café Quantum property testing in sparse directed graphs 16:00 - 16:30 (30min) Quantum property testing in sparse directed graphs Daniel Szabo Directed st-connectivity with few paths is in quantum logspace 16:30 - 17:00 (30min) Directed st-connectivity with few paths is in quantum logspace Roman Edenhofer Distributed Quantum Algorithms for Cycle Detection in Networks 17:00 - 17:30 (30min) Distributed Quantum Algorithms for Cycle Detection in Networks Maël Luce