default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTom Peham
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Robert Wille, Lucas Berent, Tobias Forster, Jagatheesan Kunasaikaran, Kevin Mato, Tom Peham, Nils Quetschlich, Damian Rovara, Aaron Sander, Ludwig Schmid, Daniel Schönberger, Yannick Stade, Lukas Burgholzer:
The MQT Handbook : A Summary of Design Automation Tools and Software for Quantum Computing. QSW 2024: 1-8- [i8]Robert Wille, Lucas Berent, Tobias Forster, Jagatheesan Kunasaikaran, Kevin Mato, Tom Peham, Nils Quetschlich, Damian Rovara, Aaron Sander, Ludwig Schmid
, Daniel Schönberger, Yannick Stade, Lukas Burgholzer:
The MQT Handbook: A Summary of Design Automation Tools and Software for Quantum Computing. CoRR abs/2405.17543 (2024) - [i7]Tom Peham, Ludwig Schmid, Lucas Berent, Markus Müller, Robert Wille:
Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error Correction Codes. CoRR abs/2408.11894 (2024) - 2023
- [c7]Tom Peham, Lukas Burgholzer, Robert Wille:
Equivalence Checking of Parameterized Quantum Circuits: Verifying the Compilation of Variational Quantum Algorithms. ASP-DAC 2023: 702-708 - [c6]Stefan Engels, Tom Peham, Robert Wille:
A Symbolic Design Method for ETCS Hybrid Level 3 at Different Degrees of Accuracy. ATMOS 2023: 6:1-6:17 - [c5]Tom Peham, Nina Brandl, Richard Kueng, Robert Wille, Lukas Burgholzer:
Depth-Optimal Synthesis of Clifford Circuits with SAT Solvers. QCE 2023: 802-813 - [i6]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) - [i5]Tom Peham, Nina Brandl, Richard Kueng, Robert Wille, Lukas Burgholzer:
Depth-Optimal Synthesis of Clifford Circuits with SAT Solvers. CoRR abs/2305.01674 (2023) - [i4]Stefan Engels, Tom Peham, Judith Przigoda, Nils Przigoda, Robert Wille:
Design Tasks and Their Complexity for Hybrid Level 3 of the European Train Control System. CoRR abs/2308.02572 (2023) - 2022
- [j1]Tom Peham, Lukas Burgholzer, Robert Wille:
Equivalence Checking of Quantum Circuits With the ZX-Calculus. IEEE J. Emerg. Sel. Topics Circuits Syst. 12(3): 662-675 (2022) - [c4]Tom Peham, Lukas Burgholzer, Robert Wille:
Equivalence checking paradigms in quantum circuit design: a case study. DAC 2022: 517-522 - [c3]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 - [c2]Tom Peham, Judith Przigoda, Nils Przigoda, Robert Wille:
Optimal Railway Routing Using Virtual Subsections. RSSRail 2022: 63-79 - [i3]Tom Peham, Lukas Burgholzer, Robert Wille:
Equivalence Checking of Quantum Circuits with the ZX-Calculus. CoRR abs/2208.12820 (2022) - [i2]Tom Peham, Lukas Burgholzer, Robert Wille:
On Optimal Subarchitectures for Quantum Circuit Mapping. CoRR abs/2210.09321 (2022) - [i1]Tom Peham, Lukas Burgholzer, Robert Wille:
Equivalence Checking of Parameterized Quantum Circuits: Verifying the Compilation of Variational Quantum Algorithms. CoRR abs/2210.12166 (2022) - 2021
- [c1]Robert Wille, Tom Peham, Judith Przigoda, Nils Przigoda:
Towards Automatic Design and Verification for Level 3 of the European Train Control System. DATE 2021: 974-979
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-10-07 22:17 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:
