{"id":405,"date":"2020-09-15T15:34:39","date_gmt":"2020-09-15T13:34:39","guid":{"rendered":"http:\/\/members.loria.fr\/AClement\/?page_id=405"},"modified":"2024-09-10T17:30:22","modified_gmt":"2024-09-10T15:30:22","slug":"improved-bibtex-entries","status":"publish","type":"page","link":"https:\/\/members.loria.fr\/AClement\/publications\/improved-bibtex-entries\/","title":{"rendered":"Publications"},"content":{"rendered":"<p>Alexandre Cl\u00e9ment, <a href=\"https:\/\/noedelor.me\/\" target=\"_blank\" rel=\"noopener\">No\u00e9 Delorme<\/a> and <a href=\"https:\/\/members.loria.fr\/SPerdrix\/\" target=\"_blank\" rel=\"noopener noreferrer\">Simon Perdrix<\/a>, <em>Minimal Equational Theories for Quantum Circuits.<\/em> <a href=\"https:\/\/lics.siglog.org\/lics24\/index.php\" target=\"_blank\" rel=\"noopener\"><i>LICS \u201924: 39th Annual ACM\/IEEE Symposium on Logic in Computer Science<\/i><\/a>, July 2024, Tallinn, Estonia. [<a href=\"https:\/\/hal.science\/hal-04399210\" target=\"_blank\" rel=\"noopener\">HAL<\/a>][<a href=\"https:\/\/doi.org\/10.1145\/3661814.3662088\" target=\"_blank\" rel=\"noopener\">doi<\/a>][<a href=\"https:\/\/arxiv.org\/abs\/2311.07476\" target=\"_blank\" rel=\"noopener\">arXiv<\/a>]<\/p>\n<p>Alexandre Cl\u00e9ment, <a href=\"https:\/\/noedelor.me\/\" target=\"_blank\" rel=\"noopener\">No\u00e9 Delorme<\/a>, <a href=\"https:\/\/members.loria.fr\/SPerdrix\/\" target=\"_blank\" rel=\"noopener noreferrer\">Simon Perdrix<\/a> and <a href=\"https:\/\/rvilmart.github.io\/\" target=\"_blank\" rel=\"noopener\">Renaud Vilmart<\/a>, <em>Quantum Circuit Completeness: Extensions and Simplifications. <a href=\"https:\/\/csl2024.github.io\/Home\/\" target=\"_blank\" rel=\"noopener\">32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)<\/a><\/em>, February 2024, Naples, Italy. pp.20:1-20:23 [<a href=\"https:\/\/hal.science\/hal-04016498\" target=\"_blank\" rel=\"noopener\">HAL<\/a>][<a href=\"https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2024.20\" target=\"_blank\" rel=\"noopener\">doi<\/a>][<a href=\"https:\/\/arxiv.org\/abs\/2303.03117\" target=\"_blank\" rel=\"noopener\">arXiv<\/a>]<\/p>\n<p>Alexandre Cl\u00e9ment, <a href=\"http:\/\/heurtel.fr\/\" target=\"_blank\" rel=\"noopener\">Nicolas Heurtel<\/a>, Shane Mansfield, <a href=\"https:\/\/members.loria.fr\/SPerdrix\/\" target=\"_blank\" rel=\"noopener noreferrer\">Simon Perdrix<\/a> and <a href=\"https:\/\/www.monoidal.net\/\" target=\"_blank\" rel=\"noopener\">Beno\u00eet Valiron<\/a>, <em>A Complete Equational Theory for Quantum Circuits. <\/em><a href=\"https:\/\/lics.siglog.org\/lics23\/index.php\" target=\"_blank\" rel=\"noopener noreferrer\"><i><em>2023 38th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2023)<\/em><\/i><\/a>, June 2023, Boston, MA, United States. [<a href=\"https:\/\/hal.science\/hal-03926757\" target=\"_blank\" rel=\"noopener\">HAL<\/a>][<a href=\"https:\/\/doi.org\/10.1109\/LICS56636.2023.10175801\" target=\"_blank\" rel=\"noopener\">doi<\/a>][<a href=\"https:\/\/arxiv.org\/abs\/2206.10577\" target=\"_blank\" rel=\"noopener\">arXiv<\/a>]<\/p>\n<p>Alexandre Cl\u00e9ment, <a href=\"http:\/\/heurtel.fr\/\" target=\"_blank\" rel=\"noopener\">Nicolas Heurtel<\/a>, Shane Mansfield, <a href=\"https:\/\/members.loria.fr\/SPerdrix\/\" target=\"_blank\" rel=\"noopener noreferrer\">Simon Perdrix<\/a> and <a href=\"https:\/\/www.monoidal.net\/\" target=\"_blank\" rel=\"noopener\">Beno\u00eet Valiron<\/a>, <em>LOv-Calculus: A Graphical Language for Linear Optical Quantum Circuits.\u00a0<\/em><a href=\"https:\/\/www.ac.tuwien.ac.at\/mfcs2022\/\" target=\"_blank\" rel=\"noopener noreferrer\"><i>47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)<\/i><\/a>, August 2022, Vienna, Austria. pp.35:1-35:16 [<a href=\"https:\/\/hal.science\/hal-03926660\" target=\"_blank\" rel=\"noopener\">HAL<\/a>][<a href=\"https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2022.35\" target=\"_blank\" rel=\"noopener noreferrer\">doi<\/a>][<a href=\"https:\/\/arxiv.org\/abs\/2204.11787\" target=\"_blank\" rel=\"noopener\">arXiv<\/a>]<\/p>\n<p>Alexandre Cl\u00e9ment and <a href=\"https:\/\/members.loria.fr\/SPerdrix\/\" target=\"_blank\" rel=\"noopener noreferrer\">Simon Perdrix<\/a>, <em>Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-calculus.<\/em> <a href=\"https:\/\/www.ac.tuwien.ac.at\/mfcs2022\/\" target=\"_blank\" rel=\"noopener noreferrer\"><i>47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)<\/i><\/a>, August 2022, Vienna, Austria. pp.36:1-36:15 [<a href=\"https:\/\/hal.science\/hal-03926639\" target=\"_blank\" rel=\"noopener\">HAL<\/a>][<a href=\"https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2022.36\" target=\"_blank\" rel=\"noopener noreferrer\">doi<\/a>][<a href=\"https:\/\/arxiv.org\/abs\/2202.05260\" target=\"_blank\" rel=\"noopener\">arXiv<\/a>]<\/p>\n<p><a href=\"https:\/\/neel.cnrs.fr\/les-chercheurs-et-techniciens\/branciard-cyril\" target=\"_blank\" rel=\"noopener\">Cyril Branciard<\/a>, Alexandre Cl\u00e9ment, <a href=\"http:\/\/membres-lig.imag.fr\/mhalla\/\" target=\"_blank\" rel=\"noopener\">Mehdi Mhalla<\/a> and <a href=\"https:\/\/members.loria.fr\/SPerdrix\/\" target=\"_blank\" rel=\"noopener noreferrer\">Simon Perdrix<\/a>, <em>Coherent Control and Distinguishability of Quantum Channels via PBS-Diagrams<\/em>. <a href=\"https:\/\/compose.ioc.ee\/mfcs\/\" target=\"_blank\" rel=\"noopener noreferrer\"><i>46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)<\/i><\/a>, August 2021, Tallinn, Estonia (hybrid event). pp.22:1-22:20 [<a href=\"https:\/\/hal.science\/hal-03325456\" target=\"_blank\" rel=\"noopener noreferrer\">HAL<\/a>] [<a href=\"https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2021.22\" target=\"_blank\" rel=\"noopener noreferrer\">doi<\/a>] [<a href=\"https:\/\/arxiv.org\/abs\/2103.02073\" target=\"_blank\" rel=\"noopener noreferrer\">arXiv<\/a>] [<a href=\"\/AClement\/files\/bibtex\/bib\/bibliocoherent.bib\" target=\"_blank\" rel=\"noopener noreferrer\">Bibtex (corrected)<\/a>].<\/p>\n<p>Alexandre Cl\u00e9ment and <a href=\"https:\/\/members.loria.fr\/SPerdrix\/\" target=\"_blank\" rel=\"noopener noreferrer\">Simon Perdrix<\/a>, <em>PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations<\/em>. <a href=\"http:\/\/mfcs.mff.cuni.cz\/2020\/\" target=\"_blank\" rel=\"noopener noreferrer\"><i>45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)<\/i><\/a>, August 2020, Prague, Czech Republic (held online). pp.24:1-24:14 [<a href=\"https:\/\/hal.science\/hal-02929291\" target=\"_blank\" rel=\"noopener noreferrer\">HAL<\/a>] [<a href=\"https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2020.24\" target=\"_blank\" rel=\"noopener noreferrer\">doi<\/a>] [<a href=\"https:\/\/arxiv.org\/abs\/2002.09387\" target=\"_blank\" rel=\"noopener noreferrer\">arXiv<\/a>] [<a href=\"\/AClement\/files\/bibtex\/bib\/bibliopbs.bib\" target=\"_blank\" rel=\"noopener noreferrer\">Bibtex (corrected)<\/a>].<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Alexandre Cl\u00e9ment, <a href=\"https:\/\/noedelor.me\/\" target=\"_blank\" rel=\"noopener\">No\u00e9 Delorme<\/a> and <a href=\"https:\/\/members.loria.fr\/SPerdrix\/\" target=\"_blank\" rel=\"noopener noreferrer\">Simon Perdrix<\/a>, <em>Minimal Equational Theories for Quantum Circuits.<\/em> <a href=\"https:\/\/lics.siglog.org\/lics24\/index.php\" target=\"_blank\" rel=\"noopener\"><i>LICS \u201924: 39th Annual ACM\/IEEE Symposium on Logic in Computer Science<\/i><\/a>, July 2024, Tallinn, Estonia. [<a href=\"https:\/\/hal.science\/hal-04399210\" target=\"_blank\" rel=\"noopener\">HAL<\/a>][<a href=\"https:\/\/doi.org\/10.1145\/3661814.3662088\" target=\"_blank\" rel=\"noopener\">doi<\/a>][<a href=\"https:\/\/arxiv.org\/abs\/2311.07476\" target=\"_blank\" rel=\"noopener\">arXiv<\/a>]<\/p>\n<p>Alexandre Cl\u00e9ment, <a href=\"https:\/\/noedelor.me\/\" target=\"_blank\" rel=\"noopener\">No\u00e9 Delorme<\/a>, <a href=\"https:\/\/members.loria.fr\/SPerdrix\/\" target=\"_blank\" rel=\"noopener noreferrer\">Simon Perdrix<\/a> and <a href=\"https:\/\/rvilmart.github.io\/\" target=\"_blank\" rel=\"noopener\">Renaud Vilmart<\/a>, <em>Quantum Circuit Completeness: Extensions and Simplifications. <a href=\"https:\/\/csl2024.github.io\/Home\/\" target=\"_blank\" rel=\"noopener\">32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)<\/a><\/em>, February 2024, Naples, Italy. pp.20:1-20:23 [<a href=\"https:\/\/hal.science\/hal-04016498\" target=\"_blank\" rel=\"noopener\">HAL<\/a>][<a href=\"https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2024.20\" target=\"_blank\" rel=\"noopener\">doi<\/a>][<a href=\"https:\/\/arxiv.org\/abs\/2303.03117\" target=\"_blank\" rel=\"noopener\">arXiv<\/a>]<\/p>\n<p>Alexandre Cl\u00e9ment,<\/p>\n","protected":false},"author":196,"featured_media":0,"parent":13,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-405","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/members.loria.fr\/AClement\/wp-json\/wp\/v2\/pages\/405","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/members.loria.fr\/AClement\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/members.loria.fr\/AClement\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/members.loria.fr\/AClement\/wp-json\/wp\/v2\/users\/196"}],"replies":[{"embeddable":true,"href":"https:\/\/members.loria.fr\/AClement\/wp-json\/wp\/v2\/comments?post=405"}],"version-history":[{"count":15,"href":"https:\/\/members.loria.fr\/AClement\/wp-json\/wp\/v2\/pages\/405\/revisions"}],"predecessor-version":[{"id":448,"href":"https:\/\/members.loria.fr\/AClement\/wp-json\/wp\/v2\/pages\/405\/revisions\/448"}],"up":[{"embeddable":true,"href":"https:\/\/members.loria.fr\/AClement\/wp-json\/wp\/v2\/pages\/13"}],"wp:attachment":[{"href":"https:\/\/members.loria.fr\/AClement\/wp-json\/wp\/v2\/media?parent=405"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}