Show simple item record

dc.contributor.author
Häner, Thomas
dc.contributor.author
Hoefler, Torsten
dc.contributor.author
Troyer, Matthias
dc.date.accessioned
2020-12-22T10:42:22Z
dc.date.available
2020-12-22T03:41:25Z
dc.date.available
2020-12-22T10:42:22Z
dc.date.issued
2020-11
dc.identifier.issn
2475-1421
dc.identifier.other
10.1145/3428201
en_US
dc.identifier.uri
http://hdl.handle.net/20.500.11850/457964
dc.identifier.doi
10.3929/ethz-b-000457964
dc.description.abstract
Quantum computers promise to perform certain computations exponentially faster than any classical device. Precise control over their physical implementation and proper shielding from unwanted interactions with the environment become more difficult as the space/time volume of the computation grows. Code optimization is thus crucial in order to reduce resource requirements to the greatest extent possible. Besides manual optimization, previous work has adapted classical methods such as constant-folding and common subexpression elimination to the quantum domain. However, such classically-inspired methods fail to exploit certain optimization opportunities across subroutine boundaries, limiting the effectiveness of software reuse. To address this insufficiency, we introduce an optimization methodology which employs annotations that describe how subsystems are entangled in order to exploit these optimization opportunities. We formalize our approach, prove its correctness, and present benchmarks: Without any prior manual optimization, our methodology is able to reduce, e.g., the qubit requirements of a 64-bit floating-point subroutine by 34×.
en_US
dc.format
application/pdf
en_US
dc.language.iso
en
en_US
dc.publisher
ACM
en_US
dc.rights.uri
http://creativecommons.org/licenses/by/4.0/
dc.title
Assertion-based optimization of Quantum programs
en_US
dc.type
Journal Article
dc.rights.license
Creative Commons Attribution 4.0 International
ethz.journal.title
Proceedings of the ACM on Programming Languages
ethz.journal.volume
4
en_US
ethz.journal.issue
OOPSLA
en_US
ethz.journal.abbreviated
Proc. ACM Program. Lang.
ethz.pages.start
133
en_US
ethz.size
20 p.
en_US
ethz.version.deposit
publishedVersion
en_US
ethz.identifier.wos
ethz.identifier.scopus
ethz.publication.place
New York, NY
en_US
ethz.publication.status
published
en_US
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::02666 - Institut für Hochleistungsrechnersysteme / Inst. f. High Performance Computing Syst::03950 - Hoefler, Torsten / Hoefler, Torsten
ethz.leitzahl.certified
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::02666 - Institut für Hochleistungsrechnersysteme / Inst. f. High Performance Computing Syst::03950 - Hoefler, Torsten / Hoefler, Torsten
ethz.date.deposited
2020-12-22T03:41:35Z
ethz.source
SCOPUS
ethz.eth
yes
en_US
ethz.availability
Open access
en_US
ethz.rosetta.installDate
2020-12-22T10:42:33Z
ethz.rosetta.lastUpdated
2022-03-29T04:39:03Z
ethz.rosetta.versionExported
true
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=Assertion-based%20optimization%20of%20Quantum%20programs&rft.jtitle=Proceedings%20of%20the%20ACM%20on%20Programming%20Languages&rft.date=2020-11&rft.volume=4&rft.issue=OOPSLA&rft.spage=133&rft.issn=2475-1421&rft.au=H%C3%A4ner,%20Thomas&Hoefler,%20Torsten&Troyer,%20Matthias&rft.genre=article&rft_id=info:doi/10.1145/3428201&
 Search print copy at ETH Library

Files in this item

Thumbnail

Publication type

Show simple item record