Jérémie Roland

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 16

Top Topics

Quantum Computing

Poisson Process

Communication Protocols

Top Venues

ACM Trans. Comput. Theory

IACR Cryptol. ePrint Arch.

Publications

Joseph Cunningham, Jérémie Roland
Eigenpath traversal by Poisson-distributed phase randomisation. CoRR (2024)
Atul Singh Arora, Jérémie Roland, Chrysoula Vlachou, Stephan Weis
Protocols for Quantum Weak Coin Flipping. CoRR (2024)
Joseph Cunningham, Jérémie Roland
Eigenpath Traversal by Poisson-Distributed Phase Randomisation. TQC (2024)
Atul Singh Arora, Jérémie Roland, Chrysoula Vlachou, Stephan Weis
Solutions to quantum weak coin flipping. IACR Cryptol. ePrint Arch. 2022 (2022)
Simon Apers, Shantanav Chakraborty, Leonardo Novo, Jérémie Roland
Quadratic speedup for spatial search by continuous-time quantum walk. CoRR (2021)
Atul Singh Arora, Jérémie Roland, Chrysoula Vlachou
Analytic quantum weak coin flipping protocols with arbitrarily small bias. SODA (2021)
Shantanav Chakraborty, Kyle Luh, Jérémie Roland
How fast do quantum walks mix? CoRR (2020)
Atul Singh Arora, Jérémie Roland, Stephan Weis
Quantum weak coin flipping. STOC (2019)
Shantanav Chakraborty, Kyle Luh, Jérémie Roland
On analog quantum algorithms for the mixing of Markov chains. CoRR (2019)
Jean Cardinal, Gwenaël Joret, Jérémie Roland
Information-theoretic lower bounds for quantum sorting. CoRR (2019)
Atul Singh Arora, Jérémie Roland, Stephan Weis
Quantum Weak Coin Flipping. CoRR (2018)
Shantanav Chakraborty, Leonardo Novo, Jérémie Roland
Finding a marked node on any graph by continuous time quantum walk. CoRR (2018)
Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie Roland, Gabriel Senno
Robust Bell Inequalities from Communication Complexity. TQC (2016)
Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland
Relative Discrepancy Does Not Separate Information and Communication Complexity. ACM Trans. Comput. Theory 9 (1) (2016)
Hari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland
Quantum Walks Can Find a Marked Element on Any Graph. Algorithmica 74 (2) (2016)
Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie Roland, Gabriel Senno
Robust Bell inequalities from communication complexity. CoRR (2016)
Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. SIAM J. Comput. 44 (5) (2015)
Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland
Relative Discrepancy Does not Separate Information and Communication Complexity. ICALP (1) (2015)
Mathieu Brandeho, Jérémie Roland
A Universal Adiabatic Quantum Query Algorithm. TQC (2015)
Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland
Relative Discrepancy does not separate Information and Communication Complexity. Electron. Colloquium Comput. Complex. 22 (2015)
Mathieu Brandeho, Jérémie Roland
An optimal adiabatic quantum query algorithm. CoRR (2014)
Troy Lee, Jérémie Roland
A strong direct product theorem for quantum query complexity. Comput. Complex. 22 (2) (2013)
Loïck Magnin, Jérémie Roland
Explicit relation between all lower bound techniques for quantum query complexity. STACS (2013)
Maris Ozols, Martin Roetteler, Jérémie Roland
Quantum rejection sampling. ACM Trans. Comput. Theory 5 (3) (2013)
Loïck Magnin, Jérémie Roland
Explicit relation between all lower bound techniques for quantum query complexity. Electron. Colloquium Comput. Complex. 19 (2012)
Loïck Magnin, Jérémie Roland
Explicit relation between all lower bound techniques for quantum query complexity CoRR (2012)
Sophie Laplante, Virginie Lerays, Jérémie Roland
Classical and quantum partition bound and detector inefficiency CoRR (2012)
Sophie Laplante, Virginie Lerays, Jérémie Roland
Classical and quantum partition bound and detector inefficiency. Electron. Colloquium Comput. Complex. 19 (2012)
Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao
Lower bounds on information complexity via zero-communication protocols and applications CoRR (2012)
Sophie Laplante, Virginie Lerays, Jérémie Roland
Classical and Quantum Partition Bound and Detector Inefficiency. ICALP (1) (2012)
Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao
Lower bounds on information complexity via zero-communication protocols and applications. Electron. Colloquium Comput. Complex. 19 (2012)
Maris Ozols, Martin Roetteler, Jérémie Roland
Quantum rejection sampling. ITCS (2012)
Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. FOCS (2012)
Troy Lee, Jérémie Roland
A Strong Direct Product Theorem for Quantum Query Complexity. Computational Complexity Conference (2012)
Maris Ozols, Martin Roetteler, Jérémie Roland
Quantum rejection sampling CoRR (2011)
Marc Kaplan, Sophie Laplante, Iordanis Kerenidis, Jérémie Roland
Non-local box complexity and secure function evaluation. Quantum Inf. Comput. 11 (1&2) (2011)
Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland
The communication complexity of non-signaling distributions. Quantum Inf. Comput. 11 (7&8) (2011)
Troy Lee, Jérémie Roland
A strong direct product theorem for quantum query complexity CoRR (2011)
Dmitry Gavinsky, Martin Roetteler, Jérémie Roland
Quantum Algorithm for the Boolean Hidden Shift Problem. COCOON (2011)
Dmitry Gavinsky, Martin Roetteler, Jérémie Roland
Quantum algorithm for the Boolean hidden shift problem CoRR (2011)
Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha
Search via Quantum Walk. SIAM J. Comput. 40 (1) (2011)
Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland
Symmetry-Assisted Adversaries for Quantum State Generation. Computational Complexity Conference (2011)
Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland
Symmetry-assisted adversaries for quantum state generation CoRR (2010)
Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland
Symmetry-assisted adversaries for quantum state generation. Electron. Colloquium Comput. Complex. 17 (2010)
Hari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland
Finding Is as Easy as Detecting for Quantum Walks. ICALP (1) (2010)
Jérémie Roland, Mario Szegedy
Amortized Communication Complexity of Distributions. ICALP (1) (2009)
Boris Altshuler, Hari Krovi, Jérémie Roland
Anderson localization casts clouds over adiabatic quantum optimization CoRR (2009)
Boris Altshuler, Hari Krovi, Jérémie Roland
Adiabatic quantum optimization fails for random instances of NP-complete problems CoRR (2009)
Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland
The Communication Complexity of Non-signaling Distributions. MFCS (2009)
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, Jérémie Roland
Non-Local Box Complexity and Secure Function Evaluation. FSTTCS (2009)
Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland
The communication complexity of non-signaling distributions. CoRR (2008)
Olga Lopez-Acevedo, Jérémie Roland, Nicolas J. Cerf
Exploring scalar quantum walks on Cayley graphs. Quantum Inf. Comput. 8 (1) (2008)
Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha
Search via quantum walk. STOC (2007)
Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha
Search via Quantum Walk. CoRR (2006)