default search action
Lukas Burgholzer
Person information
- affiliation: Technical University of Munich, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c35]Shui Jiang
, Rongliang Fu
FlatDD: A High-Performance Quantum Circuit Simulator using Decision Diagram and Flat Array. ICPP 2024: 388-399 - [c34]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 - [c33]Nils Quetschlich, Florian J. Kiwit, Maximilian A. Wolf, Carlos A. Riofrío, Lukas Burgholzer, Andre Luckow, Robert Wille:
Towards Application-Aware Quantum Circuit Compilation. QSW 2024: 135-142 - [c32]Aaron Sander, Ioan-Albert Florea, Lukas Burgholzer, Robert Wille:
Stripping Quantum Decision Diagrams of their Identity. QSW 2024: 168-174 - [d2]Lucas Berent
Dataset containing raw threshold and runtime simulation data for a paper evaluation on decoding quantum color codes. Version 2. Zenodo, 2024 [all versions] - [i29]Yannick Stade
An Abstract Model and Efficient Routing for Logical Entangling Gates on Zoned Neutral Atom Architectures. CoRR abs/2405.08068 (2024) - [i28]Robert Wille, Lucas Berent, Tobias Forster, Jagatheesan Kunasaikaran, Kevin Mato, Tom Peham, Nils Quetschlich, Damian Rovara, Aaron Sander, Ludwig Schmid
The MQT Handbook: A Summary of Design Automation Tools and Software for Quantum Computing. CoRR abs/2405.17543 (2024) - [i27]Aaron Sander, Ioan-Albert Florea, Lukas Burgholzer, Robert Wille:
Stripping Quantum Decision Diagrams of their Identity. CoRR abs/2406.11959 (2024) - [i26]Kevin Mato, Martin Ringbauer, Lukas Burgholzer, Robert Wille:
MQT Qudits: A Software Framework for Mixed-Dimensional Quantum Computing. CoRR abs/2410.02854 (2024) - [i25]Aaron Sander, Lukas Burgholzer, Robert Wille:
Equivalence Checking of Quantum Circuits via Intermediary Matrix Product Operator. CoRR abs/2410.10946 (2024) - 2023
- [j7]Nils Quetschlich, Lukas Burgholzer, Robert Wille:
MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing. Quantum 7: 1062 (2023) - [j6]Lukas Burgholzer
Simulation Paths for Quantum Circuit Simulation With Decision Diagrams What to Learn From Tensor Networks, and What Not. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 42(4): 1113-1122 (2023) - [c31]Sarah Schneider, Lukas Burgholzer
A SAT Encoding for Optimal Clifford Circuit Synthesis. ASP-DAC 2023: 190-195 - [c30]Lukas Burgholzer
Exploiting Reversible Computing for Verification: Potential, Possible Paths, and Consequences. ASP-DAC 2023: 429-435 - [c29]Tom Peham
Equivalence Checking of Parameterized Quantum Circuits: Verifying the Compilation of Variational Quantum Algorithms. ASP-DAC 2023: 702-708 - [c28]Lucas Berent
Software Tools for Decoding Quantum Low-Density Parity-Check Codes. ASP-DAC 2023: 709-714 - [c27]Nils Quetschlich, Lukas Burgholzer
Compiler Optimization for Quantum Computing Using Reinforcement Learning. DAC 2023: 1-6 - [c26]Nils Quetschlich, Lukas Burgholzer, Robert Wille:
Towards an Automated Framework for Realizing Quantum Computing Solutions. ISMVL 2023: 134-140 - [c25]Robert Wille
MQT QMAP: Efficient Quantum Circuit Mapping. ISPD 2023: 198-204 - [c24]Aaron Sander, Lukas Burgholzer, Robert Wille:
Towards Hamiltonian Simulation with Decision Diagrams. QCE 2023: 283-294 - [c23]Nils Quetschlich, Vincent Koch, Lukas Burgholzer, Robert Wille:
A Hybrid Classical Quantum Computing Approach to the Satellite Mission Planning Problem. QCE 2023: 642-647 - [c22]Nils Quetschlich, Lukas Burgholzer, Robert Wille:
Reducing the Compilation Time of Quantum Circuits Using Pre-Compilation on the Gate Level. QCE 2023: 757-767 - [c21]Tom Peham, Nina Brandl, Richard Kueng, Robert Wille, Lukas Burgholzer:
Depth-Optimal Synthesis of Clifford Circuits with SAT Solvers. QCE 2023: 802-813 - [c20]Nils Quetschlich, Lukas Burgholzer, Robert Wille:
Predicting Good Quantum Circuit Compilation Options. QSW 2023: 43-53 - [c19]Benedikt Poggel, Nils Quetschlich, Lukas Burgholzer, Robert Wille, Jeanette Miriam Lorenz:
Recommending Solution Paths for Solving Optimization Problems with Quantum Computing. QSW 2023: 60-67 - [p1]Lukas Burgholzer:
Entwurfsautomatisierungs-Tools und Software für Quantencomputing. Ausgezeichnete Informatikdissertationen 2023: 41-50 - [d1]Lucas Berent
Dataset containing raw threshold and runtime simulation data for a paper evaluation on decoding quantum color codes. Version 1. Zenodo, 2023 [all versions] - [i24]Robert Wille, Lukas Burgholzer, Stefan Hillmich
The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus. CoRR abs/2301.04147 (2023) - [i23]Robert Wille, Lukas Burgholzer:
MQT QMAP: Efficient Quantum Circuit Mapping. CoRR abs/2301.11935 (2023) - [i22]Lukas Burgholzer, Alexander Ploier, Robert Wille:
Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum Circuit Simulation. CoRR abs/2302.06616 (2023) - [i21]Tom Peham, Nina Brandl, Richard Kueng, Robert Wille, Lukas Burgholzer:
Depth-Optimal Synthesis of Clifford Circuits with SAT Solvers. CoRR abs/2305.01674 (2023) - [i20]Aaron Sander, Lukas Burgholzer, Robert Wille:
Towards Hamiltonian Simulation with Decision Diagrams. CoRR abs/2305.02337 (2023) - 2022
- [j5]Lukas Burgholzer
Characteristics of reversible circuits for error detection. Array 14: 100165 (2022) - [j4]Tom Peham
Equivalence Checking of Quantum Circuits With the ZX-Calculus. IEEE J. Emerg. Sel. Topics Circuits Syst. 12(3): 662-675 (2022) - [j3]Smaran Adarsh
SyReC Synthesizer: An MQT tool for synthesis of reversible circuits. Softw. Impacts 14: 100451 (2022) - [c18]Lukas Burgholzer, Sarah Schneider, Robert Wille:
Limiting the Search Space in Optimal Quantum Circuit Mapping. ASP-DAC 2022: 466-471 - [c17]Tom Peham
Equivalence checking paradigms in quantum circuit design: a case study. DAC 2022: 517-522 - [c16]Lukas Burgholzer
Handling non-unitaries in quantum circuit equivalence checking. DAC 2022: 529-534 - [c15]Robert Wille, Lukas Burgholzer
The basis of design tools for quantum computing: arrays, decision diagrams, tensor networks, and ZX-calculus. DAC 2022: 1367-1370 - [c14]Lukas Burgholzer, Alexander Ploier, Robert Wille:
Exploiting Arbitrary Paths for the Simulation of Quantum Circuits with Decision Diagrams. DATE 2022: 64-67 - [c13]Stefan Hillmich
Reordering Decision Diagrams for Quantum Computing Is Harder Than You Might Think. RC 2022: 93-107 - [c12]Lucas Berent
Towards a SAT Encoding for Quantum Circuits: A Journey From Classical Circuits to Clifford Circuits and Beyond. SAT 2022: 18:1-18:17 - [i19]Lucas Berent, Lukas Burgholzer, Robert Wille:
Towards a SAT Encoding for Quantum Circuits: A Journey From Classical Circuits to Clifford Circuits and Beyond. CoRR abs/2203.00698 (2022) - [i18]Lukas Burgholzer, Alexander Ploier, Robert Wille:
Simulation Paths for Quantum Circuit Simulation with Decision Diagrams. CoRR abs/2203.00703 (2022) - [i17]Nils Quetschlich, Lukas Burgholzer, Robert Wille:
MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing. CoRR abs/2204.13719 (2022) - [i16]Sarah Schneider, Lukas Burgholzer, Robert Wille:
A SAT Encoding for Optimal Clifford Circuit Synthesis. CoRR abs/2208.11713 (2022) - [i15]Tom Peham, Lukas Burgholzer, Robert Wille:
Equivalence Checking of Quantum Circuits with the ZX-Calculus. CoRR abs/2208.12820 (2022) - [i14]Lucas Berent, Lukas Burgholzer, Robert Wille:
Software Tools for Decoding Quantum Low-Density Parity Check Codes. CoRR abs/2209.01180 (2022) - [i13]Nils Quetschlich, Lukas Burgholzer, Robert Wille:
Predicting Good Quantum Circuit Compilation Options. CoRR abs/2210.08027 (2022) - [i12]Tom Peham, Lukas Burgholzer, Robert Wille:
On Optimal Subarchitectures for Quantum Circuit Mapping. CoRR abs/2210.09321 (2022) - [i11]Tom Peham, Lukas Burgholzer, Robert Wille:
Equivalence Checking of Parameterized Quantum Circuits: Verifying the Compilation of Variational Quantum Algorithms. CoRR abs/2210.12166 (2022) - [i10]Nils Quetschlich, Lukas Burgholzer, Robert Wille:
Towards an Automated Framework for Realizing Quantum Computing Solutions. CoRR abs/2210.14928 (2022) - [i9]Nils Quetschlich, Lukas Burgholzer, Robert Wille:
Compiler Optimization for Quantum Computing Using Reinforcement Learning. CoRR abs/2212.04508 (2022) - [i8]Smaran Adarsh, Lukas Burgholzer, Tanmay Manjunath, Robert Wille:
SyReC Synthesizer: An MQT tool for synthesis of reversible circuits. CoRR abs/2212.05903 (2022) - 2021
- [j2]Lukas Burgholzer
QCEC: A JKQ tool for quantum circuit equivalence checking. Softw. Impacts 7: 100051 (2021) - [j1]Lukas Burgholzer
Advanced Equivalence Checking for Quantum Circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 40(9): 1810-1824 (2021) - [c11]Lukas Burgholzer
Random Stimuli Generation for the Verification of Quantum Circuits. ASP-DAC 2021: 767-772 - [c10]Robert Wille, Lukas Burgholzer, Michael Artner:
Visualizing Decision Diagrams for Quantum Computing (Special Session Summary). DATE 2021: 768-773 - [c9]Lukas Burgholzer
Hybrid Schrödinger-Feynman Simulation of Quantum Circuits With Decision Diagrams. QCE 2021: 199-206 - [c8]Lukas Burgholzer
Efficient Construction of Functional Representations for Quantum Algorithms. RC 2021: 227-241 - [i7]Lukas Burgholzer, Rudy Raymond, Indranil Sengupta, Robert Wille:
Efficient Construction of Functional Representations for Quantum Algorithms. CoRR abs/2103.08281 (2021) - [i6]Lukas Burgholzer, Hartwig Bauer, Robert Wille:
Hybrid Schrödinger-Feynman Simulation of Quantum Circuits With Decision Diagrams. CoRR abs/2105.07045 (2021) - [i5]Lukas Burgholzer, Robert Wille:
Towards Verification of Dynamic Quantum Circuits. CoRR abs/2106.01099 (2021) - [i4]Lukas Burgholzer, Sarah Schneider, Robert Wille:
Limiting the Search Space in Optimal Quantum Circuit Mapping. CoRR abs/2112.00045 (2021) - 2020
- [c7]Lukas Burgholzer
Improved DD-based Equivalence Checking of Quantum Circuits. ASP-DAC 2020: 127-132 - [c6]Lukas Burgholzer
The Power of Simulation for Equivalence Checking in Quantum Computing. DAC 2020: 1-6 - [c5]Robert Wille, Stefan Hillmich
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
Arrays vs. Decision Diagrams: A Case Study on Quantum Circuit Simulators. ISMVL 2020: 176-181 - [c2]Lukas Burgholzer
Verifying Results of the IBM Qiskit Quantum Circuit Compilation Flow. QCE 2020: 356-365 - [i3]Lukas Burgholzer
Advanced Equivalence Checking for Quantum Circuits. CoRR abs/2004.08420 (2020) - [i2]Lukas Burgholzer, Richard Kueng, Robert Wille:
Random Stimuli Generation for the Verification of Quantum Circuits. CoRR abs/2011.07288 (2020) - [i1]Lukas Burgholzer, Robert Wille, Richard Kueng:
Characteristics of Reversible Circuits for Error Detection. CoRR abs/2012.02037 (2020)
2010 – 2019
- 2019
- [c1]Robert Wille, Lukas Burgholzer, Alwin Zulehner:
Mapping Quantum Circuits to IBM QX Architectures Using the Minimal Number of SWAP and H Operations. DAC 2019: 142
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-12-01 01:10 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: