9 papers
Basis-update and Galerkin time integration in canonical matrix-product-state form
Maximilian Fröhlich, Richard M. Milbradt, Martin Eigel +3
Matrix product state algorithms must enlarge their bond spaces as entanglement grows and compress them to control cost. We formulate basis-update and Galerkin (BUG) time integratio…
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…
Noisy quantum circuit simulation with the tensor jump method
Maximilian Fröhlich, Aaron Sander, Martin Eigel +2
Classical simulation of noisy quantum circuits is essential for validating algorithms, benchmarking hardware, and assessing error-mitigation strategies, but remains limited by the…
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…