REVIEW 3 cited by
The MQT Handbook: A Summary of Design Automation Tools and Software for Quantum Computing
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Quantum computers are becoming a reality and numerous quantum computing applications with a near-term perspective (e.g., for finance, chemistry, machine learning, and optimization) and with a long-term perspective (e.g., for cryptography or unstructured search) are currently being investigated. However, designing and realizing potential applications for these devices in a scalable fashion requires automated, efficient, and user-friendly software tools that cater to the needs of end users, engineers, and physicists at every level of the entire quantum software stack. Many of the problems to be tackled in that regard are similar to design problems from the classical realm for which sophisticated design automation tools have been developed in the previous decades. The Munich Quantum Toolkit (MQT) is a collection of software tools for quantum computing developed by the Chair for Design Automation at the Technical University of Munich which explicitly utilizes this design automation expertise. Our overarching objective is to provide solutions for design tasks across the entire quantum software stack. This entails high-level support for end users in realizing their applications, efficient methods for the classical simulation, compilation, and verification of quantum circuits, tools for quantum error correction, support for physical design, and more. These methods are supported by corresponding data structures (such as decision diagrams) and core methods (such as SAT encodings/solvers). All of the developed tools are available as open-source implementations and are hosted on https://github.com/cda-tum.
Forward citations
Cited by 3 Pith papers
-
Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation
A group of four non-commuting pi/4 Pauli rotations can be reordered as blocks whenever their axes satisfy a simple algebraic condition, and this rule defeats current T-count optimizers on specially built circuits.
-
Probing Hadron Scattering in Lattice Gauge Theories on Qudit Quantum Computers
Proposed qudit circuits simulate meson-antimeson scattering in a spin-1 U(1) lattice gauge theory and remain accurate under realistic dephasing and depolarization noise.
-
Deterministic Fault-Tolerant State Preparation for Near-Term Quantum Error Correction: Automatic Synthesis Using Boolean Satisfiability
A SAT-based tool automatically synthesizes deterministic, fault-tolerant state preparation circuits for any small CSS quantum error-correcting code, with optimal measurement count.
Discussion (0). Continue with ORCID to comment.