@Proceedings{legall_et_al:LIPIcs.TQC.2022,
title = {{LIPIcs, Volume 232, TQC 2022, Complete Volume}},
booktitle = {17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)},
pages = {1--218},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-237-2},
ISSN = {1868-8969},
year = {2022},
volume = {232},
editor = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2022},
URN = {urn:nbn:de:0030-drops-165067},
doi = {10.4230/LIPIcs.TQC.2022},
annote = {Keywords: LIPIcs, Volume 232, TQC 2022, Complete Volume}
}
@InProceedings{legall_et_al:LIPIcs.TQC.2022.0,
author = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)},
pages = {0:i--0:xii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-237-2},
ISSN = {1868-8969},
year = {2022},
volume = {232},
editor = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2022.0},
URN = {urn:nbn:de:0030-drops-165071},
doi = {10.4230/LIPIcs.TQC.2022.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{montanaro_et_al:LIPIcs.TQC.2022.1,
author = {Montanaro, Ashley and Shao, Changpeng},
title = {{Quantum Algorithms for Learning a Hidden Graph}},
booktitle = {17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)},
pages = {1:1--1:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-237-2},
ISSN = {1868-8969},
year = {2022},
volume = {232},
editor = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2022.1},
URN = {urn:nbn:de:0030-drops-165081},
doi = {10.4230/LIPIcs.TQC.2022.1},
annote = {Keywords: Quantum algorithms, query complexity, graphs, combinatorial group testing}
}
@InProceedings{doriguello_et_al:LIPIcs.TQC.2022.2,
author = {Doriguello, Jo\~{a}o F. and Luongo, Alessandro and Bao, Jinge and Rebentrost, Patrick and Santha, Miklos},
title = {{Quantum Algorithm for Stochastic Optimal Stopping Problems with Applications in Finance}},
booktitle = {17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)},
pages = {2:1--2:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-237-2},
ISSN = {1868-8969},
year = {2022},
volume = {232},
editor = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2022.2},
URN = {urn:nbn:de:0030-drops-165091},
doi = {10.4230/LIPIcs.TQC.2022.2},
annote = {Keywords: Quantum computation complexity, optimal stopping time, stochastic processes, American options, quantum finance}
}
@InProceedings{arunachalam_et_al:LIPIcs.TQC.2022.3,
author = {Arunachalam, Srinivasan and Bravyi, Sergey and Nirkhe, Chinmay and O'Gorman, Bryan},
title = {{The Parametrized Complexity of Quantum Verification}},
booktitle = {17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)},
pages = {3:1--3:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-237-2},
ISSN = {1868-8969},
year = {2022},
volume = {232},
editor = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2022.3},
URN = {urn:nbn:de:0030-drops-165104},
doi = {10.4230/LIPIcs.TQC.2022.3},
annote = {Keywords: parametrized complexity, quantum verification, QMA}
}
@InProceedings{flammia:LIPIcs.TQC.2022.4,
author = {Flammia, Steven T.},
title = {{Averaged Circuit Eigenvalue Sampling}},
booktitle = {17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)},
pages = {4:1--4:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-237-2},
ISSN = {1868-8969},
year = {2022},
volume = {232},
editor = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2022.4},
URN = {urn:nbn:de:0030-drops-165114},
doi = {10.4230/LIPIcs.TQC.2022.4},
annote = {Keywords: Quantum noise estimation, quantum benchmarking, QCVV}
}
@InProceedings{kissinger_et_al:LIPIcs.TQC.2022.5,
author = {Kissinger, Aleks and van de Wetering, John and Vilmart, Renaud},
title = {{Classical Simulation of Quantum Circuits with Partial and Graphical Stabiliser Decompositions}},
booktitle = {17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)},
pages = {5:1--5:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-237-2},
ISSN = {1868-8969},
year = {2022},
volume = {232},
editor = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2022.5},
URN = {urn:nbn:de:0030-drops-165128},
doi = {10.4230/LIPIcs.TQC.2022.5},
annote = {Keywords: ZX-calculus, Stabiliser Rank, Quantum Simulation}
}
@InProceedings{briet_et_al:LIPIcs.TQC.2022.6,
author = {Bri\"{e}t, Jop and Escudero Guti\'{e}rrez, Francisco},
title = {{On Converses to the Polynomial Method}},
booktitle = {17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)},
pages = {6:1--6:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-237-2},
ISSN = {1868-8969},
year = {2022},
volume = {232},
editor = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2022.6},
URN = {urn:nbn:de:0030-drops-165139},
doi = {10.4230/LIPIcs.TQC.2022.6},
annote = {Keywords: Quantum query complexity, polynomial method, completely bounded polynomials}
}
@InProceedings{basso_et_al:LIPIcs.TQC.2022.7,
author = {Basso, Joao and Farhi, Edward and Marwaha, Kunal and Villalonga, Benjamin and Zhou, Leo},
title = {{The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model}},
booktitle = {17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)},
pages = {7:1--7:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-237-2},
ISSN = {1868-8969},
year = {2022},
volume = {232},
editor = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2022.7},
URN = {urn:nbn:de:0030-drops-165144},
doi = {10.4230/LIPIcs.TQC.2022.7},
annote = {Keywords: Quantum algorithm, Max-Cut, spin glass, approximation algorithm}
}
@InProceedings{osborn_et_al:LIPIcs.TQC.2022.8,
author = {Osborn, Sarah A. and Sikora, Jamie},
title = {{A Constant Lower Bound for Any Quantum Protocol for Secure Function Evaluation}},
booktitle = {17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)},
pages = {8:1--8:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-237-2},
ISSN = {1868-8969},
year = {2022},
volume = {232},
editor = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2022.8},
URN = {urn:nbn:de:0030-drops-165151},
doi = {10.4230/LIPIcs.TQC.2022.8},
annote = {Keywords: Quantum cryptography, security analysis, secure function evaluation}
}
@InProceedings{dontha_et_al:LIPIcs.TQC.2022.9,
author = {Dontha, Suchetan and Tan, Shi Jie Samuel and Smith, Stephen and Choi, Sangheon and Coudron, Matthew},
title = {{Approximating Output Probabilities of Shallow Quantum Circuits Which Are Geometrically-Local in Any Fixed Dimension}},
booktitle = {17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)},
pages = {9:1--9:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-237-2},
ISSN = {1868-8969},
year = {2022},
volume = {232},
editor = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2022.9},
URN = {urn:nbn:de:0030-drops-165163},
doi = {10.4230/LIPIcs.TQC.2022.9},
annote = {Keywords: Low-Depth Quantum Circuits, Matrix Product States, Block-Encoding}
}
@InProceedings{buhrman_et_al:LIPIcs.TQC.2022.10,
author = {Buhrman, Harry and Loff, Bruno and Patro, Subhasree and Speelman, Florian},
title = {{Memory Compression with Quantum Random-Access Gates}},
booktitle = {17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)},
pages = {10:1--10:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-237-2},
ISSN = {1868-8969},
year = {2022},
volume = {232},
editor = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2022.10},
URN = {urn:nbn:de:0030-drops-165177},
doi = {10.4230/LIPIcs.TQC.2022.10},
annote = {Keywords: complexity theory, data structures, algorithms, quantum walk}
}
@InProceedings{klevickis_et_al:LIPIcs.TQC.2022.11,
author = {K\c{l}evickis, Vladislavs and Pr\={u}sis, Kri\v{s}j\={a}nis and Vihrovs, Jevg\={e}nijs},
title = {{Quantum Speedups for Treewidth}},
booktitle = {17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)},
pages = {11:1--11:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-237-2},
ISSN = {1868-8969},
year = {2022},
volume = {232},
editor = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2022.11},
URN = {urn:nbn:de:0030-drops-165186},
doi = {10.4230/LIPIcs.TQC.2022.11},
annote = {Keywords: Quantum computation, Treewidth, Exact algorithms, Dynamic programming}
}
@InProceedings{glaudell_et_al:LIPIcs.TQC.2022.12,
author = {Glaudell, Andrew N. and Ross, Neil J. and van de Wetering, John and Yeh, Lia},
title = {{Qutrit Metaplectic Gates Are a Subset of Clifford+T}},
booktitle = {17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)},
pages = {12:1--12:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-237-2},
ISSN = {1868-8969},
year = {2022},
volume = {232},
editor = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2022.12},
URN = {urn:nbn:de:0030-drops-165195},
doi = {10.4230/LIPIcs.TQC.2022.12},
annote = {Keywords: Quantum computation, qutrits, gate synthesis, metaplectic gate, Clifford+T}
}
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