


default search action
11th TQC 2016: Berlin, Germany
- Anne Broadbent:

11th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2016, Berlin, Germany, September 27-29, 2016. LIPIcs 61, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-019-4 - Front Matter, Table of Contents, Preface, List of Contributed Talks, Conference Organization. 0:i-0:xii

- Bill Fefferman, Christopher Umans:

On the Power of Quantum Fourier Sampling. 1:1-1:19 - Rotem Arnon Friedman

, Christopher Portmann, Volkher B. Scholz:
Quantum-Proof Multi-Source Randomness Extractors in the Markov Model. 2:1-2:34 - Anurag Anshu, Ankit Garg, Aram W. Harrow

, Penghui Yao:
Lower Bound on Expected Communication Cost of Quantum Huffman Coding. 3:1-3:18 - Jamie Sikora

:
Simple, Near-Optimal Quantum Protocols for Die-Rolling. 4:1-4:14 - Sophie Laplante, Mathieu Laurière, Alexandre Nolin

, Jérémie Roland, Gabriel Senno
:
Robust Bell Inequalities from Communication Complexity. 5:1-5:24 - Nai-Hui Chia, Sean Hallgren:

How Hard Is Deciding Trivial Versus Nontrivial in the Dihedral Coset Problem?. 6:1-6:16 - Shalev Ben-David:

The Structure of Promises in Quantum Speedups. 7:1-7:14 - Martin Roetteler

:
Quantum Algorithms for Abelian Difference Sets and Applications to Dihedral Hidden Subgroups. 8:1-8:16 - Florian Speelman

:
Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits. 9:1-9:24

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














