activity
20132026
most citedDefect-induced supersolidity with soft-core bosons

142 citations · 159 across the 18 of their papers we have counts for

collaborators
Showing 2025 · quant-phShow all

7 papers · 2 filters

quant-ph2025

Fault-tolerant multi-qubit gates in Parity Codes

Anette Messinger, Christophe Goeller, Wolfgang Lechner

We present a set of efficiently implementable logical multi-qubit gates in concatenated quantum error correction codes using parity qubits. In particular, we show how fault-toleran…

quant-ph2025

Bundling of bipartite entanglement

Maike Drieb-Schön, Florian Dreier, Wolfgang Lechner

We investigate bipartite entanglement and prove that in constrained energy subspaces, the entanglement spectra of multiple bipartitions are the same across the whole subspace. We s…

quant-ph2025★ 1 cited

The Parity Flow Formalism: Tracking Quantum Information Throughout Computation

Berend Klaver, Katharina Ludwig, Anette Messinger +4

We propose the Parity Flow formalism, a method for tracking the information flow in quantum circuits. This method adds labels to quantum circuit diagrams such that the action of Cl…

quant-ph2025

Optimal Decoder for the Error Correcting Parity Code

Konstantin Tiurev, Christophe Goeller, Leo Stenzel +4

We present a two-step decoder for the parity code and evaluate its performance in code-capacity and faulty-measurement settings. For noiseless measurements, we find that the decodi…

quant-ph2025★ 2 cited

Minimally Universal Parity Quantum Computing

Isaac D. Smith, Berend Klaver, Hendrik Poulsen Nautrup +2

In parity quantum computing, multi-qubit logical gates are implemented by single-qubit rotations on a suitably encoded state involving auxiliary qubits. Consequently, there is a co…

quant-ph2025

Improving success probability in the LHZ parity embedding by computing with quantum walks

Jemma Bennett, Nicholas Chancellor, Viv Kendon +1

The LHZ parity embedding is one of the front-running methods for implementing difficult-to-engineer long-range interactions in quantum optimisation problems. Continuous-time quantu…

quant-ph2025★ 2 cited

Connectivity-aware Synthesis of Quantum Algorithms

Florian Dreier, Christoph Fleckenstein, Gregor Aigner +5

We present a general method for the implementation of quantum algorithms that optimizes both gate count and circuit depth. Our approach introduces connectivity-adapted CNOT-based b…