Academic Journal
Προβολή σε EDS

Efficient parallel compilation and profiling of quantum circuits at large scales.

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Efficient parallel compilation and profiling of quantum circuits at large scales.
Συγγραφείς: Moore, Jane, Hart, Michael, McAllister, John
Πηγή: npj Unconventional Computing; 7/21/2026, Vol. 3 Issue 1, p1-19, 19p
Θεματικοί όροι: Electric circuits, Parallel processing, Compilers (Computer programs), Quantum computing, Benchmarking (Management), Accuracy, Quantum gates, Program generators (Computer programs), Benchmark problems (Computer science), Circuit complexity
Περίληψη: Compiling quantum circuits is a major bottleneck in quantum computing, and given the scale required in a few years, is likely to become infeasibly long. Techniques to reduce compilation time for quantum circuits are sorely needed. Furthermore, resources to test acceleration techniques are similarly lacking due to the limited scale of circuits in benchmark suites and mismatches in characteristics of these circuits and those produced by random circuit generators. This paper resolves the latter of these problems by describing a random circuit generator which allows control of circuit density, width and depth parameters. This is used to derive 8000 experimental large-scale circuits and test a novel approach to compiler parallelisation. This separates a circuit into sub-circuits, which are compiled in parallel and recombined to produce a compiled circuit. When the parallel approach was tested using Qiskit, a peak speedup of 15.56 was achieved with corresponding overheads of less than 1%. [ABSTRACT FROM AUTHOR]
Copyright of npj Unconventional Computing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Βάση Δεδομένων: Complementary Index
FullText Text:
  Availability: 0
Header DbId: edb
DbLabel: Complementary Index
An: 195524190
RelevancyScore: 1082
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1082.42236328125
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Efficient parallel compilation and profiling of quantum circuits at large scales.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Moore%2C+Jane%22">Moore, Jane</searchLink><br /><searchLink fieldCode="AR" term="%22Hart%2C+Michael%22">Hart, Michael</searchLink><br /><searchLink fieldCode="AR" term="%22McAllister%2C+John%22">McAllister, John</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: npj Unconventional Computing; 7/21/2026, Vol. 3 Issue 1, p1-19, 19p
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Electric+circuits%22">Electric circuits</searchLink><br /><searchLink fieldCode="DE" term="%22Parallel+processing%22">Parallel processing</searchLink><br /><searchLink fieldCode="DE" term="%22Compilers+%28Computer+programs%29%22">Compilers (Computer programs)</searchLink><br /><searchLink fieldCode="DE" term="%22Quantum+computing%22">Quantum computing</searchLink><br /><searchLink fieldCode="DE" term="%22Benchmarking+%28Management%29%22">Benchmarking (Management)</searchLink><br /><searchLink fieldCode="DE" term="%22Accuracy%22">Accuracy</searchLink><br /><searchLink fieldCode="DE" term="%22Quantum+gates%22">Quantum gates</searchLink><br /><searchLink fieldCode="DE" term="%22Program+generators+%28Computer+programs%29%22">Program generators (Computer programs)</searchLink><br /><searchLink fieldCode="DE" term="%22Benchmark+problems+%28Computer+science%29%22">Benchmark problems (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Circuit+complexity%22">Circuit complexity</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Compiling quantum circuits is a major bottleneck in quantum computing, and given the scale required in a few years, is likely to become infeasibly long. Techniques to reduce compilation time for quantum circuits are sorely needed. Furthermore, resources to test acceleration techniques are similarly lacking due to the limited scale of circuits in benchmark suites and mismatches in characteristics of these circuits and those produced by random circuit generators. This paper resolves the latter of these problems by describing a random circuit generator which allows control of circuit density, width and depth parameters. This is used to derive 8000 experimental large-scale circuits and test a novel approach to compiler parallelisation. This separates a circuit into sub-circuits, which are compiled in parallel and recombined to produce a compiled circuit. When the parallel approach was tested using Qiskit, a peak speedup of 15.56 was achieved with corresponding overheads of less than 1%. [ABSTRACT FROM AUTHOR]
– Name: Abstract
  Label:
  Group: Ab
  Data: <i>Copyright of npj Unconventional Computing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=195524190
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1038/s44335-026-00079-z
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 19
        StartPage: 1
    Subjects:
      – SubjectFull: Electric circuits
        Type: general
      – SubjectFull: Parallel processing
        Type: general
      – SubjectFull: Compilers (Computer programs)
        Type: general
      – SubjectFull: Quantum computing
        Type: general
      – SubjectFull: Benchmarking (Management)
        Type: general
      – SubjectFull: Accuracy
        Type: general
      – SubjectFull: Quantum gates
        Type: general
      – SubjectFull: Program generators (Computer programs)
        Type: general
      – SubjectFull: Benchmark problems (Computer science)
        Type: general
      – SubjectFull: Circuit complexity
        Type: general
    Titles:
      – TitleFull: Efficient parallel compilation and profiling of quantum circuits at large scales.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Moore, Jane
      – PersonEntity:
          Name:
            NameFull: Hart, Michael
      – PersonEntity:
          Name:
            NameFull: McAllister, John
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 21
              M: 07
              Text: 7/21/2026
              Type: published
              Y: 2026
          Numbering:
            – Type: volume
              Value: 3
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: npj Unconventional Computing
              Type: main
ResultId 1