default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMehdi Mhalla
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Mnacho Echenim, Mehdi Mhalla:
A Formalization of the CHSH Inequality and Tsirelson's Upper-bound in Isabelle/HOL. J. Autom. Reason. 68(1): 2 (2024)- [j17]Éric Duchêne, Valentin Gledel, Sylvain Gravier, Fionn Mc Inerney
, Mehdi Mhalla, Aline Parreau:
Smash and grab: The 0 ⋅ 6 scoring game on graphs. Theor. Comput. Sci. 990: 114417 (2024) - [c21]Maxime Cautrès, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin, Stéphan Thomassé:
Vertex-Minor Universal Graphs for Generating Entangled Quantum Subsystems. ICALP 2024: 36:1-36:18 - [i13]Maxime Cautrès, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin, Stéphan Thomassé:
Vertex-minor universal graphs for generating entangled quantum subsystems. CoRR abs/2402.06260 (2024) - 2023
- [j16]Mnacho Echenim, Mehdi Mhalla, Coraline Mori:
The CHSH inequality: Tsirelson's upper-bound and other results. Arch. Formal Proofs 2023 (2023) - [c20]Rachid Echahed, Mnacho Echenim, Mehdi Mhalla, Nicolas Peltier:
A Strict Constrained Superposition Calculus for Graphs. FoSSaCS 2023: 135-155 - [c19]Julien du Crest, Francisco Garcia-Herrero, Mehdi Mhalla, Valentin Savin, Javier Valls:
Layered Decoding of Quantum LDPC Codes. ISTC 2023: 1-5 - [c18]Ashutosh Goswami, Mehdi Mhalla, Valentin Savin:
Improved Rate Fault-Tolerant Preparation of Q1 Code-States. ISTC 2023: 1-5 - [i12]Mnacho Echenim, Mehdi Mhalla:
A formalization of the CHSH inequality and Tsirelson's upper-bound in Isabelle/HOL. CoRR abs/2306.12535 (2023) - 2022
- [c17]Julien du Crest, Mehdi Mhalla, Valentin Savin:
Stabilizer Inactivation for Message-Passing Decoding of Quantum LDPC Codes. ITW 2022: 488-493 - [i11]Julien du Crest, Mehdi Mhalla, Valentin Savin:
Stabilizer Inactivation for Message-Passing Decoding of Quantum LDPC Codes. CoRR abs/2205.06125 (2022) - [i10]Ashutosh Goswami, Mehdi Mhalla, Valentin Savin:
Fault-Tolerant Preparation of Quantum Polar Codes Encoding One Logical Qubit. CoRR abs/2209.06673 (2022) - 2021
- [j15]Ashutosh Goswami, Mehdi Mhalla, Valentin Savin:
Multilevel polarization for quantum Channels. Quantum Inf. Comput. 21(7&8): 577-606 (2021) - [j14]Frédéric Dupuis, Ashutosh Goswami, Mehdi Mhalla, Valentin Savin:
Polarization of Quantum Channels Using Clifford-Based Channel Combining. IEEE Trans. Inf. Theory 67(5): 2857-2877 (2021) - [c16]Ashutosh Goswami, Mehdi Mhalla, Valentin Savin:
Quantum Polarization of Qudit Channels. ISIT 2021: 1487-1492 - [c15]Cyril Branciard, Alexandre Clément, Mehdi Mhalla, Simon Perdrix:
Coherent Control and Distinguishability of Quantum Channels via PBS-Diagrams. MFCS 2021: 22:1-22:20 - [c14]Rachid Echahed, Mnacho Echenim, Mehdi Mhalla, Nicolas Peltier:
A Superposition-Based Calculus for Diagrammatic Reasoning. PPDP 2021: 10:1-10:13 - [i9]Cyril Branciard, Alexandre Clément, Mehdi Mhalla, Simon Perdrix:
Coherent control and distinguishability of quantum channels via PBS-diagrams. CoRR abs/2103.02073 (2021) - [i8]Mnacho Echenim, Mehdi Mhalla:
Quantum projective measurements and the CHSH inequality in Isabelle/HOL. CoRR abs/2103.08535 (2021) - [i7]Rachid Echahed, Mnacho Echenim, Mehdi Mhalla, Nicolas Peltier:
A Superposition-Based Calculus for Quantum Diagrammatic Reasoning and Beyond. CoRR abs/2103.11709 (2021) - 2020
- [j13]Anurag Anshu, Peter Høyer, Mehdi Mhalla, Simon Perdrix:
Contextuality in multipartite pseudo-telepathy graph games. J. Comput. Syst. Sci. 107: 156-165 (2020) - [j12]Berry Groisman, Michael Mc Gettrick, Mehdi Mhalla, Marcin Pawlowski:
How Quantum Information Can Improve Social Welfare. IEEE J. Sel. Areas Inf. Theory 1(2): 445-453 (2020) - [j11]Alastair A. Abbott, Julian Wechs, Dominic Horsman, Mehdi Mhalla, Cyril Branciard:
Communication through coherent control of quantum channels. Quantum 4: 333 (2020) - [c13]Sangjun Lee, Mehdi Mhalla, Valentin Savin:
Trimming Decoding of Color Codes over the Quantum Erasure Channel. ISIT 2020: 1886-1890 - [c12]Sacha Huriot-Tattegrain, Mehdi Mhalla:
Contextuality and Expressivity of Non-locality. QPL 2020: 160-173
2010 – 2019
- 2019
- [c11]Frédéric Dupuis, Ashutosh Goswami, Mehdi Mhalla, Valentin Savin:
Purely Quantum Polar Codes. ITW 2019: 1-5 - [i6]Berry Groisman, Michael Mc Gettrick, Mehdi Mhalla, Marcin Pawlowski:
How Quantum Information can improve Social Welfare. CoRR abs/1912.10967 (2019) - 2017
- [c10]Anurag Anshu, Peter Høyer, Mehdi Mhalla, Simon Perdrix:
Contextuality in Multipartite Pseudo-Telepathy Graph Games. FCT 2017: 41-55 - [c9]Paul Dorbec, Mehdi Mhalla:
Quantum Combinatorial Games. QPL 2017: 237-248 - 2016
- [i5]Peter Høyer, Mehdi Mhalla, Simon Perdrix:
Contextuality in multipartie pseudo-telepathy graph games. CoRR abs/1609.09689 (2016) - 2015
- [j10]Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix:
On weak odd domination and graph-based quantum secret sharing. Theor. Comput. Sci. 598: 129-137 (2015) - 2013
- [j9]Mehdi Mhalla, Frédéric Prost:
Gardner's Minichess Variant is Solved. J. Int. Comput. Games Assoc. 36(4): 215-221 (2013) - [j8]Mehdi Mhalla, Simon Perdrix:
Graph States, Pivot Minor, and Universality of (X, Z)-Measurements. Int. J. Unconv. Comput. 9(1-2): 153-171 (2013) - [j7]Anurag Anshu, Mehdi Mhalla:
Pseudo-telepathy games and genuine ns k-way nonlocality using graph states. Quantum Inf. Comput. 13(9-10): 833-845 (2013) - [i4]Mehdi Mhalla, Frédéric Prost:
Gardner's Minichess Variant is solved. CoRR abs/1307.7118 (2013) - 2012
- [c8]Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix:
Quantum Secret Sharing with Graph States. MEMICS 2012: 15-31 - [c7]Jérôme Javelle, Mehdi Mhalla, Simon Perdrix:
New Protocols and Lower Bounds for Quantum Secret Sharing with Graph States. TQC 2012: 1-12 - [c6]Jérôme Javelle, Mehdi Mhalla, Simon Perdrix:
On the Minimum Degree Up to Local Complementation: Bounds and Complexity. WG 2012: 138-147 - [i3]Jérôme Javelle, Mehdi Mhalla, Simon Perdrix:
On the Minimum Degree up to Local Complementation: Bounds and Complexity. CoRR abs/1204.4564 (2012) - 2011
- [c5]Mehdi Mhalla, Mio Murao, Simon Perdrix, Masato Someya, Peter S. Turner:
Which Graph States are Useful for Quantum Information Processing? TQC 2011: 174-187 - [i2]Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix:
Optimal accessing and non-accessing structures for graph protocols. CoRR abs/1109.6181 (2011) - [i1]Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix:
On Weak Odd Domination and Graph-based Quantum Secret Sharing. CoRR abs/1112.2495 (2011)
2000 – 2009
- 2009
- [j6]Éric Duchêne, Sylvain Gravier, Mehdi Mhalla:
Combinatorial graph games. Ars Comb. 90 (2009) - [c4]Elham Kashefi, Damian Markham, Mehdi Mhalla, Simon Perdrix:
Information Flow in Secret Sharing Protocols. DCM 2009: 87-97 - 2008
- [c3]Mehdi Mhalla, Simon Perdrix:
Finding Optimal Flows Efficiently. ICALP (1) 2008: 857-868 - 2006
- [j5]Sylvain Gravier, Philippe Jorrand, Mehdi Mhalla, Charles Payan:
Quantum Octal Games. Int. J. Found. Comput. Sci. 17(4): 919-932 (2006) - [j4]Christoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla:
Quantum Query Complexity of Some Graph Problems. SIAM J. Comput. 35(6): 1310-1328 (2006) - [c2]Peter Høyer, Mehdi Mhalla, Simon Perdrix:
Resources Required for Preparing Graph States. ISAAC 2006: 638-649 - 2005
- [j3]Éric Duchêne, Sylvain Gravier, Mehdi Mhalla:
Around Wythoff's game. Electron. Notes Discret. Math. 22: 167-172 (2005) - 2004
- [c1]Christoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla:
Quantum Query Complexity of Some Graph Problems. ICALP 2004: 481-493 - 2003
- [j2]Philippe Jorrand, Mehdi Mhalla:
Separability Of Pure N-Qubit States: Two Characterizations. Int. J. Found. Comput. Sci. 14(5): 797-814 (2003) - [j1]Sylvain Gravier, Mehdi Mhalla, Eric Tannier:
On a modular domination game. Theor. Comput. Sci. 306(1-3): 291-303 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
