Sophie Laplante

Institut de Recherche en Informatique Fondamentale — France

Computer Science · Physical Sciences

15h-index748citations55works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Quantum Computing Algorithms and Architecture(26), Complexity and Algorithms in Graphs(21), Computability, Logic, AI Algorithms(19), Quantum Information and Cryptography(11), Cryptography and Data Security(11)

Publications55 total

Sensitivity conjecture and signed hypercubes
ACM Transactions on Computation Theory·2025Open Access
QuBobs Teaching Kits to Explain Quantum Computing
Lecture notes in computer science·2024
The communication complexity of functions with large outputs
arXiv (Cornell University)·2023Open Access
Certificate Games
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2023· 1 citedOpen Access
The Communication Complexity of Functions with Large Outputs
Lecture notes in computer science·2023Open Access
QuBOBS, interactive objects and a visual representation to explain quantum computing
arXiv (Cornell University)·2022Open Access
Certificate Games
arXiv (Cornell University)·2022Open Access
Sensitivity Lower Bounds from Linear Dependencies
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2020· 3 citedOpen Access
Key Establishment à la Merkle in a Quantum World
Journal of Cryptology·2019Open Access
Robust Bell inequalities from communication complexity
Quantum·2018· 11 citedOpen Access
Provably Secure Key Establishment Against Quantum Adversaries
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2017Open Access
Relative Discrepancy Does Not Separate Information and Communication Complexity
ACM Transactions on Computation Theory·2016· 1 citedOpen Access
Robust Bell Inequalities from Communication Complexity
Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)·2016· 1 citedOpen Access
Balanced Mobiles with applications to phylogenetic trees and Huffman-like problems
SPIRE - Sciences Po Institutional REpository·2015Open Access
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications
SIAM Journal on Computing·2015· 16 cited
Relative Discrepancy Does not Separate Information and Communication Complexity
Lecture notes in computer science·2015· 5 citedOpen Access
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications
2012· 53 citedOpen Access
Lower bounds on information complexity via zero-communication protocols and applications
arXiv (Cornell University)·2012Open Access
Classical and quantum partition bound and detector inefficiency
2012Open Access
Classical and Quantum Partition Bound and Detector Inefficiency
Lecture notes in computer science·2012· 10 citedOpen Access
page 1 of 3Next →

Frequent Co-authors

Jérémie Roland(15), Lance Fortnow(8), Iordanis Kerenidis(7), Marc Kaplan(6), Julien Degorre(5), Virginie Lerays(5), Frédéric Magniez(5), Mathieu Laurière(5), Márió Szegedy(4), Anupa Sunny(4), Troy Lee(3), David Xiao(3), Gilles Brassard(3), Alexandre Nolin(3), Lila Fontes(3), André Berthiaume(2), Wim van Dam(2), Harry Buhrman(2), Peter Høyer(2), Kassem Kalach(2)