@Proceedings{hsieh:LIPIcs.TQC.2021,
title = {{LIPIcs, Volume 197, TQC 2021, Complete Volume}},
booktitle = {16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)},
pages = {1--178},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-198-6},
ISSN = {1868-8969},
year = {2021},
volume = {197},
editor = {Hsieh, Min-Hsiu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2021},
URN = {urn:nbn:de:0030-drops-139940},
doi = {10.4230/LIPIcs.TQC.2021},
annote = {Keywords: LIPIcs, Volume 197, TQC 2021, Complete Volume}
}
@InProceedings{hsieh:LIPIcs.TQC.2021.0,
author = {Hsieh, Min-Hsiu},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)},
pages = {0:i--0:xii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-198-6},
ISSN = {1868-8969},
year = {2021},
volume = {197},
editor = {Hsieh, Min-Hsiu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2021.0},
URN = {urn:nbn:de:0030-drops-139958},
doi = {10.4230/LIPIcs.TQC.2021.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{hamoudi_et_al:LIPIcs.TQC.2021.1,
author = {Hamoudi, Yassine and Magniez, Fr\'{e}d\'{e}ric},
title = {{Quantum Time-Space Tradeoff for Finding Multiple Collision Pairs}},
booktitle = {16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)},
pages = {1:1--1:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-198-6},
ISSN = {1868-8969},
year = {2021},
volume = {197},
editor = {Hsieh, Min-Hsiu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2021.1},
URN = {urn:nbn:de:0030-drops-139961},
doi = {10.4230/LIPIcs.TQC.2021.1},
annote = {Keywords: Quantum computing, query complexity, lower bound, time-space tradeoff}
}
@InProceedings{kretschmer:LIPIcs.TQC.2021.2,
author = {Kretschmer, William},
title = {{Quantum Pseudorandomness and Classical Complexity}},
booktitle = {16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)},
pages = {2:1--2:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-198-6},
ISSN = {1868-8969},
year = {2021},
volume = {197},
editor = {Hsieh, Min-Hsiu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2021.2},
URN = {urn:nbn:de:0030-drops-139975},
doi = {10.4230/LIPIcs.TQC.2021.2},
annote = {Keywords: pseudorandom quantum states, quantum Merlin-Arthur}
}
@InProceedings{chung_et_al:LIPIcs.TQC.2021.3,
author = {Chung, Kai-Min and Lin, Han-Hsuan},
title = {{Sample Efficient Algorithms for Learning Quantum Channels in PAC Model and the Approximate State Discrimination Problem}},
booktitle = {16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)},
pages = {3:1--3:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-198-6},
ISSN = {1868-8969},
year = {2021},
volume = {197},
editor = {Hsieh, Min-Hsiu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2021.3},
URN = {urn:nbn:de:0030-drops-139984},
doi = {10.4230/LIPIcs.TQC.2021.3},
annote = {Keywords: PAC learning, Quantum PAC learning, Sample Complexity, Approximate State Discrimination, Quantum information}
}
@InProceedings{liu:LIPIcs.TQC.2021.4,
author = {Liu, Yupan},
title = {{StoqMA Meets Distribution Testing}},
booktitle = {16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)},
pages = {4:1--4:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-198-6},
ISSN = {1868-8969},
year = {2021},
volume = {197},
editor = {Hsieh, Min-Hsiu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2021.4},
URN = {urn:nbn:de:0030-drops-139995},
doi = {10.4230/LIPIcs.TQC.2021.4},
annote = {Keywords: StoqMA, distribution testing, error reduction, reversible circuits}
}
@InProceedings{prabhu_et_al:LIPIcs.TQC.2021.5,
author = {Prabhu, Prithviraj and Reichardt, Ben W.},
title = {{Fault-Tolerant Syndrome Extraction and Cat State Preparation with Fewer Qubits}},
booktitle = {16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)},
pages = {5:1--5:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-198-6},
ISSN = {1868-8969},
year = {2021},
volume = {197},
editor = {Hsieh, Min-Hsiu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2021.5},
URN = {urn:nbn:de:0030-drops-140001},
doi = {10.4230/LIPIcs.TQC.2021.5},
annote = {Keywords: Quantum error correction, fault tolerance, quantum state preparation, combinatorics}
}
@InProceedings{ambainis_et_al:LIPIcs.TQC.2021.6,
author = {Ambainis, Andris and Balodis, Kaspars and Iraids, J\={a}nis},
title = {{A Note About Claw Function with a Small Range}},
booktitle = {16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)},
pages = {6:1--6:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-198-6},
ISSN = {1868-8969},
year = {2021},
volume = {197},
editor = {Hsieh, Min-Hsiu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2021.6},
URN = {urn:nbn:de:0030-drops-140013},
doi = {10.4230/LIPIcs.TQC.2021.6},
annote = {Keywords: collision, claw, quantum query complexity}
}
@InProceedings{franca_et_al:LIPIcs.TQC.2021.7,
author = {Fran\c{c}a, Daniel Stilck and Brand\~{a}o, Fernando G.S L. and Kueng, Richard},
title = {{Fast and Robust Quantum State Tomography from Few Basis Measurements}},
booktitle = {16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)},
pages = {7:1--7:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-198-6},
ISSN = {1868-8969},
year = {2021},
volume = {197},
editor = {Hsieh, Min-Hsiu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2021.7},
URN = {urn:nbn:de:0030-drops-140023},
doi = {10.4230/LIPIcs.TQC.2021.7},
annote = {Keywords: quantum tomography, low-rank tomography, Gibbs states, random measurements}
}
@InProceedings{flammia_et_al:LIPIcs.TQC.2021.8,
author = {Flammia, Steven T. and O'Donnell, Ryan},
title = {{Pauli Error Estimation via Population Recovery}},
booktitle = {16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)},
pages = {8:1--8:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-198-6},
ISSN = {1868-8969},
year = {2021},
volume = {197},
editor = {Hsieh, Min-Hsiu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2021.8},
URN = {urn:nbn:de:0030-drops-140034},
doi = {10.4230/LIPIcs.TQC.2021.8},
annote = {Keywords: Pauli channels, population recovery, Goldreich-Levin, sparse recovery, quantum channel tomography}
}
@InProceedings{vanapeldoorn:LIPIcs.TQC.2021.9,
author = {van Apeldoorn, Joran},
title = {{Quantum Probability Oracles \& Multidimensional Amplitude Estimation}},
booktitle = {16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)},
pages = {9:1--9:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-198-6},
ISSN = {1868-8969},
year = {2021},
volume = {197},
editor = {Hsieh, Min-Hsiu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2021.9},
URN = {urn:nbn:de:0030-drops-140046},
doi = {10.4230/LIPIcs.TQC.2021.9},
annote = {Keywords: quantum algorithms, amplitude estimation, monte carlo}
}
@InProceedings{legall_et_al:LIPIcs.TQC.2021.10,
author = {Le Gall, Fran\c{c}ois and Nishimura, Harumichi and Yakary{\i}lmaz, Abuzer},
title = {{Quantum Logarithmic Space and Post-Selection}},
booktitle = {16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)},
pages = {10:1--10:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-198-6},
ISSN = {1868-8969},
year = {2021},
volume = {197},
editor = {Hsieh, Min-Hsiu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2021.10},
URN = {urn:nbn:de:0030-drops-140054},
doi = {10.4230/LIPIcs.TQC.2021.10},
annote = {Keywords: computational complexity, space-bounded quantum computation, post-selection}
}
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