Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Jérémie
    Last name: Roland
    DBLP: 11/7187
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 25 of 32  
    Select a publication
    Show Title Venue Rating Date
    Journal article
    Mathieu Brandeho, Jérémie Roland.
    An optimal adiabatic quantum query algorithm.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Loïck Magnin, Jérémie Roland.
    Explicit relation between all lower bound techniques for quantum query complexity.
    30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013 (0) 2013
    Conference paper
    Troy Lee, Jérémie Roland.
    A strong direct product theorem for quantum query complexity.
    Computational Complexity 2013, Volume 22 (0) 2013
    Conference paper
    Maris Ozols, Martin Rötteler, Jérémie Roland.
    Quantum rejection sampling.
    TOCT 2013, Volume 5 (0) 2013
    Conference paper
    Maris Ozols, Martin Rötteler, Jérémie Roland.
    Quantum rejection sampling.
    Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA, January 8-10, 2012 2012 (0) 2012
    Conference paper
    Sophie Laplante, Virginie Lerays, Jérémie Roland.
    Classical and Quantum Partition Bound and Detector Inefficiency.
    Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I 2012 (0) 2012
    Conference paper
    Troy Lee, Jérémie Roland.
    A Strong Direct Product Theorem for Quantum Query Complexity.
    Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012 2012 (0) 2012
    Journal article
    Loïck Magnin, Jérémie Roland.
    Explicit relation between all lower bound techniques for quantum query complexity
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Sophie Laplante, Virginie Lerays, Jérémie Roland.
    Classical and quantum partition bound and detector inefficiency
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao.
    Lower bounds on information complexity via zero-communication protocols and applications
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao.
    Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications.
    53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012 2012 (0) 2012
    Conference paper
    Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao.
    Lower bounds on information complexity via zero-communication protocols and applications.
    Electronic Colloquium on Computational Complexity (ECCC) 2012, Volume 19 (0) 2012
    Conference paper
    Loïck Magnin, Jérémie Roland.
    Explicit relation between all lower bound techniques for quantum query complexity.
    Electronic Colloquium on Computational Complexity (ECCC) 2012, Volume 19 (0) 2012
    Conference paper
    Sophie Laplante, Virginie Lerays, Jérémie Roland.
    Classical and quantum partition bound and detector inefficiency.
    Electronic Colloquium on Computational Complexity (ECCC) 2012, Volume 19 (0) 2012
    Journal article
    Maris Ozols, Martin Rötteler, Jérémie Roland.
    Quantum rejection sampling
    CoRR 2011, Volume 0 (0) 2011
    Journal article
    Dmitry Gavinsky, Martin Rötteler, Jérémie Roland.
    Quantum algorithm for the Boolean hidden shift problem
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha.
    Search via Quantum Walk.
    SIAM J. Comput. 2011, Volume 40 (0) 2011
    Journal article
    Troy Lee, Jérémie Roland.
    A strong direct product theorem for quantum query complexity
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Andris Ambainis, Loïck Magnin, Martin Rötteler, Jérémie Roland.
    Symmetry-Assisted Adversaries for Quantum State Generation.
    Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, June 8-10, 2011 2011 (0) 2011
    Conference paper
    Dmitry Gavinsky, Martin Rötteler, Jérémie Roland.
    Quantum Algorithm for the Boolean Hidden Shift Problem.
    Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings 2011 (0) 2011
    Journal article
    Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland.
    The communication complexity of non-signaling distributions.
    Quantum Information Computation 2011, Volume 11 (0) 2011
    Conference paper
    Marc Kaplan, Sophie Laplante, Iordanis Kerenidis, Jérémie Roland.
    Non-local box complexity and secure function evaluation.
    Quantum Information Computation 2011, Volume 11 (0) 2011
    Conference paper
    Hari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland.
    Finding Is as Easy as Detecting for Quantum Walks.
    Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I 2010 (0) 2010
    Conference paper
    Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland.
    Symmetry-assisted adversaries for quantum state generation.
    Electronic Colloquium on Computational Complexity (ECCC) 2010, Volume 17 (0) 2010
    Journal article
    Andris Ambainis, Loïck Magnin, Martin Rötteler, Jérémie Roland.
    Symmetry-assisted adversaries for quantum state generation
    CoRR 2010, Volume 0 (0) 2010
    Show item 1 to 25 of 32  

    Your query returned 32 matches in the database.