@Proceedings{flammia:LIPIcs.TQC.2020,
title = {{LIPIcs, Volume 158, TQC 2020, Complete Volume}},
booktitle = {15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)},
pages = {1--230},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-146-7},
ISSN = {1868-8969},
year = {2020},
volume = {158},
editor = {Flammia, Steven T.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2020},
URN = {urn:nbn:de:0030-drops-120583},
doi = {10.4230/LIPIcs.TQC.2020},
annote = {Keywords: LIPIcs, Volume 158, TQC 2020, Complete Volume}
}
@InProceedings{flammia:LIPIcs.TQC.2020.0,
author = {Flammia, Steven T.},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)},
pages = {0:i--0:x},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-146-7},
ISSN = {1868-8969},
year = {2020},
volume = {158},
editor = {Flammia, Steven T.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2020.0},
URN = {urn:nbn:de:0030-drops-120598},
doi = {10.4230/LIPIcs.TQC.2020.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{doriguello_et_al:LIPIcs.TQC.2020.1,
author = {Doriguello, Jo\~{a}o F. and Montanaro, Ashley},
title = {{Exponential Quantum Communication Reductions from Generalizations of the Boolean Hidden Matching Problem}},
booktitle = {15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)},
pages = {1:1--1:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-146-7},
ISSN = {1868-8969},
year = {2020},
volume = {158},
editor = {Flammia, Steven T.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2020.1},
URN = {urn:nbn:de:0030-drops-120601},
doi = {10.4230/LIPIcs.TQC.2020.1},
annote = {Keywords: Communication Complexity, Quantum Communication Complexity, Boolean Hidden Matching Problem}
}
@InProceedings{mande_et_al:LIPIcs.TQC.2020.2,
author = {Mande, Nikhil S. and Thaler, Justin and Zhu, Shuchen},
title = {{Improved Approximate Degree Bounds for k-Distinctness}},
booktitle = {15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)},
pages = {2:1--2:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-146-7},
ISSN = {1868-8969},
year = {2020},
volume = {158},
editor = {Flammia, Steven T.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2020.2},
URN = {urn:nbn:de:0030-drops-120613},
doi = {10.4230/LIPIcs.TQC.2020.2},
annote = {Keywords: Quantum Query Complexity, Approximate Degree, Dual Polynomials, k-distinctness}
}
@InProceedings{chabaud_et_al:LIPIcs.TQC.2020.3,
author = {Chabaud, Ulysse and Douce, Tom and Grosshans, Fr\'{e}d\'{e}ric and Kashefi, Elham and Markham, Damian},
title = {{Building Trust for Continuous Variable Quantum States}},
booktitle = {15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)},
pages = {3:1--3:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-146-7},
ISSN = {1868-8969},
year = {2020},
volume = {158},
editor = {Flammia, Steven T.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2020.3},
URN = {urn:nbn:de:0030-drops-120623},
doi = {10.4230/LIPIcs.TQC.2020.3},
annote = {Keywords: Continuous variable quantum information, reliable state tomography, certification, verification}
}
@InProceedings{broadbent_et_al:LIPIcs.TQC.2020.4,
author = {Broadbent, Anne and Lord, S\'{e}bastien},
title = {{Uncloneable Quantum Encryption via Oracles}},
booktitle = {15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)},
pages = {4:1--4:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-146-7},
ISSN = {1868-8969},
year = {2020},
volume = {158},
editor = {Flammia, Steven T.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2020.4},
URN = {urn:nbn:de:0030-drops-120639},
doi = {10.4230/LIPIcs.TQC.2020.4},
annote = {Keywords: Quantum Cryptography, Symmetric Key, Monogamy-of-Entanglement}
}
@InProceedings{bannink_et_al:LIPIcs.TQC.2020.5,
author = {Bannink, Tom and Bri\"{e}t, Jop and Labib, Farrokh and Maassen, Hans},
title = {{Quasirandom Quantum Channels}},
booktitle = {15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)},
pages = {5:1--5:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-146-7},
ISSN = {1868-8969},
year = {2020},
volume = {158},
editor = {Flammia, Steven T.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2020.5},
URN = {urn:nbn:de:0030-drops-120642},
doi = {10.4230/LIPIcs.TQC.2020.5},
annote = {Keywords: Quantum channels, quantum expanders, quasirandomness}
}
@InProceedings{broadbent_et_al:LIPIcs.TQC.2020.6,
author = {Broadbent, Anne and Gharibian, Sevag and Zhou, Hong-Sheng},
title = {{Towards Quantum One-Time Memories from Stateless Hardware}},
booktitle = {15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)},
pages = {6:1--6:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-146-7},
ISSN = {1868-8969},
year = {2020},
volume = {158},
editor = {Flammia, Steven T.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2020.6},
URN = {urn:nbn:de:0030-drops-120654},
doi = {10.4230/LIPIcs.TQC.2020.6},
annote = {Keywords: quantum cryptography, one-time memories, semi-definite programming}
}
@InProceedings{anshu_et_al:LIPIcs.TQC.2020.7,
author = {Anshu, Anurag and Gosset, David and Morenz, Karen},
title = {{Beyond Product State Approximations for a Quantum Analogue of Max Cut}},
booktitle = {15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)},
pages = {7:1--7:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-146-7},
ISSN = {1868-8969},
year = {2020},
volume = {158},
editor = {Flammia, Steven T.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2020.7},
URN = {urn:nbn:de:0030-drops-120660},
doi = {10.4230/LIPIcs.TQC.2020.7},
annote = {Keywords: Approximation algorithms, Quantum many-body systems}
}
@InProceedings{brakerski_et_al:LIPIcs.TQC.2020.8,
author = {Brakerski, Zvika and Koppula, Venkata and Vazirani, Umesh and Vidick, Thomas},
title = {{Simpler Proofs of Quantumness}},
booktitle = {15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)},
pages = {8:1--8:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-146-7},
ISSN = {1868-8969},
year = {2020},
volume = {158},
editor = {Flammia, Steven T.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2020.8},
URN = {urn:nbn:de:0030-drops-120677},
doi = {10.4230/LIPIcs.TQC.2020.8},
annote = {Keywords: Proof of Quantumness, Random Oracle, Learning with Errors}
}
@InProceedings{ambainis_et_al:LIPIcs.TQC.2020.9,
author = {Ambainis, Andris and Larka, Nikita},
title = {{Quantum Algorithms for Computational Geometry Problems}},
booktitle = {15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)},
pages = {9:1--9:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-146-7},
ISSN = {1868-8969},
year = {2020},
volume = {158},
editor = {Flammia, Steven T.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2020.9},
URN = {urn:nbn:de:0030-drops-120687},
doi = {10.4230/LIPIcs.TQC.2020.9},
annote = {Keywords: Quantum algorithms, quantum search, computational geometry, 3Sum problem, amplitude amplification}
}
@InProceedings{arunachalam_et_al:LIPIcs.TQC.2020.10,
author = {Arunachalam, Srinivasan and Belovs, Aleksandrs and Childs, Andrew M. and Kothari, Robin and Rosmanis, Ansis and de Wolf, Ronald},
title = {{Quantum Coupon Collector}},
booktitle = {15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)},
pages = {10:1--10:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-146-7},
ISSN = {1868-8969},
year = {2020},
volume = {158},
editor = {Flammia, Steven T.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2020.10},
URN = {urn:nbn:de:0030-drops-120692},
doi = {10.4230/LIPIcs.TQC.2020.10},
annote = {Keywords: Quantum algorithms, Adversary method, Coupon collector, Quantum learning theory}
}
@InProceedings{debeaudrap_et_al:LIPIcs.TQC.2020.11,
author = {de Beaudrap, Niel and Bian, Xiaoning and Wang, Quanlong},
title = {{Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities}},
booktitle = {15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)},
pages = {11:1--11:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-146-7},
ISSN = {1868-8969},
year = {2020},
volume = {158},
editor = {Flammia, Steven T.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2020.11},
URN = {urn:nbn:de:0030-drops-120705},
doi = {10.4230/LIPIcs.TQC.2020.11},
annote = {Keywords: T-count, Parity-phase operations, Phase gadgets, Clifford hierarchy, ZX calculus}
}
@InProceedings{kundu_et_al:LIPIcs.TQC.2020.12,
author = {Kundu, Srijita and Sikora, Jamie and Tan, Ernest Y.-Z.},
title = {{A Device-Independent Protocol for XOR Oblivious Transfer}},
booktitle = {15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)},
pages = {12:1--12:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-146-7},
ISSN = {1868-8969},
year = {2020},
volume = {158},
editor = {Flammia, Steven T.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2020.12},
URN = {urn:nbn:de:0030-drops-127579},
doi = {10.4230/LIPIcs.TQC.2020.12},
annote = {Keywords: Quantum cryptography, device independence, oblivious transfer, semidefinite programming, security analysis}
}
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