HTML Export for TQC 2020

Copy to Clipboard Download

<h2>LIPIcs, Volume 158, TQC 2020</h2>
<ul>
<li>
    <span class="authors">Steven T. Flammia</span>
    <span class="title">LIPIcs, Volume 158, TQC 2020, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2020">10.4230/LIPIcs.TQC.2020</a>
</li>
<li>
    <span class="authors">Steven T. Flammia</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2020.0">10.4230/LIPIcs.TQC.2020.0</a>
</li>
<li>
    <span class="authors">João F. Doriguello and Ashley Montanaro</span>
    <span class="title">Exponential Quantum Communication Reductions from Generalizations of the Boolean Hidden Matching Problem</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2020.1">10.4230/LIPIcs.TQC.2020.1</a>
</li>
<li>
    <span class="authors">Nikhil S. Mande, Justin Thaler, and Shuchen Zhu</span>
    <span class="title">Improved Approximate Degree Bounds for k-Distinctness</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2020.2">10.4230/LIPIcs.TQC.2020.2</a>
</li>
<li>
    <span class="authors">Ulysse Chabaud, Tom Douce, Frédéric Grosshans, Elham Kashefi, and Damian Markham</span>
    <span class="title">Building Trust for Continuous Variable Quantum States</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2020.3">10.4230/LIPIcs.TQC.2020.3</a>
</li>
<li>
    <span class="authors">Anne Broadbent and Sébastien Lord</span>
    <span class="title">Uncloneable Quantum Encryption via Oracles</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2020.4">10.4230/LIPIcs.TQC.2020.4</a>
</li>
<li>
    <span class="authors">Tom Bannink, Jop Briët, Farrokh Labib, and Hans Maassen</span>
    <span class="title">Quasirandom Quantum Channels</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2020.5">10.4230/LIPIcs.TQC.2020.5</a>
</li>
<li>
    <span class="authors">Anne Broadbent, Sevag Gharibian, and Hong-Sheng Zhou</span>
    <span class="title">Towards Quantum One-Time Memories from Stateless Hardware</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2020.6">10.4230/LIPIcs.TQC.2020.6</a>
</li>
<li>
    <span class="authors">Anurag Anshu, David Gosset, and Karen Morenz</span>
    <span class="title">Beyond Product State Approximations for a Quantum Analogue of Max Cut</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2020.7">10.4230/LIPIcs.TQC.2020.7</a>
</li>
<li>
    <span class="authors">Zvika Brakerski, Venkata Koppula, Umesh Vazirani, and Thomas Vidick</span>
    <span class="title">Simpler Proofs of Quantumness</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2020.8">10.4230/LIPIcs.TQC.2020.8</a>
</li>
<li>
    <span class="authors">Andris Ambainis and Nikita Larka</span>
    <span class="title">Quantum Algorithms for Computational Geometry Problems</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2020.9">10.4230/LIPIcs.TQC.2020.9</a>
</li>
<li>
    <span class="authors">Srinivasan Arunachalam, Aleksandrs Belovs, Andrew M. Childs, Robin Kothari, Ansis Rosmanis, and Ronald de Wolf</span>
    <span class="title">Quantum Coupon Collector</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2020.10">10.4230/LIPIcs.TQC.2020.10</a>
</li>
<li>
    <span class="authors">Niel de Beaudrap, Xiaoning Bian, and Quanlong Wang</span>
    <span class="title">Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2020.11">10.4230/LIPIcs.TQC.2020.11</a>
</li>
<li>
    <span class="authors">Srijita Kundu, Jamie Sikora, and Ernest Y.-Z. Tan</span>
    <span class="title">A Device-Independent Protocol for XOR Oblivious Transfer</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2020.12">10.4230/LIPIcs.TQC.2020.12</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