Exploring scalar quantum walks on Cayley graphs. - Olga Lopez-Acevedo; Jérémie Roland; Nicolas J. Cerf (Quantum Inf. Comput., 2008)

Amortized Communication Complexity of Distributions. - Jérémie Roland; Mario Szegedy (ICALP (1), 2009)

Adiabatic quantum optimization fails for random instances of NP-complete problems - Boris Altshuler; Hari Krovi; Jérémie Roland (CoRR, 2009)

Anderson localization casts clouds over adiabatic quantum optimization - Boris Altshuler; Hari Krovi; Jérémie Roland (CoRR, 2009)

Finding Is as Easy as Detecting for Quantum Walks. - Hari Krovi; Frédéric Magniez; Maris Ozols; Jérémie Roland (ICALP (1), 2010)

Symmetry-assisted adversaries for quantum state generation. - Andris Ambainis; Loïck Magnin; Martin Roetteler; Jérémie Roland (Electron. Colloquium Comput. Complex., 2010)

Quantum Algorithm for the Boolean Hidden Shift Problem. - Dmitry Gavinsky; Martin Roetteler; Jérémie Roland (COCOON, 2011)

The communication complexity of non-signaling distributions. - Julien Degorre; Marc Kaplan; Sophie Laplante; Jérémie Roland (Quantum Inf. Comput., 2011)

Non-local box complexity and secure function evaluation. - Marc Kaplan; Sophie Laplante; Iordanis Kerenidis; Jérémie Roland (Quantum Inf. Comput., 2011)

Search via Quantum Walk. - Frédéric Magniez; Ashwin Nayak 001; Jérémie Roland; Miklos Santha (SIAM J. Comput., 2011)

Classical and quantum partition bound and detector inefficiency. - Sophie Laplante; Virginie Lerays; Jérémie Roland (Electron. Colloquium Comput. Complex., 2012)

Explicit relation between all lower bound techniques for quantum query complexity. - Loïck Magnin; Jérémie Roland (Electron. Colloquium Comput. Complex., 2012)

A strong direct product theorem for quantum query complexity. - Troy Lee; Jérémie Roland (Comput. Complex., 2013)

Quantum rejection sampling. - Maris Ozols; Martin Roetteler; Jérémie Roland (ACM Trans. Comput. Theory, 2013)

An optimal adiabatic quantum query algorithm. - Mathieu Brandeho; Jérémie Roland (CoRR, 2014)

A Universal Adiabatic Quantum Query Algorithm. - Mathieu Brandeho; Jérémie Roland (TQC, 2015)

Relative Discrepancy does not separate Information and Communication Complexity. - Lila Fontes; Rahul Jain 001; Iordanis Kerenidis; Sophie Laplante; Mathieu Laurière; Jérémie Roland (Electron. Colloquium Comput. Complex., 2015)

Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. - Iordanis Kerenidis; Sophie Laplante; Virginie Lerays; Jérémie Roland; David Xiao (SIAM J. Comput., 2015)

Quantum Walks Can Find a Marked Element on Any Graph. - Hari Krovi; Frédéric Magniez; Maris Ozols; Jérémie Roland (Algorithmica, 2016)

Finding a marked node on any graph by continuous time quantum walk. - Shantanav Chakraborty; Leonardo Novo; Jérémie Roland (CoRR, 2018)

Robust Bell inequalities from communication complexity. - Sophie Laplante; Mathieu Laurière; Alexandre Nolin; Jérémie Roland; Gabriel Senno (Quantum, 2018)

Quantum weak coin flipping. - Atul Singh Arora; Jérémie Roland; Stephan Weis (STOC, 2019)

Information-theoretic lower bounds for quantum sorting. - Jean Cardinal; Gwenaël Joret; Jérémie Roland (CoRR, 2019)

On analog quantum algorithms for the mixing of Markov chains. - Shantanav Chakraborty; Kyle Luh; Jérémie Roland (CoRR, 2019)

How fast do quantum walks mix? - Shantanav Chakraborty; Kyle Luh; Jérémie Roland (CoRR, 2020)

Analytic quantum weak coin flipping protocols with arbitrarily small bias. - Atul Singh Arora; Jérémie Roland; Chrysoula Vlachou (SODA, 2021)

Quadratic speedup for spatial search by continuous-time quantum walk. - Simon Apers; Shantanav Chakraborty; Leonardo Novo; Jérémie Roland (CoRR, 2021)

Solutions to quantum weak coin flipping. - Atul Singh Arora; Jérémie Roland; Chrysoula Vlachou; Stephan Weis (IACR Cryptol. ePrint Arch., 2022)

Eigenpath Traversal by Poisson-Distributed Phase Randomisation. - Joseph Cunningham; Jérémie Roland (TQC, 2024)

Protocols for Quantum Weak Coin Flipping. - Atul Singh Arora; Jérémie Roland; Chrysoula Vlachou; Stephan Weis (CoRR, 2024)

Unstructured Adiabatic Quantum Optimization: Optimality with Limitations. - Arthur Braida; Shantanav Chakraborty; Alapan Chaudhuri; Joseph Cunningham; Rutvij Menavlikar; Leonardo Novo; Jérémie Roland (Quantum, 2025)