Jérémie Roland

According to our database, Jérémie Roland authored at least 31 papers between 2007 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

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

2024

Protocols for Quantum Weak Coin Flipping.

Atul Singh Arora, Jérémie Roland, Chrysoula Vlachou, Stephan Weis

CoRR, 2024

Eigenpath Traversal by Poisson-Distributed Phase Randomisation.

Joseph Cunningham, Jérémie Roland

Proceedings of the 19th Conference on the Theory of Quantum Computation, 2024

2022

Solutions to quantum weak coin flipping.

Atul Singh Arora, Jérémie Roland, Chrysoula Vlachou, Stephan Weis

IACR Cryptol. ePrint Arch., 2022

2021

Quadratic speedup for spatial search by continuous-time quantum walk.

Simon Apers, Shantanav Chakraborty, Leonardo Novo, Jérémie Roland

CoRR, 2021

Analytic quantum weak coin flipping protocols with arbitrarily small bias.

Atul Singh Arora, Jérémie Roland, Chrysoula Vlachou

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

How fast do quantum walks mix?

Shantanav Chakraborty, Kyle Luh, Jérémie Roland

CoRR, 2020

2019

On analog quantum algorithms for the mixing of Markov chains.

Shantanav Chakraborty, Kyle Luh, Jérémie Roland

CoRR, 2019

Information-theoretic lower bounds for quantum sorting.

Jean Cardinal, Gwenaël Joret, Jérémie Roland

CoRR, 2019

Quantum weak coin flipping.

Atul Singh Arora, Jérémie Roland, Stephan Weis

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018

Finding a marked node on any graph by continuous time quantum walk.

Shantanav Chakraborty, Leonardo Novo, Jérémie Roland

CoRR, 2018

2016

Quantum Walks Can Find a Marked Element on Any Graph.

Hari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland

Algorithmica, 2016

Robust Bell Inequalities from Communication Complexity.

Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie Roland, Gabriel Senno

Proceedings of the 11th Conference on the Theory of Quantum Computation, 2016

2015

A Universal Adiabatic Quantum Query Algorithm.

Mathieu Brandeho, Jérémie Roland

Proceedings of the 10th Conference on the Theory of Quantum Computation, 2015

Relative Discrepancy Does not Separate Information and Communication Complexity.

Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

An optimal adiabatic quantum query algorithm.

Mathieu Brandeho, Jérémie Roland

CoRR, 2014

2013

Explicit relation between all lower bound techniques for quantum query complexity.

Loïck Magnin, Jérémie Roland

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

2012

Quantum rejection sampling.

Maris Ozols, Martin Roetteler, Jérémie Roland

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

Classical and Quantum Partition Bound and Detector Inefficiency.

Sophie Laplante, Virginie Lerays, Jérémie Roland

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications.

Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

A Strong Direct Product Theorem for Quantum Query Complexity.

Troy Lee, Jérémie Roland

Proceedings of the 27th Conference on Computational Complexity, 2012

2011

Quantum Algorithm for the Boolean Hidden Shift Problem.

Dmitry Gavinsky, Martin Roetteler, Jérémie Roland

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Symmetry-Assisted Adversaries for Quantum State Generation.

Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland

Proceedings of the 26th Annual IEEE Conference on Computational Complexity, 2011

2010

Finding Is as Easy as Detecting for Quantum Walks.

Hari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Anderson localization casts clouds over adiabatic quantum optimization

Boris Altshuler, Hari Krovi, Jérémie Roland

CoRR, 2009

Adiabatic quantum optimization fails for random instances of NP-complete problems

Boris Altshuler, Hari Krovi, Jérémie Roland

CoRR, 2009

The Communication Complexity of Non-signaling Distributions.

Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Amortized Communication Complexity of Distributions.

Jérémie Roland, Mario Szegedy

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Non-Local Box Complexity and Secure Function Evaluation.

Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, Jérémie Roland

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2008

Exploring scalar quantum walks on Cayley graphs.

Olga Lopez-Acevedo, Jérémie Roland, Nicolas J. Cerf

Quantum Inf. Comput., 2008

2007

Search via quantum walk.

Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007