Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Emmanuel Jeandel"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 2 (2024)
The ZX-calculus is a powerful framework for reasoning in quantum computing. It provides in particular a compact representation of matrices of interests. A peculiar property of the ZX-calculus is the absence of a formal sum allowing the linear combina
Externí odkaz:
https://doaj.org/article/c84a6175b78348928e474eeba0d2d31e
Publikováno v:
Logical Methods in Computer Science, Vol Volume 16, Issue 2 (2020)
The ZX-Calculus is a graphical language for diagrammatic reasoning in quantum mechanics and quantum information theory. It comes equipped with an equational presentation. We focus here on a very important property of the language: completeness, which
Externí odkaz:
https://doaj.org/article/a0194c260e1d49a39594d6eef27f4d21
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 266, Iss Proc. QPL 2017, Pp 23-57 (2018)
We introduce a ZX-like diagrammatic language devoted to manipulating real matrices – and rebits –, with its own set of axioms. We prove the necessity of some non trivial axioms of these. We show that some restriction of the language is complete.
Externí odkaz:
https://doaj.org/article/8c471c89d31a42b5b1d989038d1cd261
Autor:
Emmanuel Jeandel, Nicolas Rolin
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 90, Iss Proc. AUTOMATA&JAC 2012, Pp 69-85 (2012)
Deciding if a given set of Wang tiles admits a tiling of the plane is decidable if the number of Wang tiles (or the number of colors) is bounded, for a trivial reason, as there are only finitely many such tilesets. We prove however that the tiling pr
Externí odkaz:
https://doaj.org/article/8613bd93a45d4fa1a25964886f36c0fb
Autor:
Emmanuel, Jeandel, Vanier, Pascal
We investigate here the hardness of conjugacy and factorization of subshifts of finite type (SFTs) in dimension $d>1$. In particular, we prove that the factorization problem is $\Sigma^0_3$-complete and the conjugacy problem $\Sigma^0_1$-complete in
Externí odkaz:
http://arxiv.org/abs/1204.4988
Publikováno v:
Programming Languages and Systems ISBN: 9783031300431
Variational Quantum Algorithms are hybrid classical-quantum algorithms where classical and quantum computation work in tandem to solve computational problems. These algorithms create interesting challenges for the design of suitable programming langu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::53b14dd0d2bec33610588aabb49b4d8f
https://doi.org/10.1007/978-3-031-30044-8_19
https://doi.org/10.1007/978-3-031-30044-8_19
Publikováno v:
ACM Transactions on Quantum Computing
ACM Transactions on Quantum Computing, 2021, 2 (4), pp.1-28. ⟨10.1145/3464693⟩
ACM Transactions on Quantum Computing, 2021, 2 (4), pp.1-28. ⟨10.1145/3464693⟩
There exist several graphical languages for quantum information processing, like quantum circuits, ZX-calculus, ZW-calculus, and so on. Each of these languages forms a †-symmetric monoidal category (†-SMC) and comes with an interpretation functor
Publikováno v:
Automata and Complexity
Automata and Complexity, 42, Springer, Cham, pp.417-432, 2022, 978-3-030-92553-6. ⟨10.1007/978-3-030-92551-2_23⟩
Automata and Complexity ISBN: 9783030925505
Automata and Complexity, 42, Springer, Cham, pp.417-432, 2022, 978-3-030-92553-6. ⟨10.1007/978-3-030-92551-2_23⟩
Automata and Complexity ISBN: 9783030925505
International audience; We present a bio-inspired mechanism for data clustering. Our method uses amoebae which evolve according to cellular automata rules: they contain the data to be processed and emit reaction-diffusion waves at random times. The w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dbd21d196f43c6097f2b0434a75fee0e
https://inria.hal.science/hal-02973830
https://inria.hal.science/hal-02973830
Publikováno v:
ICTAC 2021-18th International Colloquium on Theoretical Aspects of Computing
ICTAC 2021-18th International Colloquium on Theoretical Aspects of Computing, Sep 2021, Nur-Sultan/Virtual, Kazakhstan. pp.357-365, ⟨10.1007/978-3-030-85315-0_20⟩
Theoretical Aspects of Computing – ICTAC 2021 ISBN: 9783030853143
ICTAC
ICTAC 2021-18th International Colloquium on Theoretical Aspects of Computing, Sep 2021, Nur-Sultan/Virtual, Kazakhstan. pp.357-365, ⟨10.1007/978-3-030-85315-0_20⟩
Theoretical Aspects of Computing – ICTAC 2021 ISBN: 9783030853143
ICTAC
International audience; ComplexityParser is a static complexity analyzer for Java programs providing the first implementation of a tier-based typing discipline. The input is a file containing Java classes. If the main method can be typed and, provide
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e80a94d4f2be2c474a90ab2145a85f4e
https://hal.inria.fr/hal-03337755/file/ictac-tool.pdf
https://hal.inria.fr/hal-03337755/file/ictac-tool.pdf
Publikováno v:
Theory of Computing Systems
Theory of Computing Systems, Springer Verlag, 2020, 64 (1), pp.35-61. ⟨10.1007/s00224-019-09931-1⟩
Theory of Computing Systems, 2020, 64 (1), pp.35-61. ⟨10.1007/s00224-019-09931-1⟩
Theory of Computing Systems, Springer Verlag, 2020, 64 (1), pp.35-61. ⟨10.1007/s00224-019-09931-1⟩
Theory of Computing Systems, 2020, 64 (1), pp.35-61. ⟨10.1007/s00224-019-09931-1⟩
In this paper we study the directions of periodicity of multidimensional subshifts of finite type (SFTs) and of multidimensional effectively closed and sofic subshifts. A configuration of a subshift has a slope of periodicity if it is periodic in exa