51 citations · 157 across the 15 of their papers we have counts for
15 papers
Lifted surgery: Fast processing with QLDPC codes
Lucas Berent, Lawrence Z. Cohen, Armanda O. Quintavalle
Quantum low-density parity-check (QLDPC) codes are a leading candidate for achieving low-overhead fault-tolerant quantum computing. However, the time overhead of logical operations…
The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes
Paul Webster, Lucas Berent, Omprakash Chandra +5
The realisation of utility-scale quantum computing inextricably depends on the design of practical, low-overhead fault-tolerant architectures. We introduce the Pinnacle Architectur…
Exploiting Movable Logical Qubits for Lattice Surgery Compilation
Laura S. Herzog, Lucas Berent, Aleksander Kubica +1
Lattice surgery with two-dimensional quantum error correcting codes is among the leading schemes for fault-tolerant quantum computation, motivated by superconducting hardware archi…
Fast surgery for quantum LDPC codes
Nouédyn Baspin, Lucas Berent, Lawrence Z. Cohen
Quantum LDPC codes promise significant reductions in physical qubit overhead compared with topological codes. However, many existing constructions for performing logical operations…
Lattice Surgery Compilation Beyond the Surface Code
Laura S. Herzog, Lucas Berent, Aleksander Kubica +1
Large-scale fault-tolerant quantum computation requires compiling logical circuits into physical operations tailored to a given architecture. Prior work addressing this challenge h…
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…
Localized statistics decoding for quantum low-density parity-check codes
Timo Hillmann, Lucas Berent, Armanda O. Quintavalle +3
Quantum low-density parity-check codes are a promising candidate for fault-tolerant quantum computing with considerably reduced overhead compared to the surface code. However, the…
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)…
Analog information decoding of bosonic quantum LDPC codes
Lucas Berent, Timo Hillmann, Jens Eisert +2
Quantum error correction is crucial for scalable quantum information processing applications. Traditional discrete-variable quantum codes that use multiple two-level systems to enc…
Decoding quantum color codes with MaxSAT
Lucas Berent, Lukas Burgholzer, Peter-Jan H. S. Derks +2
In classical computing, error-correcting codes are well established and are ubiquitous both in theory and practical applications. For quantum computing, error-correction is essenti…
Software Tools for Decoding Quantum Low-Density Parity Check Codes
Lucas Berent, Lukas Burgholzer, Robert Wille
Quantum Error Correction (QEC) is an essential field of research towards the realization of large-scale quantum computers. On the theoretical side, a lot of effort is put into desi…
Quantum LDPC Codes for Modular Architectures
Armands Strikis, Lucas Berent
In efforts to scale the size of quantum computers, modularity plays a central role across most quantum computing technologies. In the light of fault tolerance, this necessitates de…
Towards a SAT Encoding for Quantum Circuits: A Journey From Classical Circuits to Clifford Circuits and Beyond
Lucas Berent, Lukas Burgholzer, Robert Wille
Satisfiability Testing (SAT) techniques are well-established in classical computing where they are used to solve a broad variety of problems, e.g., in the design of classical circu…
Complexity of Arithmetic in Warded Datalog+-
Lucas Berent, Markus Nissl, Emanuel Sallinger
Warded Datalog+- extends the logic-based language Datalog with existential quantifiers in rule heads. Existential rules are needed for advanced reasoning tasks, e.g., ontological r…