Josias Old
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Josias Old has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Markus Müller
Forschungszentrum Jülich
3 shared publications Alex Townsend-Teague
Freie Universität Berlin
1 shared publication- David F. Locher
RWTH Aachen University
1 shared publication - Hans Peter Büchler
Institute for Theoretical Physics III and Center for Integrated Quantum Science and Technology, University of Stuttgart, Stuttgart, Germany
1 shared publication - Jakob Holschbach
Forschungszentrum Jülich
1 shared publication - Jens Eisert
Dahlem Center for Complex Quantum Systems, Freie Universität Berlin, Berlin, Germany
1 shared publication
Latest Publications
- Open Access
- 8 June 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (2)
Multiqubit Rydberg Gates for Quantum Error Correction
Multiqubit gates that involve three or more qubits are usually thought to be of little significance for fault-tolerant quantum error correction because single gate faults can lead to errors of high Pauli weight. However, recent works have shown that multiqubit gates can be beneficial for measurement-free fault-tolerant quantum error correction and for fault-tolerant stabilizer readout in unrotated surface codes. In this work, we investigate multiqubit Rydberg gates that are useful for fault-tolerant quantum error correction in single-species neutral-atom platforms and can be implemented with global laser pulses that do not individually address atomic sites. We develop an open-source Python package to generate analytical, few-parameter pulses that implement the desired gates while minimizing gate errors due to Rydberg-state decay. The tool also allows us to identify parameter-optimal pulses, characterized by a minimal parameter count for the pulse ansatz. Measurement-free quantum error correction protocols require controlled-controlled-Z (CCZ) gates, which we analyze for atoms arranged in symmetric and asymmetric configurations. We investigate the performance of these schemes for various single-, two-, and three-qubit gate error rates, showing that break-even performance of measurement-free quantum error correction is within reach of current hardware. Moreover, we study Floquet quantum error correction protocols that comprise two-body stabilizer measurements. Those can be realized using global three-qubit gates, and we show that this can lead to a significant reduction in shuttling operations. Simulations with realistic circuit-level noise indicate that applying three-qubit gates for stabilizer measurements in Floquet codes can yield competitive logical qubit performance in experimentally relevant error regimes.
- 8 June 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (2)
Open AccessMultiqubit Rydberg Gates for Quantum Error Correction
Multiqubit gates that involve three or more qubits are usually thought to be of little significance for fault-tolerant quantum error correction because single gate faults can lead to errors of high Pauli weight. However, recent works have shown that multiqubit gates can be beneficial for measurement-free fault-tolerant quantum error correction and for fault-tolerant stabilizer readout in unrotated surface codes. In this work, we investigate multiqubit Rydberg gates that are useful for fault-tolerant quantum error correction in single-species neutral-atom platforms and can be implemented with global laser pulses that do not individually address atomic sites. We develop an open-source Python package to generate analytical, few-parameter pulses that implement the desired gates while minimizing gate errors due to Rydberg-state decay. The tool also allows us to identify parameter-optimal pulses, characterized by a minimal parameter count for the pulse ansatz. Measurement-free quantum error correction protocols require controlled-controlled-Z (CCZ) gates, which we analyze for atoms arranged in symmetric and asymmetric configurations. We investigate the performance of these schemes for various single-, two-, and three-qubit gate error rates, showing that break-even performance of measurement-free quantum error correction is within reach of current hardware. Moreover, we study Floquet quantum error correction protocols that comprise two-body stabilizer measurements. Those can be realized using global three-qubit gates, and we show that this can lead to a significant reduction in shuttling operations. Simulations with realistic circuit-level noise indicate that applying three-qubit gates for stabilizer measurements in Floquet codes can yield competitive logical qubit performance in experimentally relevant error regimes.
- Open Access
- 9 December 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 135 (24) , 240601
Fault-Tolerant Stabilizer Measurements in Surface Codes with Three-Qubit Gates
Stabilizer quantum error correction (QEC) codes, in particular topological surface codes, are prime candidates to enable practical quantum computing. While it is widely believed that strictly fault-tolerant protocols can only be implemented using single- and two-qubit gates, several quantum computing platforms, including trapped ions, neutral atoms, and superconducting qubits, support native multi-qubit operations. In this Letter, we show that stabilizer measurement circuits for unrotated surface codes can be fault tolerant using single auxiliary qubits and gates. These gates enable lower-depth circuits with fewer fault locations and potentially shorter QEC cycle times. We find that in an optimistic parameter regime where fidelities of three-qubit gates are the same as those of two-qubit gates, the logical error rate can be up to one order of magnitude lower and the threshold significantly higher, increasing from ≈ 0.63 % to ≈ 0.83 % . Our results, applicable to a wide range of platforms, motivate further investigation into multi-qubit gates for fault-tolerant QEC as they can offer substantial time and physical qubit resource advantages to reach a given target logical error rate.
- 9 December 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 135 (24) , 240601
Open AccessFault-Tolerant Stabilizer Measurements in Surface Codes with Three-Qubit Gates
Stabilizer quantum error correction (QEC) codes, in particular topological surface codes, are prime candidates to enable practical quantum computing. While it is widely believed that strictly fault-tolerant protocols can only be implemented using single- and two-qubit gates, several quantum computing platforms, including trapped ions, neutral atoms, and superconducting qubits, support native multi-qubit operations. In this Letter, we show that stabilizer measurement circuits for unrotated surface codes can be fault tolerant using single auxiliary qubits and gates. These gates enable lower-depth circuits with fewer fault locations and potentially shorter QEC cycle times. We find that in an optimistic parameter regime where fidelities of three-qubit gates are the same as those of two-qubit gates, the logical error rate can be up to one order of magnitude lower and the threshold significantly higher, increasing from ≈ 0.63 % to ≈ 0.83 % . Our results, applicable to a wide range of platforms, motivate further investigation into multi-qubit gates for fault-tolerant QEC as they can offer substantial time and physical qubit resource advantages to reach a given target logical error rate.
- Open Access
- 28 March 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (1)
Ruby Code: Making a Case for a Three-Colored Graphical Calculus for Quantum Error Correction in SpacetimeAnalyzing and developing new quantum error-correcting (QEC) schemes is one of the most prominent tasks in quantum computing research. In such efforts, introducing time dynamics explicitly in both analysis and design of error-correcting protocols constitutes an important cornerstone. In this work, we present a graphical formalism based on tensor networks to capture the logical action and error-correcting capabilities of any Clifford circuit with Pauli measurements. We showcase the functioning of the formalism on new Floquet codes derived from topological subsystem codes, which we call XYZ . Based on the projective symmetries of the building blocks of the tensor network we develop a framework of . Pauli flows allow for a graphical understanding of all quantities entering an error-correction analysis of a circuit, including different types of QEC experiments, such as memory and stability experiments. We lay out how to derive a well-defined decoding problem from the tensor-network representation of a protocol and its Pauli flows alone, independent of any stabilizer code or fixed circuit. Importantly, this framework applies to all Clifford protocols and encompasses both measurement-based and circuit-based approaches to fault tolerance. We apply our method to our new family of dynamical codes, which are in the same topological phase as the 2 + 1 -dimensional color code, making them a promising candidate for low-overhead logical gates. In contrast to its static counterpart, the dynamical protocol applies a Z 3 automorphism to the logical Pauli group every three time steps. We highlight some of its topological properties and comment on the anyon physics behind a planar layout. Lastly, we benchmark the performance of the XYZ ruby code on a torus by performing both memory and stability experiments and find competitive circuit-level noise thresholds of approximately equal to 0.18 % , comparable with other Floquet codes and 2 + 1 -dimensional color codes.
- 28 March 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (1)
Open AccessRuby Code: Making a Case for a Three-Colored Graphical Calculus for Quantum Error Correction in SpacetimeAnalyzing and developing new quantum error-correcting (QEC) schemes is one of the most prominent tasks in quantum computing research. In such efforts, introducing time dynamics explicitly in both analysis and design of error-correcting protocols constitutes an important cornerstone. In this work, we present a graphical formalism based on tensor networks to capture the logical action and error-correcting capabilities of any Clifford circuit with Pauli measurements. We showcase the functioning of the formalism on new Floquet codes derived from topological subsystem codes, which we call XYZ . Based on the projective symmetries of the building blocks of the tensor network we develop a framework of . Pauli flows allow for a graphical understanding of all quantities entering an error-correction analysis of a circuit, including different types of QEC experiments, such as memory and stability experiments. We lay out how to derive a well-defined decoding problem from the tensor-network representation of a protocol and its Pauli flows alone, independent of any stabilizer code or fixed circuit. Importantly, this framework applies to all Clifford protocols and encompasses both measurement-based and circuit-based approaches to fault tolerance. We apply our method to our new family of dynamical codes, which are in the same topological phase as the 2 + 1 -dimensional color code, making them a promising candidate for low-overhead logical gates. In contrast to its static counterpart, the dynamical protocol applies a Z 3 automorphism to the logical Pauli group every three time steps. We highlight some of its topological properties and comment on the anyon physics behind a planar layout. Lastly, we benchmark the performance of the XYZ ruby code on a torus by performing both memory and stability experiments and find competitive circuit-level noise thresholds of approximately equal to 0.18 % , comparable with other Floquet codes and 2 + 1 -dimensional color codes.
- Open Access
- 17 July 2024
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 9 (4) , 045012
Lift-connected surface codes
We use the recently introduced lifted product to construct a family of quantum low density parity check codes (QLDPC codes). The codes we obtain can be viewed as stacks of surface codes that are interconnected, leading to the name lift-connected surface (LCS) codes. LCS codes offer a wide range of parameters—a particularly striking feature is that they show interesting properties that are favorable compared to the standard surface code. For example, already at moderate numbers of physical qubits in the order of tens, LCS codes of equal size have lower logical error rate or similarly, require fewer qubits for a fixed target logical error rate. We present and analyze the construction and provide numerical simulation results for the logical error rate under code capacity and phenomenological noise. These results show that LCS codes attain thresholds that are comparable to corresponding (non-connected) copies of surface codes, while the logical error rate can be orders of magnitude lower, even for representatives with the same parameters. This provides a code family showing the potential of modern product constructions at already small qubit numbers. Their amenability to 3D-local connectivity renders them particularly relevant for near-term implementations.
- 17 July 2024
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 9 (4) , 045012
Open AccessLift-connected surface codes
We use the recently introduced lifted product to construct a family of quantum low density parity check codes (QLDPC codes). The codes we obtain can be viewed as stacks of surface codes that are interconnected, leading to the name lift-connected surface (LCS) codes. LCS codes offer a wide range of parameters—a particularly striking feature is that they show interesting properties that are favorable compared to the standard surface code. For example, already at moderate numbers of physical qubits in the order of tens, LCS codes of equal size have lower logical error rate or similarly, require fewer qubits for a fixed target logical error rate. We present and analyze the construction and provide numerical simulation results for the logical error rate under code capacity and phenomenological noise. These results show that LCS codes attain thresholds that are comparable to corresponding (non-connected) copies of surface codes, while the logical error rate can be orders of magnitude lower, even for representatives with the same parameters. This provides a code family showing the potential of modern product constructions at already small qubit numbers. Their amenability to 3D-local connectivity renders them particularly relevant for near-term implementations.