Jérémie Roland

According to our database, Jérémie Roland authored at least 29 papers between 2008 and 2024.

Collaborative distances:

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

2024

Protocols for Quantum Weak Coin Flipping.

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

CoRR, 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

Relative Discrepancy does not separate Information and Communication Complexity.

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

Electron. Colloquium Comput. Complex., 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

2014

An optimal adiabatic quantum query algorithm.

Mathieu Brandeho, Jérémie Roland

CoRR, 2014

2013

Quantum rejection sampling.

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

ACM Trans. Comput. Theory, 2013

A strong direct product theorem for quantum query complexity.

Troy Lee, Jérémie Roland

Comput. Complex., 2013

2012

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

Loïck Magnin, Jérémie Roland

Electron. Colloquium Comput. Complex., 2012

Classical and quantum partition bound and detector inefficiency.

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

Electron. Colloquium Comput. Complex., 2012

Lower bounds on information complexity via zero-communication protocols and applications.

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

Electron. Colloquium Comput. Complex., 2012

2011

Search via Quantum Walk.

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

SIAM J. Comput., 2011

Non-local box complexity and secure function evaluation.

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

Quantum Inf. Comput., 2011

The communication complexity of non-signaling distributions.

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

Quantum Inf. Comput., 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

2010

Symmetry-assisted adversaries for quantum state generation.

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

Electron. Colloquium Comput. Complex., 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

Amortized Communication Complexity of Distributions.

Jérémie Roland, Mario Szegedy

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

2008

Exploring scalar quantum walks on Cayley graphs.

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

Quantum Inf. Comput., 2008