HTML Export for TQC 2016

Copy to Clipboard Download

<h2>LIPIcs, Volume 61, TQC 2016</h2>
<ul>
<li>
    <span class="authors">Anne Broadbent</span>
    <span class="title">LIPIcs, Volume 61, TQC&#039;16, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2016">10.4230/LIPIcs.TQC.2016</a>
</li>
<li>
    <span class="authors">Anne Broadbent</span>
    <span class="title">Front Matter, Table of Contents, Preface, List of Contributed Talks, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2016.0">10.4230/LIPIcs.TQC.2016.0</a>
</li>
<li>
    <span class="authors">Bill Fefferman and Christopher Umans</span>
    <span class="title">On the Power of Quantum Fourier Sampling</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2016.1">10.4230/LIPIcs.TQC.2016.1</a>
</li>
<li>
    <span class="authors">Rotem Arnon-Friedman, Christopher Portmann, and Volkher B. Scholz</span>
    <span class="title">Quantum-Proof Multi-Source Randomness Extractors in the Markov Model</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2016.2">10.4230/LIPIcs.TQC.2016.2</a>
</li>
<li>
    <span class="authors">Anurag Anshu, Ankit Garg, Aram W. Harrow, and Penghui Yao</span>
    <span class="title">Lower Bound on Expected Communication Cost of Quantum Huffman Coding</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2016.3">10.4230/LIPIcs.TQC.2016.3</a>
</li>
<li>
    <span class="authors">Jamie Sikora</span>
    <span class="title">Simple, Near-Optimal Quantum Protocols for Die-Rolling</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2016.4">10.4230/LIPIcs.TQC.2016.4</a>
</li>
<li>
    <span class="authors">Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie Roland, and Gabriel Senno</span>
    <span class="title">Robust Bell Inequalities from Communication Complexity</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2016.5">10.4230/LIPIcs.TQC.2016.5</a>
</li>
<li>
    <span class="authors">Nai-Hui Chia and Sean Hallgren</span>
    <span class="title">How Hard Is Deciding Trivial Versus Nontrivial in the Dihedral Coset Problem?</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2016.6">10.4230/LIPIcs.TQC.2016.6</a>
</li>
<li>
    <span class="authors">Shalev Ben-David</span>
    <span class="title">The Structure of Promises in Quantum Speedups</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2016.7">10.4230/LIPIcs.TQC.2016.7</a>
</li>
<li>
    <span class="authors">Martin Roetteler</span>
    <span class="title">Quantum Algorithms for Abelian Difference Sets and Applications to Dihedral Hidden Subgroups</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2016.8">10.4230/LIPIcs.TQC.2016.8</a>
</li>
<li>
    <span class="authors">Florian Speelman</span>
    <span class="title">Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2016.9">10.4230/LIPIcs.TQC.2016.9</a>
</li>
</ul>

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode