Jérémie Roland

58 papers A* 4A 4B 1Misc 1Journal 40Unranked 8

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