Luis Colmenarez
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
Luis Colmenarez has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
Markus Müller
Institute for Theoretical Nanoelectronics (PGI-2), Forschungszentrum Jülich, Jülich, Germany
6 shared publications- David J. Luitz
University of Bonn
5 shared publications Florian Marquardt
Max Planck Institute for the Science of Light, Erlangen, Germany
3 shared publicationsJan Olle
Max Planck Institute for the Science of Light, Erlangen, Germany
3 shared publicationsAlejandro López
Centro de Física, Instituto Venezolano de Investigaciones Científicas (IVIC), Apartado 21827, Caracas 1020 A, Venezuela
2 shared publications- David J. Luitz
Institute of Physics, University of Bonn, Nußallee 12, 53115 Bonn, Germany
2 shared publications
Latest Publications
- Open Access
- 1 October 2026
- Published by Springer Nature in npj Quantum Information
- Vol. 12 (1) , 159
Unitary fault-tolerant encoding of Pauli states in surface codes
- 1 October 2026
- Published by Springer Nature in npj Quantum Information
- Vol. 12 (1) , 159
Open AccessUnitary fault-tolerant encoding of Pauli states in surface codes
- Open Access
Unitary fault-tolerant encoding of Pauli states in surface codes
In fault-tolerant quantum computation, the preparation of logical states is a ubiquitous subroutine, yet significant challenges persist even for the simplest states required. In the present work, we present a unitary, scalable, distance-preserving encoding scheme for preparing Pauli eigenstates in surface codes. Unlike previous unitary approaches whose fault-distance remains constant with increasing code distance, our scheme ensures that the protection offered by the code is preserved during state preparation. Building on strategies discovered by reinforcement learning for the surface-17 code, we generalize the construction to arbitrary code distances and both rotated and unrotated surface codes. The proposed encoding relies only on geometrically local gates, and is therefore fully compatible with planar 2D qubit connectivity, and it achieves circuit depth scaling as $\mathcal{O}(d)$, consistent with fundamental entanglement-generation bounds. We design explicit stabilizer-expanding circuits with and without ancilla-mediated connectivity and analyze their error-propagation behavior. Numerical simulations under depolarizing noise show that our unitary encoding without ancillas outperforms standard stabilizer-measurement-based schemes, reducing logical error rates by up to an order of magnitude. These results make the scheme particularly relevant for platforms such as trapped ions and neutral atoms, where measurements are costly relative to gates and idling noise is considerably weaker than gate noise. Our work bridges the gap between measurement-based and unitary encodings of surface-code states and opens new directions for distance-preserving state preparation in fault-tolerant quantum computation.Open AccessUnitary fault-tolerant encoding of Pauli states in surface codes
In fault-tolerant quantum computation, the preparation of logical states is a ubiquitous subroutine, yet significant challenges persist even for the simplest states required. In the present work, we present a unitary, scalable, distance-preserving encoding scheme for preparing Pauli eigenstates in surface codes. Unlike previous unitary approaches whose fault-distance remains constant with increasing code distance, our scheme ensures that the protection offered by the code is preserved during state preparation. Building on strategies discovered by reinforcement learning for the surface-17 code, we generalize the construction to arbitrary code distances and both rotated and unrotated surface codes. The proposed encoding relies only on geometrically local gates, and is therefore fully compatible with planar 2D qubit connectivity, and it achieves circuit depth scaling as $\mathcal{O}(d)$, consistent with fundamental entanglement-generation bounds. We design explicit stabilizer-expanding circuits with and without ancilla-mediated connectivity and analyze their error-propagation behavior. Numerical simulations under depolarizing noise show that our unitary encoding without ancillas outperforms standard stabilizer-measurement-based schemes, reducing logical error rates by up to an order of magnitude. These results make the scheme particularly relevant for platforms such as trapped ions and neutral atoms, where measurements are costly relative to gates and idling noise is considerably weaker than gate noise. Our work bridges the gap between measurement-based and unitary encodings of surface-code states and opens new directions for distance-preserving state preparation in fault-tolerant quantum computation. - Open Access
- 7 November 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (4) , 040327
Fundamental Thresholds for Computational and Erasure Errors via the Coherent Information
Quantum error correcting (QEC) codes protect quantum information against environmental noise. Computational errors caused by the environment change the quantum state within the qubit subspace, whereas quantum erasures correspond to the loss of qubits at known positions. Correcting either type of error involves different correction mechanisms, which makes studying the interplay between erasure and computational errors particularly challenging. In this work, we propose a framework based on the coherent information (CI) of the mixed-state density operator associated to noisy QEC codes, for treating both types of errors together. We show how to rigorously derive different families of statistical mechanics mappings for generic stabilizer QEC codes in the presence of both types of errors. We observe that the erasure errors enter as a classical average over fully depolarizing channels. Further, we show that computing the CI for erasure errors only can be done efficiently upon sampling over erasure configurations. We then test our approach on the two-dimensional toric and color codes and compute optimal thresholds for erasure errors only, finding a 50 % threshold for both codes. This strengthens the notion that both codes share the same optimal thresholds. When considering both computational and erasure errors, the CI of small-size codes yields thresholds in very accurate agreement with established results that have been obtained in the thermodynamic limit. Next, we perform a similar analysis for a low-density parity-check (LDPC) code—the lift-connected surface code. We find a 50 % threshold under erasure errors alone and, for the first time, derive the exact statistical mechanics mappings in the presence of both computational and erasure errors. We thereby further establish the CI as a practical tool for studying optimal thresholds for code classes beyond topological codes under realistic noise, and as a means for uncovering new relations between QEC codes and statistical physics models.
- 7 November 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (4) , 040327
Open AccessFundamental Thresholds for Computational and Erasure Errors via the Coherent Information
Quantum error correcting (QEC) codes protect quantum information against environmental noise. Computational errors caused by the environment change the quantum state within the qubit subspace, whereas quantum erasures correspond to the loss of qubits at known positions. Correcting either type of error involves different correction mechanisms, which makes studying the interplay between erasure and computational errors particularly challenging. In this work, we propose a framework based on the coherent information (CI) of the mixed-state density operator associated to noisy QEC codes, for treating both types of errors together. We show how to rigorously derive different families of statistical mechanics mappings for generic stabilizer QEC codes in the presence of both types of errors. We observe that the erasure errors enter as a classical average over fully depolarizing channels. Further, we show that computing the CI for erasure errors only can be done efficiently upon sampling over erasure configurations. We then test our approach on the two-dimensional toric and color codes and compute optimal thresholds for erasure errors only, finding a 50 % threshold for both codes. This strengthens the notion that both codes share the same optimal thresholds. When considering both computational and erasure errors, the CI of small-size codes yields thresholds in very accurate agreement with established results that have been obtained in the thermodynamic limit. Next, we perform a similar analysis for a low-density parity-check (LDPC) code—the lift-connected surface code. We find a 50 % threshold under erasure errors alone and, for the first time, derive the exact statistical mechanics mappings in the presence of both computational and erasure errors. We thereby further establish the CI as a practical tool for studying optimal thresholds for code classes beyond topological codes under realistic noise, and as a means for uncovering new relations between QEC codes and statistical physics models.
- Top Cited PapersOpen Access
- 22 October 2025
- Published by American Physical Society (APS) in Physical Review X
- Vol. 15 (4)
Quantum Circuit Discovery for Fault-Tolerant Logical State Preparation with Reinforcement Learning
The realization of large-scale quantum computers requires not only quantum error correction but also fault-tolerant (FT) operations to handle errors that propagate into harmful errors. Recently, flag-based protocols have been introduced that use ancillary qubits to flag harmful errors. However, there is no clear recipe for finding a FT quantum circuit with flag-based protocols, especially when we consider hardware constraints, such as the qubit connectivity and available gate set. This work presents a novel approach to automatically discover compact and hardware-adapted FT quantum circuits to make significant progress towards scalable FT quantum computing. We employ reinforcement learning (RL) as an enabling tool, leveraging a fast, parallelized stabilizer quantum circuit simulator and a nontrivial reward function specifically adapted to the problem. We show that, in the task of FT logical state preparation, RL discovers not only circuits with fewer gates and ancillary qubits than published results but also novel circuits without and with hardware constraints of up to distance-5 codes with 25 physical qubits, and they can be implemented directly in experiments. Furthermore, RL allows for straightforward exploration of different qubit connectivities and the use of transfer learning to accelerate the discovery. More generally, our work sets the framework towards the use of RL or other machine learning techniques for FT quantum circuit discovery with hardware constraints to make real progress towards the realization of large-scale quantum computers, addressing tasks beyond state preparation, including magic state preparation, logical gate synthesis, and syndrome measurement.
- 22 October 2025
- Published by American Physical Society (APS) in Physical Review X
- Vol. 15 (4)
Top Cited PapersOpen AccessQuantum Circuit Discovery for Fault-Tolerant Logical State Preparation with Reinforcement Learning
The realization of large-scale quantum computers requires not only quantum error correction but also fault-tolerant (FT) operations to handle errors that propagate into harmful errors. Recently, flag-based protocols have been introduced that use ancillary qubits to flag harmful errors. However, there is no clear recipe for finding a FT quantum circuit with flag-based protocols, especially when we consider hardware constraints, such as the qubit connectivity and available gate set. This work presents a novel approach to automatically discover compact and hardware-adapted FT quantum circuits to make significant progress towards scalable FT quantum computing. We employ reinforcement learning (RL) as an enabling tool, leveraging a fast, parallelized stabilizer quantum circuit simulator and a nontrivial reward function specifically adapted to the problem. We show that, in the task of FT logical state preparation, RL discovers not only circuits with fewer gates and ancillary qubits than published results but also novel circuits without and with hardware constraints of up to distance-5 codes with 25 physical qubits, and they can be implemented directly in experiments. Furthermore, RL allows for straightforward exploration of different qubit connectivities and the use of transfer learning to accelerate the discovery. More generally, our work sets the framework towards the use of RL or other machine learning techniques for FT quantum circuit discovery with hardware constraints to make real progress towards the realization of large-scale quantum computers, addressing tasks beyond state preparation, including magic state preparation, logical gate synthesis, and syndrome measurement.
- Open Access
- 1 October 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (4)
Coherent information as a mixed-state topological order parameter of fermions
Quantum error correction protects quantum information against decoherence, provided the noise strength remains below a critical threshold. This threshold marks the critical point for the decoding phase transition. Here, we connect this transition in the toric code to a topological phase transition in disordered Majorana fermions at high temperatures. A quantum memory in the error-correctable phase is captured by the presence of a Majorana zero mode, trapped in vortex defects associated with twisted boundary conditions. These results are established by expressing the coherent information, which measures the amount of recoverable quantum information in a given noisy code, in terms of a mixed-state topological order parameter of fermions. Our work hints at a broader connection of the robustness of quantum information in stabilizer codes and mixed-state topological phase transitions in symmetry-protected fermion matter.
- 1 October 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (4)
Open AccessCoherent information as a mixed-state topological order parameter of fermions
Quantum error correction protects quantum information against decoherence, provided the noise strength remains below a critical threshold. This threshold marks the critical point for the decoding phase transition. Here, we connect this transition in the toric code to a topological phase transition in disordered Majorana fermions at high temperatures. A quantum memory in the error-correctable phase is captured by the presence of a Majorana zero mode, trapped in vortex defects associated with twisted boundary conditions. These results are established by expressing the coherent information, which measures the amount of recoverable quantum information in a given noisy code, in terms of a mixed-state topological order parameter of fermions. Our work hints at a broader connection of the robustness of quantum information in stabilizer codes and mixed-state topological phase transitions in symmetry-protected fermion matter.
- Open Access
- 10 September 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (3)
Lattice surgery-based logical state teleportation via noisy links
For planar architectures, surface code-based quantum error correction is one of the most promising approaches to fault-tolerant quantum computation. This is partially due to the variety of fault-tolerant logical protocols that can be implemented in two dimensions using local operations. One such protocol is the lattice surgery-based logical state teleportation, which transfers a logical quantum state from an initial location on a quantum chip to a target location through a linking region of qubits. This protocol serves as a basis for higher-level routines, such as the entangling cnot gate or magic state injection. In this work, we investigate the correctability phase diagram of this protocol for distinct error rates inside the surface code patches and within the linking region. We adopt techniques from statistical physics to describe the numerically observed crossover regime between correctable and uncorrectable quantum error correction phases, where the correctability depends on the separation between the initial and target locations. We find that inside the crossover regime the correctability-threshold lines decay as a power law with increasing separation, which we explain accurately using a finite-size scaling analysis. Our results indicate that the logical state teleportation protocol can tolerate much higher noise rates in the linking region compared to the bulk of the surface code patches, provided the separation between the positions is relatively small.
- 10 September 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (3)
Open AccessLattice surgery-based logical state teleportation via noisy links
For planar architectures, surface code-based quantum error correction is one of the most promising approaches to fault-tolerant quantum computation. This is partially due to the variety of fault-tolerant logical protocols that can be implemented in two dimensions using local operations. One such protocol is the lattice surgery-based logical state teleportation, which transfers a logical quantum state from an initial location on a quantum chip to a target location through a linking region of qubits. This protocol serves as a basis for higher-level routines, such as the entangling cnot gate or magic state injection. In this work, we investigate the correctability phase diagram of this protocol for distinct error rates inside the surface code patches and within the linking region. We adopt techniques from statistical physics to describe the numerically observed crossover regime between correctable and uncorrectable quantum error correction phases, where the correctability depends on the separation between the initial and target locations. We find that inside the crossover regime the correctability-threshold lines decay as a power law with increasing separation, which we explain accurately using a finite-size scaling analysis. Our results indicate that the logical state teleportation protocol can tolerate much higher noise rates in the linking region compared to the bulk of the surface code patches, provided the separation between the positions is relatively small.
- Open Access
- 15 October 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (4)
Accurate optimal quantum error correction thresholds from coherent information
Quantum error correcting (QEC) codes protect quantum information from decoherence as long as error rates fall below critical error thresholds. In general, obtaining thresholds implies simulating the QEC procedure using, in general, suboptimal decoding strategies. In a few cases and for sufficiently simple noise models, optimal decoding of QEC codes can be framed as a phase transition in disordered classical spin models. In both situations, accurate estimation of thresholds demands intensive computational resources. Here we use the coherent information of the mixed state of noisy QEC codes to accurately estimate the associated optimal QEC thresholds already from small-distance codes at moderate computational cost. We show the effectiveness and versatility of our method by applying it first to the topological surface and color code under bit-flip and depolarizing noise. We then extend the coherent information based methodology to phenomenological and quantum circuit level noise settings. For all examples considered, we obtain highly accurate estimates of optimal error thresholds from small, low-distance instances of the codes, in close agreement with threshold values reported in the literature. Our findings establish the coherent information as a reliable competitive tool for the calculation of optimal thresholds of state-of-the-art QEC codes under realistic noise models. Published by the American Physical Society 2024
- 15 October 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (4)
Open AccessAccurate optimal quantum error correction thresholds from coherent information
Quantum error correcting (QEC) codes protect quantum information from decoherence as long as error rates fall below critical error thresholds. In general, obtaining thresholds implies simulating the QEC procedure using, in general, suboptimal decoding strategies. In a few cases and for sufficiently simple noise models, optimal decoding of QEC codes can be framed as a phase transition in disordered classical spin models. In both situations, accurate estimation of thresholds demands intensive computational resources. Here we use the coherent information of the mixed state of noisy QEC codes to accurately estimate the associated optimal QEC thresholds already from small-distance codes at moderate computational cost. We show the effectiveness and versatility of our method by applying it first to the topological surface and color code under bit-flip and depolarizing noise. We then extend the coherent information based methodology to phenomenological and quantum circuit level noise settings. For all examples considered, we obtain highly accurate estimates of optimal error thresholds from small, low-distance instances of the codes, in close agreement with threshold values reported in the literature. Our findings establish the coherent information as a reliable competitive tool for the calculation of optimal thresholds of state-of-the-art QEC codes under realistic noise models. Published by the American Physical Society 2024
- Open Access
Localization and integrability breaking in weakly interacting Floquet circuits
We present a family of Floquet circuits that can interpolate between non-interacting qubits, free propagation, generic interacting, and dual-unitary dynamics. We identify the operator entanglement entropy of the two-qubit gate as a good quantitative measure of the interaction strength. We test the persistence of localization in the vicinity of the non-interacting point by probing spectral statistics, decay of autocorrelators, and measuring entanglement growth. The finite-size analysis suggests that the many-body localized regime does not persist in the thermodynamic limit. Instead, our results are compatible with an integrability-breaking phenomenon.
Open AccessLocalization and integrability breaking in weakly interacting Floquet circuits
We present a family of Floquet circuits that can interpolate between non-interacting qubits, free propagation, generic interacting, and dual-unitary dynamics. We identify the operator entanglement entropy of the two-qubit gate as a good quantitative measure of the interaction strength. We test the persistence of localization in the vicinity of the non-interacting point by probing spectral statistics, decay of autocorrelators, and measuring entanglement growth. The finite-size analysis suggests that the many-body localized regime does not persist in the thermodynamic limit. Instead, our results are compatible with an integrability-breaking phenomenon.
- Open Access
- 21 March 2024
- Published by American Physical Society (APS) in Physical Review B
- Vol. 109 (9) , 094207
Absence of localization in weakly interacting Floquet circuits
We present a family of Floquet circuits that can interpolate between noninteracting qubits, free propagation, generic interacting, and dual-unitary dynamics. We identify the operator entanglement entropy of the two-qubit gate as a good quantitative measure of the interaction strength. We test the persistence of localization in the vicinity of the noninteracting point by probing spectral statistics, decay of autocorrelators, and measuring entanglement growth. The finite-size analysis suggests that the many-body localized regime does not persist in the thermodynamic limit. Instead, our results are compatible with an integrability-breaking phenomenon. Published by the American Physical Society 2024
- 21 March 2024
- Published by American Physical Society (APS) in Physical Review B
- Vol. 109 (9) , 094207
Open AccessAbsence of localization in weakly interacting Floquet circuits
We present a family of Floquet circuits that can interpolate between noninteracting qubits, free propagation, generic interacting, and dual-unitary dynamics. We identify the operator entanglement entropy of the two-qubit gate as a good quantitative measure of the interaction strength. We test the persistence of localization in the vicinity of the noninteracting point by probing spectral statistics, decay of autocorrelators, and measuring entanglement growth. The finite-size analysis suggests that the many-body localized regime does not persist in the thermodynamic limit. Instead, our results are compatible with an integrability-breaking phenomenon. Published by the American Physical Society 2024
- Open Access
- 28 February 2024
- Published by American Physical Society (APS) in Physical Review B
- Vol. 109 (8) , L081117
Ergodic inclusions in many-body localized systems
We investigate the effect of ergodic inclusions in putative many-body localized systems. We consider the random field Heisenberg chain, which is many-body localized at strong disorder and we couple it to an ergodic bubble, modeled by a random matrix Hamiltonian. Recent theoretical work suggests that localized systems are unstable to ergodic bubbles, driving the delocalization transition. We tentatively confirm this by numerically analyzing the response of the on-site purities to the insertion of the bubble. For a range of intermediate disorder strengths, this response decays very slowly, or not at all, with increasing distance to the bubble. This suggests that at those disorder strengths, the system is actually delocalized in the thermodynamic limit. However, the signal is quite weak and artefacts in the numerics cannot be ruled out conclusively. Published by the American Physical Society 2024
- 28 February 2024
- Published by American Physical Society (APS) in Physical Review B
- Vol. 109 (8) , L081117
Open AccessErgodic inclusions in many-body localized systems
We investigate the effect of ergodic inclusions in putative many-body localized systems. We consider the random field Heisenberg chain, which is many-body localized at strong disorder and we couple it to an ergodic bubble, modeled by a random matrix Hamiltonian. Recent theoretical work suggests that localized systems are unstable to ergodic bubbles, driving the delocalization transition. We tentatively confirm this by numerically analyzing the response of the on-site purities to the insertion of the bubble. For a range of intermediate disorder strengths, this response decays very slowly, or not at all, with increasing distance to the bubble. This suggests that at those disorder strengths, the system is actually delocalized in the thermodynamic limit. However, the signal is quite weak and artefacts in the numerics cannot be ruled out conclusively. Published by the American Physical Society 2024