Claude Gravel

dblp:127/7427 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2026
0000-0001-5275-4953ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2026 Constructing a Parameterized Polynomial Map Through Functional Graphs and Applications
Hugo Teixeira, Claude Gravel, Daniel Panario
WAIFI2
2020 Finding Linearly Generated Subsequences
Claude Gravel, Daniel Panario, Bastien Rigault
WAIFI1
2016 Exact Classical Simulation of the Quantum-Mechanical GHZ Distribution
abstract
John Bell has shown that the correlations entailed by quantum mechanics cannot be reproduced by a classical process involving non-communicating parties. But can they be simulated with the help of bounded communication? This problem has been studied for more than two decades, and it is now well understood in the case of bipartite entanglement. However, the issue was still widely open for multipartite entanglement, even for the simplest case, which is the tripartite Greenberger- Horne-Zeilinger (GHZ) state. We give an exact simulation of arbitrary independent von Neumann measurements on general n-partite GHZ states. Our protocol requires O(n2) bits of expected communication between the parties, and O(n log n) expected time is sufficient to carry it out in parallel. Furthermore, we need only an expectation of O(n) independent unbiased random bits, with no need for the generation of continuous real random variables nor prior shared random variables. In the case of equatorial measurements, we improve on the prior art with a protocol that needs only O(n log n) bits of communication and O(log2n) parallel time. At the cost of a slight increase in the number of bits communicated, these tasks can be accomplished with a constant expected number of rounds.
Gilles Brassard, Luc Devroye, Claude Gravel
IEEE Trans. Inf. Theory3