HTML Export for TQC 2014

Copy to Clipboard Download

<h2>LIPIcs, Volume 27, TQC 2014</h2>
<ul>
<li>
    <span class="authors">Steven T. Flammia and Aram W. Harrow</span>
    <span class="title">LIPIcs, Volume 27, TQC&#039;14, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2014">10.4230/LIPIcs.TQC.2014</a>
</li>
<li>
    <span class="authors">Steven T. Flammia and Aram W. Harrow</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2014.i">10.4230/LIPIcs.TQC.2014.i</a>
</li>
<li>
    <span class="authors">Jean-Daniel Bancal and Valerio Scarani</span>
    <span class="title">More Randomness From Noisy Sources</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2014.1">10.4230/LIPIcs.TQC.2014.1</a>
</li>
<li>
    <span class="authors">Gilles Brassard, Luc Devroye, and Claude Gravel</span>
    <span class="title">Exact Classical Simulation of the GHZ Distribution</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2014.7">10.4230/LIPIcs.TQC.2014.7</a>
</li>
<li>
    <span class="authors">Harry Buhrman, Serge Fehr, and Christian Schaffner</span>
    <span class="title">On the Parallel Repetition of Multi-Player Games: The No-Signaling Case</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2014.24">10.4230/LIPIcs.TQC.2014.24</a>
</li>
<li>
    <span class="authors">Juan Miguel Arrazola and Norbert Lütkenhaus</span>
    <span class="title">Quantum Communication Complexity with Coherent States and Linear Optics</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2014.36">10.4230/LIPIcs.TQC.2014.36</a>
</li>
<li>
    <span class="authors">Toby Cubitt, Laura Mancinska, David Roberson, Simone Severini, Dan Stahlke, and Andreas Winter</span>
    <span class="title">Bounds on Entanglement Assisted Source-channel Coding Via the Lovász Theta Number and Its Variants</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2014.48">10.4230/LIPIcs.TQC.2014.48</a>
</li>
<li>
    <span class="authors">Mark M. Wilde and Andreas Winter</span>
    <span class="title">Strong Converse for the Quantum Capacity of the Erasure Channel for Almost All Codes</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2014.52">10.4230/LIPIcs.TQC.2014.52</a>
</li>
<li>
    <span class="authors">André Chailloux, Laura Mancinska, Giannicola Scarpa, and Simone Severini</span>
    <span class="title">Graph-theoretical Bounds on the Entangled Value of Non-local Games</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2014.67">10.4230/LIPIcs.TQC.2014.67</a>
</li>
<li>
    <span class="authors">André Chailloux, Iordanis Kerenidis, Srijita Kundu, and Jamie Sikora</span>
    <span class="title">Optimal Bounds for Parity-Oblivious Random Access Codes with Applications</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2014.76">10.4230/LIPIcs.TQC.2014.76</a>
</li>
<li>
    <span class="authors">Milán Mosonyi</span>
    <span class="title">Convexity Properties of the Quantum Rényi Divergences, with Applications to the Quantum Stein&#039;s Lemma</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2014.88">10.4230/LIPIcs.TQC.2014.88</a>
</li>
<li>
    <span class="authors">Alex Monras and Andreas Winter</span>
    <span class="title">Quantum Learning of Classical Stochastic Processes: The Completely-Positive Realization Problem</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2014.99">10.4230/LIPIcs.TQC.2014.99</a>
</li>
<li>
    <span class="authors">Wim van Dam and Siladitya Dey</span>
    <span class="title">Hidden Subgroup Quantum Algorithms for a Class of Semi-Direct Product Groups</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2014.110">10.4230/LIPIcs.TQC.2014.110</a>
</li>
<li>
    <span class="authors">Niel de Beaudrap</span>
    <span class="title">Difficult Instances of the Counting Problem for 2-quantum-SAT are Very Atypical</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2014.118">10.4230/LIPIcs.TQC.2014.118</a>
</li>
<li>
    <span class="authors">Gorjan Alagic, Stacey Jeffery, and Stephen Jordan</span>
    <span class="title">Circuit Obfuscation Using Braids</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2014.141">10.4230/LIPIcs.TQC.2014.141</a>
</li>
<li>
    <span class="authors">Gorjan Alagic, Aniruddha Bapat, and Stephen Jordan</span>
    <span class="title">Classical Simulation of Yang-Baxter Gates</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2014.161">10.4230/LIPIcs.TQC.2014.161</a>
</li>
<li>
    <span class="authors">Theodoros Kapourniotis, Elham Kashefi, and Animesh Datta</span>
    <span class="title">Blindness and Verification of Quantum Computation with One Pure Qubit</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2014.176">10.4230/LIPIcs.TQC.2014.176</a>
</li>
<li>
    <span class="authors">Jan Bouda, Marcin Pawlowski, Matej Pivoluska, and Martin Plesch</span>
    <span class="title">Device-independent Randomness Extraction for Arbitrarily Weak Min-entropy Source</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2014.205">10.4230/LIPIcs.TQC.2014.205</a>
</li>
<li>
    <span class="authors">Laura Mancinska and David Roberson</span>
    <span class="title">Graph Homomorphisms for Quantum Players</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2014.212">10.4230/LIPIcs.TQC.2014.212</a>
</li>
<li>
    <span class="authors">Niel de Beaudrap and Martin Roetteler</span>
    <span class="title">Quantum Linear Network Coding as One-way Quantum Computation</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2014.217">10.4230/LIPIcs.TQC.2014.217</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