default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJérémie Roland
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Joseph Cunningham, Jérémie Roland:
Eigenpath Traversal by Poisson-Distributed Phase Randomisation. TQC 2024: 7:1-7:20- [i27]Atul Singh Arora, Jérémie Roland, Chrysoula Vlachou, Stephan Weis:
Protocols for Quantum Weak Coin Flipping. CoRR abs/2402.15855 (2024) - [i26]Joseph Cunningham, Jérémie Roland:
Eigenpath traversal by Poisson-distributed phase randomisation. CoRR abs/2406.03972 (2024) - 2022
- [i25]Atul Singh Arora, Jérémie Roland, Chrysoula Vlachou, Stephan Weis:
Solutions to quantum weak coin flipping. IACR Cryptol. ePrint Arch. 2022: 1101 (2022) - 2021
- [c17]Atul Singh Arora, Jérémie Roland, Chrysoula Vlachou
:
Analytic quantum weak coin flipping protocols with arbitrarily small bias. SODA 2021: 919-938 - [i24]Simon Apers, Shantanav Chakraborty, Leonardo Novo, Jérémie Roland:
Quadratic speedup for spatial search by continuous-time quantum walk. CoRR abs/2112.12746 (2021) - 2020
- [i23]Shantanav Chakraborty, Kyle Luh, Jérémie Roland:
How fast do quantum walks mix? CoRR abs/2001.06305 (2020)
2010 – 2019
- 2019
- [c16]Atul Singh Arora, Jérémie Roland, Stephan Weis:
Quantum weak coin flipping. STOC 2019: 205-216 - [i22]Jean Cardinal, Gwenaël Joret, Jérémie Roland:
Information-theoretic lower bounds for quantum sorting. CoRR abs/1902.06473 (2019) - [i21]Shantanav Chakraborty, Kyle Luh, Jérémie Roland:
On analog quantum algorithms for the mixing of Markov chains. CoRR abs/1904.11895 (2019) - 2018
- [i20]Shantanav Chakraborty, Leonardo Novo, Jérémie Roland:
Finding a marked node on any graph by continuous time quantum walk. CoRR abs/1807.05957 (2018) - [i19]Atul Singh Arora, Jérémie Roland, Stephan Weis:
Quantum Weak Coin Flipping. CoRR abs/1811.02984 (2018) - 2016
- [j9]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): 851-907 (2016) - [j8]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): 4:1-4:15 (2016) - [c15]Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie Roland, Gabriel Senno:
Robust Bell Inequalities from Communication Complexity. TQC 2016: 5:1-5:24 - [i18]Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie Roland, Gabriel Senno:
Robust Bell inequalities from communication complexity. CoRR abs/1606.09514 (2016) - 2015
- [j7]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): 1550-1572 (2015) - [c14]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: 506-516 - [c13]Mathieu Brandeho, Jérémie Roland:
A Universal Adiabatic Quantum Query Algorithm. TQC 2015: 163-179 - [i17]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. TR15 (2015) - 2014
- [i16]Mathieu Brandeho, Jérémie Roland:
An optimal adiabatic quantum query algorithm. CoRR abs/1409.3558 (2014) - 2013
- [j6]Troy Lee, Jérémie Roland:
A strong direct product theorem for quantum query complexity. Comput. Complex. 22(2): 429-462 (2013) - [j5]Maris Ozols, Martin Roetteler, Jérémie Roland:
Quantum rejection sampling. ACM Trans. Comput. Theory 5(3): 11:1-11:33 (2013) - [c12]Loïck Magnin, Jérémie Roland:
Explicit relation between all lower bound techniques for quantum query complexity. STACS 2013: 434-445 - 2012
- [c11]Troy Lee, Jérémie Roland:
A Strong Direct Product Theorem for Quantum Query Complexity. CCC 2012: 236-246 - [c10]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: 500-509 - [c9]Sophie Laplante, Virginie Lerays, Jérémie Roland:
Classical and Quantum Partition Bound and Detector Inefficiency. ICALP (1) 2012: 617-628 - [c8]Maris Ozols, Martin Roetteler, Jérémie Roland:
Quantum rejection sampling. ITCS 2012: 290-308 - [i15]Sophie Laplante, Virginie Lerays, Jérémie Roland:
Classical and quantum partition bound and detector inefficiency. CoRR abs/1203.4155 (2012) - [i14]Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao:
Lower bounds on information complexity via zero-communication protocols and applications. CoRR abs/1204.1505 (2012) - [i13]Loïck Magnin, Jérémie Roland:
Explicit relation between all lower bound techniques for quantum query complexity. CoRR abs/1209.2713 (2012) - [i12]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. TR12 (2012) - [i11]Sophie Laplante, Virginie Lerays, Jérémie Roland:
Classical and quantum partition bound and detector inefficiency. Electron. Colloquium Comput. Complex. TR12 (2012) - [i10]Loïck Magnin, Jérémie Roland:
Explicit relation between all lower bound techniques for quantum query complexity. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j4]Marc Kaplan, Sophie Laplante, Iordanis Kerenidis, Jérémie Roland:
Non-local box complexity and secure function evaluation. Quantum Inf. Comput. 11(1&2): 40-69 (2011) - [j3]Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland:
The communication complexity of non-signaling distributions. Quantum Inf. Comput. 11(7&8): 649-676 (2011) - [j2]Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha:
Search via Quantum Walk. SIAM J. Comput. 40(1): 142-164 (2011) - [c7]Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland:
Symmetry-Assisted Adversaries for Quantum State Generation. CCC 2011: 167-177 - [c6]Dmitry Gavinsky, Martin Roetteler, Jérémie Roland:
Quantum Algorithm for the Boolean Hidden Shift Problem. COCOON 2011: 158-167 - [i9]Maris Ozols, Martin Roetteler, Jérémie Roland:
Quantum rejection sampling. CoRR abs/1103.2774 (2011) - [i8]Dmitry Gavinsky, Martin Roetteler, Jérémie Roland:
Quantum algorithm for the Boolean hidden shift problem. CoRR abs/1103.3017 (2011) - [i7]Troy Lee, Jérémie Roland:
A strong direct product theorem for quantum query complexity. CoRR abs/1104.4468 (2011) - 2010
- [c5]Hari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland:
Finding Is as Easy as Detecting for Quantum Walks. ICALP (1) 2010: 540-551 - [i6]Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland:
Symmetry-assisted adversaries for quantum state generation. CoRR abs/1012.2112 (2010) - [i5]Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland:
Symmetry-assisted adversaries for quantum state generation. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c4]Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, Jérémie Roland:
Non-Local Box Complexity and Secure Function Evaluation. FSTTCS 2009: 239-250 - [c3]Jérémie Roland, Mario Szegedy:
Amortized Communication Complexity of Distributions. ICALP (1) 2009: 738-749 - [c2]Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland:
The Communication Complexity of Non-signaling Distributions. MFCS 2009: 270-281 - [i4]Boris Altshuler, Hari Krovi, Jérémie Roland:
Adiabatic quantum optimization fails for random instances of NP-complete problems. CoRR abs/0908.2782 (2009) - [i3]Boris Altshuler, Hari Krovi, Jérémie Roland:
Anderson localization casts clouds over adiabatic quantum optimization. CoRR abs/0912.0746 (2009) - 2008
- [j1]Olga Lopez-Acevedo, Jérémie Roland, Nicolas J. Cerf:
Exploring scalar quantum walks on Cayley graphs. Quantum Inf. Comput. 8(1): 68-81 (2008) - [i2]Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland:
The communication complexity of non-signaling distributions. CoRR abs/0804.4859 (2008) - 2007
- [c1]Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha:
Search via quantum walk. STOC 2007: 575-584 - 2006
- [i1]Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha:
Search via Quantum Walk. CoRR abs/quant-ph/0608026 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-27 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
