default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Häner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j5]Torsten Hoefler, Thomas Häner, Matthias Troyer:
Disentangling Hype from Practicality: On Realistically Achieving Quantum Advantage. Commun. ACM 66(5): 82-87 (2023)- 2020
- [j4]Giulia Meuli, Mathias Soeken, Martin Roetteler
, Thomas Häner:
Enabling accuracy-aware Quantum compilers using symbolic resource estimation. Proc. ACM Program. Lang. 4(OOPSLA): 130:1-130:26 (2020) - [j3]Thomas Häner, Torsten Hoefler, Matthias Troyer:
Assertion-based optimization of Quantum programs. Proc. ACM Program. Lang. 4(OOPSLA): 133:1-133:20 (2020) - 2019
- [j2]Damian S. Steiger, Thomas Häner, Matthias Troyer:
Advantages of a modular high-level quantum programming framework. Microprocess. Microsystems 66: 81-89 (2019) - 2017
- [j1]Thomas Häner, Martin Roetteler, Krysta M. Svore:
Factoring using $2n+2$ qubits with Toffoli based modular multiplication. Quantum Inf. Comput. 17(7&8): 673-684 (2017)
Conference and Workshop Papers
- 2021
- [c6]Thomas Häner, Damian S. Steiger, Torsten Hoefler, Matthias Troyer:
Distributed quantum computing with QMPI. SC 2021: 16 - 2020
- [c5]Thomas Häner, Samuel Jaques, Michael Naehrig, Martin Roetteler, Mathias Soeken:
Improved Quantum Circuits for Elliptic Curve Discrete Logarithms. PQCrypto 2020: 425-444 - 2018
- [c4]Mathias Soeken, Thomas Häner, Martin Roetteler:
Programming quantum computers using design automation. DATE 2018: 137-146 - [c3]Thomas Häner, Mathias Soeken, Martin Roetteler, Krysta M. Svore:
Quantum Circuits for Floating-Point Arithmetic. RC 2018: 162-174 - 2017
- [c2]Thomas Häner, Damian S. Steiger:
0.5 petabyte simulation of a 45-qubit quantum circuit. SC 2017: 33 - 2016
- [c1]Thomas Häner, Damian S. Steiger, Mikhail Smelyanskiy, Matthias Troyer:
High performance emulation of quantum circuits. SC 2016: 866-874
Informal and Other Publications
- 2023
- [i24]Torsten Hoefler, Thomas Häner, Matthias Troyer:
Disentangling Hype from Practicality: On Realistically Achieving Quantum Advantage. CoRR abs/2307.00523 (2023) - [i23]Thomas Häner:
Computing all monomials of degree n-1 using 2n-3 AND gates. CoRR abs/2307.07424 (2023) - [i22]Thomas Häner, Damian S. Steiger, Helmut G. Katzgraber:
Parallel Tempering for Logic Synthesis. CoRR abs/2311.12394 (2023) - 2022
- [i21]Thomas Häner, Mathias Soeken:
The multiplicative complexity of interval checking. CoRR abs/2201.10200 (2022) - [i20]Thomas Häner, Vadym Kliuchnikov, Martin Roetteler, Mathias Soeken, Alexander Vaschillo:
QParallel: Explicit Parallelism for Programming Quantum Computers. CoRR abs/2210.03680 (2022) - [i19]Thomas Häner, Vadym Kliuchnikov, Martin Roetteler, Mathias Soeken:
Space-time optimized table lookup. CoRR abs/2211.01133 (2022) - [i18]Thomas Häner, Mathias Soeken:
The multiplicative complexity of interval checking. IACR Cryptol. ePrint Arch. 2022: 91 (2022) - 2021
- [i17]David Ittah, Thomas Häner, Vadym Kliuchnikov, Torsten Hoefler:
Enabling Dataflow Optimization for Quantum Programs. CoRR abs/2101.11030 (2021) - [i16]Thomas Häner, Damian S. Steiger, Torsten Hoefler, Matthias Troyer:
Distributed Quantum Computing with QMPI. CoRR abs/2105.01109 (2021) - 2020
- [i15]Thomas Häner, Samuel Jaques, Michael Naehrig, Martin Roetteler, Mathias Soeken:
Improved quantum circuits for elliptic curve discrete logarithms. CoRR abs/2001.09580 (2020) - [i14]Giulia Meuli, Mathias Soeken, Martin Roetteler, Thomas Häner:
Automatic accuracy management of quantum programs via (near-)symbolic resource estimation. CoRR abs/2003.08408 (2020) - [i13]Thomas Häner, Mathias Soeken:
Lowering the T-depth of Quantum Circuits By Reducing the Multiplicative Depth Of Logic Networks. CoRR abs/2006.03845 (2020) - [i12]Vera von Burg, Guang Hao Low, Thomas Häner, Damian S. Steiger, Markus Reiher, Martin Roetteler, Matthias Troyer:
Quantum computing enhanced computational catalysis. CoRR abs/2007.14460 (2020) - [i11]Thomas Häner, Samuel Jaques, Michael Naehrig, Martin Roetteler, Mathias Soeken:
Improved Quantum Circuits for Elliptic Curve Discrete Logarithms. IACR Cryptol. ePrint Arch. 2020: 77 (2020) - 2018
- [i10]Mathias Soeken, Thomas Häner, Martin Roetteler:
Programming Quantum Computers Using Design Automation. CoRR abs/1803.01022 (2018) - [i9]Thomas Häner, Martin Roetteler, Krysta M. Svore:
Optimizing Quantum Circuits for Arithmetic. CoRR abs/1805.12445 (2018) - [i8]Damian S. Steiger, Thomas Häner, Matthias Troyer:
Advantages of a modular high-level quantum programming framework. CoRR abs/1806.01861 (2018) - [i7]Thomas Häner, Mathias Soeken, Martin Roetteler, Krysta M. Svore:
Quantum circuits for floating-point arithmetic. CoRR abs/1807.02023 (2018) - [i6]Thomas Häner, Martin Roetteler, Krysta M. Svore:
Managing approximation errors in quantum programs. CoRR abs/1807.02336 (2018) - [i5]Thomas Häner, Torsten Hoefler, Matthias Troyer:
Using Hoare logic for quantum circuit optimization. CoRR abs/1810.00375 (2018) - 2017
- [i4]Thomas Häner, Damian S. Steiger:
0.5 Petabyte Simulation of a 45-Qubit Quantum Circuit. CoRR abs/1704.01127 (2017) - 2016
- [i3]Thomas Häner, Damian S. Steiger, Krysta M. Svore, Matthias Troyer:
A Software Methodology for Compiling Quantum Programs. CoRR abs/1604.01401 (2016) - [i2]Thomas Häner, Martin Roetteler, Krysta M. Svore:
Factoring using 2n+2 qubits with Toffoli based modular multiplication. CoRR abs/1611.07995 (2016) - [i1]Damian S. Steiger, Thomas Häner, Matthias Troyer:
ProjectQ: An Open Source Software Framework for Quantum Computing. CoRR abs/1612.08091 (2016)
Coauthor Index
aka: Martin Roetteler
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
