@Proceedings{jeffery:LIPIcs.TQC.2018,
title = {{LIPIcs, Volume 111, TQC'18, Complete Volume}},
booktitle = {13th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2018)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-080-4},
ISSN = {1868-8969},
year = {2018},
volume = {111},
editor = {Jeffery, Stacey},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2018},
URN = {urn:nbn:de:0030-drops-93004},
doi = {10.4230/LIPIcs.TQC.2018},
annote = {Keywords: Theory of computation}
}
@InProceedings{jeffery:LIPIcs.TQC.2018.0,
author = {Jeffery, Stacey},
title = {{Front Matter, Table of Contents}},
booktitle = {13th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2018)},
pages = {0:i--0:vi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-080-4},
ISSN = {1868-8969},
year = {2018},
volume = {111},
editor = {Jeffery, Stacey},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2018.0},
URN = {urn:nbn:de:0030-drops-92476},
doi = {10.4230/LIPIcs.TQC.2018.0},
annote = {Keywords: Front Matter, Table of Contents}
}
@InProceedings{dulek_et_al:LIPIcs.TQC.2018.1,
author = {Dulek, Yfke and Speelman, Florian},
title = {{Quantum Ciphertext Authentication and Key Recycling with the Trap Code}},
booktitle = {13th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2018)},
pages = {1:1--1:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-080-4},
ISSN = {1868-8969},
year = {2018},
volume = {111},
editor = {Jeffery, Stacey},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2018.1},
URN = {urn:nbn:de:0030-drops-92487},
doi = {10.4230/LIPIcs.TQC.2018.1},
annote = {Keywords: quantum authentication, ciphertext authentication, trap code, purity-testing codes, quantum computing on encrypted data}
}
@InProceedings{aharonov_et_al:LIPIcs.TQC.2018.2,
author = {Aharonov, Dorit and Kenneth, Oded and Vigdorovich, Itamar},
title = {{On the Complexity of Two Dimensional Commuting Local Hamiltonians}},
booktitle = {13th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2018)},
pages = {2:1--2:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-080-4},
ISSN = {1868-8969},
year = {2018},
volume = {111},
editor = {Jeffery, Stacey},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2018.2},
URN = {urn:nbn:de:0030-drops-92498},
doi = {10.4230/LIPIcs.TQC.2018.2},
annote = {Keywords: local Hamiltonian complexity, commuting Hamiltonians, local Hamiltonian problem, trivial states, toric code, ground states, quantum NP, QMA, topological order, multiparticle entanglement, logical operators, ribbon}
}
@InProceedings{belovs_et_al:LIPIcs.TQC.2018.3,
author = {Belovs, Aleksandrs and Rosmanis, Ansis},
title = {{Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems}},
booktitle = {13th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2018)},
pages = {3:1--3:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-080-4},
ISSN = {1868-8969},
year = {2018},
volume = {111},
editor = {Jeffery, Stacey},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2018.3},
URN = {urn:nbn:de:0030-drops-92501},
doi = {10.4230/LIPIcs.TQC.2018.3},
annote = {Keywords: Adversary Bound, Dual Learning Graphs, Quantum Query Complexity, Representation Theory}
}
@InProceedings{cade_et_al:LIPIcs.TQC.2018.4,
author = {Cade, Chris and Montanaro, Ashley},
title = {{The Quantum Complexity of Computing Schatten p-norms}},
booktitle = {13th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2018)},
pages = {4:1--4:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-080-4},
ISSN = {1868-8969},
year = {2018},
volume = {111},
editor = {Jeffery, Stacey},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2018.4},
URN = {urn:nbn:de:0030-drops-92513},
doi = {10.4230/LIPIcs.TQC.2018.4},
annote = {Keywords: Schatten p-norm, quantum complexity theory, complexity theory, one clean qubit model}
}
@InProceedings{helm_et_al:LIPIcs.TQC.2018.5,
author = {Helm, Alexander and May, Alexander},
title = {{Subset Sum Quantumly in 1.17^n}},
booktitle = {13th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2018)},
pages = {5:1--5:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-080-4},
ISSN = {1868-8969},
year = {2018},
volume = {111},
editor = {Jeffery, Stacey},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2018.5},
URN = {urn:nbn:de:0030-drops-92527},
doi = {10.4230/LIPIcs.TQC.2018.5},
annote = {Keywords: Subset sum, Quantum walk, Representation technique}
}
@InProceedings{bouland_et_al:LIPIcs.TQC.2018.6,
author = {Bouland, Adam and Ozols, Maris},
title = {{Trading Inverses for an Irrep in the Solovay-Kitaev Theorem}},
booktitle = {13th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2018)},
pages = {6:1--6:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-080-4},
ISSN = {1868-8969},
year = {2018},
volume = {111},
editor = {Jeffery, Stacey},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2018.6},
URN = {urn:nbn:de:0030-drops-92539},
doi = {10.4230/LIPIcs.TQC.2018.6},
annote = {Keywords: Solovay-Kitaev theorem, quantum gate sets, gate set compilation}
}
@InProceedings{vandam_et_al:LIPIcs.TQC.2018.7,
author = {van Dam, Wim and Wong, Raymond},
title = {{Two-qubit Stabilizer Circuits with Recovery I: Existence}},
booktitle = {13th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2018)},
pages = {7:1--7:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-080-4},
ISSN = {1868-8969},
year = {2018},
volume = {111},
editor = {Jeffery, Stacey},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2018.7},
URN = {urn:nbn:de:0030-drops-92540},
doi = {10.4230/LIPIcs.TQC.2018.7},
annote = {Keywords: stabilizer circuit, recovery circuit, magic state}
}
@InProceedings{vandam_et_al:LIPIcs.TQC.2018.8,
author = {van Dam, Wim and Wong, Raymond},
title = {{Two-qubit Stabilizer Circuits with Recovery II: Analysis}},
booktitle = {13th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2018)},
pages = {8:1--8:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-080-4},
ISSN = {1868-8969},
year = {2018},
volume = {111},
editor = {Jeffery, Stacey},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2018.8},
URN = {urn:nbn:de:0030-drops-92551},
doi = {10.4230/LIPIcs.TQC.2018.8},
annote = {Keywords: stabilizer circuit, recovery circuit, magic state}
}
@InProceedings{kechedzhi_et_al:LIPIcs.TQC.2018.9,
author = {Kechedzhi, Kostyantyn and Smelyanskiy, Vadim and McClean, Jarrod R. and Denchev, Vasil S. and Mohseni, Masoud and Isakov, Sergei and Boixo, Sergio and Altshuler, Boris and Neven, Hartmut},
title = {{Efficient Population Transfer via Non-Ergodic Extended States in Quantum Spin Glass}},
booktitle = {13th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2018)},
pages = {9:1--9:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-080-4},
ISSN = {1868-8969},
year = {2018},
volume = {111},
editor = {Jeffery, Stacey},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2018.9},
URN = {urn:nbn:de:0030-drops-92565},
doi = {10.4230/LIPIcs.TQC.2018.9},
annote = {Keywords: Quantum algorithms, Discrete optimization, Quantum spin glass, Machine learning}
}
@InProceedings{song_et_al:LIPIcs.TQC.2018.10,
author = {Song, Seunghoan and Hayashi, Masahito},
title = {{Quantum Network Code for Multiple-Unicast Network with Quantum Invertible Linear Operations}},
booktitle = {13th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2018)},
pages = {10:1--10:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-080-4},
ISSN = {1868-8969},
year = {2018},
volume = {111},
editor = {Jeffery, Stacey},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2018.10},
URN = {urn:nbn:de:0030-drops-92572},
doi = {10.4230/LIPIcs.TQC.2018.10},
annote = {Keywords: Quantum network code, Multiple-unicast quantum network, Quantum invertible linear operation}
}
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