Zobrazeno 1 - 10
of 108
pro vyhledávání: '"Jeandel, Emmanuel"'
Publikováno v:
Logical Methods in Computer Science, Volume 20, Issue 2 (May 20, 2024) lmcs:11049
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:
http://arxiv.org/abs/2202.11386
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:
http://arxiv.org/abs/2111.10867
Autor:
Jeandel, Emmanuel
In this paper, we present a completely radical way to investigate the main problem of symbolic dynamics, the conjugacy problem, by proving that this problem actually relates to a natural question in category theory regarding the theory of traced bial
Externí odkaz:
http://arxiv.org/abs/2107.10734
Autor:
Dalyac, Constantin, Henriet, Loïc, Jeandel, Emmanuel, Lechner, Wolfgang, Perdrix, Simon, Porcheron, Marc, Veshchezerova, Margarita
Publikováno v:
EPJ Quantum Technology 8, 12 (2021)
In order to qualify quantum algorithms for industrial NP-Hard problems, comparing them to available polynomial approximate classical algorithms and not only to exact ones -- exponential by nature -- , is necessary. This is a great challenge as, in ma
Externí odkaz:
http://arxiv.org/abs/2012.14859
Autor:
Carette, Titouan, Jeandel, Emmanuel
Different graphical calculi have been proposed to represent quantum computation. First the ZX- calculus [4], followed by the ZW-calculus [12] and then the ZH-calculus [1]. We can wonder if new Z*-calculi will continue to be proposed forever. This art
Externí odkaz:
http://arxiv.org/abs/2008.04193
Publikováno v:
Logical Methods in Computer Science, Volume 16, Issue 2 (June 4, 2020) lmcs:5288
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:
http://arxiv.org/abs/1903.06035
There exist several graphical languages for quantum information processing, like quantum circuits, ZX-Calculus, ZW-Calculus, etc. Each of these languages forms a dagger-symmetric monoidal category (dagger-SMC) and comes with an interpretation functor
Externí odkaz:
http://arxiv.org/abs/1902.07143
Autor:
Jeandel, Emmanuel
We introduce here a new axiomatisation of the rational fragment of the ZX-calculus, a diagrammatic language for quantum mechanics. Compared to the previous axiomatisation introduced in [8], our axiomatisation does not use any metarule , but relies in
Externí odkaz:
http://arxiv.org/abs/1810.05377
This article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any Turing degree, there exists a subshift whose automorphism group contains a subgroup whose word problem has exactly thi
Externí odkaz:
http://arxiv.org/abs/1808.09194
Recent completeness results on the ZX-Calculus used a third-party language, namely the ZW-Calculus. As a consequence, these proofs are elegant, but sadly non-constructive. We address this issue in the following. To do so, we first describe a generic
Externí odkaz:
http://arxiv.org/abs/1805.05296