default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Hillmich
Person information
- affiliation: Johannes Kepler Universität Linz, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c21]Daniel Schönberger, Stefan Hillmich, Matthias Brandl, Robert Wille:
Using Boolean Satisfiability for Exact Shuttling in Trapped-Ion Quantum Computers. ASPDAC 2024: 127-133- [c20]Kevin Mato, Stefan Hillmich, Robert Wille:
Mixed-Dimensional Qudit State Preparation Using Edge-Weighted Decision Diagrams. DAC 2024: 50:1-50:6 - [c19]Daniel Schönberger, Stefan Hillmich, Matthias Brandl, Robert Wille:
Towards Cycle-based Shuttling for Trapped-Ion Quantum Computers (Extended Abstract). DATE 2024: 1-2 - 2023
- [c18]Kevin Mato, Martin Ringbauer
, Stefan Hillmich, Robert Wille:
Compilation of Entangling Gates for High-Dimensional Quantum Systems. ASP-DAC 2023: 202-208 - [c17]Kevin Mato, Stefan Hillmich, Robert Wille:
Mixed-Dimensional Quantum Circuit Simulation with Decision Diagrams. QCE 2023: 978-989 - [c16]Kevin Mato, Stefan Hillmich, Robert Wille:
Compression of Qubit Circuits: Mapping to Mixed-Dimensional Quantum Systems. QSW 2023: 155-161 - [c15]Lieuwe Vinkhuijzen, Thomas Grurl, Stefan Hillmich, Sebastiaan Brand, Robert Wille, Alfons Laarman:
Efficient Implementation of LIMDDs for Quantum Circuit Simulation. SPIN 2023: 3-21 - [i3]Robert Wille, Lukas Burgholzer, Stefan Hillmich, Thomas Grurl, Alexander Ploier, Tom Peham:
The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus. CoRR abs/2301.04147 (2023) - 2022
- [c14]Robert Wille, Lukas Burgholzer, Stefan Hillmich, Thomas Grurl, Alexander Ploier, Tom Peham:
The basis of design tools for quantum computing: arrays, decision diagrams, tensor networks, and ZX-calculus. DAC 2022: 1367-1370 - [c13]Kevin Mato, Martin Ringbauer, Stefan Hillmich, Robert Wille:
Adaptive Compilation of Multi-Level Quantum Operations. QCE 2022: 484-491 - [c12]Stefan Hillmich, Lukas Burgholzer, Florian Stögmüller, Robert Wille:
Reordering Decision Diagrams for Quantum Computing Is Harder Than You Might Think. RC 2022: 93-107 - 2021
- [c11]Stefan Hillmich, Alwin Zulehner, Robert Wille:
Exploiting Quantum Teleportation in Quantum Circuit Mapping. ASP-DAC 2021: 792-797 - [c10]Stefan Hillmich, Richard Kueng, Igor L. Markov, Robert Wille:
As Accurate as Needed, as Efficient as Possible: Approximations in DD-based Quantum Circuit Simulation. DATE 2021: 188-193 - [c9]Stefan Hillmich, Charles Hadfield, Rudy Raymond, Antonio Mezzacapo, Robert Wille:
Decision Diagrams for Quantum Measurements with Shallow Circuits. QCE 2021: 24-34 - [i2]Stefan Hillmich, Charles Hadfield, Rudy Raymond, Antonio Mezzacapo, Robert Wille:
Decision Diagrams for Quantum Measurements with Shallow Circuits. CoRR abs/2105.06932 (2021) - 2020
- [j2]Abhoy Kole, Stefan Hillmich, Kamalika Datta, Robert Wille, Indranil Sengupta:
Improved Mapping of Quantum Circuits to IBM QX Architectures. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(10): 2375-2383 (2020) - [c8]Stefan Hillmich, Alwin Zulehner, Robert Wille:
Concurrency in DD-based Quantum Circuit Simulation. ASP-DAC 2020: 115-120 - [c7]Alwin Zulehner, Stefan Hillmich, Igor L. Markov, Robert Wille:
Approximation of Quantum States Using Decision Diagrams. ASP-DAC 2020: 121-126 - [c6]Stefan Hillmich, Igor L. Markov, Robert Wille:
Just Like the Real Thing: Fast Weak Simulation of Quantum Computation. DAC 2020: 1-6 - [c5]Robert Wille, Stefan Hillmich, Lukas Burgholzer:
JKQ: JKU Tools for Quantum Computing. ICCAD 2020: 154:1-154:5 - [c4]Robert Wille, Stefan Hillmich, Lukas Burgholzer:
Efficient and Correct Compilation of Quantum Circuits. ISCAS 2020: 1-5 - [c3]Thomas Grurl, Jürgen Fuß, Stefan Hillmich, Lukas Burgholzer, Robert Wille:
Arrays vs. Decision Diagrams: A Case Study on Quantum Circuit Simulators. ISMVL 2020: 176-181
2010 – 2019
- 2019
- [c2]Alwin Zulehner, Stefan Hillmich, Robert Wille:
How to Efficiently Handle Complex Values? Implementing Decision Diagrams for Quantum Computing. ICCAD 2019: 1-7 - [i1]Alwin Zulehner, Stefan Hillmich, Robert Wille:
How to Efficiently Handle Complex Values? Implementing Decision Diagrams for Quantum Computing. CoRR abs/1911.12691 (2019) - 2016
- [j1]Arighna Deb, Robert Wille, Oliver Keszöcze, Stefan Hillmich, Rolf Drechsler:
Gates vs. Splitters: Contradictory Optimization Objectives in the Synthesis of Optical Circuits. ACM J. Emerg. Technol. Comput. Syst. 13(1): 11:1-11:13 (2016) - [c1]Robert Wille, Oliver Keszöcze, Stefan Hillmich, Marcel Walter, Alberto García Ortiz:
Synthesis of approximate coders for on-chip interconnects using reversible logic. DATE 2016: 1140-1143
Coauthor Index
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-11-13 23:47 CET 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:
