HTML Export for TQC 2024

Copy to Clipboard Download

<h2>LIPIcs, Volume 310, TQC 2024</h2>
<ul>
<li>
    <span class="authors">Frédéric Magniez and Alex Bredariol Grilo</span>
    <span class="title">LIPIcs, Volume 310, TQC 2024, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2024">10.4230/LIPIcs.TQC.2024</a>
</li>
<li>
    <span class="authors">Frédéric Magniez and Alex Bredariol Grilo</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2024.0">10.4230/LIPIcs.TQC.2024.0</a>
</li>
<li>
    <span class="authors">Allyson Silva, Xiangyi Zhang, Zak Webb, Mia Kramer, Chan-Woo Yang, Xiao Liu, Jessica Lemieux, Ka-Wai Chen, Artur Scherer, and Pooya Ronagh</span>
    <span class="title">Multi-qubit Lattice Surgery Scheduling</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2024.1">10.4230/LIPIcs.TQC.2024.1</a>
</li>
<li>
    <span class="authors">Yiyi Cai, Yu Tong, and John Preskill</span>
    <span class="title">Stochastic Error Cancellation in Analog Quantum Simulation</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2024.2">10.4230/LIPIcs.TQC.2024.2</a>
</li>
<li>
    <span class="authors">Wenhao He, Tongyang Li, Xiantao Li, Zecheng Li, Chunhao Wang, and Ke Wang</span>
    <span class="title">Efficient Optimal Control of Open Quantum Systems</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2024.3">10.4230/LIPIcs.TQC.2024.3</a>
</li>
<li>
    <span class="authors">Tomoyuki Morimae and Takashi Yamakawa</span>
    <span class="title">One-Wayness in Quantum Cryptography</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2024.4">10.4230/LIPIcs.TQC.2024.4</a>
</li>
<li>
    <span class="authors">Tomoyuki Morimae, Alexander Poremba, and Takashi Yamakawa</span>
    <span class="title">Revocable Quantum Digital Signatures</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2024.5">10.4230/LIPIcs.TQC.2024.5</a>
</li>
<li>
    <span class="authors">André Chailloux and Jean-Pierre Tillich</span>
    <span class="title">The Quantum Decoding Problem</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2024.6">10.4230/LIPIcs.TQC.2024.6</a>
</li>
<li>
    <span class="authors">Joseph Cunningham and Jérémie Roland</span>
    <span class="title">Eigenpath Traversal by Poisson-Distributed Phase Randomisation</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2024.7">10.4230/LIPIcs.TQC.2024.7</a>
</li>
<li>
    <span class="authors">Kuo-Chin Chen, Simon Apers, and Min-Hsiu Hsieh</span>
    <span class="title">(Quantum) Complexity of Testing Signed Graph Clusterability</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2024.8">10.4230/LIPIcs.TQC.2024.8</a>
</li>
<li>
    <span class="authors">Jiachen Hu, Tongyang Li, Xinzhao Wang, Yecheng Xue, Chenyi Zhang, and Han Zhong</span>
    <span class="title">Quantum Non-Identical Mean Estimation: Efficient Algorithms and Fundamental Limits</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2024.9">10.4230/LIPIcs.TQC.2024.9</a>
</li>
<li>
    <span class="authors">Jordi Weggemans, Marten Folkertsma, and Chris Cade</span>
    <span class="title">Guidable Local Hamiltonian Problems with Implications to Heuristic Ansatz State Preparation and the Quantum PCP Conjecture</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2024.10">10.4230/LIPIcs.TQC.2024.10</a>
</li>
<li>
    <span class="authors">Aleksandrs Belovs</span>
    <span class="title">A Direct Reduction from the Polynomial to the Adversary Method</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2024.11">10.4230/LIPIcs.TQC.2024.11</a>
</li>
<li>
    <span class="authors">Anne Broadbent, Arthur Mehta, and Yuming Zhao</span>
    <span class="title">Quantum Delegation with an Off-The-Shelf Device</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.TQC.2024.12">10.4230/LIPIcs.TQC.2024.12</a>
</li>
</ul>

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