Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Mehdi Mhalla"'
Publikováno v:
Physical Review Research, Vol 6, Iss 3, p L032020 (2024)
The standard model of quantum circuits assumes operations are applied in a fixed sequential “causal” order. In recent years, the possibility of relaxing this constraint to obtain causally indefinite computations has received significant attention
Externí odkaz:
https://doaj.org/article/02099d886d4d44ab8085dae8591d958c
Publikováno v:
Quantum, Vol 8, p 1376 (2024)
We investigate what quantum advantages can be obtained in multipartite non-cooperative games by studying how different types of quantum resources can lead to new Nash equilibria and improve social welfare — a measure of the quality of an equilibriu
Externí odkaz:
https://doaj.org/article/daeef5a06e934d18aad8913f0691fbbd
Publikováno v:
Quantum, Vol 8, p 1334 (2024)
The inherent degeneracy of quantum low-density parity-check codes poses a challenge to their decoding, as it significantly degrades the error-correction performance of classical message-passing decoders. To improve their performance, a post-processin
Externí odkaz:
https://doaj.org/article/7f15e5f5aeb24e4a889a881a75caa8e6
Autor:
Paul Dorbec, Mehdi Mhalla
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 266, Iss Proc. QPL 2017, Pp 237-248 (2018)
In this paper, we propose a Quantum variation of combinatorial games, generalizing the Quantum Tic-Tac-Toe proposed by Allan Goff. A combinatorial game is a two-player game with no chance and no hidden information, such as Go or Chess. In this paper,
Externí odkaz:
https://doaj.org/article/e51a0514feeb4a51b6671037e56c5bae
Publikováno v:
Quantum, Vol 4, p 333 (2020)
A completely depolarising quantum channel always outputs a fully mixed state and thus cannot transmit any information. In a recent Letter\cite{ebler18}, it was however shown that if a quantum state passes through two such channels in a quantum superp
Externí odkaz:
https://doaj.org/article/0fcf8e7355074eb5b88a1dc2e1bf1220
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 9, Iss Proc. DCM 2009, Pp 87-97 (2009)
The entangled graph states have emerged as an elegant and powerful quantum resource, indeed almost all multiparty protocols can be written in terms of graph states including measurement based quantum computation (MBQC), error correction and secret sh
Externí odkaz:
https://doaj.org/article/f8a680173979473fb17ee03b7a1fc55c
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031308284
We propose a superposition-based proof procedure to reason on equational first order formulas defined over graphs. First, we introduce the considered graphs that are directed labeled graphs with lists of roots standing for pins or interfaces for repl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3392188767e02804ab50688d0b1a30e
https://doi.org/10.1007/978-3-031-30829-1_7
https://doi.org/10.1007/978-3-031-30829-1_7
We propose a post-processing method for message-passing (MP) decoding of CSS quantum LDPC codes, called stabilizer-inactivation (SI). It relies on inactivating a set of qubits, supporting a check in the dual code, and then running the MP decoding aga
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ebaa917e2663569fc34144fab628bf82
Publikováno v:
ISIT
We provide a generalization of quantum polar codes to quantum channels with qudit-input, achieving the symmetric coherent information of the channel. Our scheme relies on a channel combining and splitting construction, where a two-qudit unitary rando
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ee9d96a99990516bcd47adfcaee87257
https://doi.org/10.1109/isit45174.2021.9517845
https://doi.org/10.1109/isit45174.2021.9517845
Publikováno v:
PPDP 2021: 23rd International Symposium on Principles and Practice of Declarative Programming
PPDP 2021: 23rd International Symposium on Principles and Practice of Declarative Programming, 2021, Tallinn, Estonia. ⟨10.1145/3479394.3479405⟩
PPDP
PPDP 2021: 23rd International Symposium on Principles and Practice of Declarative Programming, 2021, Tallinn, Estonia. ⟨10.1145/3479394.3479405⟩
PPDP
International audience; We introduce a class of rooted graphs which are expressive enough to encode various kinds of classical or quantum circuits. We then follow a set-theoretic approach to define rewrite systems over the considered graphs. Afterwar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6fc49cbc205c9f2d1e669fe8efa4c443
https://hal.archives-ouvertes.fr/hal-03372948
https://hal.archives-ouvertes.fr/hal-03372948