About me
Quentin Aristote
PhD student in Theoretical Computer Science
- quentin.aristote@irif.fr (academic)
quentin@aristote.fr (personal)
- keys
- DFC1660846EEA97C059F18534EF515441E635D36
- address
- Office 3010
8 place Aurélie Nemours
75013 Paris - online
- Git: ENS
IRIF
personal
LinkedIn
Publications
Selected works
- Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids (2024)
- Helena Rasiowa award for the Best Student Paper. At 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024). DOI:
10.4230/LIPIcs.CSL.2024.11
.More
- Abstract.
We study monoidal transducers, transition systems arising as deterministic automata whose transitions also produce outputs in an arbitrary monoid, for instance allowing outputs to commute or to cancel out. We use the categorical framework for minimization and learning of Colcombet, Petrişan and Stabile to recover the notion of minimal transducer recognizing a language, and give necessary and sufficient conditions on the output monoid for this minimal transducer to exist and be unique (up to isomorphism). The categorical framework then provides an abstract algorithm for learning it using membership and equivalence queries, and we discuss practical aspects of this algorithm’s implementation.
- Cite.
BibLaTeX
@inproceedings{aristoteActiveLearningDeterministic2024, author = {Aristote, Quentin}, publisher = {Schloss-Dagstuhl - Leibniz Zentrum für Informatik}, title = {Active {Learning} of {Deterministic} {Transducers} with {Outputs} in {Arbitrary} {Monoids}}, booktitle = {DROPS-IDN/v2/document/10.4230/LIPIcs.CSL.2024.11}, date = {2024}, urldate = {2024-02-07}, url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.11}, doi = {10.4230/LIPIcs.CSL.2024.11}, note = {Helena Rasiowa award for the Best Student Paper}, langid = {en}, abstract = {We study monoidal transducers, transition systems arising as deterministic automata whose transitions also produce outputs in an arbitrary monoid, for instance allowing outputs to commute or to cancel out. We use the categorical framework for minimization and learning of Colcombet, Petrişan and Stabile to recover the notion of minimal transducer recognizing a language, and give necessary and sufficient conditions on the output monoid for this minimal transducer to exist and be unique (up to isomorphism). The categorical framework then provides an abstract algorithm for learning it using membership and equivalence queries, and we discuss practical aspects of this algorithm’s implementation.} }
BibTeX
@inproceedings{aristoteActiveLearningDeterministic2024, author = {Aristote, Quentin}, publisher = {Schloss-Dagstuhl - Leibniz Zentrum für Informatik}, title = {Active {Learning} of {Deterministic} {Transducers} with {Outputs} in {Arbitrary} {Monoids}}, booktitle = {DROPS-IDN/v2/document/10.4230/LIPIcs.CSL.2024.11}, year = {2024}, note = {Helena Rasiowa award for the Best Student Paper}, url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.11} }
CSL JSON
[ { "DOI": "10.4230/LIPIcs.CSL.2024.11", "URL": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.11", "abstract": "We study monoidal transducers, transition systems arising as deterministic automata whose transitions also produce outputs in an arbitrary monoid, for instance allowing outputs to commute or to cancel out. We use the categorical framework for minimization and learning of Colcombet, Petrişan and Stabile to recover the notion of minimal transducer recognizing a language, and give necessary and sufficient conditions on the output monoid for this minimal transducer to exist and be unique (up to isomorphism). The categorical framework then provides an abstract algorithm for learning it using membership and equivalence queries, and we discuss practical aspects of this algorithm’s implementation.", "accessed": { "date-parts": [ [ 2024, 2, 7 ] ] }, "author": [ { "family": "Aristote", "given": "Quentin" } ], "citation-key": "aristoteActiveLearningDeterministic2024", "container-title": "DROPS-IDN/v2/document/10.4230/LIPIcs.CSL.2024.11", "event-title": "32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)", "id": "aristoteActiveLearningDeterministic2024", "issued": { "date-parts": [ [ 2024 ] ] }, "language": "en", "license": "https://creativecommons.org/licenses/by/4.0/legalcode", "note": "Helena Rasiowa award for the Best Student Paper", "publisher": "Schloss-Dagstuhl - Leibniz Zentrum für Informatik", "source": "drops.dagstuhl.de", "title": "Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids", "type": "paper-conference" } ]
Other works
- Monotone weak distributive laws over the lifted powerset monad in categories of algebras (2024)
-
More
- Abstract.
Noticing the similarity between the monotone weak distributive laws combining two layers of nondeterminisms in sets and in compact Hausdorff spaces, we study whether the latter law can be obtained automatically as a weak lifting of the former. This holds partially, but does not generalize to other categories of algebras: we then characterize when exactly monotone weak distributive laws over powerset monads in categories of algebras exist, exhibiting a law combining probabilities and non-determinism in compact Hausdorff spaces and showing on the other hand that such laws do not exist in a lot of other cases.
- Cite.
BibLaTeX
@unpublished{aristoteMonotoneWeakDistributive2024, author = {Aristote, Quentin}, title = {Monotone Weak Distributive Laws over the Lifted Powerset Monad in Categories of Algebras}, date = {2024-10}, urldate = {2024-11-04}, url = {https://hal.science/hal-04712728v4}, abstract = {Noticing the similarity between the monotone weak distributive laws combining two layers of nondeterminisms in sets and in compact Hausdorff spaces, we study whether the latter law can be obtained automatically as a weak lifting of the former. This holds partially, but does not generalize to other categories of algebras: we then characterize when exactly monotone weak distributive laws over powerset monads in categories of algebras exist, exhibiting a law combining probabilities and non-determinism in compact Hausdorff spaces and showing on the other hand that such laws do not exist in a lot of other cases.} }
BibTeX
@unpublished{aristoteMonotoneWeakDistributive2024, author = {Aristote, Quentin}, title = {Monotone Weak Distributive Laws over the Lifted Powerset Monad in Categories of Algebras}, year = {2024}, month = {oct}, url = {https://hal.science/hal-04712728v4} }
CSL JSON
[ { "URL": "https://hal.science/hal-04712728v4", "abstract": "Noticing the similarity between the monotone weak distributive laws combining two layers of nondeterminisms in sets and in compact Hausdorff spaces, we study whether the latter law can be obtained automatically as a weak lifting of the former. This holds partially, but does not generalize to other categories of algebras: we then characterize when exactly monotone weak distributive laws over powerset monads in categories of algebras exist, exhibiting a law combining probabilities and non-determinism in compact Hausdorff spaces and showing on the other hand that such laws do not exist in a lot of other cases.", "accessed": { "date-parts": [ [ 2024, 11, 4 ] ] }, "author": [ { "family": "Aristote", "given": "Quentin" } ], "citation-key": "aristoteMonotoneWeakDistributive2024", "id": "aristoteMonotoneWeakDistributive2024", "issued": { "date-parts": [ [ 2024, 10 ] ] }, "source": "HAL Archives Ouvertes", "title": "Monotone weak distributive laws over the lifted powerset monad in categories of algebras", "type": "manuscript" } ]
- Functorial approach to minimizing and learning deterministic transducers with outputs in arbitrary monoids (2023)
-
More
- Abstract.
We study monoidal transducers, transition systems arising as deterministic automata whose transitions also produce outputs in an arbitrary monoid, for instance allowing outputs to commute or to cancel out. We use the categorical framework for minimization and learning of Colcombet, Petrişan and Stabile to recover the notion of minimal transducer recognizing a language, and give necessary and sufficient conditions on the output monoid for this minimal transducer to exist and be unique (up to isomorphism). The categorical framework then provides an abstract algorithm for learning it using membership and equivalence queries, and we discuss practical aspects of this algorithm's implementation. We also extend the framework with a categorical algorithm for minimizing transition systems, whose instantiation retrieves the algorithm for minimizing monoidal transducers but also extends the class of output monoids for which this algorithm is valid.
- Cite.
BibLaTeX
@misc{aristoteFunctorialApproachMinimizing2023b, author = {Aristote, Quentin}, publisher = {HAL}, title = {Functorial Approach to Minimizing and Learning Deterministic Transducers with Outputs in Arbitrary Monoids}, date = {2023-11-28}, url = {https://ens.hal.science/hal-04172251v2}, langid = {en}, abstract = {We study monoidal transducers, transition systems arising as deterministic automata whose transitions also produce outputs in an arbitrary monoid, for instance allowing outputs to commute or to cancel out. We use the categorical framework for minimization and learning of Colcombet, Petrişan and Stabile to recover the notion of minimal transducer recognizing a language, and give necessary and sufficient conditions on the output monoid for this minimal transducer to exist and be unique (up to isomorphism). The categorical framework then provides an abstract algorithm for learning it using membership and equivalence queries, and we discuss practical aspects of this algorithm’s implementation. We also extend the framework with a categorical algorithm for minimizing transition systems, whose instantiation retrieves the algorithm for minimizing monoidal transducers but also extends the class of output monoids for which this algorithm is valid.} }
BibTeX
@misc{aristoteFunctorialApproachMinimizing2023b, author = {Aristote, Quentin}, publisher = {HAL}, title = {Functorial Approach to Minimizing and Learning Deterministic Transducers with Outputs in Arbitrary Monoids}, year = {2023}, month = {nov}, url = {https://ens.hal.science/hal-04172251v2} }
CSL JSON
[ { "URL": "https://ens.hal.science/hal-04172251v2", "abstract": "We study monoidal transducers, transition systems arising as deterministic automata whose transitions also produce outputs in an arbitrary monoid, for instance allowing outputs to commute or to cancel out. We use the categorical framework for minimization and learning of Colcombet, Petrişan and Stabile to recover the notion of minimal transducer recognizing a language, and give necessary and sufficient conditions on the output monoid for this minimal transducer to exist and be unique (up to isomorphism). The categorical framework then provides an abstract algorithm for learning it using membership and equivalence queries, and we discuss practical aspects of this algorithm’s implementation. We also extend the framework with a categorical algorithm for minimizing transition systems, whose instantiation retrieves the algorithm for minimizing monoidal transducers but also extends the class of output monoids for which this algorithm is valid.", "author": [ { "family": "Aristote", "given": "Quentin" } ], "citation-key": "aristoteFunctorialApproachMinimizing2023b", "id": "aristoteFunctorialApproachMinimizing2023b", "issued": { "date-parts": [ [ 2023, 11, 28 ] ] }, "language": "en", "publisher": "HAL", "title": "Functorial approach to minimizing and learning deterministic transducers with outputs in arbitrary monoids", "type": "article" } ]
- smtlib-backends: faster SMT-LIB-based Haskell interface to SMT solvers (2023)
- In Tweag Blog.
More
- Abstract.
Announcement of smtlib-backends, a Haskell library providing a generic interface for interacting with SMT solvers using SMT-LIB.
- Cite.
BibLaTeX
@misc{aristoteSmtlibbackendsFasterSMTLIBbased2023, author = {Aristote, Quentin}, title = {Smtlib-Backends: Faster {SMT-LIB-based} {Haskell} Interface to {SMT} Solvers}, date = {2023-02-14}, url = {https://www.tweag.io/blog/2023-02-14-smtlib-backends}, langid = {en}, abstract = {Announcement of smtlib-backends, a Haskell library providing a generic interface for interacting with SMT solvers using SMT-LIB.} }
BibTeX
@misc{aristoteSmtlibbackendsFasterSMTLIBbased2023, author = {Aristote, Quentin}, title = {Smtlib-Backends: Faster {SMT-LIB-based} {Haskell} Interface to {SMT} Solvers}, year = {2023}, month = {feb}, url = {https://www.tweag.io/blog/2023-02-14-smtlib-backends} }
CSL JSON
[ { "URL": "https://www.tweag.io/blog/2023-02-14-smtlib-backends", "abstract": "Announcement of smtlib-backends, a Haskell library providing a generic interface for interacting with SMT solvers using SMT-LIB.", "author": [ { "family": "Aristote", "given": "Quentin" } ], "citation-key": "aristoteSmtlibbackendsFasterSMTLIBbased2023", "container-title": "Tweag Blog", "id": "aristoteSmtlibbackendsFasterSMTLIBbased2023", "issued": { "date-parts": [ [ 2023, 2, 14 ] ] }, "language": "en", "title": "smtlib-backends: faster SMT-LIB-based Haskell interface to SMT solvers", "title-short": "smtlib-backends", "type": "post-weblog" } ]
- Applications of a categorical framework for minimization and active learning of transition systems (2022)
-
More
- Abstract.
M2 internship report. We extend Petrişan and Colcombet's categorical framework for automata minimization and learning with new categorical algorithms and apply it to various families of automata for which minimization and learning had not been studied previously. We focus on transducers whose output lie in arbitrary monoids, weighted automata on Dedekind domains and automata whose states are quasi-ordered. This last example links automata learning together with the Valk-Jantzen lemma, widely used in the theory of well-structured transition systems.
- Cite.
BibLaTeX
@report{aristoteApplicationsCategoricalFramework2022, author = {Aristote, Quentin}, title = {Applications of a Categorical Framework for Minimization and Active Learning of Transition Systems}, date = {2022-08-20}, url = {https://git.eleves.ens.fr/qaristote/m2-internship-report/uploads/2594114883f26d77c2b4f3731656351a/report.pdf}, langid = {en}, abstract = {M2 internship report. We extend Petrişan and Colcombet’s categorical framework for automata minimization and learning with new categorical algorithms and apply it to various families of automata for which minimization and learning had not been studied previously. We focus on transducers whose output lie in arbitrary monoids, weighted automata on Dedekind domains and automata whose states are quasi-ordered. This last example links automata learning together with the Valk-Jantzen lemma, widely used in the theory of well-structured transition systems.} }
BibTeX
@techreport{aristoteApplicationsCategoricalFramework2022, author = {Aristote, Quentin}, title = {Applications of a Categorical Framework for Minimization and Active Learning of Transition Systems}, year = {2022}, month = {aug}, url = {https://git.eleves.ens.fr/qaristote/m2-internship-report/uploads/2594114883f26d77c2b4f3731656351a/report.pdf} }
CSL JSON
[ { "URL": "https://git.eleves.ens.fr/qaristote/m2-internship-report/uploads/2594114883f26d77c2b4f3731656351a/report.pdf", "abstract": "M2 internship report. We extend Petrişan and Colcombet’s categorical framework for automata minimization and learning with new categorical algorithms and apply it to various families of automata for which minimization and learning had not been studied previously. We focus on transducers whose output lie in arbitrary monoids, weighted automata on Dedekind domains and automata whose states are quasi-ordered. This last example links automata learning together with the Valk-Jantzen lemma, widely used in the theory of well-structured transition systems.", "author": [ { "family": "Aristote", "given": "Quentin" } ], "citation-key": "aristoteApplicationsCategoricalFramework2022", "id": "aristoteApplicationsCategoricalFramework2022", "issued": { "date-parts": [ [ 2022, 8, 20 ] ] }, "language": "en", "license": "All rights reserved", "title": "Applications of a categorical framework for minimization and active learning of transition systems", "type": "report" } ]
- Fibrational Framework for Nested Alternating Fixed Points and (Bi)Simulation Notions for Büchi Automata (2020)
-
More
- Abstract.
M1 internship report. We extend a previous fibration- and coalgebra-based categorical framework for characterizing greatest fixed-points, e.g. bisimilarity-like notions, as winning positions in safety games. Our new framework thus characterizes nested alternating greatest and smallest fixed-points of a fibration- and coalgebra-based categorical operator as winning positions in parity games. This provides a new kind of parity games for the model checking of coalgebraic modal logic, but unfortunately we did not manage to instantiate more general notions of bisimulations such as fair and delayed bisimulations.
- Cite.
BibLaTeX
@report{aristoteFibrationalFrameworkNested2020, author = {Aristote, Quentin}, title = {Fibrational {Framework} for {Nested} {Alternating} {Fixed} {Points} and {(Bi)Simulation} {Notions} for {Büchi} {Automata}}, date = {2020-08-28}, url = {https://git.eleves.ens.fr/qaristote/m1-internship-report/uploads/3431548a277eb5fc297d8e7d93d1e3ce/aristote_quentin_m1_internship_report.pdf}, langid = {en}, abstract = {M1 internship report. We extend a previous fibration- and coalgebra-based categorical framework for characterizing greatest fixed-points, e.g. bisimilarity-like notions, as winning positions in safety games. Our new framework thus characterizes nested alternating greatest and smallest fixed-points of a fibration- and coalgebra-based categorical operator as winning positions in parity games. This provides a new kind of parity games for the model checking of coalgebraic modal logic, but unfortunately we did not manage to instantiate more general notions of bisimulations such as fair and delayed bisimulations.} }
BibTeX
@techreport{aristoteFibrationalFrameworkNested2020, author = {Aristote, Quentin}, title = {Fibrational {Framework} for {Nested} {Alternating} {Fixed} {Points} and {(Bi)Simulation} {Notions} for {Büchi} {Automata}}, year = {2020}, month = {aug}, url = {https://git.eleves.ens.fr/qaristote/m1-internship-report/uploads/3431548a277eb5fc297d8e7d93d1e3ce/aristote_quentin_m1_internship_report.pdf} }
CSL JSON
[ { "URL": "https://git.eleves.ens.fr/qaristote/m1-internship-report/uploads/3431548a277eb5fc297d8e7d93d1e3ce/aristote_quentin_m1_internship_report.pdf", "abstract": "M1 internship report. We extend a previous fibration- and coalgebra-based categorical framework for characterizing greatest fixed-points, e.g. bisimilarity-like notions, as winning positions in safety games. Our new framework thus characterizes nested alternating greatest and smallest fixed-points of a fibration- and coalgebra-based categorical operator as winning positions in parity games. This provides a new kind of parity games for the model checking of coalgebraic modal logic, but unfortunately we did not manage to instantiate more general notions of bisimulations such as fair and delayed bisimulations.", "author": [ { "family": "Aristote", "given": "Quentin" } ], "citation-key": "aristoteFibrationalFrameworkNested2020", "id": "aristoteFibrationalFrameworkNested2020", "issued": { "date-parts": [ [ 2020, 8, 28 ] ] }, "language": "en", "license": "All rights reserved", "title": "Fibrational Framework for Nested Alternating Fixed Points and (Bi)Simulation Notions for Büchi Automata", "type": "report" } ]
- Dynamical Triangulation Induced by Quantum Walk (2020)
- With Nathanaël Eon, Giuseppe Molfetta. In Symmetry, 12, 1:128, Multidisciplinary Digital Publishing Institute. ISSN: 2073-8994. DOI:
10.3390/sym12010128
.More
- Abstract.
We present the single-particle sector of a quantum cellular automaton, namely a quantum walk, on a simple dynamical triangulated 2-manifold. The triangulation is changed through Pachner moves, induced by the walker density itself, allowing the surface to transform into any topologically equivalent one. This model extends the quantum walk over triangular grid, introduced in a previous work, by one of the authors, whose space-time limit recovers the Dirac equation in (2+1)-dimensions. Numerical simulations show that the number of triangles and the local curvature grow as exp(a log(t) - bt²), where a and b parametrize the way geometry changes upon the local density of the walker, and that, in the long run, flatness emerges. Finally, we also prove that the global behavior of the walker, remains the same under spacetime random fluctuations.
- Cite.
BibLaTeX
@article{aristoteDynamicalTriangulationInduced2020, author = {Aristote, Quentin and Eon, Nathanaël and di Molfetta, Giuseppe}, publisher = {Multidisciplinary Digital Publishing Institute}, title = {Dynamical {Triangulation} {Induced} by {Quantum} {Walk}}, journal = {Symmetry}, volume = {12}, number = {1}, date = {2020-01}, urldate = {2020-08-17}, url = {https://www.mdpi.com/2073-8994/12/1/128}, doi = {10.3390/sym12010128}, issn = {2073-8994}, langid = {en}, abstract = {We present the single-particle sector of a quantum cellular automaton, namely a quantum walk, on a simple dynamical triangulated 2-manifold. The triangulation is changed through Pachner moves, induced by the walker density itself, allowing the surface to transform into any topologically equivalent one. This model extends the quantum walk over triangular grid, introduced in a previous work, by one of the authors, whose space-time limit recovers the Dirac equation in (2+1)-dimensions. Numerical simulations show that the number of triangles and the local curvature grow as exp(a log(t) - bt\textsuperscript{2}), where a and b parametrize the way geometry changes upon the local density of the walker, and that, in the long run, flatness emerges. Finally, we also prove that the global behavior of the walker, remains the same under spacetime random fluctuations.} }
BibTeX
@article{aristoteDynamicalTriangulationInduced2020, author = {Aristote, Quentin and Eon, Nathanaël and di Molfetta, Giuseppe}, publisher = {Multidisciplinary Digital Publishing Institute}, title = {Dynamical {Triangulation} {Induced} by {Quantum} {Walk}}, journal = {Symmetry}, volume = {12}, number = {1}, year = {2020}, month = {jan}, url = {https://www.mdpi.com/2073-8994/12/1/128} }
CSL JSON
[ { "DOI": "10.3390/sym12010128", "ISSN": "2073-8994", "URL": "https://www.mdpi.com/2073-8994/12/1/128", "abstract": "We present the single-particle sector of a quantum cellular automaton, namely a quantum walk, on a simple dynamical triangulated 2-manifold. The triangulation is changed through Pachner moves, induced by the walker density itself, allowing the surface to transform into any topologically equivalent one. This model extends the quantum walk over triangular grid, introduced in a previous work, by one of the authors, whose space-time limit recovers the Dirac equation in (2+1)-dimensions. Numerical simulations show that the number of triangles and the local curvature grow as exp(a log(t) - bt2), where a and b parametrize the way geometry changes upon the local density of the walker, and that, in the long run, flatness emerges. Finally, we also prove that the global behavior of the walker, remains the same under spacetime random fluctuations.", "accessed": { "date-parts": [ [ 2020, 8, 17 ] ] }, "author": [ { "family": "Aristote", "given": "Quentin" }, { "family": "Eon", "given": "Nathanaël" }, { "family": "Molfetta", "given": "Giuseppe", "non-dropping-particle": "di" } ], "citation-key": "aristoteDynamicalTriangulationInduced2020", "container-title": "Symmetry", "id": "aristoteDynamicalTriangulationInduced2020", "issue": "1:128", "issued": { "date-parts": [ [ 2020, 1 ] ] }, "language": "en", "license": "http://creativecommons.org/licenses/by/3.0/", "number": "1", "publisher": "Multidisciplinary Digital Publishing Institute", "source": "www.mdpi.com", "title": "Dynamical Triangulation Induced by Quantum Walk", "type": "article-journal", "volume": "12" } ]
- Marche quantique sur un réseau triangulaire sujet à des Pachner moves (2019)
-
More
- Abstract.
Rapport de stage de L3. On introduit un automate cellulaire quantique à une particule, un marcheur quantique, sur une variété triangulée de dimension 2. La triangulation change à travers des Pachner moves, induits eux-même par la densité du marcheur, permettant à la surface de se transformer en n'importe quelle autre surface qui lui est topologiquement équivalente. Ce modèle généralise le marcheur quantique sur un réseau triangulaire, introduit dans un article précédent par un des auteurs, et dont la limite en espace-temps retombe sur l'équation de Dirac en 2+1 dimensions. Des simulations numériques montrent que le nombre de triangles et que la courbure évoluent en exp(a log(t) - bt²), où a et b paramétrisent la façon dont la géométrie change selon la densité locale du marcheur, et que, sur le long terme, la surface redevient plate. Enfin, on montre aussi numériquement que le comportement global du marcheur reste le même sous l'influence de fluctuations spatio-temporelles aléatoires.
- Cite.
BibLaTeX
@report{aristoteMarcheQuantiqueReseau2019, author = {Aristote, Quentin}, title = {Marche quantique sur un réseau triangulaire sujet à des Pachner moves}, date = {2019-08-25}, url = {https://git.eleves.ens.fr/qaristote/rapport-stage-l3/-/raw/b9f9cc78ad3eabe6508be70cc27dc9bf89d34755/rapport.pdf}, langid = {fr}, abstract = {Rapport de stage de L3. On introduit un automate cellulaire quantique à une particule, un marcheur quantique, sur une variété triangulée de dimension 2. La triangulation change à travers des Pachner moves, induits eux-même par la densité du marcheur, permettant à la surface de se transformer en n’importe quelle autre surface qui lui est topologiquement équivalente. Ce modèle généralise le marcheur quantique sur un réseau triangulaire, introduit dans un article précédent par un des auteurs, et dont la limite en espace-temps retombe sur l’équation de Dirac en 2+1 dimensions. Des simulations numériques montrent que le nombre de triangles et que la courbure évoluent en exp(a log(t) - bt\textsuperscript{2}), où a et b paramétrisent la façon dont la géométrie change selon la densité locale du marcheur, et que, sur le long terme, la surface redevient plate. Enfin, on montre aussi numériquement que le comportement global du marcheur reste le même sous l’influence de fluctuations spatio-temporelles aléatoires.} }
BibTeX
@techreport{aristoteMarcheQuantiqueReseau2019, author = {Aristote, Quentin}, title = {{Marche quantique sur un réseau triangulaire sujet à des Pachner moves}}, year = {2019}, month = {aug}, url = {https://git.eleves.ens.fr/qaristote/rapport-stage-l3/-/raw/b9f9cc78ad3eabe6508be70cc27dc9bf89d34755/rapport.pdf} }
CSL JSON
[ { "URL": "https://git.eleves.ens.fr/qaristote/rapport-stage-l3/-/raw/b9f9cc78ad3eabe6508be70cc27dc9bf89d34755/rapport.pdf", "abstract": "Rapport de stage de L3. On introduit un automate cellulaire quantique à une particule, un marcheur quantique, sur une variété triangulée de dimension 2. La triangulation change à travers des Pachner moves, induits eux-même par la densité du marcheur, permettant à la surface de se transformer en n’importe quelle autre surface qui lui est topologiquement équivalente. Ce modèle généralise le marcheur quantique sur un réseau triangulaire, introduit dans un article précédent par un des auteurs, et dont la limite en espace-temps retombe sur l’équation de Dirac en 2+1 dimensions. Des simulations numériques montrent que le nombre de triangles et que la courbure évoluent en exp(a log(t) - bt2), où a et b paramétrisent la façon dont la géométrie change selon la densité locale du marcheur, et que, sur le long terme, la surface redevient plate. Enfin, on montre aussi numériquement que le comportement global du marcheur reste le même sous l’influence de fluctuations spatio-temporelles aléatoires.", "author": [ { "family": "Aristote", "given": "Quentin" } ], "citation-key": "aristoteMarcheQuantiqueReseau2019", "id": "aristoteMarcheQuantiqueReseau2019", "issued": { "date-parts": [ [ 2019, 8, 25 ] ] }, "language": "fr", "license": "All rights reserved", "title": "Marche quantique sur un réseau triangulaire sujet à des Pachner moves", "type": "report" } ]
Software
- bibli-paris
- Spacemacs layer that adds functionnalities to org-mode, enabling the management of reading lists of documents from Paris’ network of libraries.
- smtlib-backends
- Haskell library providing low-level functions for SMT-LIB-based interaction with SMT solvers.
- webpage
- Nix-based static webpage generator.
Experience
- PhD student in Theoretical Computer Science @ IRIF (UMR 8243), CNRS, Paris, France
- · supervised by Daniela Petrişan - Ongoing. Studying compositionality of monads and its application to effectful programming, in particular within automata theory.
- research intern in Applied Category Theory @ IRIF (UMR 8243), CNRS, Paris, France
- · supervised by Daniela Petrişan · paper - Follow-up to my M2's internship: wrote a paper and further explored some open questions as a preparation for my PhD.
- Software Engineering intern @ Tweag, Paris, France
- · supervised by Tweag's HAS group · blog post library - Sped-up Pirouette (a symbolic evaluator using incorrectness logic) by optimizing its interactions with SMT solvers.
- research intern in Applied Category Theory @ IRIF (UMR 8243), CNRS, Paris, France
- · supervised by Daniela Petrişan · internship report - Generalized a categorical framework for the minimization and active learning of transition systems and instanciated it to develop new such algorithms.
- research intern in Applied Category Theory @ ERATO MMSD, NII, Tōkyō, Japan
- · supervised by Ichiro Hasuo Jérémy Dubut · internship report - Generalized a greatest-fixed-points- and safety-games-based fibrational framework for bisimulations to nested fixed points and parity games.
- research intern in Natural Computing @ LiS Laboratory (UMR 7020), CNRS, Luminy, France
- · supervised by Giuseppe di Molfetta · internship report paper - Developed a quantum walker model whose density changes its own environment.
Education
- Master's degree in Theoretical Computer Science @ École Normale Supérieure, Paris, France
- Second year Master's degree in Theoretical Computer Science @ MPRI
Graduated with highest honors (18.43/20), second of a highly-selective class of 70 students.
-Computer Science courses
Approximation Algorithms · Concurrency · Denotational Semantics (Domains, Categories, Games) · Finite Automata as Models · Functional Programmming & Type Systems · Game Theory · Molecular Algorithms · Non-Sequential Theory of Distributed Systems · Probabilistic Programming · Programming Shared-Memory Multi-Threaded Machines · Proof Assistants · Proof Systems · Proof of Programs · Quantum Computing · Real-time & Hybrid Systems · Well Quasi-Orders & AlgorithmsFirst year Master's degree in Computer Science @ DIENS
Completed with highest honors (18.20/20).
-Computer Science courses
Artificial Vision · Combinatorial & Convex Optimisation · Deep Learning · Lambda Calculus & Categories · Models & Algorithms for Networks · Parallel & Reactive Programming · Path Planning in Robotics · Random Structures & AlgorithmsMathematics courses
Algebra (Domains) · Algebraic Topology · Data Science · Differential Geometry · Dynamical Systems · Functional Analysis · Logics · Partial Differential Equations · Statistics · Stochastic ProcessesTook two gap years: one to follow additional postgraduate courses in Mathematics; one to do additional internships.Bachelor's degrees in Computer Science and Mathematics @ DIENS
Graduated with highest honors in Computer Science (17.80/20), with honors in Mathematics (14.74/20).
-Computer Science courses
Algorithms & Programming · Cryptography · Databases · Formal Languages, Decidability & Complexity · Hardware Systems · Machine Learning · Operating Systems · Programming Languages & Compilation · Semantics & Verification of ProgramsMathematics courses
Algebra (Groups) · Complex Analysis · Information Theory · Measure Theory · Topology & Differential Calculus- Higher Schools Preparatory Classes @ Lycée Louis-le-Grand, Paris, France
- - MPSI - MP* (Mathematics, Physics and Computer Science)