HTML Export for TQC 2018

Copy to Clipboard Download

<h2>LIPIcs, Volume 111, TQC 2018</h2>
<ul>
<li>
    <span class="authors">Stacey Jeffery</span>
    <span class="title">LIPIcs, Volume 111, TQC&#039;18, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2018">10.4230/LIPIcs.TQC.2018</a>
</li>
<li>
    <span class="authors">Stacey Jeffery</span>
    <span class="title">Front Matter, Table of Contents</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2018.0">10.4230/LIPIcs.TQC.2018.0</a>
</li>
<li>
    <span class="authors">Yfke Dulek and Florian Speelman</span>
    <span class="title">Quantum Ciphertext Authentication and Key Recycling with the Trap Code</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2018.1">10.4230/LIPIcs.TQC.2018.1</a>
</li>
<li>
    <span class="authors">Dorit Aharonov, Oded Kenneth, and Itamar Vigdorovich</span>
    <span class="title">On the Complexity of Two Dimensional Commuting Local Hamiltonians</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2018.2">10.4230/LIPIcs.TQC.2018.2</a>
</li>
<li>
    <span class="authors">Aleksandrs Belovs and Ansis Rosmanis</span>
    <span class="title">Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2018.3">10.4230/LIPIcs.TQC.2018.3</a>
</li>
<li>
    <span class="authors">Chris Cade and Ashley Montanaro</span>
    <span class="title">The Quantum Complexity of Computing Schatten p-norms</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2018.4">10.4230/LIPIcs.TQC.2018.4</a>
</li>
<li>
    <span class="authors">Alexander Helm and Alexander May</span>
    <span class="title">Subset Sum Quantumly in 1.17^n</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2018.5">10.4230/LIPIcs.TQC.2018.5</a>
</li>
<li>
    <span class="authors">Adam Bouland and Maris Ozols</span>
    <span class="title">Trading Inverses for an Irrep in the Solovay-Kitaev Theorem</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2018.6">10.4230/LIPIcs.TQC.2018.6</a>
</li>
<li>
    <span class="authors">Wim van Dam and Raymond Wong</span>
    <span class="title">Two-qubit Stabilizer Circuits with Recovery I: Existence</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2018.7">10.4230/LIPIcs.TQC.2018.7</a>
</li>
<li>
    <span class="authors">Wim van Dam and Raymond Wong</span>
    <span class="title">Two-qubit Stabilizer Circuits with Recovery II: Analysis</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2018.8">10.4230/LIPIcs.TQC.2018.8</a>
</li>
<li>
    <span class="authors">Kostyantyn Kechedzhi, Vadim Smelyanskiy, Jarrod R. McClean, Vasil S. Denchev, Masoud Mohseni, Sergei Isakov, Sergio Boixo, Boris Altshuler, and Hartmut Neven</span>
    <span class="title">Efficient Population Transfer via Non-Ergodic Extended States in Quantum Spin Glass</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2018.9">10.4230/LIPIcs.TQC.2018.9</a>
</li>
<li>
    <span class="authors">Seunghoan Song and Masahito Hayashi</span>
    <span class="title">Quantum Network Code for Multiple-Unicast Network with Quantum Invertible Linear Operations</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2018.10">10.4230/LIPIcs.TQC.2018.10</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

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail