arXiv subjects

Markus Müller

Publications and source records attributed to Markus Müller.

At least 55 records · Page 3Linked to original sources

arXiv2025

Bosonic Quantum Error Correction with Neutral Atoms in Optical Dipole Traps

Bosonic quantum error correction codes encode logical qubits in the Hilbert space of one or multiple harmonic oscillators. A prominent class of bosonic codes is that of Gottesman-Kitaev-Preskill (GKP) codes of which implementations have been demonstrated with trapped ions and microwave cavities. In this paper, we investigate theoretically the preparation and error correction of a GKP qubit in a vibrational mode of a neutral atom stored in an optical dipole trap. This platform has recently shown remarkable progress in simultaneously controlling the motional and electronic degrees of freedom of trapped atoms. The protocols we develop make use of motional states and, additionally, internal electronic states of the trapped atom to serve as an ancilla qubit. We compare optical tweezer arrays and optical lattices and find that the latter provide more flexible control over the confinement in the out-of-plane direction, which can be utilized to optimize the conditions for the implementation of GKP codes. Concretely, the different frequency scales that the harmonic oscillators in the axial and radial lattice directions exhibit and a small oscillator anharmonicity prove to be beneficial for robust encodings of GKP states. Finally, we underpin the experimental feasibility of the proposed protocols by numerically simulating the preparation of GKP qubits in an optical lattice with realistic parameters.

quant-ph↗

arXiv2025

Experimentally Informed Decoding of Stabilizer Codes Based on Syndrome Correlations

High-fidelity decoding of quantum error correction codes relies on an accurate experimental model of the physical errors occurring in the device. Because error probabilities can depend on the context of the applied operations, the error model is ideally calibrated using the same circuit as is used for the error correction experiment. Here, we present an experimental approach guided by a novel analytical formula to characterize the probability of independent errors using correlations in the syndrome data generated by executing the error correction circuit. Using the method on a distance-three surface code, we analyze error channels that flip an arbitrary number of syndrome elements, including Pauli Y errors, hook errors, multi-qubit errors, and leakage, in addition to standard Pauli X and Z errors. We use the method to find the optimal weights for a minimum-weight perfect matching decoder without relying on a theoretical error model. Additionally, we investigate whether improved knowledge of the Pauli Y error channel, based on correlating the X- and Z-type error syndromes, can be exploited to enhance matching decoding. Furthermore, we find correlated errors that flip many syndrome elements over up-to-eight cycles, potentially caused by leakage of the data qubits out of the computational subspace. The presented method provides the tools for accurately calibrating a broad family of decoders, beyond the minimum-weight perfect matching decoder, without relying on prior knowledge of the error model.

quant-ph↗

arXiv2025

Deterministic Fault-Tolerant State Preparation for Near-Term Quantum Error Correction: Automatic Synthesis Using Boolean Satisfiability

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 structure to be fault-tolerant. Compilation of fault-tolerant quantum circuits is thus inherently different from the non-fault-tolerant case. However, automated fault-tolerant compilation methods are widely underexplored, and most known constructions are obtained manually for specific codes only. In this work, we focus on the problem of automatically synthesizing fault-tolerant circuits for the deterministic initialization of an encoded state for a broad class of quantum codes that are realizable on current and near-term hardware. To this end, we utilize methods based on techniques from classical circuit design, such as satisfiability solving, resulting in tools for the synthesis of (optimal) fault-tolerant state preparation circuits for near-term quantum codes. We demonstrate the correct fault-tolerant behavior of the synthesized circuits using circuit-level noise simulations. We provide all routines as open-source software as part of the Munich Quantum Toolkit (MQT) at https://github.com/cda-tum/mqt-qecc.

quant-ph↗

arXiv2025

Realizing Lattice Surgery on Two Distance-Three Repetition Codes with Superconducting Qubits

Quantum error correction is needed for quantum computers to be capable of fault-tolerantly executing algorithms using hundreds of logical qubits. Recent experiments have demonstrated subthreshold error rates for state preservation of a single logical qubit. In addition, the realization of universal quantum computation requires the implementation of logical entangling gates. Lattice surgery offers a practical approach for implementing such gates, particularly in planar quantum processor layouts. In this work, we demonstrate lattice surgery between two distance-three repetition-code qubits by splitting a single distance-three surface-code qubit. Using a quantum circuit fault-tolerant to bit-flip errors, we achieve an improvement in the value of the decoded $ZZ$ logical two-qubit observable compared to a similar non-encoded circuit. By preparing the surface-code qubit in initial states parametrized by a varying polar angle, we evaluate the performance of the lattice surgery operation for non-cardinal states on the logical Bloch sphere and employ logical two-qubit tomography to reconstruct the Pauli transfer matrix of the operation. In this way, we demonstrate the functional building blocks needed for lattice surgery operations on larger-distance codes based on superconducting circuits.

quant-ph↗

arXiv2024

Optimized measurement-free and fault-tolerant quantum error correction for neutral atoms

A major challenge in performing quantum error correction (QEC) is implementing reliable measurements and conditional feed-forward operations. In quantum computing platforms supporting unconditional qubit resets, or a constant supply of fresh qubits, alternative schemes which do not require measurements are possible. In such schemes, the error correction is realized via crafted coherent quantum feedback. We propose implementations of small measurement-free QEC schemes, which are fault-tolerant to circuit-level noise. These implementations are guided by several heuristics to achieve fault-tolerance: redundant syndrome information is extracted, and additional single-shot flag qubits are used. By carefully designing the circuit, the additional overhead of these measurement-free schemes is moderate compared to their conventional measurement-and-feed-forward counterparts. We highlight how this alternative approach paves the way towards implementing resource-efficient measurement-free QEC on neutral-atom arrays.

quant-ph↗

arXiv2024

Two-qubit gate protocols with microwave-dressed Rydberg ions in a linear Paul trap

Ultracold trapped atomic ions excited into highly energetic Rydberg states constitute a promising platform for scalable quantum information processing. Elementary building blocks for such tasks are high-fidelity and sufficiently fast entangling two-qubit gates, which can be achieved via strong dipole-dipole interactions between microwave-dressed Rydberg ions, as recently demonstrated in a breakthrough experiment at https://www.nature.com/articles/s41586-020-2152-9 . We theoretically investigate the performance of three protocols leading to controlled-phase gate operations. Starting from a microscopic description of Rydberg ions in a linear Paul trap, we derive an effective Hamiltonian that faithfully captures the essential dynamics underlying the gate protocols. We then use an optimization scheme to fine-tune experimentally controllable parameters like laser detuning and Rabi frequency to yield maximal gate fidelity under each studied protocol. We show how non-adiabatic transitions resulting from fast laser driving relative to the characteristic time scales of the system detrimentally affect the fidelity. Despite this, we demonstrate that in the realistic scenario of Rydberg ions with finite radiative lifetimes, optimizing the best found gate protocol enables achievement of fidelities as high as $99.25\,\%$ for a gate time of $0.2\,μ\mathrm{s}$. This considerably undercuts entangling gate durations between ground-state ions, for which gate times are typically limited by the comparably slower time scales of vibrational modes. Overall, this places trapped Rydberg ions into the regime where fast high-accuracy quantum computing and eventually quantum error correction become possible.

quant-ph↗

arXiv2024

The random coupled-plaquette gauge model and the surface code under circuit-level noise

We map the decoding problem of the surface code under depolarizing and syndrome noise to a disordered spin model, which we call the random coupled-plaquette gauge model (RCPGM). By coupling X- and Z-syndrome volumes, this model allows us to optimally account for genuine Y-errors in the surface code in a setting with noisy measurements. Using Parallel Tempering Monte Carlo simulations, we determine the code's fundamental error threshold. Firstly, for the phenomenological noise setting we determine a threshold of $6\%$ under uniform depolarizing and syndrome noise. This is a substantial improvement compared to results obtained via the previously known "uncoupled" random plaquette gauge model (RPGM) in the identical setting, where marginalizing Y-errors leads to a threshold of $4.3\%$. Secondly, we tackle the circuit-level noise scenario, where we use a reduction technique to find effective asymmetric depolarizing and syndrome noise rates to feed into the RCPGM mapping. Despite this reduction technique breaking up some of the correlations contained in the intricacies of circuit-level noise, we find an improvement exceeding that for the phenomenological case. We report a threshold of up to $1.4\%$, to be compared to $0.7\%$ under the identical noise model when marginalizing the Y-errors and mapping to the anisotropic RPGM. These results enlarge the landscape of statistical mechanical mappings for quantum error correction. In particular they provide an underpinning for the broadly held belief that accounting for Y-errors is a major bottleneck in improving surface code decoders. This is highly encouraging for leading efficient practical decoder development, where heuristically accounting for Y-error correlations has seen recent developments such as belief-matching. This suggests that there is further room for improvement of the surface code for fault-tolerant quantum computation.

quant-ph↗

arXiv2024

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.

quant-ph↗

arXiv2024

Enhanced quantum sensitivity and coherence of symmetric magnetic clusters

The search for highly coherent degrees of freedom in noisy solid-state environments is a major challenge in condensed matter. In disordered dipolar systems, such as magnetically doped insulators, compact clusters of two-level systems (TLS) have recently been shown to have significantly longer coherence times than typical single TLS. Coupling weakly to their environment, they sense and probe its many-body dynamics through the induced dephasing. However, it has remained an open question whether further mechanisms exist that protect the coherence of such solid-state qubits. Here we show that symmetric clusters of few TLS couple even more weakly to their surroundings, making them highly sensitive quantum sensors of slow many-body dynamics. Furthermore, we explore their use as qubits for quantum information storage, detailing the techniques required for their preparation and manipulation. Our findings elucidate the role of symmetry in enhancing quantum coherence in disordered and noisy systems, opening a route toward a sensitive experimental probe of many-body quasi-localization dynamics as well as the development of quantum technologies in solid-state systems.

quant-ph↗

arXiv2024

Semiclassical origin of suppressed quantum chaos in Rydberg chains

The surprisingly long-lasting oscillations observed in the dynamics of highly excited states of chains of Rydberg atoms defy the expectation that interacting systems should thermalize fast. The phenomenon is reminiscent of wavepackets in quantum billiards that trace classical periodic orbits. While analogs of the associated scarred eigenfunctions have been found for Rydberg chains, an underlying classical limit hosting periodic orbits has remained elusive. Here we generalize the Rydberg (pseudospin $S=1/2$) system to a chain of arbitrary spin $S$. Its classical limit features unexpectedly stable periodic orbits that are essential to understand the emergence of robust, parametrically suppressed quantum chaoticity, with semi-classical coherence times diverging as $\sqrt{S}$. The classical limit successfully explains several empirical features of the quantum limit.

quant-ph↗

arXiv2024

Measurement-free, scalable and fault-tolerant universal quantum computing

Reliable execution of large-scale quantum algorithms requires robust underlying operations and this challenge is addressed by quantum error correction (QEC). Most modern QEC protocols rely on measurements and feed-forward operations, which are experimentally demanding, and often slow and prone to high error rates. Additionally, no single error-correcting code intrinsically supports the full set of logical operations required for universal quantum computing, resulting in an increased operational overhead. In this work, we present a complete toolbox for fault-tolerant universal quantum computing without the need for measurements during algorithm execution by combining the strategies of code switching and concatenation. To this end, we develop new fault-tolerant, measurement-free protocols to transfer encoded information between 2D and 3D color codes, which offer complementary and in combination universal sets of robust logical gates. We identify experimentally realistic regimes where these protocols surpass state-of-the-art measurement-based approaches. Moreover, we extend the scheme to higher-distance codes by concatenating the 2D color code with itself and by integrating code switching for operations that lack a natively fault-tolerant implementation. Our measurement-free approach thereby provides a practical and scalable pathway for universal quantum computing on state-of-the-art quantum processors.

quant-ph↗

arXiv2024

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.

quant-ph↗

arXiv2024

Noise-aware variational eigensolvers: a dissipative route for lattice gauge theories

We propose a novel variational ansatz for the ground-state preparation of the $\mathbb{Z}_2$ lattice gauge theory (LGT) in quantum simulators. It combines dissipative and unitary operations in a completely deterministic scheme with a circuit depth that does not scale with the size of the considered lattice. We find that, with very few variational parameters, the ansatz can achieve $>\!99\%$ precision in energy in both the confined and deconfined phase of the $\mathbb{Z}_2$ LGT. We benchmark our proposal against the unitary Hamiltonian variational ansatz showing a reduction in the required number of variational layers to achieve a target precision. After performing a finite-size scaling analysis, we show that our dissipative variational ansatz can predict accurate critical exponents without requiring a number of layers that scale with the system size, which is the standard situation for unitary ansätze. Furthermore, we investigate the performance of this variational eigensolver subject to circuit-level noise, determining variational error thresholds that fix the error rate below which it would be beneficial to increase the number of layers. In light of these quantities and for typical gate errors $p$ in current quantum processors, we provide a detailed assessment of the prospects of our scheme to explore the $\mathbb{Z}_2$ LGT on near-term devices.

quant-ph↗

arXiv2024

Exact numerical solution of the fully-connected classical and quantum Heisenberg spin glass

We present the mean field solution of the quantum and classical Heisenberg spin glasses, using the combination of a high precision numerical solution of the Parisi full replica symmetry breaking equations and a continuous time Quantum Monte Carlo. We characterize the spin glass order and its low-energy excitations down to zero temperature. The Heisenberg spin glass has a rougher energy landscape than its Ising analogue, and exhibits a very slow temperature evolution of its dynamical properties. We extend our analysis to the doped, metallic Heisenberg spin glass, which displays an unexpectedly slow spin dynamics reflecting the proximity to the melting quantum critical point and its associated Sachdev-Ye-Kitaev Planckian dynamics.

cond-mat.dis-nn↗

arXiv2024

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, sub-optimal 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 accordance with threshold values reported in the literature. Our findings establish the coherent information as a reliable competitive practical tool for the calculation of optimal thresholds of state-of-the-art QEC codes under realistic noise models.

quant-ph↗

arXiv2024

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 (QEC) but also fault-tolerant 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 fault-tolerant quantum circuit with flag-based protocols, especially when we consider hardware constraints, such as qubit connectivity and available gate set. In this work, we propose and explore reinforcement learning (RL) to automatically discover compact and hardware-adapted fault-tolerant quantum circuits. We show that in the task of fault-tolerant logical state preparation, RL discovers circuits with fewer gates and ancillary qubits than published results without and with hardware constraints of up to 15 physical qubits. Furthermore, RL allows for straightforward exploration of different qubit connectivities and the use of transfer learning to accelerate the discovery. More generally, our work opens the door towards the use of RL for the discovery of fault-tolerant quantum circuits for addressing tasks beyond state preparation, including magic state preparation, logical gate synthesis, or syndrome measurement.

quant-ph↗

arXiv2024

Computational Capabilities and Compiler Development for Neutral Atom Quantum Processors: Connecting Tool Developers and Hardware Experts

Neutral Atom Quantum Computing (NAQC) emerges as a promising hardware platform primarily due to its long coherence times and scalability. Additionally, NAQC offers computational advantages encompassing potential long-range connectivity, native multi-qubit gate support, and the ability to physically rearrange qubits with high fidelity. However, for the successful operation of a NAQC processor, one additionally requires new software tools to translate high-level algorithmic descriptions into a hardware executable representation, taking maximal advantage of the hardware capabilities. Realizing new software tools requires a close connection between tool developers and hardware experts to ensure that the corresponding software tools obey the corresponding physical constraints. This work aims to provide a basis to establish this connection by investigating the broad spectrum of capabilities intrinsic to the NAQC platform and its implications on the compilation process. To this end, we first review the physical background of NAQC and derive how it affects the overall compilation process by formulating suitable constraints and figures of merit. We then provide a summary of the compilation process and discuss currently available software tools in this overview. Finally, we present selected case studies and employ the discussed figures of merit to evaluate the different capabilities of NAQC and compare them between two hardware setups.

quant-ph↗

arXiv2024

Experimental fault-tolerant code switching

Quantum error correction is a crucial tool for mitigating hardware errors in quantum computers by encoding logical information into multiple physical qubits. However, no single error-correcting code allows for an intrinsically fault-tolerant implementation of all the gates needed for universal quantum computing [1-3]. One way to tackle this problem is to switch between two suitable error-correcting codes, while preserving the encoded logical information, which in combination give access to a fault-tolerant universal gate set [4-6]. In this work, we present the first experimental implementation of fault-tolerant code switching between two codes. One is the seven-qubit color code [7], which features fault-tolerant CNOT and $H$ quantum gates, while the other one, the 10-qubit code [8], allows for a fault-tolerant $T$-gate implementation. Together they form a complementary universal gate set. Building on essential code switching building blocks, we construct logical circuits and prepare 12 different logical states which are not accessible natively in a fault-tolerant way within a single code. Finally, we use code switching to entangle two logical qubits employing the full universal gate set in a single logical quantum circuit. Our results experimentally open up a new route towards deterministic control over logical qubits with low auxiliary qubit overhead, not relying on the probabilistic preparation of resource states.

quant-ph↗