25 citations · 122 across the 26 of their papers we have counts for
36 papers
Combinatorial Search for Strong Shift Equivalence
Emmanuel Jeandel
The most important open problem of symbolic dynamics consists in finding a procedure to decide whether two subshifts of finite type are conjugate or, equivalently, whether two nonn…
Invariants in Linear Optics
Sébastien Draux, Simon Perdrix, Emmanuel Jeandel +1
Linear optics (LO) prohibits certain transformations. In this paper, we study the conditions for a computation to be possible in LO. We find that there are finitely many polynomial…
Addition and Differentiation of ZX-diagrams
Emmanuel Jeandel, Simon Perdrix, Margarita Veshchezerova
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…
Qimaera: Type-safe (Variational) Quantum Programming in Idris
Liliane-Joy Dandy, Emmanuel Jeandel, Vladimir Zamdzhiev
Variational Quantum Algorithms are hybrid classical-quantum algorithms where classical and quantum computation work in tandem to solve computational problems. These algorithms crea…
Strong shift equivalence as a category notion
Emmanuel Jeandel
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 n…
Qualifying quantum approaches for hard industrial optimization problems. A case study in the field of smart-charging of electric vehicles
Constantin Dalyac, Loïc Henriet, Emmanuel Jeandel +4
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 -- expone…