BibTeX records: Jérémie Roland

download as .bib file

@article{DBLP:journals/corr/abs-2402-15855,
  author       = {Atul Singh Arora and
                  J{\'{e}}r{\'{e}}mie Roland and
                  Chrysoula Vlachou and
                  Stephan Weis},
  title        = {Protocols for Quantum Weak Coin Flipping},
  journal      = {CoRR},
  volume       = {abs/2402.15855},
  year         = {2024},
  url          = {https://doi.org/10.48550/arXiv.2402.15855},
  doi          = {10.48550/ARXIV.2402.15855},
  eprinttype    = {arXiv},
  eprint       = {2402.15855},
  timestamp    = {Mon, 25 Mar 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2402-15855.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/AroraRVW22,
  author       = {Atul Singh Arora and
                  J{\'{e}}r{\'{e}}mie Roland and
                  Chrysoula Vlachou and
                  Stephan Weis},
  title        = {Solutions to quantum weak coin flipping},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {1101},
  year         = {2022},
  url          = {https://eprint.iacr.org/2022/1101},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/AroraRVW22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AroraRV21,
  author       = {Atul Singh Arora and
                  J{\'{e}}r{\'{e}}mie Roland and
                  Chrysoula Vlachou},
  editor       = {D{\'{a}}niel Marx},
  title        = {Analytic quantum weak coin flipping protocols with arbitrarily small
                  bias},
  booktitle    = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
                  {SODA} 2021, Virtual Conference, January 10 - 13, 2021},
  pages        = {919--938},
  publisher    = {{SIAM}},
  year         = {2021},
  url          = {https://doi.org/10.1137/1.9781611976465.58},
  doi          = {10.1137/1.9781611976465.58},
  timestamp    = {Thu, 15 Jul 2021 13:48:55 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/AroraRV21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-12746,
  author       = {Simon Apers and
                  Shantanav Chakraborty and
                  Leonardo Novo and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {Quadratic speedup for spatial search by continuous-time quantum walk},
  journal      = {CoRR},
  volume       = {abs/2112.12746},
  year         = {2021},
  url          = {https://arxiv.org/abs/2112.12746},
  eprinttype    = {arXiv},
  eprint       = {2112.12746},
  timestamp    = {Wed, 05 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2112-12746.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-06305,
  author       = {Shantanav Chakraborty and
                  Kyle Luh and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {How fast do quantum walks mix?},
  journal      = {CoRR},
  volume       = {abs/2001.06305},
  year         = {2020},
  url          = {https://arxiv.org/abs/2001.06305},
  eprinttype    = {arXiv},
  eprint       = {2001.06305},
  timestamp    = {Sat, 23 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2001-06305.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AroraRW19,
  author       = {Atul Singh Arora and
                  J{\'{e}}r{\'{e}}mie Roland and
                  Stephan Weis},
  editor       = {Moses Charikar and
                  Edith Cohen},
  title        = {Quantum weak coin flipping},
  booktitle    = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
                  of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
  pages        = {205--216},
  publisher    = {{ACM}},
  year         = {2019},
  url          = {https://doi.org/10.1145/3313276.3316306},
  doi          = {10.1145/3313276.3316306},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/AroraRW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-06473,
  author       = {Jean Cardinal and
                  Gwena{\"{e}}l Joret and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {Information-theoretic lower bounds for quantum sorting},
  journal      = {CoRR},
  volume       = {abs/1902.06473},
  year         = {2019},
  url          = {http://arxiv.org/abs/1902.06473},
  eprinttype    = {arXiv},
  eprint       = {1902.06473},
  timestamp    = {Tue, 21 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1902-06473.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-11895,
  author       = {Shantanav Chakraborty and
                  Kyle Luh and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {On analog quantum algorithms for the mixing of Markov chains},
  journal      = {CoRR},
  volume       = {abs/1904.11895},
  year         = {2019},
  url          = {http://arxiv.org/abs/1904.11895},
  eprinttype    = {arXiv},
  eprint       = {1904.11895},
  timestamp    = {Sat, 23 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1904-11895.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-05957,
  author       = {Shantanav Chakraborty and
                  Leonardo Novo and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {Finding a marked node on any graph by continuous time quantum walk},
  journal      = {CoRR},
  volume       = {abs/1807.05957},
  year         = {2018},
  url          = {http://arxiv.org/abs/1807.05957},
  eprinttype    = {arXiv},
  eprint       = {1807.05957},
  timestamp    = {Sat, 23 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1807-05957.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-02984,
  author       = {Atul Singh Arora and
                  J{\'{e}}r{\'{e}}mie Roland and
                  Stephan Weis},
  title        = {Quantum Weak Coin Flipping},
  journal      = {CoRR},
  volume       = {abs/1811.02984},
  year         = {2018},
  url          = {http://arxiv.org/abs/1811.02984},
  eprinttype    = {arXiv},
  eprint       = {1811.02984},
  timestamp    = {Mon, 26 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1811-02984.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KroviMOR16,
  author       = {Hari Krovi and
                  Fr{\'{e}}d{\'{e}}ric Magniez and
                  Maris Ozols and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {Quantum Walks Can Find a Marked Element on Any Graph},
  journal      = {Algorithmica},
  volume       = {74},
  number       = {2},
  pages        = {851--907},
  year         = {2016},
  url          = {https://doi.org/10.1007/s00453-015-9979-8},
  doi          = {10.1007/S00453-015-9979-8},
  timestamp    = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KroviMOR16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/FontesJKLLR16,
  author       = {Lila Fontes and
                  Rahul Jain and
                  Iordanis Kerenidis and
                  Sophie Laplante and
                  Mathieu Lauri{\`{e}}re and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {Relative Discrepancy Does Not Separate Information and Communication
                  Complexity},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {9},
  number       = {1},
  pages        = {4:1--4:15},
  year         = {2016},
  url          = {https://doi.org/10.1145/2967605},
  doi          = {10.1145/2967605},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/FontesJKLLR16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tqc/LaplanteLNRS16,
  author       = {Sophie Laplante and
                  Mathieu Lauri{\`{e}}re and
                  Alexandre Nolin and
                  J{\'{e}}r{\'{e}}mie Roland and
                  Gabriel Senno},
  editor       = {Anne Broadbent},
  title        = {Robust Bell Inequalities from Communication Complexity},
  booktitle    = {11th Conference on the Theory of Quantum Computation, Communication
                  and Cryptography, {TQC} 2016, September 27-29, 2016, Berlin, Germany},
  series       = {LIPIcs},
  volume       = {61},
  pages        = {5:1--5:24},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.TQC.2016.5},
  doi          = {10.4230/LIPICS.TQC.2016.5},
  timestamp    = {Sun, 25 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/tqc/LaplanteLNRS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LaplanteLNRS16,
  author       = {Sophie Laplante and
                  Mathieu Lauri{\`{e}}re and
                  Alexandre Nolin and
                  J{\'{e}}r{\'{e}}mie Roland and
                  Gabriel Senno},
  title        = {Robust Bell inequalities from communication complexity},
  journal      = {CoRR},
  volume       = {abs/1606.09514},
  year         = {2016},
  url          = {http://arxiv.org/abs/1606.09514},
  eprinttype    = {arXiv},
  eprint       = {1606.09514},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/LaplanteLNRS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KerenidisLLRX15,
  author       = {Iordanis Kerenidis and
                  Sophie Laplante and
                  Virginie Lerays and
                  J{\'{e}}r{\'{e}}mie Roland and
                  David Xiao},
  title        = {Lower Bounds on Information Complexity via Zero-Communication Protocols
                  and Applications},
  journal      = {{SIAM} J. Comput.},
  volume       = {44},
  number       = {5},
  pages        = {1550--1572},
  year         = {2015},
  url          = {https://doi.org/10.1137/130928273},
  doi          = {10.1137/130928273},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KerenidisLLRX15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FontesJKLLR15,
  author       = {Lila Fontes and
                  Rahul Jain and
                  Iordanis Kerenidis and
                  Sophie Laplante and
                  Mathieu Lauri{\`{e}}re and
                  J{\'{e}}r{\'{e}}mie Roland},
  editor       = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
                  Kazuo Iwama and
                  Naoki Kobayashi and
                  Bettina Speckmann},
  title        = {Relative Discrepancy Does not Separate Information and Communication
                  Complexity},
  booktitle    = {Automata, Languages, and Programming - 42nd International Colloquium,
                  {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {9134},
  pages        = {506--516},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-47672-7\_41},
  doi          = {10.1007/978-3-662-47672-7\_41},
  timestamp    = {Fri, 27 Mar 2020 09:02:59 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/FontesJKLLR15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tqc/BrandehoR15,
  author       = {Mathieu Brandeho and
                  J{\'{e}}r{\'{e}}mie Roland},
  editor       = {Salman Beigi and
                  Robert K{\"{o}}nig},
  title        = {A Universal Adiabatic Quantum Query Algorithm},
  booktitle    = {10th Conference on the Theory of Quantum Computation, Communication
                  and Cryptography, {TQC} 2015, May 20-22, 2015, Brussels, Belgium},
  series       = {LIPIcs},
  volume       = {44},
  pages        = {163--179},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2015},
  url          = {https://doi.org/10.4230/LIPIcs.TQC.2015.163},
  doi          = {10.4230/LIPICS.TQC.2015.163},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/tqc/BrandehoR15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FontesJKLLR15,
  author       = {Lila Fontes and
                  Rahul Jain and
                  Iordanis Kerenidis and
                  Sophie Laplante and
                  Mathieu Lauri{\`{e}}re and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {Relative Discrepancy does not separate Information and Communication
                  Complexity},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR15-028}},
  year         = {2015},
  url          = {https://eccc.weizmann.ac.il/report/2015/028},
  eprinttype    = {ECCC},
  eprint       = {TR15-028},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/FontesJKLLR15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrandehoR14,
  author       = {Mathieu Brandeho and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {An optimal adiabatic quantum query algorithm},
  journal      = {CoRR},
  volume       = {abs/1409.3558},
  year         = {2014},
  url          = {http://arxiv.org/abs/1409.3558},
  eprinttype    = {arXiv},
  eprint       = {1409.3558},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BrandehoR14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LeeR13,
  author       = {Troy Lee and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {A strong direct product theorem for quantum query complexity},
  journal      = {Comput. Complex.},
  volume       = {22},
  number       = {2},
  pages        = {429--462},
  year         = {2013},
  url          = {https://doi.org/10.1007/s00037-013-0066-8},
  doi          = {10.1007/S00037-013-0066-8},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/LeeR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/OzolsRR13,
  author       = {Maris Ozols and
                  Martin Roetteler and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {Quantum rejection sampling},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {5},
  number       = {3},
  pages        = {11:1--11:33},
  year         = {2013},
  url          = {https://doi.org/10.1145/2493252.2493256},
  doi          = {10.1145/2493252.2493256},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/OzolsRR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MagninR13,
  author       = {Lo{\"{\i}}ck Magnin and
                  J{\'{e}}r{\'{e}}mie Roland},
  editor       = {Natacha Portier and
                  Thomas Wilke},
  title        = {Explicit relation between all lower bound techniques for quantum query
                  complexity},
  booktitle    = {30th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
  series       = {LIPIcs},
  volume       = {20},
  pages        = {434--445},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2013},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2013.434},
  doi          = {10.4230/LIPICS.STACS.2013.434},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/MagninR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LeeR12,
  author       = {Troy Lee and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {A Strong Direct Product Theorem for Quantum Query Complexity},
  booktitle    = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
                  2012, Porto, Portugal, June 26-29, 2012},
  pages        = {236--246},
  publisher    = {{IEEE} Computer Society},
  year         = {2012},
  url          = {https://doi.org/10.1109/CCC.2012.17},
  doi          = {10.1109/CCC.2012.17},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/LeeR12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KerenidisLLRX12,
  author       = {Iordanis Kerenidis and
                  Sophie Laplante and
                  Virginie Lerays and
                  J{\'{e}}r{\'{e}}mie Roland and
                  David Xiao},
  title        = {Lower Bounds on Information Complexity via Zero-Communication Protocols
                  and Applications},
  booktitle    = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
                  2012, New Brunswick, NJ, USA, October 20-23, 2012},
  pages        = {500--509},
  publisher    = {{IEEE} Computer Society},
  year         = {2012},
  url          = {https://doi.org/10.1109/FOCS.2012.68},
  doi          = {10.1109/FOCS.2012.68},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/KerenidisLLRX12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/LaplanteLR12,
  author       = {Sophie Laplante and
                  Virginie Lerays and
                  J{\'{e}}r{\'{e}}mie Roland},
  editor       = {Artur Czumaj and
                  Kurt Mehlhorn and
                  Andrew M. Pitts and
                  Roger Wattenhofer},
  title        = {Classical and Quantum Partition Bound and Detector Inefficiency},
  booktitle    = {Automata, Languages, and Programming - 39th International Colloquium,
                  {ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {7391},
  pages        = {617--628},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-31594-7\_52},
  doi          = {10.1007/978-3-642-31594-7\_52},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/LaplanteLR12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/OzolsRR12,
  author       = {Maris Ozols and
                  Martin Roetteler and
                  J{\'{e}}r{\'{e}}mie Roland},
  editor       = {Shafi Goldwasser},
  title        = {Quantum rejection sampling},
  booktitle    = {Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA,
                  January 8-10, 2012},
  pages        = {290--308},
  publisher    = {{ACM}},
  year         = {2012},
  url          = {https://doi.org/10.1145/2090236.2090261},
  doi          = {10.1145/2090236.2090261},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/innovations/OzolsRR12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-4155,
  author       = {Sophie Laplante and
                  Virginie Lerays and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {Classical and quantum partition bound and detector inefficiency},
  journal      = {CoRR},
  volume       = {abs/1203.4155},
  year         = {2012},
  url          = {http://arxiv.org/abs/1203.4155},
  eprinttype    = {arXiv},
  eprint       = {1203.4155},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1203-4155.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-1505,
  author       = {Iordanis Kerenidis and
                  Sophie Laplante and
                  Virginie Lerays and
                  J{\'{e}}r{\'{e}}mie Roland and
                  David Xiao},
  title        = {Lower bounds on information complexity via zero-communication protocols
                  and applications},
  journal      = {CoRR},
  volume       = {abs/1204.1505},
  year         = {2012},
  url          = {http://arxiv.org/abs/1204.1505},
  eprinttype    = {arXiv},
  eprint       = {1204.1505},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1204-1505.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1209-2713,
  author       = {Lo{\"{\i}}ck Magnin and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {Explicit relation between all lower bound techniques for quantum query
                  complexity},
  journal      = {CoRR},
  volume       = {abs/1209.2713},
  year         = {2012},
  url          = {http://arxiv.org/abs/1209.2713},
  eprinttype    = {arXiv},
  eprint       = {1209.2713},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1209-2713.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KerenidisLLRX12,
  author       = {Iordanis Kerenidis and
                  Sophie Laplante and
                  Virginie Lerays and
                  J{\'{e}}r{\'{e}}mie Roland and
                  David Xiao},
  title        = {Lower bounds on information complexity via zero-communication protocols
                  and applications},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR12-038}},
  year         = {2012},
  url          = {https://eccc.weizmann.ac.il/report/2012/038},
  eprinttype    = {ECCC},
  eprint       = {TR12-038},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/KerenidisLLRX12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LaplanteLR12,
  author       = {Sophie Laplante and
                  Virginie Lerays and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {Classical and quantum partition bound and detector inefficiency},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR12-023}},
  year         = {2012},
  url          = {https://eccc.weizmann.ac.il/report/2012/023},
  eprinttype    = {ECCC},
  eprint       = {TR12-023},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/LaplanteLR12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MagninR12,
  author       = {Lo{\"{\i}}ck Magnin and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {Explicit relation between all lower bound techniques for quantum query
                  complexity},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR12-117}},
  year         = {2012},
  url          = {https://eccc.weizmann.ac.il/report/2012/117},
  eprinttype    = {ECCC},
  eprint       = {TR12-117},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/MagninR12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qic/KaplanLKR11,
  author       = {Marc Kaplan and
                  Sophie Laplante and
                  Iordanis Kerenidis and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {Non-local box complexity and secure function evaluation},
  journal      = {Quantum Inf. Comput.},
  volume       = {11},
  number       = {1{\&}2},
  pages        = {40--69},
  year         = {2011},
  url          = {https://doi.org/10.26421/QIC11.1-2-4},
  doi          = {10.26421/QIC11.1-2-4},
  timestamp    = {Thu, 29 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/qic/KaplanLKR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qic/DegorreKLR11,
  author       = {Julien Degorre and
                  Marc Kaplan and
                  Sophie Laplante and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {The communication complexity of non-signaling distributions},
  journal      = {Quantum Inf. Comput.},
  volume       = {11},
  number       = {7{\&}8},
  pages        = {649--676},
  year         = {2011},
  url          = {https://doi.org/10.26421/QIC11.7-8-8},
  doi          = {10.26421/QIC11.7-8-8},
  timestamp    = {Thu, 29 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/qic/DegorreKLR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MagniezNRS11,
  author       = {Fr{\'{e}}d{\'{e}}ric Magniez and
                  Ashwin Nayak and
                  J{\'{e}}r{\'{e}}mie Roland and
                  Miklos Santha},
  title        = {Search via Quantum Walk},
  journal      = {{SIAM} J. Comput.},
  volume       = {40},
  number       = {1},
  pages        = {142--164},
  year         = {2011},
  url          = {https://doi.org/10.1137/090745854},
  doi          = {10.1137/090745854},
  timestamp    = {Mon, 18 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/MagniezNRS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AmbainisMRR11,
  author       = {Andris Ambainis and
                  Lo{\"{\i}}ck Magnin and
                  Martin Roetteler and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {Symmetry-Assisted Adversaries for Quantum State Generation},
  booktitle    = {Proceedings of the 26th Annual {IEEE} Conference on Computational
                  Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
  pages        = {167--177},
  publisher    = {{IEEE} Computer Society},
  year         = {2011},
  url          = {https://doi.org/10.1109/CCC.2011.24},
  doi          = {10.1109/CCC.2011.24},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/AmbainisMRR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/GavinskyRR11,
  author       = {Dmitry Gavinsky and
                  Martin Roetteler and
                  J{\'{e}}r{\'{e}}mie Roland},
  editor       = {Bin Fu and
                  Ding{-}Zhu Du},
  title        = {Quantum Algorithm for the Boolean Hidden Shift Problem},
  booktitle    = {Computing and Combinatorics - 17th Annual International Conference,
                  {COCOON} 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6842},
  pages        = {158--167},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22685-4\_14},
  doi          = {10.1007/978-3-642-22685-4\_14},
  timestamp    = {Tue, 14 May 2019 10:00:35 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoon/GavinskyRR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-2774,
  author       = {Maris Ozols and
                  Martin Roetteler and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {Quantum rejection sampling},
  journal      = {CoRR},
  volume       = {abs/1103.2774},
  year         = {2011},
  url          = {http://arxiv.org/abs/1103.2774},
  eprinttype    = {arXiv},
  eprint       = {1103.2774},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1103-2774.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-3017,
  author       = {Dmitry Gavinsky and
                  Martin Roetteler and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {Quantum algorithm for the Boolean hidden shift problem},
  journal      = {CoRR},
  volume       = {abs/1103.3017},
  year         = {2011},
  url          = {http://arxiv.org/abs/1103.3017},
  eprinttype    = {arXiv},
  eprint       = {1103.3017},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1103-3017.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-4468,
  author       = {Troy Lee and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {A strong direct product theorem for quantum query complexity},
  journal      = {CoRR},
  volume       = {abs/1104.4468},
  year         = {2011},
  url          = {http://arxiv.org/abs/1104.4468},
  eprinttype    = {arXiv},
  eprint       = {1104.4468},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1104-4468.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KroviMOR10,
  author       = {Hari Krovi and
                  Fr{\'{e}}d{\'{e}}ric Magniez and
                  Maris Ozols and
                  J{\'{e}}r{\'{e}}mie Roland},
  editor       = {Samson Abramsky and
                  Cyril Gavoille and
                  Claude Kirchner and
                  Friedhelm Meyer auf der Heide and
                  Paul G. Spirakis},
  title        = {Finding Is as Easy as Detecting for Quantum Walks},
  booktitle    = {Automata, Languages and Programming, 37th International Colloquium,
                  {ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
                  {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {6198},
  pages        = {540--551},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-14165-2\_46},
  doi          = {10.1007/978-3-642-14165-2\_46},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/KroviMOR10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1012-2112,
  author       = {Andris Ambainis and
                  Lo{\"{\i}}ck Magnin and
                  Martin Roetteler and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {Symmetry-assisted adversaries for quantum state generation},
  journal      = {CoRR},
  volume       = {abs/1012.2112},
  year         = {2010},
  url          = {http://arxiv.org/abs/1012.2112},
  eprinttype    = {arXiv},
  eprint       = {1012.2112},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1012-2112.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AmbainisMRR10,
  author       = {Andris Ambainis and
                  Lo{\"{\i}}ck Magnin and
                  Martin Roetteler and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {Symmetry-assisted adversaries for quantum state generation},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR10-191}},
  year         = {2010},
  url          = {https://eccc.weizmann.ac.il/report/2010/191},
  eprinttype    = {ECCC},
  eprint       = {TR10-191},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/AmbainisMRR10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/KaplanKLR09,
  author       = {Marc Kaplan and
                  Iordanis Kerenidis and
                  Sophie Laplante and
                  J{\'{e}}r{\'{e}}mie Roland},
  editor       = {Ravi Kannan and
                  K. Narayan Kumar},
  title        = {Non-Local Box Complexity and Secure Function Evaluation},
  booktitle    = {{IARCS} Annual Conference on Foundations of Software Technology and
                  Theoretical Computer Science, {FSTTCS} 2009, December 15-17, 2009,
                  {IIT} Kanpur, India},
  series       = {LIPIcs},
  volume       = {4},
  pages        = {239--250},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2009},
  url          = {https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2322},
  doi          = {10.4230/LIPICS.FSTTCS.2009.2322},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/fsttcs/KaplanKLR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/RolandS09,
  author       = {J{\'{e}}r{\'{e}}mie Roland and
                  Mario Szegedy},
  editor       = {Susanne Albers and
                  Alberto Marchetti{-}Spaccamela and
                  Yossi Matias and
                  Sotiris E. Nikoletseas and
                  Wolfgang Thomas},
  title        = {Amortized Communication Complexity of Distributions},
  booktitle    = {Automata, Languages and Programming, 36th International Colloquium,
                  {ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {5555},
  pages        = {738--749},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-02927-1\_61},
  doi          = {10.1007/978-3-642-02927-1\_61},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/RolandS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DegorreKLR09,
  author       = {Julien Degorre and
                  Marc Kaplan and
                  Sophie Laplante and
                  J{\'{e}}r{\'{e}}mie Roland},
  editor       = {Rastislav Kr{\'{a}}lovic and
                  Damian Niwinski},
  title        = {The Communication Complexity of Non-signaling Distributions},
  booktitle    = {Mathematical Foundations of Computer Science 2009, 34th International
                  Symposium, {MFCS} 2009, Novy Smokovec, High Tatras, Slovakia, August
                  24-28, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5734},
  pages        = {270--281},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03816-7\_24},
  doi          = {10.1007/978-3-642-03816-7\_24},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/DegorreKLR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0908-2782,
  author       = {Boris Altshuler and
                  Hari Krovi and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {Adiabatic quantum optimization fails for random instances of NP-complete
                  problems},
  journal      = {CoRR},
  volume       = {abs/0908.2782},
  year         = {2009},
  url          = {http://arxiv.org/abs/0908.2782},
  eprinttype    = {arXiv},
  eprint       = {0908.2782},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0908-2782.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0912-0746,
  author       = {Boris Altshuler and
                  Hari Krovi and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {Anderson localization casts clouds over adiabatic quantum optimization},
  journal      = {CoRR},
  volume       = {abs/0912.0746},
  year         = {2009},
  url          = {http://arxiv.org/abs/0912.0746},
  eprinttype    = {arXiv},
  eprint       = {0912.0746},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0912-0746.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qic/AcevedoRC08,
  author       = {Olga Lopez{-}Acevedo and
                  J{\'{e}}r{\'{e}}mie Roland and
                  Nicolas J. Cerf},
  title        = {Exploring scalar quantum walks on Cayley graphs},
  journal      = {Quantum Inf. Comput.},
  volume       = {8},
  number       = {1},
  pages        = {68--81},
  year         = {2008},
  url          = {https://doi.org/10.26421/QIC8.1-2-5},
  doi          = {10.26421/QIC8.1-2-5},
  timestamp    = {Thu, 29 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/qic/AcevedoRC08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DegorreKLR08,
  author       = {Julien Degorre and
                  Marc Kaplan and
                  Sophie Laplante and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {The communication complexity of non-signaling distributions},
  journal      = {CoRR},
  volume       = {abs/0804.4859},
  year         = {2008},
  url          = {http://arxiv.org/abs/0804.4859},
  eprinttype    = {arXiv},
  eprint       = {0804.4859},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DegorreKLR08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MagniezNRS07,
  author       = {Fr{\'{e}}d{\'{e}}ric Magniez and
                  Ashwin Nayak and
                  J{\'{e}}r{\'{e}}mie Roland and
                  Miklos Santha},
  editor       = {David S. Johnson and
                  Uriel Feige},
  title        = {Search via quantum walk},
  booktitle    = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
                  San Diego, California, USA, June 11-13, 2007},
  pages        = {575--584},
  publisher    = {{ACM}},
  year         = {2007},
  url          = {https://doi.org/10.1145/1250790.1250874},
  doi          = {10.1145/1250790.1250874},
  timestamp    = {Mon, 18 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/MagniezNRS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MagniezNRS06,
  author       = {Fr{\'{e}}d{\'{e}}ric Magniez and
                  Ashwin Nayak and
                  J{\'{e}}r{\'{e}}mie Roland and
                  Miklos Santha},
  title        = {Search via Quantum Walk},
  journal      = {CoRR},
  volume       = {abs/quant-ph/0608026},
  year         = {2006},
  url          = {http://arxiv.org/abs/quant-ph/0608026},
  eprinttype    = {arXiv},
  eprint       = {quant-ph/0608026},
  timestamp    = {Mon, 18 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/MagniezNRS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics