Mehdi Mhalla

J. Autom. Reason., March, 2024

Smash and grab: The 0 ⋅ 6 scoring game on graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2024

Vertex-Minor Universal Graphs for Generating Entangled Quantum Subsystems.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

The CHSH inequality: Tsirelson's upper-bound and other results.

[BibT_eX]

[DOI]

Mnacho Echenim

Coraline Mori

Arch. Formal Proofs, 2023

Improved Rate Fault-Tolerant Preparation of Q1 Code-States.

[BibT_eX]

[DOI]

Proceedings of the 12th International Symposium on Topics in Coding, 2023

Layered Decoding of Quantum LDPC Codes.

[BibT_eX]

[DOI]

Julien du Crest

Francisco Garcia-Herrero

Javier Valls

Proceedings of the 12th International Symposium on Topics in Coding, 2023

A Strict Constrained Superposition Calculus for Graphs.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2023

2022

Fault-Tolerant Preparation of Quantum Polar Codes Encoding One Logical Qubit.

[BibT_eX]

[DOI]

CoRR, 2022

Stabilizer Inactivation for Message-Passing Decoding of Quantum LDPC Codes.

[BibT_eX]

[DOI]

Julien du Crest

Proceedings of the IEEE Information Theory Workshop, 2022

2021

Polarization of Quantum Channels Using Clifford-Based Channel Combining.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Multilevel polarization for quantum Channels.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2021

A Superposition-Based Calculus for Quantum Diagrammatic Reasoning and Beyond.

[BibT_eX]

[DOI]

CoRR, 2021

Quantum projective measurements and the CHSH inequality in Isabelle/HOL.

[BibT_eX]

[DOI]

Mnacho Echenim

CoRR, 2021

A Superposition-Based Calculus for Diagrammatic Reasoning.

[BibT_eX]

[DOI]

Proceedings of the PPDP 2021: 23rd International Symposium on Principles and Practice of Declarative Programming, 2021

Coherent Control and Distinguishability of Quantum Channels via PBS-Diagrams.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Quantum Polarization of Qudit Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Communication through coherent control of quantum channels.

[BibT_eX]

[DOI]

Quantum, 2020

How Quantum Information Can Improve Social Welfare.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2020

Contextuality in multipartite pseudo-telepathy graph games.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

Contextuality and Expressivity of Non-locality.

[BibT_eX]

[DOI]

Sacha Huriot-Tattegrain

Proceedings of the Proceedings 17th International Conference on Quantum Physics and Logic, 2020

Trimming Decoding of Color Codes over the Quantum Erasure Channel.

[BibT_eX]

[DOI]

Sangjun Lee

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Purely Quantum Polar Codes.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

2017

Quantum Combinatorial Games.

[BibT_eX]

[DOI]

Paul Dorbec

Proceedings of the Proceedings 14th International Conference on Quantum Physics and Logic, 2017

2016

Contextuality in multipartie pseudo-telepathy graph games.

[BibT_eX]

[DOI]

Peter Høyer

CoRR, 2016

2015

On weak odd domination and graph-based quantum secret sharing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

2013

Pseudo-telepathy games and genuine ns k-way nonlocality using graph states.

[BibT_eX]

[DOI]

Anurag Anshu

Quantum Inf. Comput., 2013

Graph States, Pivot Minor, and Universality of (X, Z)-Measurements.

[BibT_eX]

[DOI]

Int. J. Unconv. Comput., 2013

Gardner's Minichess Variant is Solved.

[BibT_eX]

[DOI]

Frédéric Prost

J. Int. Comput. Games Assoc., 2013

2012

On the Minimum Degree Up to Local Complementation: Bounds and Complexity.

[BibT_eX]

[DOI]

Jérôme Javelle

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

New Protocols and Lower Bounds for Quantum Secret Sharing with Graph States.

[BibT_eX]

[DOI]

Jérôme Javelle

Proceedings of the Theory of Quantum Computation, 2012

Quantum Secret Sharing with Graph States.

[BibT_eX]

[DOI]

Proceedings of the Mathematical and Engineering Methods in Computer Science, 2012

2011

Optimal accessing and non-accessing structures for graph protocols

[BibT_eX]

[DOI]

CoRR, 2011

Which Graph States are Useful for Quantum Information Processing?

[BibT_eX]

[DOI]

Proceedings of the Theory of Quantum Computation, Communication, and Cryptography, 2011

2009

Information Flow in Secret Sharing Protocols.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Fifth Workshop on Developments in Computational Models--Computational Models From Nature, 2009

Combinatorial graph games.

[BibT_eX]

Éric Duchêne

Sylvain Gravier

Ars Comb., 2009

2008

Finding Optimal Flows Efficiently.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2006

Quantum Query Complexity of Some Graph Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2006

Quantum Octal Games.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2006

Resources Required for Preparing Graph States.

[BibT_eX]

[DOI]

Peter Høyer

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2005

Around Wythoff's game.

[BibT_eX]

[DOI]

Éric Duchêne

Sylvain Gravier

Electron. Notes Discret. Math., 2005

2003

On a modular domination game.

[BibT_eX]

[DOI]

Sylvain Gravier

Eric Tannier

Theor. Comput. Sci., 2003

Separability Of Pure N-Qubit States: Two Characterizations.

[BibT_eX]

[DOI]

Philippe Jorrand