Publications


864 documents

  • Emmanuel Hainry, Romain Péchoux, Mário Alberto Machado da Silva. Branch Sequentialization in Quantum Polytime. FSCD 2025, Jul 2025, Birmingham, United Kingdom. ⟨10.4230/LIPIcs.FSCD.2025.22⟩. ⟨hal-04823282v4⟩
  • Alejandro Díaz-Caro. Towards a Computational Quantum Logic. 21st Conference on Computability in Europe, CiE 2025, Jul 2025, Lisbon, Portugal. pp.34-46, ⟨10.1007/978-3-031-95908-0_3⟩. ⟨hal-05129482⟩
  • Alastair A. Abbott, Mehdi Mhalla, Pierre Pocreau. Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order. QPL 2025 - 22nd International Conference on Quantum Physics and Logic, Jul 2025, Varna, Bulgaria. pp.270-300, ⟨10.4204/EPTCS.426.11⟩. ⟨hal-05217422⟩
  • Simon Apers, Minbo Gao, Zhengfeng Ji, Chenghua Liu. Quantum Speedups for Sampling Random Spanning Trees. 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), Jul 2025, Aarhus, Denmark. pp.13:1-13:21, ⟨10.4230/LIPIcs.ICALP.2025.13⟩. ⟨hal-05411036⟩
  • Arjan Cornelissen, Simon Apers, Sander Gribling. How to compute the volume in low dimension?. 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), Jul 2025, Aarhus, Denmark. pp.61:1-61:18, ⟨10.4230/LIPIcs.ICALP.2025.61⟩. ⟨hal-05411024⟩
  • Nathan Claudet, Simon Perdrix. Deciding Local Unitary Equivalence of Graph States in Quasi-Polynomial Time. 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), Jul 2025, Aarhus (Danemark), Denmark. pp.59:1-59:20, ⟨10.4230/LIPIcs.ICALP.2025.59⟩. ⟨hal-05435692⟩
  • Giacomo Pope, Krijn Reijnders, Damien Robert, Alessandro Sferlazza, Benjamin Smith. Simpler and Faster Pairings from the Montgomery Ladder. IACR Communications in Cryptology, 2025, 2025 (2), ⟨10.62056/ah2i893y6⟩. ⟨hal-05142445⟩
  • Jocelyn Achard, Alexandre Tallaire, Ovidiu Brinza, Vianney Mille, Fabien J Bénédic. Engineering of diamond growth for high-end application: challenges and perspectives.. 75th UK Diamond Research Conference, Jul 2025, Warwick, United Kingdom. ⟨hal-05164913⟩
  • Alejandro Díaz-Caro, Gilles Dowek, Jean-Pierre Jouannaud. Proving Termination With CPO --Full Version. 2025. ⟨hal-05146299v2⟩
  • Tristan Cam, Cyril Gavoille, Yvan Le Borgne, Simon Martiel. Universal Graph Theory Operations for Graph State Preparation. 17th International Conference on Reversible Computation (RC), Jul 2025, Odense (Danemark), Denmark. pp.54-70, ⟨10.1007/978-3-031-97063-4_5⟩. ⟨hal-05133697⟩

Documents récupérés de l'archive ouverte HAL logo