Folgen
Stefan Hillmich
Stefan Hillmich
Bestätigte E-Mail-Adresse bei scch.at - Startseite
Titel
Zitiert von
Zitiert von
Jahr
How to efficiently handle complex values? Implementing decision diagrams for quantum computing
A Zulehner, S Hillmich, R Wille
2019 IEEE/ACM International Conference on Computer-Aided Design (ICCAD), 1-7, 2019
782019
Exploiting quantum teleportation in quantum circuit mapping
S Hillmich, A Zulehner, R Wille
Proceedings of the 26th Asia and South Pacific Design Automation Conference …, 2021
432021
Improved mapping of quantum circuits to IBM QX architectures
A Kole, S Hillmich, K Datta, R Wille, I Sengupta
IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2019
402019
Decision diagrams for quantum measurements with shallow circuits
S Hillmich, C Hadfield, R Raymond, A Mezzacapo, R Wille
2021 IEEE International Conference on Quantum Computing and Engineering (QCE …, 2021
382021
Synthesis of approximate coders for on-chip interconnects using reversible logic
R Wille, O Keszocze, S Hillmich, M Walter, A Garcia-Ortiz
2016 Design, Automation & Test in Europe Conference & Exhibition (DATE …, 2016
372016
JKQ: JKU tools for quantum computing
R Wille, S Hillmich, L Burgholzer
Proceedings of the 39th International Conference on Computer-Aided Design, 1-5, 2020
342020
Clinical data classification with noisy intermediate scale quantum computers
S Moradi, C Brandner, C Spielvogel, D Krajnc, S Hillmich, R Wille, ...
Scientific reports 12 (1), 1851, 2022
312022
Tools for quantum computing based on decision diagrams
R Wille, S Hillmich, L Burgholzer
ACM Transactions on Quantum Computing 3 (3), 1-17, 2022
282022
Just like the real thing: Fast weak simulation of quantum computation
S Hillmich, IL Markov, R Wille
2020 57th ACM/IEEE Design Automation Conference (DAC), 1-6, 2020
282020
Arrays vs. decision diagrams: A case study on quantum circuit simulators
T Grurl, J Fuß, S Hillmich, L Burgholzer, R Wille
2020 IEEE 50th International Symposium on Multiple-Valued Logic (ISMVL), 176-181, 2020
232020
As accurate as needed, as efficient as possible: Approximations in DD-based quantum circuit simulation
S Hillmich, R Kueng, IL Markov, R Wille
2021 Design, Automation & Test in Europe Conference & Exhibition (DATE), 188-193, 2021
212021
Concurrency in DD-based quantum circuit simulation
S Hillmich, A Zulehner, R Wille
2020 25th Asia and South Pacific Design Automation Conference (ASP-DAC), 115-120, 2020
182020
Efficient and correct compilation of quantum circuits
R Wille, S Hillmich, L Burgholzer
2020 IEEE International Symposium on Circuits and Systems (ISCAS), 1-5, 2020
172020
Decision diagrams for quantum computing
R Wille, S Hillmich, L Burgholzer
Design Automation of Quantum Computers, 1-23, 2022
152022
Approximating decision diagrams for quantum circuit simulation
S Hillmich, A Zulehner, R Kueng, IL Markov, R Wille
ACM Transactions on Quantum Computing 3 (4), 1-21, 2022
132022
Approximation of quantum states using decision diagrams
A Zulehner, S Hillmich, IL Markov, R Wille
2020 25th Asia and South Pacific Design Automation Conference (ASP-DAC), 121-126, 2020
132020
Gates vs. splitters: Contradictory optimization objectives in the synthesis of optical circuits
A Deb, R Wille, O Keszöcze, S Hillmich, R Drechsler
ACM Journal on Emerging Technologies in Computing Systems (JETC) 13 (1), 1-13, 2016
132016
The basis of design tools for quantum computing: arrays, decision diagrams, tensor networks, and ZX-calculus
R Wille, L Burgholzer, S Hillmich, T Grurl, A Ploier, T Peham
Proceedings of the 59th ACM/IEEE Design Automation Conference, 1367-1370, 2022
122022
Using Boolean satisfiability for exact shuttling in trapped-ion quantum computers
D Schoenberger, S Hillmich, M Brandl, R Wille
2024 29th Asia and South Pacific Design Automation Conference (ASP-DAC), 127-133, 2024
112024
Adaptive compilation of multi-level quantum operations
K Mato, M Ringbauer, S Hillmich, R Wille
2022 IEEE International Conference on Quantum Computing and Engineering (QCE …, 2022
112022
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20