HTML Export for TQC 2013

Copy to Clipboard Download

<h2>LIPIcs, Volume 22, TQC 2013</h2>
<ul>
<li>
    <span class="authors">Simone Severini and Fernando Brandao</span>
    <span class="title">LIPIcs, Volume 22, TQC&#039;13, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013">10.4230/LIPIcs.TQC.2013</a>
</li>
<li>
    <span class="authors">Simone Severini and Fernando Brandao</span>
    <span class="title">Frontmatter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.i">10.4230/LIPIcs.TQC.2013.i</a>
</li>
<li>
    <span class="authors">Kerem Halil Shah and Daniel K.L. Oi</span>
    <span class="title">Ancilla Driven Quantum Computation with Arbitrary Entangling Strength</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.1">10.4230/LIPIcs.TQC.2013.1</a>
</li>
<li>
    <span class="authors">Greg Kuperberg</span>
    <span class="title">Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.20">10.4230/LIPIcs.TQC.2013.20</a>
</li>
<li>
    <span class="authors">Joel Klassen, Jianxin Chen, and Bei Zeng</span>
    <span class="title">Universal Entanglers for Bosonic and Fermionic Systems</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.35">10.4230/LIPIcs.TQC.2013.35</a>
</li>
<li>
    <span class="authors">Andrew M. Childs, Robin Kothari, Maris Ozols, and Martin Roetteler</span>
    <span class="title">Easy and Hard Functions for the Boolean Hidden Shift Problem</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.50">10.4230/LIPIcs.TQC.2013.50</a>
</li>
<li>
    <span class="authors">Alessandro Cosentino, Robin Kothari, and Adam Paetznick</span>
    <span class="title">Dequantizing Read-once Quantum Formulas</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.80">10.4230/LIPIcs.TQC.2013.80</a>
</li>
<li>
    <span class="authors">Nathaniel Johnston</span>
    <span class="title">The Minimum Size of Qubit Unextendible Product Bases</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.93">10.4230/LIPIcs.TQC.2013.93</a>
</li>
<li>
    <span class="authors">Christopher E. Granade, Christopher Ferrie, Nathan Wiebe, and D. G. Cory</span>
    <span class="title">Robust Online Hamiltonian Learning</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.106">10.4230/LIPIcs.TQC.2013.106</a>
</li>
<li>
    <span class="authors">Kevin C. Zatloukal</span>
    <span class="title">Classical and Quantum Algorithms for Testing Equivalence of Group Extensions</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.126">10.4230/LIPIcs.TQC.2013.126</a>
</li>
<li>
    <span class="authors">Andris Ambainis and Janis Iraids</span>
    <span class="title">Provable Advantage for Quantum Strategies in Random Symmetric XOR Games</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.146">10.4230/LIPIcs.TQC.2013.146</a>
</li>
<li>
    <span class="authors">Mark M. Wilde, Olivier Landon-Cardinal, and Patrick Hayden</span>
    <span class="title">Towards Efficient Decoding of Classical-Quantum Polar Codes</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.157">10.4230/LIPIcs.TQC.2013.157</a>
</li>
<li>
    <span class="authors">Giulio Chiribella, Giacomo Mauro D&#039;Ariano, and Martin Roetteler</span>
    <span class="title">On the Query Complexity of Perfect Gate Discrimination</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.178">10.4230/LIPIcs.TQC.2013.178</a>
</li>
<li>
    <span class="authors">Salman Beigi, Jianxin Chen, Markus Grassl, Zhengfeng Ji, Qiang Wang, and Bei Zeng</span>
    <span class="title">Symmetries of Codeword Stabilized Quantum Codes</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.192">10.4230/LIPIcs.TQC.2013.192</a>
</li>
<li>
    <span class="authors">Gonzalo de la Torre, Chirag Dhara, and Antonio Acin</span>
    <span class="title">Certifying the Absence of Apparent Randomness under Minimal Assumptions</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.207">10.4230/LIPIcs.TQC.2013.207</a>
</li>
<li>
    <span class="authors">Yuxiang Yang and Giulio Chiribella</span>
    <span class="title">Is Global Asymptotic Cloning State Estimation?</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.220">10.4230/LIPIcs.TQC.2013.220</a>
</li>
<li>
    <span class="authors">Guillaume Duclos-Cianci and Krysta M. Svore</span>
    <span class="title">Distillation of Non-Stabilizer States for Universal Quantum Computation</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.235">10.4230/LIPIcs.TQC.2013.235</a>
</li>
<li>
    <span class="authors">Akira SaiToh</span>
    <span class="title">Realistic Cost for the Model of Coherent Computing</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.244">10.4230/LIPIcs.TQC.2013.244</a>
</li>
<li>
    <span class="authors">Carl A. Miller and Yaoyun Shi</span>
    <span class="title">Optimal Robust Self-Testing by Binary Nonlocal XOR Games</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.254">10.4230/LIPIcs.TQC.2013.254</a>
</li>
<li>
    <span class="authors">Andris Ambainis, Janis Iraids, and Juris Smotrovs</span>
    <span class="title">Exact Quantum Query Complexity of EXACT and THRESHOLD</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.263">10.4230/LIPIcs.TQC.2013.263</a>
</li>
<li>
    <span class="authors">Noah Linden, Frantisek Matus, Mary Beth Ruskai, and Andreas Winter</span>
    <span class="title">The Quantum Entropy Cone of Stabiliser States</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.270">10.4230/LIPIcs.TQC.2013.270</a>
</li>
<li>
    <span class="authors">Guillaume Duclos-Cianci and David Poulin</span>
    <span class="title">Kitaev&#039;s Z_d-Codes Threshold Estimates</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.285">10.4230/LIPIcs.TQC.2013.285</a>
</li>
<li>
    <span class="authors">David J. Rosenbaum</span>
    <span class="title">Optimal Quantum Circuits for Nearest-Neighbor Architectures</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.294">10.4230/LIPIcs.TQC.2013.294</a>
</li>
<li>
    <span class="authors">Anne Marin, Damian Markham, and Simon Perdrix</span>
    <span class="title">Access Structure in Graphs in High Dimension and Application to Secret Sharing</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2013.308">10.4230/LIPIcs.TQC.2013.308</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