51 citations · 178 across the 15 of their papers we have counts for
17 papers
The Pinnacle Architecture with fixed connectivity of degree eight
Paul Webster, Tom Peham, Lawrence Z. Cohen
We show how the Pinnacle architecture can be adapted to be compatible with superconducting qubits, where the connectivity between qubits must be fixed at fabrication. Specifically,…
QECirc: A Community-Driven, FAIR Library of Quantum Error Correction Circuits
Ludwig Schmid, Tom Peham, Robert Wille
Quantum error correction (QEC) underpins fault-tolerant quantum computing, but the circuits that realize QEC codes (encoders, logical state-preparation and gate routines, and syndr…
Complementary 3D color codes for transversal quantum logic
Friederike Butt, Luis Colmenarez, Erik Weilandt +3
Transversal logical gates provide a direct route to fault-tolerant quantum computation, but the Eastin-Knill theorem forbids a universal transversal gate set within a single quantu…
Computational regimes in matrix-product-state-based quantum trajectory simulations
Aaron Sander, Simon Cichy, Martin Eigel +4
Efficient simulation of open quantum systems is central to modeling noisy quantum hardware and many-body dynamics. In trajectory-based tensor network methods, cost is often associa…
Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation
Tom Peham, Matthew Steinberg, Robert Wille +1
Preparing arbitrary logical states is a central primitive for universal fault-tolerant quantum computation and the cost of encoded-state preparation contributes directly to the ove…
Synthesis of Fault-tolerant State Preparation Circuits using Steane-type Error Detection
Erik Weilandt, Tom Peham, Robert Wille
Fault-tolerant state preparation is essential for reliable quantum error correction, particularly in Steane-type error correction, which relies on robust ancilla states for syndrom…
Optimizing Fault-tolerant Cat State Preparation
Tom Peham, Erik Weilandt, Robert Wille
Cat states are an important resource for fault-tolerant quantum computing, where they serve as building blocks for a variety of fault-tolerant primitives. Consequently, the ability…
Minimizing the Number of Code Switching Operations in Fault-Tolerant Quantum Circuits
Erik Weilandt, Tom Peham, Robert Wille
Fault-tolerant quantum computers rely on Quantum Error-Correcting Codes (QECCs) to protect information from noise. However, no single error-correcting code supports a fully transve…
Deterministic Fault-Tolerant State Preparation for Near-Term Quantum Error Correction: Automatic Synthesis Using Boolean Satisfiability
Ludwig Schmid, Tom Peham, Lucas Berent +2
To ensure resilience against the unavoidable noise in quantum computers, quantum information needs to be encoded using an error-correcting code, and circuits must have a particular…
Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error Correction Codes
Tom Peham, Ludwig Schmid, Lucas Berent +2
A central ingredient in fault-tolerant quantum algorithms is the initialization of a logical state for a given quantum error-correcting code from a set of noisy qubits. A scheme th…
The MQT Handbook: A Summary of Design Automation Tools and Software for Quantum Computing
Robert Wille, Lucas Berent, Tobias Forster +10
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)…
Design Tasks and Their Complexity for the European Train Control System with Hybrid Train Detection
Stefan Engels, Tom Peham, Judith Przigoda +2
Railway networks have become increasingly important in recent times, especially in moving freight and public transportation from road traffic and planes to more environmentally fri…
Depth-Optimal Synthesis of Clifford Circuits with SAT Solvers
Tom Peham, Nina Brandl, Richard Kueng +2
Circuit synthesis is the task of decomposing a given logical functionality into a sequence of elementary gates. It is (depth-)optimal if it is impossible to achieve the desired fun…
The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus
Robert Wille, Lukas Burgholzer, Stefan Hillmich +3
Quantum computers promise to efficiently solve important problems classical computers never will. However, in order to capitalize on these prospects, a fully automated quantum soft…
Equivalence Checking of Parameterized Quantum Circuits: Verifying the Compilation of Variational Quantum Algorithms
Tom Peham, Lukas Burgholzer, Robert Wille
Variational quantum algorithms have been introduced as a promising class of quantum-classical hybrid algorithms that can already be used with the noisy quantum computing hardware a…
On Optimal Subarchitectures for Quantum Circuit Mapping
Tom Peham, Lukas Burgholzer, Robert Wille
Compiling a high-level quantum circuit down to a low-level description that can be executed on state-of-the-art quantum computers is a crucial part of the software stack for quantu…
Equivalence Checking of Quantum Circuits with the ZX-Calculus
Tom Peham, Lukas Burgholzer, Robert Wille
As state-of-the-art quantum computers are capable of running increasingly complex algorithms, the need for automated methods to design and test potential applications rises. Equiva…