LIPIcs, Volume 197
TQC 2021, July 5-8, 2021, Virtual Conference
Editors: Min-Hsiu Hsieh
Published in: LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023)
Ting-Yu Kuo, Yu-Han Chen, Andrea Frosini, Sun-Yuan Hsieh, Shi-Chun Tsai, and Mong-Jen Kao. On Min-Max Graph Balancing with Strict Negative Correlation Constraints. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, pp. 50:1-50:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{kuo_et_al:LIPIcs.ISAAC.2023.50, author = {Kuo, Ting-Yu and Chen, Yu-Han and Frosini, Andrea and Hsieh, Sun-Yuan and Tsai, Shi-Chun and Kao, Mong-Jen}, title = {{On Min-Max Graph Balancing with Strict Negative Correlation Constraints}}, booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)}, pages = {50:1--50:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-289-1}, ISSN = {1868-8969}, year = {2023}, volume = {283}, editor = {Iwata, Satoru and Kakimura, Naonori}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.50}, URN = {urn:nbn:de:0030-drops-193524}, doi = {10.4230/LIPIcs.ISAAC.2023.50}, annote = {Keywords: Unrelated Scheduling, Graph Balancing, Strict Correlation Constraints} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Adam Izdebski and Ronald de Wolf. Improved Quantum Boosting. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 64:1-64:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{izdebski_et_al:LIPIcs.ESA.2023.64, author = {Izdebski, Adam and de Wolf, Ronald}, title = {{Improved Quantum Boosting}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {64:1--64:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-295-2}, ISSN = {1868-8969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.64}, URN = {urn:nbn:de:0030-drops-187178}, doi = {10.4230/LIPIcs.ESA.2023.64}, annote = {Keywords: Learning theory, Boosting algorithms, Quantum computing} }
Published in: LIPIcs, Volume 264, 38th Computational Complexity Conference (CCC 2023)
Nai-Hui Chia, Kai-Min Chung, Yao-Ching Hsieh, Han-Hsuan Lin, Yao-Ting Lin, and Yu-Ching Shen. On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian Simulation. In 38th Computational Complexity Conference (CCC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 264, pp. 33:1-33:45, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{chia_et_al:LIPIcs.CCC.2023.33, author = {Chia, Nai-Hui and Chung, Kai-Min and Hsieh, Yao-Ching and Lin, Han-Hsuan and Lin, Yao-Ting and Shen, Yu-Ching}, title = {{On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian Simulation}}, booktitle = {38th Computational Complexity Conference (CCC 2023)}, pages = {33:1--33:45}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-282-2}, ISSN = {1868-8969}, year = {2023}, volume = {264}, editor = {Ta-Shma, Amnon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.33}, URN = {urn:nbn:de:0030-drops-183038}, doi = {10.4230/LIPIcs.CCC.2023.33}, annote = {Keywords: Hamiltonian simulation, Depth lower bound, Parallel query lower bound} }
Published in: LIPIcs, Volume 197, 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)
Min-Hsiu Hsieh. LIPIcs, Volume 197, TQC 2021, Complete Volume. In 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 197, pp. 1-178, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@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} }
Published in: LIPIcs, Volume 197, 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)
Min-Hsiu Hsieh. Front Matter, Table of Contents, Preface, Conference Organization. In 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 197, pp. 0:i-0:xii, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@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} }
Published in: LIPIcs, Volume 197, 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)
Yassine Hamoudi and Frédéric Magniez. Quantum Time-Space Tradeoff for Finding Multiple Collision Pairs. In 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 197, pp. 1:1-1:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@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} }
Published in: LIPIcs, Volume 197, 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)
William Kretschmer. Quantum Pseudorandomness and Classical Complexity. In 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 197, pp. 2:1-2:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@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} }
Published in: LIPIcs, Volume 197, 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)
Kai-Min Chung and Han-Hsuan Lin. Sample Efficient Algorithms for Learning Quantum Channels in PAC Model and the Approximate State Discrimination Problem. In 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 197, pp. 3:1-3:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@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} }
Published in: LIPIcs, Volume 197, 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)
Yupan Liu. StoqMA Meets Distribution Testing. In 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 197, pp. 4:1-4:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@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} }
Published in: LIPIcs, Volume 197, 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)
Prithviraj Prabhu and Ben W. Reichardt. Fault-Tolerant Syndrome Extraction and Cat State Preparation with Fewer Qubits. In 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 197, pp. 5:1-5:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@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} }
Published in: LIPIcs, Volume 197, 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)
Andris Ambainis, Kaspars Balodis, and Jānis Iraids. A Note About Claw Function with a Small Range. In 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 197, pp. 6:1-6:5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@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} }
Published in: LIPIcs, Volume 197, 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)
Daniel Stilck França, Fernando G.S L. Brandão, and Richard Kueng. Fast and Robust Quantum State Tomography from Few Basis Measurements. In 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 197, pp. 7:1-7:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@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} }
Published in: LIPIcs, Volume 197, 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)
Steven T. Flammia and Ryan O'Donnell. Pauli Error Estimation via Population Recovery. In 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 197, pp. 8:1-8:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@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} }
Published in: LIPIcs, Volume 197, 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)
Joran van Apeldoorn. Quantum Probability Oracles & Multidimensional Amplitude Estimation. In 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 197, pp. 9:1-9:11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@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} }
Feedback for Dagstuhl Publishing