@Proceedings{broadbent:LIPIcs.TQC.2016,
title = {{LIPIcs, Volume 61, TQC'16, Complete Volume}},
booktitle = {11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-019-4},
ISSN = {1868-8969},
year = {2016},
volume = {61},
editor = {Broadbent, Anne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2016},
URN = {urn:nbn:de:0030-drops-66984},
doi = {10.4230/LIPIcs.TQC.2016},
annote = {Keywords: Data Encryption, Coding and Information Theory, Theory of Computation}
}
@InProceedings{broadbent:LIPIcs.TQC.2016.0,
author = {Broadbent, Anne},
title = {{Front Matter, Table of Contents, Preface, List of Contributed Talks, Conference Organization}},
booktitle = {11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016)},
pages = {0:i--0:xii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-019-4},
ISSN = {1868-8969},
year = {2016},
volume = {61},
editor = {Broadbent, Anne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2016.0},
URN = {urn:nbn:de:0030-drops-66816},
doi = {10.4230/LIPIcs.TQC.2016.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, List of Contributed Talks, Conference Organization}
}
@InProceedings{fefferman_et_al:LIPIcs.TQC.2016.1,
author = {Fefferman, Bill and Umans, Christopher},
title = {{On the Power of Quantum Fourier Sampling}},
booktitle = {11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016)},
pages = {1:1--1:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-019-4},
ISSN = {1868-8969},
year = {2016},
volume = {61},
editor = {Broadbent, Anne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2016.1},
URN = {urn:nbn:de:0030-drops-66829},
doi = {10.4230/LIPIcs.TQC.2016.1},
annote = {Keywords: Quantum Complexity Theory, Sampling Complexity}
}
@InProceedings{arnonfriedman_et_al:LIPIcs.TQC.2016.2,
author = {Arnon-Friedman, Rotem and Portmann, Christopher and Scholz, Volkher B.},
title = {{Quantum-Proof Multi-Source Randomness Extractors in the Markov Model}},
booktitle = {11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016)},
pages = {2:1--2:34},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-019-4},
ISSN = {1868-8969},
year = {2016},
volume = {61},
editor = {Broadbent, Anne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2016.2},
URN = {urn:nbn:de:0030-drops-66830},
doi = {10.4230/LIPIcs.TQC.2016.2},
annote = {Keywords: Quantum proof randomness extractors, multisource extractors, device independent quantum cryptography}
}
@InProceedings{anshu_et_al:LIPIcs.TQC.2016.3,
author = {Anshu, Anurag and Garg, Ankit and Harrow, Aram W. and Yao, Penghui},
title = {{Lower Bound on Expected Communication Cost of Quantum Huffman Coding}},
booktitle = {11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016)},
pages = {3:1--3:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-019-4},
ISSN = {1868-8969},
year = {2016},
volume = {61},
editor = {Broadbent, Anne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2016.3},
URN = {urn:nbn:de:0030-drops-66843},
doi = {10.4230/LIPIcs.TQC.2016.3},
annote = {Keywords: Quantum information, quantum communication, expected communica- tion cost, huffman coding}
}
@InProceedings{sikora:LIPIcs.TQC.2016.4,
author = {Sikora, Jamie},
title = {{Simple, Near-Optimal Quantum Protocols for Die-Rolling}},
booktitle = {11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016)},
pages = {4:1--4:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-019-4},
ISSN = {1868-8969},
year = {2016},
volume = {61},
editor = {Broadbent, Anne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2016.4},
URN = {urn:nbn:de:0030-drops-66851},
doi = {10.4230/LIPIcs.TQC.2016.4},
annote = {Keywords: Quantum Cryptography, Semidefinite Programming, Die-Rolling, Integer-Commitment}
}
@InProceedings{laplante_et_al:LIPIcs.TQC.2016.5,
author = {Laplante, Sophie and Lauri\`{e}re, Mathieu and Nolin, Alexandre and Roland, J\'{e}r\'{e}mie and Senno, Gabriel},
title = {{Robust Bell Inequalities from Communication Complexity}},
booktitle = {11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016)},
pages = {5:1--5:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-019-4},
ISSN = {1868-8969},
year = {2016},
volume = {61},
editor = {Broadbent, Anne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2016.5},
URN = {urn:nbn:de:0030-drops-66867},
doi = {10.4230/LIPIcs.TQC.2016.5},
annote = {Keywords: Communication complexity, Bell inequalities, nonlocality, detector efficiency}
}
@InProceedings{chia_et_al:LIPIcs.TQC.2016.6,
author = {Chia, Nai-Hui and Hallgren, Sean},
title = {{How Hard Is Deciding Trivial Versus Nontrivial in the Dihedral Coset Problem?}},
booktitle = {11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016)},
pages = {6:1--6:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-019-4},
ISSN = {1868-8969},
year = {2016},
volume = {61},
editor = {Broadbent, Anne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2016.6},
URN = {urn:nbn:de:0030-drops-66877},
doi = {10.4230/LIPIcs.TQC.2016.6},
annote = {Keywords: Quantum algorithms, hidden subgroup problem, random subset sum problem}
}
@InProceedings{bendavid:LIPIcs.TQC.2016.7,
author = {Ben-David, Shalev},
title = {{The Structure of Promises in Quantum Speedups}},
booktitle = {11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016)},
pages = {7:1--7:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-019-4},
ISSN = {1868-8969},
year = {2016},
volume = {61},
editor = {Broadbent, Anne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2016.7},
URN = {urn:nbn:de:0030-drops-66882},
doi = {10.4230/LIPIcs.TQC.2016.7},
annote = {Keywords: Quantum computing, quantum query complexity, decision tree complexity, lower bounds, quantum adversary method}
}
@InProceedings{roetteler:LIPIcs.TQC.2016.8,
author = {Roetteler, Martin},
title = {{Quantum Algorithms for Abelian Difference Sets and Applications to Dihedral Hidden Subgroups}},
booktitle = {11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016)},
pages = {8:1--8:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-019-4},
ISSN = {1868-8969},
year = {2016},
volume = {61},
editor = {Broadbent, Anne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2016.8},
URN = {urn:nbn:de:0030-drops-66896},
doi = {10.4230/LIPIcs.TQC.2016.8},
annote = {Keywords: Quantum algorithms, hidden shift problem, hidden subgroup problem, difference sets, Fourier transforms}
}
@InProceedings{speelman:LIPIcs.TQC.2016.9,
author = {Speelman, Florian},
title = {{Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits}},
booktitle = {11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016)},
pages = {9:1--9:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-019-4},
ISSN = {1868-8969},
year = {2016},
volume = {61},
editor = {Broadbent, Anne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2016.9},
URN = {urn:nbn:de:0030-drops-66909},
doi = {10.4230/LIPIcs.TQC.2016.9},
annote = {Keywords: Quantum Cryptography, Quantum Communication}
}
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
Feedback for Dagstuhl Publishing