<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="https://m2.mtmt.hu/xsl/gui3.xsl" ?>
<myciteResult>
  <serverUrl>https://m2.mtmt.hu/</serverUrl>
  <labelLang>hun</labelLang>
  <responseDate>2026-10-23 19:34</responseDate>
  <content>
    <publication>
      <otype>BookChapter</otype>
      <mtid>35749323</mtid>
      <status>APPROVED</status>
      <published>true</published>
      <comment>IBM Research, United States            
            IBM Research, South Africa            
            University of the Witwatersrand, South Africa            
            Royal Institution, United Kingdom            
            Conference code: 200372            
            Export Date: 10 February 2025            
            Funding details: International Business Machines Corporation, IBM            
            Funding details: Air Force Research Laboratory, AFRL, FA8750-C-18-0098            
            Funding details: Air Force Research Laboratory, AFRL            
            Funding details: National Research Foundation, NRF, 78554            
            Funding details: National Research Foundation, NRF            
            Funding text 1: This research was supported in part by the Air Force Research Laboratory (AFRL) grant number FA8750-C-18-0098, and in part by IBM Research, South Africa under the Equity Equivalent Investment Programme (EEIP) of the government of South Africa. VJ is supported in part by the South African Research Chairs Initiative of the National Research Foundation, grant number 78554. Firstly, we wish to thank Brian Neyenhuis, Jennifer Strabley, Chad Edwards, and Tony Uttley from the Quantinuum quantum team for generously providing us credits to access their quantum computers and assisting with the experimentation. Secondly, we would like to thank Adam Connolly and Julien Sorci for pointing out a flaw in the algorithm of an earlier version of the paper. Next, we would like to acknowledge Tal Kachman for the suggestion to use controlled-increment to entangle the simplices with the count register. The authors would also like to thank Scott Aaronson, Paul Alsing, Ryan Babbush, Sergey Bravyi, Chris Cade, Marcos Crichigno, Aram Harrow, Gil Kalai, and Seth Lloyd for valuable discussions.</comment>
      <unhandledTickets>0</unhandledTickets>
      <deleted>false</deleted>
      <lastRefresh>2025-02-28T12:52:46.159+0000</lastRefresh>
      <lastModified>2025-02-28T09:37:13.375+0000</lastModified>
      <created>2025-02-10T11:17:11.951+0000</created>
      <creator>
        <snippet>true</snippet>
        <mtid>10084481</mtid>
        <familyName>Toroczkai</familyName>
        <givenName>Annamária</givenName>
        <link>/api/admin/10084481</link>
        <otype>Admin</otype>
        <label>Toroczkai Annamária (idézők, admin)</label>
        <published>true</published>
      </creator>
      <duplumSearchResult>
        <id>5124600</id>
        <creationDate>2025-03-05T16:09:59.898+0000</creationDate>
        <startDate>2025-03-05T16:10:00.165+0000</startDate>
        <creator>
          <otype>Admin</otype>
          <mtid>10015168</mtid>
          <link>/api/admin/10015168</link>
          <label>Szakonyi Erzsebet (RAMKI admin 4)</label>
          <familyName>Szakonyi</familyName>
          <givenName>Erzsebet</givenName>
          <published>true</published>
          <oldId>10015168</oldId>
          <snippet>true</snippet>
        </creator>
      </duplumSearchResult>
      <duplumRole>SUSPECT</duplumRole>
      <lastDuplumOK>2025-02-28T12:34:29.007+0000</lastDuplumOK>
      <lastDuplumSearch>2025-03-05T16:10:00.165+0000</lastDuplumSearch>
      <core>false</core>
      <publicationPending>false</publicationPending>
      <type>
        <snippet>true</snippet>
        <mtid>31</mtid>
        <code>31</code>
        <link>/api/publicationtype/31</link>
        <otype>PublicationType</otype>
        <label>Egyéb konferenciaközlemény</label>
        <listPosition>4</listPosition>
        <published>true</published>
        <oldId>31</oldId>
        <otypeName>BookChapter</otypeName>
      </type>
      <subType>
        <snippet>true</snippet>
        <mtid>10000197</mtid>
        <nameEng>Conference paper</nameEng>
        <docType>
          <snippet>true</snippet>
          <mtid>31</mtid>
          <code>31</code>
          <link>/api/publicationtype/31</link>
          <otype>PublicationType</otype>
          <label>Egyéb konferenciaközlemény</label>
          <listPosition>4</listPosition>
          <published>true</published>
          <oldId>31</oldId>
          <otypeName>BookChapter</otypeName>
        </docType>
        <link>/api/subtype/10000197</link>
        <name>Konferenciaközlemény</name>
        <otype>SubType</otype>
        <label>Konferenciaközlemény (Egyéb konferenciaközlemény)</label>
        <listPosition>452</listPosition>
        <published>true</published>
        <oldId>10000197</oldId>
      </subType>
      <category>
        <snippet>true</snippet>
        <mtid>1</mtid>
        <link>/api/category/1</link>
        <otype>Category</otype>
        <label>Tudományos</label>
        <published>true</published>
        <oldId>1</oldId>
      </category>
      <firstAuthor>Akhalwaya, I.Y.</firstAuthor>
      <title>TOPOLOGICAL DATA ANALYSIS ON NOISY QUANTUM COMPUTERS</title>
      <firstPage>&amp;</firstPage>
      <firstPageOrInternalIdForSort>&amp;</firstPageOrInternalIdForSort>
      <publishedYear>2024</publishedYear>
      <abstractText>Topological data analysis (TDA) is a powerful technique for extracting complex and valuable shape-related summaries of high-dimensional data. However, the computational demands of classical algorithms for computing TDA are exorbitant, and quickly become impractical for high-order characteristics. Quantum computers offer the potential of achieving significant speedup for certain computational problems. Indeed, TDA has been purported to be one such problem, yet, quantum computing algorithms proposed for the problem, such as the original Quantum TDA (QTDA) formulation by Lloyd, Garnerone and Zanardi, require currently unavailable fault-tolerance. In this study, we present NISQ-TDA, a fully implemented end-to-end quantum machine learning algorithm needing only a short circuit-depth, that is applicable to high-dimensional classical data, and with provable asymptotic speedup for certain classes of problems. The algorithm neither suffers from the data-loading problem nor does it need to store the input data on the quantum computer explicitly. The algorithm was successfully executed on quantum computing devices, as well as on noisy quantum simulators, applied to small datasets. Preliminary empirical results suggest that the algorithm is robust to noise. © 2024 12th International Conference on Learning Representations, ICLR 2024. All rights reserved.</abstractText>
      <digital/>
      <printed/>
      <sourceYear>2025</sourceYear>
      <foreignEdition/>
      <foreignLanguage>true</foreignLanguage>
      <fullPublication>true</fullPublication>
      <conferencePublication>true</conferencePublication>
      <nationalOrigin/>
      <missingAuthor>false</missingAuthor>
      <oaType>NONE</oaType>
      <oaCheckDate>2025-02-28</oaCheckDate>
      <oaFree>false</oaFree>
      <citationCount>0</citationCount>
      <citationCountUnpublished>0</citationCountUnpublished>
      <citationCountWoOther>0</citationCountWoOther>
      <independentCitCountWoOther>0</independentCitCountWoOther>
      <doiCitationCount>0</doiCitationCount>
      <wosCitationCount>0</wosCitationCount>
      <scopusCitationCount>0</scopusCitationCount>
      <independentCitationCount>0</independentCitationCount>
      <unhandledCitationCount>0</unhandledCitationCount>
      <citingPubCount>0</citingPubCount>
      <independentCitingPubCount>0</independentCitingPubCount>
      <unhandledCitingPubCount>0</unhandledCitingPubCount>
      <citedPubCount>2</citedPubCount>
      <citedCount>2</citedCount>
      <hasCitationDuplums>false</hasCitationDuplums>
      <importDuplum>false</importDuplum>
      <importOverwritten>false</importOverwritten>
      <importSkipped>false</importSkipped>
      <userChangeableUntil>2025-05-29T08:37:13.156+0000</userChangeableUntil>
      <directInstitutesForSort></directInstitutesForSort>
      <ownerAuthorCount>1</ownerAuthorCount>
      <ownerInstituteCount>14</ownerInstituteCount>
      <directInstituteCount>0</directInstituteCount>
      <authorCount>9</authorCount>
      <contributorCount>0</contributorCount>
      <book>
        <snippet>true</snippet>
        <languages>
          <language>
            <snippet>true</snippet>
            <mtid>10002</mtid>
            <nameEng>English</nameEng>
            <link>/api/language/10002</link>
            <name>Angol</name>
            <otype>Language</otype>
            <label>Angol</label>
            <published>true</published>
            <oldId>2</oldId>
          </language>
        </languages>
        <citation>false</citation>
        <publishedAt/>
        <identifiers>
          <identifier>
            <snippet>true</snippet>
            <mtid>26946994</mtid>
            <validState>IDENTICAL</validState>
            <link>/api/publicationidentifier/26946994</link>
            <realUrl>https://openreview.net/group?id=ICLR.cc/2024/Conference#tab-accept-oral</realUrl>
            <idValue>https://openreview.net/group?id=ICLR.cc/2024/Conference#tab-accept-oral</idValue>
            <otype>PublicationIdentifier</otype>
            <label>Egyéb URL: https://openreview.net/group?id=ICLR.cc/2024/Conference#tab-accept-oral</label>
            <source>
              <snippet>true</snippet>
              <mtid>40</mtid>
              <nameEng>Other URL</nameEng>
              <linkPattern>@@@</linkPattern>
              <link>/api/publicationsource/40</link>
              <name>Egyéb URL</name>
              <otype>PlainSource</otype>
              <label>Egyéb URL</label>
              <published>true</published>
              <type>
                <snippet>true</snippet>
                <mtid>10006</mtid>
                <link>/api/publicationsourcetype/10006</link>
                <otype>PublicationSourceType</otype>
                <label>Link</label>
                <published>true</published>
                <mayHaveOa>true</mayHaveOa>
              </type>
              <oldId>40</oldId>
              <publiclyVisible>true</publiclyVisible>
            </source>
            <published>false</published>
          </identifier>
          <identifier>
            <snippet>true</snippet>
            <mtid>27812562</mtid>
            <validState>IDENTICAL</validState>
            <link>/api/publicationidentifier/27812562</link>
            <realUrl>https://iclr.cc/Conferences/2024</realUrl>
            <idValue>https://iclr.cc/Conferences/2024</idValue>
            <otype>PublicationIdentifier</otype>
            <label>Egyéb URL: https://iclr.cc/Conferences/2024</label>
            <source>
              <snippet>true</snippet>
              <mtid>40</mtid>
              <nameEng>Other URL</nameEng>
              <linkPattern>@@@</linkPattern>
              <link>/api/publicationsource/40</link>
              <name>Egyéb URL</name>
              <otype>PlainSource</otype>
              <label>Egyéb URL</label>
              <published>true</published>
              <type>
                <snippet>true</snippet>
                <mtid>10006</mtid>
                <link>/api/publicationsourcetype/10006</link>
                <otype>PublicationSourceType</otype>
                <label>Link</label>
                <published>true</published>
                <mayHaveOa>true</mayHaveOa>
              </type>
              <oldId>40</oldId>
              <publiclyVisible>true</publiclyVisible>
            </source>
            <published>false</published>
          </identifier>
        </identifiers>
        <link>/api/publication/35178194</link>
        <label>12th International Conference on Learning Representations, ICLR 2024. (2024)</label>
        <published>true</published>
        <type>
          <snippet>true</snippet>
          <mtid>32</mtid>
          <code>32</code>
          <link>/api/publicationtype/32</link>
          <otype>PublicationType</otype>
          <label>Egyéb konferenciakötet</label>
          <listPosition>6</listPosition>
          <published>true</published>
          <oldId>32</oldId>
          <otypeName>Book</otypeName>
        </type>
        <title>12th International Conference on Learning Representations, ICLR 2024</title>
        <publicationPending>false</publicationPending>
        <mtid>35178194</mtid>
        <core>false</core>
        <conferencePublication>true</conferencePublication>
        <foreignLanguage>true</foreignLanguage>
        <fullPublication>false</fullPublication>
        <otype>Book</otype>
        <publishedYear>2024</publishedYear>
        <category>
          <snippet>true</snippet>
          <mtid>1</mtid>
          <link>/api/category/1</link>
          <otype>Category</otype>
          <label>Tudományos</label>
          <published>true</published>
          <oldId>1</oldId>
        </category>
      </book>
      <hasQualityFactor>false</hasQualityFactor>
      <languages>
        <language>
          <otype>Language</otype>
          <mtid>10002</mtid>
          <link>/api/language/10002</link>
          <label>Angol</label>
          <name>Angol</name>
          <nameEng>English</nameEng>
          <published>true</published>
          <oldId>2</oldId>
          <snippet>true</snippet>
        </language>
      </languages>
      <authorships>
        <authorship>
          <otype>PersonAuthorship</otype>
          <mtid>123224386</mtid>
          <link>/api/authorship/123224386</link>
          <label>Akhalwaya, I.Y.</label>
          <listPosition>1</listPosition>
          <share>0.11111111</share>
          <first>true</first>
          <last>false</last>
          <corresponding>false</corresponding>
          <familyName>Akhalwaya</familyName>
          <givenName>I.Y.</givenName>
          <authorTyped>true</authorTyped>
          <editorTyped>false</editorTyped>
          <otherTyped>false</otherTyped>
          <type>
            <otype>AuthorshipType</otype>
            <mtid>1</mtid>
            <link>/api/authorshiptype/1</link>
            <label>Szerző</label>
            <code>0</code>
            <published>true</published>
            <oldId>0</oldId>
            <snippet>true</snippet>
          </type>
          <published>false</published>
          <snippet>true</snippet>
        </authorship>
        <authorship>
          <otype>PersonAuthorship</otype>
          <mtid>123224387</mtid>
          <link>/api/authorship/123224387</link>
          <label>Ubaru, S.</label>
          <listPosition>2</listPosition>
          <share>0.11111111</share>
          <first>false</first>
          <last>false</last>
          <corresponding>false</corresponding>
          <familyName>Ubaru</familyName>
          <givenName>S.</givenName>
          <authorTyped>true</authorTyped>
          <editorTyped>false</editorTyped>
          <otherTyped>false</otherTyped>
          <type>
            <otype>AuthorshipType</otype>
            <mtid>1</mtid>
            <link>/api/authorshiptype/1</link>
            <label>Szerző</label>
            <code>0</code>
            <published>true</published>
            <oldId>0</oldId>
            <snippet>true</snippet>
          </type>
          <published>false</published>
          <snippet>true</snippet>
        </authorship>
        <authorship>
          <otype>PersonAuthorship</otype>
          <mtid>123224388</mtid>
          <link>/api/authorship/123224388</link>
          <label>Clarkson, K.L.</label>
          <listPosition>3</listPosition>
          <share>0.11111111</share>
          <first>false</first>
          <last>false</last>
          <corresponding>false</corresponding>
          <familyName>Clarkson</familyName>
          <givenName>K.L.</givenName>
          <authorTyped>true</authorTyped>
          <editorTyped>false</editorTyped>
          <otherTyped>false</otherTyped>
          <type>
            <otype>AuthorshipType</otype>
            <mtid>1</mtid>
            <link>/api/authorshiptype/1</link>
            <label>Szerző</label>
            <code>0</code>
            <published>true</published>
            <oldId>0</oldId>
            <snippet>true</snippet>
          </type>
          <published>false</published>
          <snippet>true</snippet>
        </authorship>
        <authorship>
          <otype>PersonAuthorship</otype>
          <mtid>123224389</mtid>
          <link>/api/authorship/123224389</link>
          <label>Squillante, M.S.</label>
          <listPosition>4</listPosition>
          <share>0.11111111</share>
          <first>false</first>
          <last>false</last>
          <corresponding>false</corresponding>
          <familyName>Squillante</familyName>
          <givenName>M.S.</givenName>
          <authorTyped>true</authorTyped>
          <editorTyped>false</editorTyped>
          <otherTyped>false</otherTyped>
          <type>
            <otype>AuthorshipType</otype>
            <mtid>1</mtid>
            <link>/api/authorshiptype/1</link>
            <label>Szerző</label>
            <code>0</code>
            <published>true</published>
            <oldId>0</oldId>
            <snippet>true</snippet>
          </type>
          <published>false</published>
          <snippet>true</snippet>
        </authorship>
        <authorship>
          <otype>PersonAuthorship</otype>
          <mtid>123224390</mtid>
          <link>/api/authorship/123224390</link>
          <label>Jejjala, V.</label>
          <listPosition>5</listPosition>
          <share>0.11111111</share>
          <first>false</first>
          <last>false</last>
          <corresponding>false</corresponding>
          <familyName>Jejjala</familyName>
          <givenName>V.</givenName>
          <authorTyped>true</authorTyped>
          <editorTyped>false</editorTyped>
          <otherTyped>false</otherTyped>
          <type>
            <otype>AuthorshipType</otype>
            <mtid>1</mtid>
            <link>/api/authorshiptype/1</link>
            <label>Szerző</label>
            <code>0</code>
            <published>true</published>
            <oldId>0</oldId>
            <snippet>true</snippet>
          </type>
          <published>false</published>
          <snippet>true</snippet>
        </authorship>
        <authorship>
          <otype>PersonAuthorship</otype>
          <mtid>123224391</mtid>
          <link>/api/authorship/123224391</link>
          <label>He, Y.-H.</label>
          <listPosition>6</listPosition>
          <share>0.11111111</share>
          <first>false</first>
          <last>false</last>
          <corresponding>false</corresponding>
          <familyName>He</familyName>
          <givenName>Y.-H.</givenName>
          <authorTyped>true</authorTyped>
          <editorTyped>false</editorTyped>
          <otherTyped>false</otherTyped>
          <type>
            <otype>AuthorshipType</otype>
            <mtid>1</mtid>
            <link>/api/authorshiptype/1</link>
            <label>Szerző</label>
            <code>0</code>
            <published>true</published>
            <oldId>0</oldId>
            <snippet>true</snippet>
          </type>
          <published>false</published>
          <snippet>true</snippet>
        </authorship>
        <authorship>
          <otype>PersonAuthorship</otype>
          <mtid>123224392</mtid>
          <link>/api/authorship/123224392</link>
          <label>Naidoo, K.</label>
          <listPosition>7</listPosition>
          <share>0.11111111</share>
          <first>false</first>
          <last>false</last>
          <corresponding>false</corresponding>
          <familyName>Naidoo</familyName>
          <givenName>K.</givenName>
          <authorTyped>true</authorTyped>
          <editorTyped>false</editorTyped>
          <otherTyped>false</otherTyped>
          <type>
            <otype>AuthorshipType</otype>
            <mtid>1</mtid>
            <link>/api/authorshiptype/1</link>
            <label>Szerző</label>
            <code>0</code>
            <published>true</published>
            <oldId>0</oldId>
            <snippet>true</snippet>
          </type>
          <published>false</published>
          <snippet>true</snippet>
        </authorship>
        <authorship>
          <otype>PersonAuthorship</otype>
          <mtid>123224393</mtid>
          <link>/api/authorship/123224393</link>
          <label>Kalantzis, V.</label>
          <listPosition>8</listPosition>
          <share>0.11111111</share>
          <first>false</first>
          <last>false</last>
          <corresponding>false</corresponding>
          <familyName>Kalantzis</familyName>
          <givenName>V.</givenName>
          <authorTyped>true</authorTyped>
          <editorTyped>false</editorTyped>
          <otherTyped>false</otherTyped>
          <type>
            <otype>AuthorshipType</otype>
            <mtid>1</mtid>
            <link>/api/authorshiptype/1</link>
            <label>Szerző</label>
            <code>0</code>
            <published>true</published>
            <oldId>0</oldId>
            <snippet>true</snippet>
          </type>
          <published>false</published>
          <snippet>true</snippet>
        </authorship>
        <authorship>
          <otype>PersonAuthorship</otype>
          <mtid>123224394</mtid>
          <link>/api/authorship/123224394</link>
          <label>Horesh, L.</label>
          <listPosition>9</listPosition>
          <share>0.11111111</share>
          <first>false</first>
          <last>true</last>
          <corresponding>false</corresponding>
          <familyName>Horesh</familyName>
          <givenName>L.</givenName>
          <authorTyped>true</authorTyped>
          <editorTyped>false</editorTyped>
          <otherTyped>false</otherTyped>
          <type>
            <otype>AuthorshipType</otype>
            <mtid>1</mtid>
            <link>/api/authorshiptype/1</link>
            <label>Szerző</label>
            <code>0</code>
            <published>true</published>
            <oldId>0</oldId>
            <snippet>true</snippet>
          </type>
          <published>false</published>
          <snippet>true</snippet>
        </authorship>
      </authorships>
      <identifiers>
        <identifier>
          <otype>PublicationIdentifier</otype>
          <mtid>28373883</mtid>
          <link>/api/publicationidentifier/28373883</link>
          <label>Scopus: 85200602121</label>
          <source>
            <otype>PlainSource</otype>
            <mtid>3</mtid>
            <link>/api/publicationsource/3</link>
            <label>Scopus</label>
            <type>
              <otype>PublicationSourceType</otype>
              <mtid>10003</mtid>
              <link>/api/publicationsourcetype/10003</link>
              <label>Indexelő adatbázis</label>
              <mayHaveOa>false</mayHaveOa>
              <published>true</published>
              <snippet>true</snippet>
            </type>
            <name>Scopus</name>
            <linkPattern>http://www.scopus.com/record/display.url?origin=inward&amp;eid=2-s2.0-@@@</linkPattern>
            <publiclyVisible>true</publiclyVisible>
            <published>true</published>
            <oldId>3</oldId>
            <snippet>true</snippet>
          </source>
          <idValue>85200602121</idValue>
          <realUrl>http://www.scopus.com/record/display.url?origin=inward&amp;eid=2-s2.0-85200602121</realUrl>
          <published>false</published>
          <snippet>true</snippet>
        </identifier>
      </identifiers>
      <keywords>
        <keyword>
          <otype>Keyword</otype>
          <mtid>6402</mtid>
          <link>/api/keyword/6402</link>
          <label>TOPOLOGY</label>
          <published>true</published>
          <oldId>6402</oldId>
          <snippet>true</snippet>
        </keyword>
        <keyword>
          <otype>Keyword</otype>
          <mtid>12390</mtid>
          <link>/api/keyword/12390</link>
          <label>machine learning</label>
          <published>true</published>
          <oldId>12390</oldId>
          <snippet>true</snippet>
        </keyword>
        <keyword>
          <otype>Keyword</otype>
          <mtid>1009970</mtid>
          <link>/api/keyword/1009970</link>
          <label>Information analysis</label>
          <published>true</published>
          <oldId>1009970</oldId>
          <snippet>true</snippet>
        </keyword>
        <keyword>
          <otype>Keyword</otype>
          <mtid>1014189</mtid>
          <link>/api/keyword/1014189</link>
          <label>Quantum computers</label>
          <published>true</published>
          <oldId>1014189</oldId>
          <snippet>true</snippet>
        </keyword>
        <keyword>
          <otype>Keyword</otype>
          <mtid>1014520</mtid>
          <link>/api/keyword/1014520</link>
          <label>Learning algorithms</label>
          <published>true</published>
          <oldId>1014520</oldId>
          <snippet>true</snippet>
        </keyword>
        <keyword>
          <otype>Keyword</otype>
          <mtid>1016245</mtid>
          <link>/api/keyword/1016245</link>
          <label>Clustering algorithms</label>
          <published>true</published>
          <oldId>1016245</oldId>
          <snippet>true</snippet>
        </keyword>
        <keyword>
          <otype>Keyword</otype>
          <mtid>1138489</mtid>
          <link>/api/keyword/1138489</link>
          <label>Computational demands</label>
          <published>true</published>
          <oldId>1138489</oldId>
          <snippet>true</snippet>
        </keyword>
        <keyword>
          <otype>Keyword</otype>
          <mtid>1174122</mtid>
          <link>/api/keyword/1174122</link>
          <label>High-order</label>
          <published>true</published>
          <oldId>1174122</oldId>
          <snippet>true</snippet>
        </keyword>
        <keyword>
          <otype>Keyword</otype>
          <mtid>1201290</mtid>
          <link>/api/keyword/1201290</link>
          <label>Fault tolerance</label>
          <published>true</published>
          <oldId>1201290</oldId>
          <snippet>true</snippet>
        </keyword>
        <keyword>
          <otype>Keyword</otype>
          <mtid>1205600</mtid>
          <link>/api/keyword/1205600</link>
          <label>Computational problem</label>
          <published>true</published>
          <oldId>1205600</oldId>
          <snippet>true</snippet>
        </keyword>
        <keyword>
          <otype>Keyword</otype>
          <mtid>1280781</mtid>
          <link>/api/keyword/1280781</link>
          <label>HIGHER-ORDER</label>
          <published>true</published>
          <oldId>1280781</oldId>
          <snippet>true</snippet>
        </keyword>
        <keyword>
          <otype>Keyword</otype>
          <mtid>1303741</mtid>
          <link>/api/keyword/1303741</link>
          <label>Quantum computing</label>
          <published>true</published>
          <oldId>1303741</oldId>
          <snippet>true</snippet>
        </keyword>
        <keyword>
          <otype>Keyword</otype>
          <mtid>1316046</mtid>
          <link>/api/keyword/1316046</link>
          <label>Computing algorithms</label>
          <published>true</published>
          <oldId>1316046</oldId>
          <snippet>true</snippet>
        </keyword>
        <keyword>
          <otype>Keyword</otype>
          <mtid>1519696</mtid>
          <link>/api/keyword/1519696</link>
          <label>Topological data analysis</label>
          <published>true</published>
          <snippet>true</snippet>
        </keyword>
        <keyword>
          <otype>Keyword</otype>
          <mtid>1540996</mtid>
          <link>/api/keyword/1540996</link>
          <label>High dimensional data</label>
          <published>true</published>
          <snippet>true</snippet>
        </keyword>
        <keyword>
          <otype>Keyword</otype>
          <mtid>1781334</mtid>
          <link>/api/keyword/1781334</link>
          <label>End to end</label>
          <published>true</published>
          <snippet>true</snippet>
        </keyword>
        <keyword>
          <otype>Keyword</otype>
          <mtid>2546380</mtid>
          <link>/api/keyword/2546380</link>
          <label>Quanta computers</label>
          <published>true</published>
          <snippet>true</snippet>
        </keyword>
      </keywords>
      <references>
        <reference>
          <otype>Reference</otype>
          <mtid>63218945</mtid>
          <link>/api/reference/63218945</link>
          <label>1. Suppressing quantum errors by scaling a surface code logical qubit (2023) Nature, 614 (7949), pp. 676-681</label>
          <listPosition>1</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218946</mtid>
          <link>/api/reference/63218946</link>
          <label>2. Aaronson, Scott, Read the fine print (2015) Nature Physics, 11 (4), pp. 291-293</label>
          <listPosition>2</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218998</mtid>
          <link>/api/reference/63218998</link>
          <label>3. Kahle, Matthew, (2016) Random simplicial complexes, , arXiv preprint arXiv:1607.07069</label>
          <listPosition>3</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218947</mtid>
          <link>/api/reference/63218947</link>
          <label>4. Adhikari, Kartick, Adler, Robert J, Bobrowski, Omer, Rosenthal, Ron, (2020) On the spectrum of dense random geometric graphs, , arXiv preprint arXiv:2004.04967</label>
          <listPosition>4</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218948</mtid>
          <link>/api/reference/63218948</link>
          <label>5. Adler, Robert J, Bobrowski, Omer, Weinberger, Shmuel, Crackle: The homology of noise (2014) Discrete &amp; Computational Geometry, 52 (4), pp. 680-704</label>
          <listPosition>5</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218949</mtid>
          <link>/api/reference/63218949</link>
          <label>6. Aghanim, N., Planck 2018 results. VI. Cosmological parameters (2020) Astron. Astrophys, 641, p. A6. , [Erratum: Astron.Astrophys. 652, C4 (2021)]</label>
          <listPosition>6</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218950</mtid>
          <link>/api/reference/63218950</link>
          <label>7. Akhalwaya, Ismail Yunus, He, Yang-Hui, Horesh, Lior, Jejjala, Vishnu, Kirby, William, Naidoo, Kugendran, Ubaru, Shashanka, Representation of the fermionic boundary operator (2022) Physical Review A, 106 (2), p. 022407</label>
          <listPosition>7</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218951</mtid>
          <link>/api/reference/63218951</link>
          <label>8. Ambainis, Andris, Emerson, Joseph, Quantum t-designs: t-wise independence in the quantum world (2007) Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), pp. 129-140. , IEEE</label>
          <listPosition>8</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218952</mtid>
          <link>/api/reference/63218952</link>
          <label>9. Apers, Simon, Gribling, Sander, Sen, Sayantan, Szabó, Dániel, (2022) A (simple) classical algorithm for estimating betti numbers, , arXiv preprint arXiv:2211.09618</label>
          <listPosition>9</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218953</mtid>
          <link>/api/reference/63218953</link>
          <label>10. Arute, Frank, Arya, Kunal, Babbush, Ryan, Bacon, Dave, Bardin, Joseph C, Barends, Rami, Biswas, Rupak, Buell, David A, Quantum supremacy using a programmable superconducting processor (2019) Nature, 574 (7779), pp. 505-510</label>
          <listPosition>10</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218954</mtid>
          <link>/api/reference/63218954</link>
          <label>11. Avron, Haim, Toledo, Sivan, Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix (2011) Journal of the ACM (JACM), 58 (2), pp. 1-34</label>
          <listPosition>11</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218955</mtid>
          <link>/api/reference/63218955</link>
          <label>12. Bauer, Frank, Jost, Jürgen, Liu, Shiping, (2011) Ollivier-Ricci curvature and the spectrum of the normalized graph Laplace operator, , arXiv preprint arXiv:1105.3803</label>
          <listPosition>12</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218956</mtid>
          <link>/api/reference/63218956</link>
          <label>13. Beals, Robert, Brierley, Stephen, Gray, Oliver, Harrow, Aram W, Kutin, Samuel, Linden, Noah, Shepherd, Dan, Stather, Mark, Efficient distributed quantum computing (2013) Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 469 (2153), p. 20120686</label>
          <listPosition>13</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218957</mtid>
          <link>/api/reference/63218957</link>
          <label>14. Beit-Aharon, Orr, Meshulam, Roy, Spectral expansion of random sum complexes (2020) Journal of Topology and Analysis, 12, pp. 989-1002. , (04)</label>
          <listPosition>14</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218958</mtid>
          <link>/api/reference/63218958</link>
          <label>15. Biagetti, Matteo, Cole, Alex, Shiu, Gary, The Persistence of Large Scale Structures I: Primordial non-Gaussianity (2021) JCAP, p. 061. , 04</label>
          <listPosition>15</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218959</mtid>
          <link>/api/reference/63218959</link>
          <label>16. Biamonte, Jacob, Wittek, Peter, Pancotti, Nicola, Rebentrost, Patrick, Wiebe, Nathan, Lloyd, Seth, Quantum machine learning (2017) Nature, 549 (7671), pp. 195-202</label>
          <listPosition>16</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218960</mtid>
          <link>/api/reference/63218960</link>
          <label>17. Boyer, Michel, Brassard, Gilles, Høyer, Peter, Tapp, Alain, Tight bounds on quantum searching (1998) Fortschritte der Physik: Progress of Physics, 46 (4-5), pp. 493-505</label>
          <listPosition>17</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218961</mtid>
          <link>/api/reference/63218961</link>
          <label>18. Brakerski, Zvika, Shmueli, Omri, (pseudo) random quantum states with binary phase (2019) Theory of Cryptography Conference, pp. 229-250. , Springer</label>
          <listPosition>18</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218962</mtid>
          <link>/api/reference/63218962</link>
          <label>19. Bravyi, Sergey, Gosset, David, König, Robert, Quantum advantage with shallow circuits (2018) Science, 362 (6412), pp. 308-311</label>
          <listPosition>19</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218963</mtid>
          <link>/api/reference/63218963</link>
          <label>20. Cade, Chris, Marcos Crichigno, P, (2021) Complexity of supersymmetric systems and the cohomology problem, , arXiv preprint arXiv:2107.00011</label>
          <listPosition>20</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218964</mtid>
          <link>/api/reference/63218964</link>
          <label>21. Cerezo, Marco, Arrasmith, Andrew, Babbush, Ryan, Benjamin, Simon C, Endo, Suguru, Fujii, Keisuke, McClean, Jarrod R, Cincio, Lukasz, Variational quantum algorithms (2021) Nature Reviews Physics, 3 (9), pp. 625-644</label>
          <listPosition>21</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218965</mtid>
          <link>/api/reference/63218965</link>
          <label>22. Chepurko, Nadiia, Clarkson, Kenneth L, Horesh, Lior, Woodruff, David P, (2020) Quantum-inspired algorithms from randomized numerical linear algebra, , arXiv preprint arXiv:2011.04125</label>
          <listPosition>22</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218966</mtid>
          <link>/api/reference/63218966</link>
          <label>23. Chia, Nai-Hui, Gilyén, András, Li, Tongyang, Lin, Han-Hsuan, Tang, Ewin, Wang, Chunhao, Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning (2020) Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 387-400</label>
          <listPosition>23</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218967</mtid>
          <link>/api/reference/63218967</link>
          <label>24. Cole, Alex, Shiu, Gary, Persistent Homology and Non-Gaussianity (2018) JCAP, p. 025. , 03:, a</label>
          <listPosition>24</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218968</mtid>
          <link>/api/reference/63218968</link>
          <label>25. Cole, Alex, Shiu, Gary, Persistent homology and non-Gaussianity (2018) Journal of Cosmology and Astroparticle Physics, 2018, p. 025. , (03):, b</label>
          <listPosition>25</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218969</mtid>
          <link>/api/reference/63218969</link>
          <label>26. Crichigno, Marcos, Kohler, Tamara, (2022) Clique homology is qma1-hard, , arXiv preprint arXiv:22209.11793</label>
          <listPosition>26</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218970</mtid>
          <link>/api/reference/63218970</link>
          <label>27. Deshpande, Abhinav, Mehta, Arthur, Vincent, Trevor, Quesada, Nicolás, Hinsche, Marcel, Ioannou, Marios, Madsen, Lars, Eisert, Jens, Quantum computational advantage via high-dimensional gaussian boson sampling (2022) Science advances, 8 (1), p. eabi7894</label>
          <listPosition>27</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218971</mtid>
          <link>/api/reference/63218971</link>
          <label>28. Deutsch, David, Quantum theory, the Church-Turing principle and the universal quantum computer (1985) Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 400 (1818), pp. 97-117</label>
          <listPosition>28</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218972</mtid>
          <link>/api/reference/63218972</link>
          <label>29. DiVincenzo, David P, The physical implementation of quantum computation (2000) Fortschritte der Physik: Progress of Physics, 48 (9-11), pp. 771-783</label>
          <listPosition>29</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218973</mtid>
          <link>/api/reference/63218973</link>
          <label>30. Feldbrugge, Job, van Engelen, Matti, van de Weygaert, Rien, Pranav, Pratyush, Vegter, Gert, Stochastic Homology of Gaussian vs. non-Gaussian Random Fields: Graphs towards Betti Numbers and Persistence Diagrams (2019) JCAP, p. 052. , 09:, a</label>
          <listPosition>30</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218974</mtid>
          <link>/api/reference/63218974</link>
          <label>31. Feldbrugge, Job, Van Engelen, Matti, van de Weygaert, Rien, Pranav, Pratyush, Vegter, Gert, Stochastic homology of Gaussian vs. non-Gaussian random fields: graphs towards betti numbers and persistence diagrams (2019) Journal of Cosmology and Astroparticle Physics, 2019, p. 052. , (09):, b</label>
          <listPosition>31</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218975</mtid>
          <link>/api/reference/63218975</link>
          <label>32. Fendley, Paul, Schoutens, Kareljan, Exact results for strongly correlated fermions in 2+ 1 dimensions (2005) Physical review letters, 95 (4), p. 046403</label>
          <listPosition>32</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218976</mtid>
          <link>/api/reference/63218976</link>
          <label>33. Feynman, Richard P, Simulating physics with computers (1982) International Journal of Theoretical Physics, 21 (6). , (/7)</label>
          <listPosition>33</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218977</mtid>
          <link>/api/reference/63218977</link>
          <label>34. Fika, Paraskevi, Koukouvinos, Christos, Stochastic estimates for the trace of functions of matrices via Hadamard matrices (2017) Communications in Statistics-Simulation and Computation, 46 (5), pp. 3491-3503</label>
          <listPosition>34</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218978</mtid>
          <link>/api/reference/63218978</link>
          <label>35. Friedman, Joel, Computing Betti numbers via combinatorial Laplacians (1998) Algorithmica, 21 (4), pp. 331-346</label>
          <listPosition>35</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218979</mtid>
          <link>/api/reference/63218979</link>
          <label>36. Ghrist, Robert, Barcodes: the persistent topology of data (2008) Bulletin of the American Mathematical Society, 45 (1), pp. 61-75</label>
          <listPosition>36</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218997</mtid>
          <link>/api/reference/63218997</link>
          <label>37. Jordan, P, Wigner, E, Über das paulische äquivalenzverbot (1928) Zeitschrift für Physik, 47 (9), pp. 631-651</label>
          <listPosition>37</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218980</mtid>
          <link>/api/reference/63218980</link>
          <label>38. Gilyén, András, Su, Yuan, Hao Low, Guang, Wiebe, Nathan, Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics (2019) Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 193-204</label>
          <listPosition>38</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218981</mtid>
          <link>/api/reference/63218981</link>
          <label>39. Giusti, Chad, Pastalkova, Eva, Curto, Carina, Itskov, Vladimir, Clique topology reveals intrinsic geometric structure in neural correlations (2015) Proceedings of the National Academy of Sciences, 112 (44), pp. 13455-13460</label>
          <listPosition>39</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218982</mtid>
          <link>/api/reference/63218982</link>
          <label>40. Goldberg, Timothy E, (2002) Combinatorial Laplacians of simplicial complexes, , Senior Thesis, Bard College</label>
          <listPosition>40</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218983</mtid>
          <link>/api/reference/63218983</link>
          <label>41. Gottesman, Daniel, An introduction to quantum error correction and fault-tolerant quantum computation (2010) Quantum information science and its contributions to mathematics, Proceedings of Symposia in Applied Mathematics, 68, pp. 13-58</label>
          <listPosition>41</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218984</mtid>
          <link>/api/reference/63218984</link>
          <label>42. Grover, K, A fast quantum mechanical algorithm for database search (1996) Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pp. 212-219. , Lov</label>
          <listPosition>42</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218985</mtid>
          <link>/api/reference/63218985</link>
          <label>43. Gundert, Anna, Wagner, Uli, On eigenvalues of random complexes (2016) Israel Journal of Mathematics, 216 (2), pp. 545-582</label>
          <listPosition>43</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218986</mtid>
          <link>/api/reference/63218986</link>
          <label>44. Gunn, Sam, Kornerup, Niels, (2019) Review of a quantum algorithm for Betti numbers, , arXiv preprint arXiv:1906.07673</label>
          <listPosition>44</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218987</mtid>
          <link>/api/reference/63218987</link>
          <label>45. Guss, William H, Salakhutdinov, Ruslan, (2018) On characterizing the capacity of neural networks using algebraic topology, , arXiv preprint arXiv:1802.04443</label>
          <listPosition>45</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218988</mtid>
          <link>/api/reference/63218988</link>
          <label>46. Guzman-Saenz, Aldo, Haiminen, Niina, Saugata, Basum, Parida, Laxmi, Signal enrichment with strain-level resolution in metagenomes using topological data analysis (2019) BMC Genomics, 20, pp. 25-34</label>
          <listPosition>46</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218989</mtid>
          <link>/api/reference/63218989</link>
          <label>47. Gyurik, Casper, Cade, Chris, Dunjko, Vedran, (2020) Towards quantum advantage for topological data analysis, , arXiv preprint arXiv:2005.02607</label>
          <listPosition>47</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218990</mtid>
          <link>/api/reference/63218990</link>
          <label>48. Harrow, Aram W, Hassidim, Avinatan, Lloyd, Seth, Quantum algorithm for linear systems of equations (2009) Physical review letters, 103 (15), p. 150502</label>
          <listPosition>48</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218991</mtid>
          <link>/api/reference/63218991</link>
          <label>49. Havlíček, Vojtěch, Córcoles, Antonio D, Temme, Kristan, Harrow, Aram W, Kandala, Abhinav, Chow, Jerry M, Gambetta, Jay M, Supervised learning with quantum-enhanced feature spaces (2019) Nature, 567 (7747), pp. 209-212</label>
          <listPosition>49</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218992</mtid>
          <link>/api/reference/63218992</link>
          <label>50. Holevo, Alexander Semenovich, Bounds for the quantity of information transmitted by a quantum communication channel (1973) Problemy Peredachi Informatsii, 9 (3), pp. 3-11</label>
          <listPosition>50</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218993</mtid>
          <link>/api/reference/63218993</link>
          <label>51. (2022) Quantinuum H1 series trapped-ion quantum processor powered by honeywell, , https://www.quantinuum.com/products/h1, Honeywell</label>
          <listPosition>51</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218994</mtid>
          <link>/api/reference/63218994</link>
          <label>52. Horak, Danijela, Jost, Jürgen, Spectra of combinatorial Laplace operators on simplicial complexes (2013) Advances in Mathematics, 244, pp. 303-336</label>
          <listPosition>52</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218995</mtid>
          <link>/api/reference/63218995</link>
          <label>53. Huang, Hsin-Yuan, Broughton, Michael, Cotler, Jordan, Chen, Sitan, Li, Jerry, Mohseni, Masoud, Neven, Hartmut, Preskill, John, Quantum advantage in learning from experiments (2022) Science, 376 (6598), pp. 1182-1186</label>
          <listPosition>53</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218996</mtid>
          <link>/api/reference/63218996</link>
          <label>54. Hutchinson, MF, A stochastic estimator of the trace of the influence matrix for Laplacian smoothing splines (1990) Communications in Statistics-Simulation and Computation, 19 (2), pp. 433-450</label>
          <listPosition>54</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63218999</mtid>
          <link>/api/reference/63218999</link>
          <label>55. King, Robbie, Kohler, Tamara, (2023) Promise clique homology on weighted graphs is QMA1-hard and contained in QMA, , arXiv preprint arXiv:2311.17234</label>
          <listPosition>55</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219000</mtid>
          <link>/api/reference/63219000</link>
          <label>56. Knill, Emanuel, Laflamme, Raymond, Power of one bit of quantum information (1998) Physical Review Letters, 81 (25), p. 5672</label>
          <listPosition>56</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219001</mtid>
          <link>/api/reference/63219001</link>
          <label>57. Knowles, Antti, Rosenthal, Ron, Eigenvalue confinement and spectral gap for random simplicial complexes (2017) Random Structures &amp; Algorithms, 51 (3), pp. 506-537</label>
          <listPosition>57</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219002</mtid>
          <link>/api/reference/63219002</link>
          <label>58. Lew, Alan, Spectral gaps, missing faces and minimal degrees (2020) Journal of Combinatorial Theory, Series A, 169, p. 105127</label>
          <listPosition>58</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219003</mtid>
          <link>/api/reference/63219003</link>
          <label>59. Lew, Alan, The spectral gaps of generalized flag complexes and a geometric Hall-type theorem (2020) International Mathematics Research Notices, 2020 (11), pp. 3364-3395</label>
          <listPosition>59</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219004</mtid>
          <link>/api/reference/63219004</link>
          <label>60. Lim, Lek-Heng, (2019) Hodge Laplacians on graphs, , http://arxiv.org/abs/1507.05379, arXiv:1507.05379 [cs, math], August arXiv: 1507.05379</label>
          <listPosition>60</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219005</mtid>
          <link>/api/reference/63219005</link>
          <label>61. Lin, Lin, (2022) Lecture notes on quantum algorithms for scientific computation, , arXiv preprint arXiv:2201.08309</label>
          <listPosition>61</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219006</mtid>
          <link>/api/reference/63219006</link>
          <label>62. Liu, Yunchao, Arunachalam, Srinivasan, Temme, Kristan, A rigorous and robust quantum speedup in supervised machine learning (2021) Nature Physics, 17 (9), pp. 1013-1017</label>
          <listPosition>62</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219007</mtid>
          <link>/api/reference/63219007</link>
          <label>63. Lloyd, Seth, Universal quantum simulators (1996) Science, pp. 1073-1078</label>
          <listPosition>63</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219008</mtid>
          <link>/api/reference/63219008</link>
          <label>64. Lloyd, Seth, Garnerone, Silvano, Zanardi, Paolo, Quantum algorithms for topological and geometric analysis of data (2016) Nature communications, 7, p. 10138</label>
          <listPosition>64</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219009</mtid>
          <link>/api/reference/63219009</link>
          <label>65. Low, Guang Hao, Chuang, Isaac L, Optimal Hamiltonian simulation by quantum signal processing (2017) Physical review letters, 118 (1), p. 010501</label>
          <listPosition>65</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219010</mtid>
          <link>/api/reference/63219010</link>
          <label>66. Low, Guang Hao, Chuang, Isaac L, Hamiltonian simulation by qubitization (2019) Quantum, 3, p. 163</label>
          <listPosition>66</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219011</mtid>
          <link>/api/reference/63219011</link>
          <label>67. Madsen, Lars S, Laudenbach, Fabian, Askarani, Mohsen Falamarzi, Rortais, Fabien, Vincent, Trevor, Bulmer, Jacob FF, Miatto, Filippo M, Collins, Matthew J, Quantum computational advantage with a programmable photonic processor (2022) Nature, 606 (7912), pp. 75-81</label>
          <listPosition>67</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219012</mtid>
          <link>/api/reference/63219012</link>
          <label>68. Mandal, Sayan, Guzman-Saenz, Aldo, Haiminen, Niina, Basu, Saugata, Parida, Laxmi, A Topological Data Analysis Approach on Predicting Phenotypes from Gene Expression Data (2020) Algorithms for Computational Biology, pp. 178-187. , Springer, a</label>
          <listPosition>68</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219013</mtid>
          <link>/api/reference/63219013</link>
          <label>69. Mandal, Sayan, Guzmán-Sáenz, Aldo, Haiminen, Niina, Basu, Saugata, Parida, Laxmi, A topological data analysis approach on predicting phenotypes from gene expression data (2020) Algorithms for Computational Biology, 12099, p. 178</label>
          <listPosition>69</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219014</mtid>
          <link>/api/reference/63219014</link>
          <label>70. Maria, Clément, Boissonnat, Jean-Daniel, Glisse, Marc, Yvinec, Mariette, The gudhi library: Simplicial complexes and persistent homology (2014) International congress on mathematical software, pp. 167-174. , Springer</label>
          <listPosition>70</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219015</mtid>
          <link>/api/reference/63219015</link>
          <label>71. Maroulas, Vasileios, Nasrin, Farzana, Oballe, Christopher, A bayesian framework for persistent homology (2020) SIAM Journal on Mathematics of Data Science, 2 (1), pp. 48-74</label>
          <listPosition>71</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219016</mtid>
          <link>/api/reference/63219016</link>
          <label>72. Morimae, Tomoyuki, Fujii, Keisuke, Fitzsimons, Joseph F, Hardness of classically simulating the one-clean-qubit model (2014) Physical review letters, 112 (13), p. 130502</label>
          <listPosition>72</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219017</mtid>
          <link>/api/reference/63219017</link>
          <label>73. Musco, Cameron, Musco, Christopher, Randomized block krylov methods for stronger and faster approximate singular value decomposition (2015) Advances in neural information processing systems, 28</label>
          <listPosition>73</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219018</mtid>
          <link>/api/reference/63219018</link>
          <label>74. Naitzat, Gregory, Zhitnikov, Andrey, Lim, Lek-Heng, Topology of deep neural networks (2020) J. Mach. Learn. Res, 21 (184), pp. 1-40</label>
          <listPosition>74</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219019</mtid>
          <link>/api/reference/63219019</link>
          <label>75. Nielsen, Michael A, Chuang, Isaac L, (2010) Quantum Computation and Quantum Information, , Cambridge University Press</label>
          <listPosition>75</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219020</mtid>
          <link>/api/reference/63219020</link>
          <label>76. O'Gorman, Bryan, Huggins, William J, Rieffel, Eleanor G, Birgitta Whaley, K, (2019) Generalized swap networks for near-term quantum computing, , arXiv preprint arXiv:1905.05118</label>
          <listPosition>76</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219021</mtid>
          <link>/api/reference/63219021</link>
          <label>77. Pednault, Edwin, Gunnels, John A, Nannicini, Giacomo, Horesh, Lior, Magerlein, Thomas, Solomonik, Edgar, Draeger, Erik W, Wisnieff, Robert, (2017) Pareto-efficient quantum circuit simulation using tensor contraction deferral, , arXiv preprint arXiv:1710.05867</label>
          <listPosition>77</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219022</mtid>
          <link>/api/reference/63219022</link>
          <label>78. Pednault, Edwin, Gunnels, John A, Nannicini, Giacomo, Horesh, Lior, Wisnieff, Robert, (2019) Leveraging secondary storage to simulate deep 54-qubit sycamore circuits, , arXiv preprint arXiv:1910.09534</label>
          <listPosition>78</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219023</mtid>
          <link>/api/reference/63219023</link>
          <label>79. Peruzzo, Alberto, McClean, Jarrod, Shadbolt, Peter, Yung, Man-Hong, Zhou, Xiao-Qi, Love, Peter J, Aspuru-Guzik, Alán, O'brien, Jeremy L, A variational eigenvalue solver on a photonic quantum processor (2014) Nature communications, 5 (1), pp. 1-7</label>
          <listPosition>79</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219024</mtid>
          <link>/api/reference/63219024</link>
          <label>80. Preskill, John, Quantum computing in the NISQ era and beyond (2018) Quantum, 2, p. 79</label>
          <listPosition>80</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219025</mtid>
          <link>/api/reference/63219025</link>
          <label>81. Rabadán, Raúl, Mohamedi, Yamina, Rubin, Udi, Chu, Tim, Alghalith, Adam N, Elliott, Oliver, Arnés, Luis, Levine, Arnold J, Identification of relevant genetic alterations in cancer using topological data analysis (2020) Nature communications, 11 (1), pp. 1-10</label>
          <listPosition>81</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219026</mtid>
          <link>/api/reference/63219026</link>
          <label>82. Rebentrost, Patrick, Mohseni, Masoud, Lloyd, Seth, Quantum support vector machine for big data classification (2014) Physical review letters, 113 (13), p. 130503</label>
          <listPosition>82</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219027</mtid>
          <link>/api/reference/63219027</link>
          <label>83. Reiher, Christian, The clique density theorem (2016) Annals of Mathematics, pp. 683-707</label>
          <listPosition>83</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219028</mtid>
          <link>/api/reference/63219028</link>
          <label>84. Rinott, Yosef, Shoham, Tomer, Kalai, Gil, Statistical aspects of the quantum supremacy demonstration (2022) Statistical Science, 37 (3), pp. 322-347</label>
          <listPosition>84</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219029</mtid>
          <link>/api/reference/63219029</link>
          <label>85. Schmidhuber, Alexander, Lloyd, Seth, (2022) Complexity-theoretic limitations on quantum algorithms for topological data analysis, , arXiv preprint arXiv:2209.14286</label>
          <listPosition>85</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219030</mtid>
          <link>/api/reference/63219030</link>
          <label>86. Schuld, Maria, Killoran, Nathan, Quantum machine learning in feature Hilbert spaces (2019) Physical review letters, 122 (4), p. 040504</label>
          <listPosition>86</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219031</mtid>
          <link>/api/reference/63219031</link>
          <label>87. Schuld, Maria, Sinayskiy, Ilya, Petruccione, Francesco, An introduction to quantum machine learning (2015) Contemporary Physics, 56 (2), pp. 172-185</label>
          <listPosition>87</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219032</mtid>
          <link>/api/reference/63219032</link>
          <label>88. Shende, Vivek V, Bullock, Stephen S, Markov, Igor L, Synthesis of quantum-logic circuits (2006) IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 25 (6), pp. 1000-1010</label>
          <listPosition>88</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219033</mtid>
          <link>/api/reference/63219033</link>
          <label>89. Shor, Peter W, Algorithms for quantum computation: discrete logarithms and factoring (1994) Proceedings 35th annual symposium on foundations of computer science, pp. 124-134. , Ieee</label>
          <listPosition>89</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219034</mtid>
          <link>/api/reference/63219034</link>
          <label>90. Shor, Peter W, Fault-tolerant quantum computation (1996) Proceedings of 37th Conference on Foundations of Computer Science, pp. 56-65. , IEEE</label>
          <listPosition>90</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219035</mtid>
          <link>/api/reference/63219035</link>
          <label>91. Tang, Ewin, Quantum principal component analysis only achieves an exponential speedup because of its state preparation assumptions (2021) Physical Review Letters, 127 (6), p. 060503</label>
          <listPosition>91</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219036</mtid>
          <link>/api/reference/63219036</link>
          <label>92. Trefethen, Lloyd N, (2019) Approximation Theory and Approximation Practice, , Extended Edition. SIAM</label>
          <listPosition>92</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219037</mtid>
          <link>/api/reference/63219037</link>
          <label>93. Ubaru, Shashanka, Saad, Yousef, Fast methods for estimating the numerical rank of large matrices (2016) Proceedings of The 33rd International Conference on Machine Learning, pp. 468-477</label>
          <listPosition>93</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219038</mtid>
          <link>/api/reference/63219038</link>
          <label>94. Ubaru, Shashanka, Saad, Yousef, Seghouane, Abd-Krim, Fast estimation of approximate matrix ranks using spectral densities (2017) Neural computation, 29 (5), pp. 1317-1351</label>
          <listPosition>94</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219039</mtid>
          <link>/api/reference/63219039</link>
          <label>95. Ubaru, Shashanka, Akhalwaya, Ismail Yunus, Squillante, Mark S, Clarkson, Kenneth L, Horesh, Lior, (2021) Quantum topological data analysis with linear depth and exponential speedup, , arXiv preprint arXiv:2108.02811</label>
          <listPosition>95</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219040</mtid>
          <link>/api/reference/63219040</link>
          <label>96. Wasserman, Larry, Topological data analysis (2018) Annual Review of Statistics and Its Application, 5, pp. 501-532</label>
          <listPosition>96</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219041</mtid>
          <link>/api/reference/63219041</link>
          <label>97. Watrous, John, Quantum computational complexity (2012) Computational Complexity: Theory, Techniques, and Applications, pp. 2361-2387. , Springer New York</label>
          <listPosition>97</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219042</mtid>
          <link>/api/reference/63219042</link>
          <label>98. Yamada, Taiki, (2019) Spectrum of the Laplacian on simplicial complexes by the Ricci curvature, , arXiv preprint arXiv:1906.07404</label>
          <listPosition>98</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219043</mtid>
          <link>/api/reference/63219043</link>
          <label>99. Zhao, Andrew, Tranter, Andrew, Kirby, William M., Ung, Shu Fay, Miyake, Akimasa, Love, Peter J., Measurement reduction in variational quantum algorithms (2020) Phys. Rev. A, 101, p. 062322. , https://link.aps.org/doi/10.1103/PhysRevA.101.062322, Jun</label>
          <listPosition>99</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219044</mtid>
          <link>/api/reference/63219044</link>
          <label>100. Zhong, Han-Sen, Wang, Hui, Deng, Yu-Hao, Chen, Ming-Cheng, Peng, Li-Chao, Luo, Yi-Han, Qin, Jian, Hu, Yi, Quantum computational advantage using photons (2020) Science, 370 (6523), pp. 1460-1463</label>
          <listPosition>100</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219045</mtid>
          <link>/api/reference/63219045</link>
          <label>101. Zhou, Leo, Wang, Sheng-Tao, Choi, Soonwon, Pichler, Hannes, Lukin, Mikhail D, Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices (2020) Physical Review X, 10 (2), p. 021067</label>
          <listPosition>101</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>63219046</mtid>
          <link>/api/reference/63219046</link>
          <label>102. Zomorodian, Afra, Carlsson, Gunnar, Computing persistent homology (2005) Discrete &amp; Computational Geometry, 33 (2), pp. 249-274</label>
          <listPosition>102</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
      </references>
      <link>/api/publication/35749323</link>
      <label>Akhalwaya I.Y. et al. TOPOLOGICAL DATA ANALYSIS ON NOISY QUANTUM COMPUTERS. (2024) Megjelent: 12th International Conference on Learning Representations, ICLR 2024 p. &amp;</label><template>&lt;div class=&quot;BookChapter Publication short-list&quot;&gt; &lt;div class=&quot;authors&quot;&gt; &lt;span class=&quot;author-name&quot; &gt; Akhalwaya, I.Y. &lt;/span&gt; &lt;span class=&quot;author-type&quot;&gt; &lt;/span&gt; ; &lt;span class=&quot;author-name&quot; &gt; Ubaru, S. &lt;/span&gt; &lt;span class=&quot;author-type&quot;&gt; &lt;/span&gt; ; &lt;span class=&quot;author-name&quot; &gt; Clarkson, K.L. &lt;/span&gt; &lt;span class=&quot;author-type&quot;&gt; &lt;/span&gt; ; &lt;span class=&quot;author-name&quot; &gt; Squillante, M.S. &lt;/span&gt; &lt;span class=&quot;author-type&quot;&gt; &lt;/span&gt; ; &lt;span class=&quot;author-name&quot; &gt; Jejjala, V. &lt;/span&gt; &lt;span class=&quot;author-type&quot;&gt; &lt;/span&gt; ; &lt;span class=&quot;author-name&quot; &gt; He, Y.-H. &lt;/span&gt; &lt;span class=&quot;author-type&quot;&gt; &lt;/span&gt; ; &lt;span class=&quot;author-name&quot; &gt; Naidoo, K. &lt;/span&gt; &lt;span class=&quot;author-type&quot;&gt; &lt;/span&gt; ; &lt;span class=&quot;author-name&quot; &gt; Kalantzis, V. &lt;/span&gt; &lt;span class=&quot;author-type&quot;&gt; &lt;/span&gt; ; &lt;span class=&quot;author-name&quot; &gt; Horesh, L. &lt;/span&gt; &lt;span class=&quot;author-type&quot;&gt; &lt;/span&gt; &lt;/div &gt;&lt;div class=&quot;title&quot;&gt;&lt;a href=&quot;/gui2/?mode=browse&amp;params=publication;35749323&quot; mtid=&quot;35749323&quot; target=&quot;_blank&quot;&gt;TOPOLOGICAL DATA ANALYSIS ON NOISY QUANTUM COMPUTERS&lt;/a&gt;&lt;/div&gt; &lt;div class=&quot;InBook&quot;&gt;In: &lt;span class=&quot;booktitle&quot;&gt;&lt;a href=&quot;/gui2/?mode=browse&amp;params=publication;35178194&quot; target=&quot;_blank&quot;&gt;12th International Conference on Learning Representations, ICLR 2024 &lt;/a&gt;&lt;/span &gt; &lt;/div&gt;&lt;div class=&quot;pub-info&quot;&gt; &lt;span class=&quot;publisher&quot;&gt;International Conference on Learning Representations, ICLR&lt;/span&gt; &lt;span class=&quot;year&quot;&gt;(2024)&lt;/span&gt; &lt;span class=&quot;page&quot;&gt; p. &amp; &lt;/span&gt; &lt;/div&gt; &lt;div class=&quot;pub-end&quot;&gt;&lt;div class=&quot;identifier-list&quot;&gt; &lt;span class=&quot;identifiers&quot;&gt; &lt;span class=&quot;id identifier oa_none&quot; title=&quot;none&quot;&gt; &lt;a style=&quot;color:black&quot; title=&quot;85200602121&quot; target=&quot;_blank&quot; href=&quot;http://www.scopus.com/record/display.url?origin=inward&amp;eid=2-s2.0-85200602121&quot;&gt; Scopus &lt;/a&gt; &lt;/span&gt; &lt;/span&gt; &lt;/div&gt; &lt;div class=&quot;short-pub-prop-list&quot;&gt; &lt;span class=&quot;short-pub-mtid&quot;&gt; Közlemény:35749323 &lt;/span&gt; &lt;span class=&quot;status-holder&quot;&gt;&lt;span class=&quot;status-data status-APPROVED&quot;&gt; Nyilvános &lt;/span&gt;&lt;/span&gt; &lt;span class=&quot;pub-core&quot;&gt; Idéző &lt;/span&gt; &lt;span class=&quot;pub-type&quot;&gt;Egyéb konferenciaközlemény (Konferenciaközlemény ) &lt;/span&gt; &lt;!-- &amp;&amp; !record.category.scientific --&gt; &lt;span class=&quot;pub-category&quot;&gt;Tudományos&lt;/span&gt; &lt;/div&gt; &lt;/div&gt; &lt;/div&gt;</template><template2>&lt;div class=&quot;BookChapter Publication long-list&quot;&gt;
&lt;div class=&quot;authors&quot;&gt;
	
	&lt;img title=&quot;Idézőközlemény&quot; style=&quot;float: left&quot; src=&quot;/frontend/resources/grid/publication-citation-icon.png&quot;&gt;

		&lt;div class=&quot;autype autype0&quot;&gt;				&lt;span class=&quot;author-name&quot; &gt;Akhalwaya I.Y.
    &lt;/span&gt;
;&amp;nbsp;&amp;nbsp;&amp;nbsp;
							&lt;span class=&quot;author-name&quot; &gt;Ubaru S.
    &lt;/span&gt;
;&amp;nbsp;&amp;nbsp;&amp;nbsp;
							&lt;span class=&quot;author-name&quot; &gt;Clarkson K.L.
    &lt;/span&gt;
;&amp;nbsp;&amp;nbsp;&amp;nbsp;
							&lt;span class=&quot;author-name&quot; &gt;Squillante M.S.
    &lt;/span&gt;
;&amp;nbsp;&amp;nbsp;&amp;nbsp;
							&lt;span class=&quot;author-name&quot; &gt;Jejjala V.
    &lt;/span&gt;
;&amp;nbsp;&amp;nbsp;&amp;nbsp;
							&lt;span class=&quot;author-name&quot; &gt;He Y.-H.
    &lt;/span&gt;
;&amp;nbsp;&amp;nbsp;&amp;nbsp;
							&lt;span class=&quot;author-name&quot; &gt;Naidoo K.
    &lt;/span&gt;
;&amp;nbsp;&amp;nbsp;&amp;nbsp;
							&lt;span class=&quot;author-name&quot; &gt;Kalantzis V.
    &lt;/span&gt;
;&amp;nbsp;&amp;nbsp;&amp;nbsp;
							&lt;span class=&quot;author-name&quot; &gt;Horesh L.
    &lt;/span&gt;

				    &lt;/div&gt;
&lt;/div&gt;
&lt;div class=&quot;title&quot;&gt;&lt;a href=&quot;/gui2/?mode=browse&amp;params=publication;35749323&quot; target=&quot;_blank&quot;&gt;TOPOLOGICAL DATA ANALYSIS ON NOISY QUANTUM COMPUTERS&lt;/a&gt;&lt;/div&gt;    &lt;div class=&quot;InBook&quot;&gt;&lt;div class=&quot;chapter-in&quot;&gt;In:&lt;/div&gt;         &lt;div class=&quot;authors&quot;&gt;

        &lt;/div&gt;
        &lt;div class=&quot;booktitle&quot;&gt;&lt;a href=&quot;/gui2/?mode=browse&amp;params=publication;35178194&quot; target=&quot;_blank&quot;&gt;12th International Conference on Learning Representations, ICLR 2024 &lt;/a&gt;&lt;/div&gt;
&lt;div class=&quot;conference&quot;&gt;
	
	Konferencia helye, ideje: 
        &lt;span class=&quot;conference-date&quot;&gt;2024.05.07.
             - 
            2024.05.11.&lt;/span&gt;
    
&lt;/div&gt;        
        : 
            &lt;span class=&quot;publishers&quot;&gt;International Conference on Learning Representations, ICLR&lt;/span&gt;,
&lt;span class=&quot;page&quot;&gt;
	p. &amp;.
		
&lt;/span&gt;         &lt;span class=&quot;year&quot;&gt;(2024)&lt;/span&gt;  
    &lt;/div&gt;
&lt;div class=&quot;pub-footer&quot;&gt;

	&lt;span class=&quot;language&quot; xmlns=&quot;http://www.w3.org/1999/html&quot;&gt;Nyelv:
			Angol
		 |  &lt;/span&gt;

	&lt;span class=&quot;identifiers&quot;&gt;
						&lt;span class=&quot;id identifier oa_none&quot; title=&quot;none&quot;&gt;
							
							&lt;a style=&quot;color:black&quot; title=&quot;85200602121&quot; target=&quot;_blank&quot; href=&quot;http://www.scopus.com/record/display.url?origin=inward&amp;eid=2-s2.0-85200602121&quot;&gt;
									Scopus
							&lt;/a&gt;
						&lt;/span&gt;
	&lt;/span&gt;
&lt;span class=&quot;bookchapter-ids&quot;&gt;Befoglaló link(ek):&lt;/span&gt; 	&lt;span class=&quot;identifiers&quot;&gt;
						&lt;span class=&quot;id identifier oa_none&quot; title=&quot;none&quot;&gt;
							
							&lt;a style=&quot;color:blue&quot; title=&quot;https://openreview.net/group?id=ICLR.cc/2024/Conference#tab-accept-oral&quot; target=&quot;_blank&quot; href=&quot;https://openreview.net/group?id=ICLR.cc/2024/Conference#tab-accept-oral&quot;&gt;
									Egyéb URL
							&lt;/a&gt;
						&lt;/span&gt;
						&lt;span class=&quot;id identifier oa_none&quot; title=&quot;none&quot;&gt;
							
							&lt;a style=&quot;color:blue&quot; title=&quot;https://iclr.cc/Conferences/2024&quot; target=&quot;_blank&quot; href=&quot;https://iclr.cc/Conferences/2024&quot;&gt;
									Egyéb URL
							&lt;/a&gt;
						&lt;/span&gt;
	&lt;/span&gt;




	&lt;div class=&quot;publication-citation&quot;&gt;
		&lt;a target=&quot;_blank&quot; href=&quot;/api/publication?cond=citations.related;eq;35749323&amp;sort=publishedYear,desc&amp;sort=title&quot;&gt;
			Idézett közlemények száma: 2
		&lt;/a&gt;
	&lt;/div&gt;



    &lt;div class=&quot;mtid&quot;&gt;&lt;span class=&quot;long-pub-mtid&quot;&gt;Közlemény: 35749323&lt;/span&gt;
    | &lt;span class=&quot;status-data status-APPROVED&quot;&gt; 	Nyilvános
  &lt;/span&gt;
        &lt;span class=&quot;long-book-mtid&quot;&gt;Befoglaló: 35178194&lt;/span&gt;
	
	
	 Idéző
	
	
    | &lt;span class=&quot;type-subtype&quot;&gt;Egyéb konferenciaközlemény
			( Konferenciaközlemény
			
			)
		&lt;/span&gt;
      		| &lt;span class=&quot;pub-category&quot;&gt;Tudományos&lt;/span&gt;
	| &lt;span class=&quot;publication-sourceOfData&quot;&gt;Scopus&lt;/span&gt;
&lt;/div&gt;



&lt;div class=&quot;lastModified&quot;&gt;Utolsó módosítás: 2025.02.28. 10:37 Szakonyi Erzsebet (RAMKI admin 4)
&lt;/div&gt;




	&lt;pre class=&quot;comment&quot; style=&quot;margin-top: 0; margin-bottom: 0;&quot;&gt;&lt;u&gt;Megjegyzés&lt;/u&gt;: IBM Research, United States            
            IBM Research, South Africa            
            University of the Witwatersrand, South Africa            
            Royal Institution, United Kingdom            
            Conference code: 200372            
            Export Date: 10 February 2025            
            Funding details: International Business Machines Corporation, IB...&lt;/pre&gt;
&lt;/div&gt;
&lt;/div&gt;</template2>
    </publication>
  </content>
</myciteResult>
