<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-22T13:28:14Z</responseDate>
  <request identifier="24828" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:24828</identifier>
        <datestamp>2026-02-09T07:41:37Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs</dc:title>
          <dc:creator>Balliu, Alkida</dc:creator>
          <dc:creator>Coupette, Corinna</dc:creator>
          <dc:creator>Cruciani, Antonio</dc:creator>
          <dc:creator>d'Amore, Francesco</dc:creator>
          <dc:creator>Equi, Massimo</dc:creator>
          <dc:creator>Lievonen, Henrik</dc:creator>
          <dc:creator>Modanese, Augusto</dc:creator>
          <dc:creator>Olivetti, Dennis</dc:creator>
          <dc:creator>Suomela, Jukka</dc:creator>
          <dc:subject>linear programming</dc:subject>
          <dc:subject>distributed quantum advantage</dc:subject>
          <dc:subject>quantum-LOCAL model</dc:subject>
          <dc:subject>SLOCAL model</dc:subject>
          <dc:subject>online-LOCAL model</dc:subject>
          <dc:subject>non-signaling distributions</dc:subject>
          <dc:subject>locally checkable labeling problems</dc:subject>
          <dc:subject>dequantization</dc:subject>
          <dc:description>In this work, we give two results that put new limits on distributed quantum advantage in the context of the LOCAL model of distributed computing:  &#13;
1) We show that there is no distributed quantum advantage for any linear program. Put otherwise, if there is a quantum-LOCAL algorithm 𝒜 that finds an α-approximation of some linear optimization problem Π in T communication rounds, we can construct a classical, deterministic LOCAL algorithm 𝒜' that finds an α-approximation of Π in T rounds. As a corollary, all classical lower bounds for linear programs, including the KMW bound, hold verbatim in quantum-LOCAL. &#13;
2) Using the above result, we show that there exists a locally checkable labeling problem (LCL) for which quantum-LOCAL is strictly weaker than the classical deterministic SLOCAL model.  Our results extend from quantum-LOCAL to finitely dependent and non-signaling distributions, and one of the corollaries of our work is that the non-signaling model and the SLOCAL model are incomparable in the context of LCL problems: By prior work, there exists an LCL problem for which SLOCAL is strictly weaker than the non-signaling model, and our work provides a separation in the opposite direction.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Alkida Balliu and Corinna Coupette and Antonio Cruciani and Francesco d'Amore and Massimo Equi and Henrik Lievonen and Augusto Modanese and Dennis Olivetti and Jukka Suomela</dc:contributor>
          <dc:date>2025</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 356, 39th International Symposium on Distributed Computing (DISC 2025)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.DISC.2025.11</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-248280</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2025.11</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
