Mermin polynomials for non-locality and entanglement detection in Grover’s algorithm and Quantum Fourier Transform

Autor: Pierre-Alain Masson, Frédéric Holweck, Henri de Boutray, Alain Giorgetti, Hamza Jaffali

Publikováno v: Quantum Information Processing
Quantum Information Processing, Springer Verlag, 2021, 20 (3), pp.91 (29)

International audience; The non-locality and thus the presence of entanglement of a quantum system can be detected using Mermin polynomials. This gives us a means to study non-locality evolution during the execution of quantum algorithms. We first co

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16c1add20c41204c1bb5a3b6333e077c
https://hal.archives-ouvertes.fr/hal-03221875/file/7fbf2026-0b5b-4901-933a-33615fd65ef1-author.pdf

Approximating Event System Abstractions by Covering Their States and Transitions

Autor: Olga Kouchnarenko, Guillaume Voiron, Pierre-Alain Masson, Jacques Julliand

Publikováno v: Lecture Notes in Computer Science ISBN: 9783319743127
Ershov Informatics Conference

In event systems, contrarily to sequential ones, the control flow is implicit. Consequently, their abstraction may give rise to disconnected and unreachable paths. This paper presents an algorithmic method for computing a reachable and connected unde

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::5c5203e01923a6400e5e73019c8b0c18
https://doi.org/10.1007/978-3-319-74313-4_16

Two under-approximation techniques for 3-modal abstraction coverage of event systems: Joint effort?

Autor: Pierre-Alain Masson, Olga Kouchnarenko, Guillaume Voiron, Jacques Julliand

Publikováno v: TASE

Model-based testing of event systems can take advantage of considering abstractions rather than explicit models, for controlling their size. A test is then a connected and reachable event sequence. This paper reports on experiments made when adapting

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::a83ac0e33b90ee1b78ec13f594a2695e
https://doi.org/10.1109/tase.2017.8285632

Non-Deterministic Timed Pushdown Automata-Based Testing Evaluated by Mutation

Autor: Jacques Julliand, Riadh Robbana, Pierre-Alain Masson, M'Hemdi Hana

Publikováno v: International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises
International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises, Jun 2015, Larnaca, Cyprus
WETICE

International audience; This paper is about conformance testing of non deterministic timed pushdown automata with inputs and outputs (TPAIO), that specify both stack and clock constraints. It proposes a novel off-line test generation method from this

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5818f0b283dae15062e30383cda119cf
https://hal.archives-ouvertes.fr/hal-03020526

Test generation from timed pushdown automata with inputs and outputs

Autor: Pierre-Alain Masson, Hana M'Hemdi, Riadh Robbana, Jacques Julliand

Publikováno v: ICST Workshops
A-MOST 2015, 11th Workshop on Advances in Model Based Testing. Co-located with ICST 2015
A-MOST 2015, 11th Workshop on Advances in Model Based Testing. Co-located with ICST 2015, 2015, Graz, Austria. pp.***--***

International audience; We consider in this paper the model of Timed Pushdown Automata with Inputs and Outputs (TPAIO), for which state reachability can only be solved in exponential time. We compute by means of a polynomial algorithm a reachability

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a955ccbf46c5cebb56cb4585d411127a
https://doi.org/10.1109/icstw.2015.7107404