<?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-08-26 23:56</responseDate>
  <content>
    <publication>
      <otype>PublicationOther</otype>
      <mtid>34014781</mtid>
      <status>APPROVED</status>
      <published>true</published>
      <unhandledTickets>0</unhandledTickets>
      <deleted>false</deleted>
      <lastRefresh>2025-04-30T07:56:37.535+0000</lastRefresh>
      <lastModified>2023-06-13T16:59:19.200+0000</lastModified>
      <created>2023-06-13T16:59:18.530+0000</created>
      <creator>
        <snippet>true</snippet>
        <mtid>10087185</mtid>
        <familyName>Nemkin</familyName>
        <givenName>Viktória</givenName>
        <link>/api/author/10087185</link>
        <otype>Author</otype>
        <label>Nemkin Viktória (algoritmuselmélet, kvantumalgoritmusok)</label>
        <published>true</published>
      </creator>
      <lastDuplumOK>2023-06-13T16:59:19.221+0000</lastDuplumOK>
      <lastDuplumSearch>2023-06-13T16:59:19.221+0000</lastDuplumSearch>
      <core>true</core>
      <type>
        <snippet>true</snippet>
        <mtid>29</mtid>
        <code>29</code>
        <link>/api/publicationtype/29</link>
        <otype>PublicationType</otype>
        <label>Egyéb</label>
        <listPosition>15</listPosition>
        <published>true</published>
        <oldId>29</oldId>
        <otypeName>PublicationOther</otypeName>
      </type>
      <subType>
        <snippet>true</snippet>
        <mtid>10000221</mtid>
        <nameEng>Diploma thesis, Report of Scientific Students Association</nameEng>
        <docType>
          <snippet>true</snippet>
          <mtid>29</mtid>
          <code>29</code>
          <link>/api/publicationtype/29</link>
          <otype>PublicationType</otype>
          <label>Egyéb</label>
          <listPosition>15</listPosition>
          <published>true</published>
          <oldId>29</oldId>
          <otypeName>PublicationOther</otypeName>
        </docType>
        <link>/api/subtype/10000221</link>
        <name>Diplomamunka, szakdolgozat, TDK dolgozat</name>
        <otype>SubType</otype>
        <label>Diplomamunka, szakdolgozat, TDK dolgozat (Egyéb)</label>
        <listPosition>1583</listPosition>
        <published>true</published>
        <oldId>10000221</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>Nemkin, Viktória</firstAuthor>
      <title>Optimizing memory usage in quantum algorithm simulation</title>
      <firstPageOrInternalIdForSort></firstPageOrInternalIdForSort>
      <publishedYear>2022</publishedYear>
      <publishedYearEnd>2023</publishedYearEnd>
      <conference>
        <snippet>true</snippet>
        <mtid>301799</mtid>
        <link>/api/conference/301799</link>
        <locations>
          <location>
            <snippet>true</snippet>
            <mtid>11948</mtid>
            <partOf>
              <snippet>true</snippet>
              <mtid>10016</mtid>
              <link>/api/country/10016</link>
              <otype>Country</otype>
              <label>Románia</label>
              <published>true</published>
              <oldId>12</oldId>
            </partOf>
            <link>/api/city/11948</link>
            <otype>City</otype>
            <label>Targu Mures, Románia</label>
            <published>true</published>
            <oldId>10001322</oldId>
          </location>
        </locations>
        <otype>Conference</otype>
        <label>36. Országos Tudományos Diákköri Konferencia, Informatikatudományi Szekció 2023-04-16 [Targu Mures, Románia]</label>
        <published>true</published>
      </conference>
      <abstractText>The quantum algorithm execution frameworks currently available on the market (IBM
Qiskit, Google Cirq) implement their computations using unitary matrices of exponential
size in the number of qubits. Consequently, they require large amounts of memory, even
for small inputs. Although existing frameworks use some optimization methods, these
often cannot provide improvements of an order of magnitude (e.g. sparse matrix storage
mode) or are only applicable in special cases (Clifford gates). In practice, in contrast to
a large company, the average user cannot experiment within reasonable limits, for many
algorithms, even with relatively small inputs, as this would incur outstanding hardware
costs.

Algorithms that save memory in exchange for increased runtime can reduce these hardware
expenses. For example, any submatrix of the unitary matrix can be computed on-the-fly
during runtime, or the equivalent conventional algorithm can replace the unitary matrix
operation. Although the currently available frameworks are open-source, they store the
unitary matrices in memory as an integral part of their architecture, making it impossible
to incorporate these memory optimization techniques.

In my paper, I focus on developing these memory optimization methodologies and implementing them in a general-purpose quantum algorithm simulation framework. I present
the classical algorithm and architecture design steps that form the basis of the system and
demonstrate how this system can be used in quantum algorithm research. The framework
is primarily intended to be used in a resource-constrained environment to enable running
tests on a larger number of qubits, thus facilitating theoretical research. Accordingly, I will
make the system and its documentation available to everyone in an open-source licensed
form.</abstractText>
      <digital/>
      <printed/>
      <sourceYear>2023</sourceYear>
      <foreignEdition/>
      <foreignLanguage>true</foreignLanguage>
      <fullPublication>false</fullPublication>
      <conferencePublication>true</conferencePublication>
      <nationalOrigin/>
      <missingAuthor>false</missingAuthor>
      <oaType>NONE</oaType>
      <oaCheckDate>2025-04-30</oaCheckDate>
      <oaFree>false</oaFree>
      <citationCount>0</citationCount>
      <citationCountUnpublished>0</citationCountUnpublished>
      <citationCountWoOther>0</citationCountWoOther>
      <independentCitCountWoOther>0</independentCitCountWoOther>
      <nationalOriginCitationCount>0</nationalOriginCitationCount>
      <foreignEditionCitationCount>0</foreignEditionCitationCount>
      <doiCitationCount>0</doiCitationCount>
      <wosCitationCount>0</wosCitationCount>
      <scopusCitationCount>0</scopusCitationCount>
      <wosScopusCitationCount>0</wosScopusCitationCount>
      <wosScopusCitationCountWoOther>0</wosScopusCitationCountWoOther>
      <wosScopusIndependentCitationCount>0</wosScopusIndependentCitationCount>
      <wosScopusIndependentCitationCountWoOther>0</wosScopusIndependentCitationCountWoOther>
      <independentCitationCount>0</independentCitationCount>
      <selfCitationCount>0</selfCitationCount>
      <unhandledCitationCount>0</unhandledCitationCount>
      <citingPubCount>0</citingPubCount>
      <independentCitingPubCount>0</independentCitingPubCount>
      <citingPubCountWoOther>0</citingPubCountWoOther>
      <independentCitingPubCountWoOther>0</independentCitingPubCountWoOther>
      <unhandledCitingPubCount>0</unhandledCitingPubCount>
      <citedPubCount>0</citedPubCount>
      <citedCount>0</citedCount>
      <hasCitationDuplums>false</hasCitationDuplums>
      <importDuplum>false</importDuplum>
      <importOverwritten>false</importOverwritten>
      <importSkipped>false</importSkipped>
      <userChangeableUntil>2023-09-11T16:59:18.961+0000</userChangeableUntil>
      <directInstitutesForSort>Számítástudományi és Információelméleti Tanszék (BME / VIK)</directInstitutesForSort>
      <ownerAuthorCount>1</ownerAuthorCount>
      <ownerInstituteCount>5</ownerInstituteCount>
      <directInstituteCount>1</directInstituteCount>
      <authorCount>1</authorCount>
      <contributorCount>0</contributorCount>
      <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>108986654</mtid>
          <link>/api/authorship/108986654</link>
          <label>Nemkin, Viktória [Nemkin, Viktória (algoritmuselmélet...), szerző] Számítástudományi és Információelméleti Tanszék (BME / VIK)</label>
          <listPosition>1</listPosition>
          <share>1.0</share>
          <first>true</first>
          <last>false</last>
          <author>
            <otype>Author</otype>
            <mtid>10087185</mtid>
            <link>/api/author/10087185</link>
            <label>Nemkin Viktória (algoritmuselmélet, kvantumalgoritmusok)</label>
            <familyName>Nemkin</familyName>
            <givenName>Viktória</givenName>
            <published>true</published>
            <snippet>true</snippet>
          </author>
          <familyName>Nemkin</familyName>
          <givenName>Viktória</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>
      <link>/api/publication/34014781</link>
      <label>Nemkin Viktória. Optimizing memory usage in quantum algorithm simulation. (2022)</label><template>&lt;div class=&quot;PublicationOther Publication short-list&quot;&gt; &lt;div class=&quot;authors&quot;&gt; &lt;span class=&quot;author-name&quot; mtid=&quot;10087185&quot;&gt; &lt;a href=&quot;/gui2/?type=authors&amp;mode=browse&amp;sel=10087185&quot; target=&quot;_blank&quot;&gt;Nemkin, Viktória&lt;/a&gt; &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;34014781&quot; mtid=&quot;34014781&quot; target=&quot;_blank&quot;&gt;Optimizing memory usage in quantum algorithm simulation&lt;/a&gt; &lt;span class=&quot;page&quot;&gt; &lt;/span&gt; (2022) &lt;/div&gt; &lt;div class=&quot;pub-info&quot;&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&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:34014781 &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;Forrás &lt;/span&gt; &lt;span class=&quot;pub-type&quot;&gt;Egyéb (Diplomamunka, szakdolgozat, TDK dolgozat ) &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;PublicationOther Publication long-list&quot;&gt; &lt;div class=&quot;authors&quot;&gt; &lt;img title=&quot;Forrásközlemény&quot; style=&quot;float: left&quot; src=&quot;/frontend/resources/grid/publication-core-icon.png&quot;&gt; &lt;div class=&quot;autype autype0&quot;&gt; &lt;span class=&quot;author-name&quot; mtid=&quot;10087185&quot;&gt;&lt;a href=&quot;/gui2/?type=authors&amp;mode=browse&amp;sel=10087185&quot; target=&quot;_blank&quot;&gt;Nemkin Viktória (&lt;span class=&quot;authorship-author-name&quot;&gt;Nemkin Viktória&lt;/span&gt; &lt;span class=&quot;authorAux-mtmt&quot;&gt; algoritmuselmélet, kvantumalgoritmusok&lt;/span&gt;) &lt;/a&gt; &lt;/span&gt; &lt;span class=&quot;author-affil&quot;&gt;&lt;span title=&quot;Budapesti Műszaki és Gazdaságtudományi Egyetem&quot;&gt;BME&lt;/span&gt;/&lt;span title=&quot;Villamosmérnöki és Informatikai Kar&quot;&gt;VIK&lt;/span&gt;/Számítástudományi és Információelméleti Tanszék&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;34014781&quot; target=&quot;_blank&quot;&gt;Optimizing memory usage in quantum algorithm simulation&lt;/a&gt;&lt;/div&gt; &lt;div class=&quot;description&quot;&gt; &lt;/div&gt; &lt;div class=&quot;country&quot;&gt; Megjelenés: &lt;span class=&quot;publishedYear&quot;&gt;(2022)&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&gt; &lt;div class=&quot;mtid&quot;&gt;&lt;span class=&quot;long-pub-mtid&quot;&gt;Közlemény: 34014781&lt;/span&gt; | &lt;span class=&quot;status-data status-APPROVED&quot;&gt; Nyilvános &lt;/span&gt; Forrás | &lt;span class=&quot;type-subtype&quot;&gt;Egyéb ( Diplomamunka, szakdolgozat, TDK dolgozat ) &lt;/span&gt; | &lt;span class=&quot;pub-category&quot;&gt;Tudományos&lt;/span&gt; | &lt;span class=&quot;publication-sourceOfData&quot;&gt;kézi felvitel&lt;/span&gt; &lt;/div&gt; &lt;div class=&quot;lastModified&quot;&gt;Utolsó módosítás: 2023.06.13. 18:59 Nemkin Viktória (algoritmuselmélet, kvantumalgoritmusok) &lt;/div&gt; &lt;/div&gt;&lt;/div&gt;</template2>
    </publication>
  </content>
</myciteResult>
