Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.04081

Frequency-Multiplexed Parallel Gates for Quantum LDPC Codes in a Two-Dimensional Ion Crystal

G. -X. Tang, L. -M. Duan, Y. -K. Wu

quant-phSubmitted Sep 3, 2026• Announced Sep 4, 2026• 0 citations
v1 · Sep 3, 2026v2 · Sep 9, 2026
arXivHTMLPDF

Abstract

Quantum low-density parity-check (qLDPC) codes admit high encoding rates but require nonlocal entangling gates for syndrome measurement. Instead of physically moving the qubits which slows down with the increasing qubit number, here we propose to achieve parallel nonlocal entangling gates on a two-dimensional (2D) ion crystal using frequency-multiplexing. Adiabatic conditions ensure the suppression of gate infidelity and crosstalk error, as well as their robustness against slow drift in the trap frequency which is a leading error source in ion trap. We consider a numerical example of a $[[248,10,18]]$ bivariate bicycle code on a 2D crystal of 512 ions. By optimizing the mapping of the qubits and the assignment of the frequency bands for multiplexing, we show that a moderate laser power is sufficient for parallelism, and that a logical error rate of $10^{-12}$ can be achieved under realistic noise parameters.

Comments
8 pages, 4 figures

Related papers

Performance analysis for crosstalk errors between parallel entangling gates in trapped-ion quantum error correction

Fangxuan Liu, Gaoxiang Tang, L.-M. Duan +1 more

The ability to execute a large number of quantum gates in parallel is a fundamental requirement for quantum error correction, allowing an error threshold to exist under the finite coherence time of physical qubits. Recently, two-dimensional ion crystals have been demonstrated as a plausible approach to scale up the qubit number in a trapped ion quantum computer. However, although the long-range Coulomb interaction between the ions enables their strong connectivity, it also complicates the design of parallel gates and leads to intrinsic crosstalk errors. Here we examine the effects of crosstalk errors on a rotated surface code. We show that, instead of the distance-3 code considered in previous works, a distance-5 code is necessary to correct the two-qubit crosstalk error. We numerically calculate the logical error rates and coherence times under various crosstalk errors, gate infidelities, and coherence times of the physical qubits, and we optimize the parallelism level according to the competition between different error sources. We show that a break-even point can be reached under realistic parameters. We further analyze the spatial dependence of the crosstalk, and discuss the scaling of the logical error rate versus the code distance for the long-term goal of a logical error rate below 10 − 10 .

arXiv:2501.09554•Physical Review Applied•Jun 27, 2025•2 citations

Distributed Quantum Error Correction with Bivariate Bicycle Codes in a Modular Architecture

Nitish Kumar Chandra, Eneet Kaur, Reza Nejabati +1 more

Quantum low density parity check (qLDPC) codes, particularly bivariate bicycle (BB) codes, achieve competitive fault tolerance thresholds while offering substantially higher encoding rates than planar surface codes. However, their intrinsically long-range stabilizer structure makes them difficult to implement on monolithic devices with nearest neighbor connectivity and limited qubit capacity. In this work, we study the realization of a BB code in a modular multiprocessor architecture, where quantum processors are interconnected through shared Bell pairs. We consider processors with all to all internal connectivity, which is feasible on trapped ion and neutral atom platforms, enabling flexible local gate execution while inter-processor (nonlocal) gates are mediated by shared entanglement. We describe a star network architecture that can realize this distributed setting. We partition the qubits of the [[144,12,12]] BB code across 4, 6, and 12 quantum processors and analyze the resulting logical error rates and pseudo-threshold performance under circuit level noise by varying the number of processors and a scaling factor that captures the additional noise associated with nonlocal operations. We use Monte Carlo simulations with BP+OSD decoding and extend the previously known BB code ansatz to the distributed setting. Our results provide architectural insight and design considerations for distributed BB codes in modular quantum computing architectures.

quant-pharXiv:2605.04663•May 7, 2026•0 citations

Toward a 2D Local Implementation of Quantum Low-Density Parity-Check Codes

Noah Berthusen, Dhruv Devulapalli, Eddie Schoute +4 more

Geometric locality is an important theoretical and practical factor for quantum low-density parity-check (qLDPC) codes that affects code performance and ease of physical realization. For device architectures restricted to two-dimensional (2D) local gates, naively implementing the high-rate codes suitable for low-overhead fault-tolerant quantum computing incurs prohibitive overhead. In this work, we present an error-correction protocol built on a bilayer architecture that aims to reduce operational overheads when restricted to 2D local gates by measuring some generators less frequently than others. We investigate the family of bivariate-bicycle qLDPC codes and show that they are well suited for a parallel syndrome-measurement scheme using fast routing with local operations and classical communication (LOCC). Through circuit-level simulations, we find that in some parameter regimes, bivariate-bicycle codes implemented with this protocol have logical error rates comparable to the surface code while using fewer physical qubits.

arXiv:2404.17676•PRX Quantum•Jan 9, 2025•31 citations

Routing Codes: High-Rate Quantum LDPC Codes with Short, Parallel Non-Local Connectivity

Jiaxuan Zhang, Zhao-Yun Chen, Peng Duan +6 more

Quantum low-density parity-check (qLDPC) codes are promising candidates for realizing large-scale fault-tolerant quantum computing. Although many codes with favorable theoretical parameters have been developed, their practical adoption must take hardware implementability into account. For mainstream quantum platforms such as superconductors and neutral atoms, the connectivity, the length of non-local couplings, and the complexity of wiring or atom rearrangement are key factors that dictate the difficulty of hardware realization. Here, we propose a new family of qLDPC codes, termed routing codes. Within this family, we find explicit instances whose encoding rates are competitive to those of bivariate bicycle (BB) codes, while systematically reducing qubit connectivity, shortening the length of non-local couplings, and, crucially, making all non-local couplings mutually parallel. This parallelism translates into quantifiable benefits, substantially reducing wiring crossings in superconducting multi-layer architectures and simplifying the scheduling of atom movement in neutral-atom arrays. The weight-7 routing codes maintain a high threshold of 0.7\% and reduce the physical qubit overhead by approximately a factor of 8, compared to surface codes achieving a same logical error rate. Further increasing the weight to 11 yields a [[200, 24, 14]] and [[200, 16, 17]] codes with an encoding rate over 23 times that of the surface code, at the cost of a higher logical error rate. These results establish routing codes as a hardware-centric qLDPC family that bridges the gap between theoretical optimality and near-term physical feasibility.

quant-pharXiv:2606.25330•Jun 25, 2026•0 citations

Breakeven demonstration of quantum low-density parity-check codes

Edwin Tham, Michael L. Goldman, Shantanu Debnath +8 more

High-rate quantum low-density parity-check (qLDPC) codes are a leading candidate for fault-tolerant quantum computing. They feature higher encoding rates than planar alternatives such as the surface code, but their implementation often entails significant hardware hurdles like the need for long-range couplers. We leverage the flexibility of a trapped-ion quantum computer to demonstrate nine quantum error-correcting codes with starkly different qubit connectivity requirements on a single device without any hardware reconfiguration. These experiments span three families of quantum error-correcting codes: qLDPC codes, topological codes, and concatenated codes. With a qLDPC code encoding 4 logical qubits into 18 physical qubits, we achieve a logical error rate up to $9\times$ better than a previous demonstration of a similar code on superconducting solid-state qubits. Moreover, our implementation exhibits breakeven performance, with some instances achieving qubit lifetimes comparable to or slightly exceeding that of our trapped-ion qubits. We use a novel implementation of the optical-metastable-ground (OMG) architecture for addressable mid-circuit measurement and reset, which enables us to perform these experiments without any ion transport or dedicated coolant ions, requirements that typically consume a large fraction of the runtime or ion count of trapped-ion quantum computers.

quant-pharXiv:2606.06455•Jun 5, 2026•0 citations

High-quality parallel entangling gates in long mixed-species ion chains

Lin Cheng, Sheng-Chen Liu, Gui-Zhong Yao +3 more

A universal quantum computer is an ultimate pursuit, which should possess the ability to perform entangling gate operations in parallel with high quality in a scalable fashion. However, for a long trapped-ion chain, the simultaneous implementation of two-qubit quantum gates is a challenging task due to the drastic increase of the crosstalk resulting from the collective motional modes. In this paper, by utilizing the structure of the localized motional modes in the long mixed-species ion chain, we propose a highly efficient linear iterative scheme to eliminate the crosstalk within the neighboring pairs. We show that this scheme allows the realization of high-fidelity, low-crosstalk, scalable, parallel two-qubit gates with only a few pulse segments for the long chain. In addition, by considering the practical experimental feasibility, we optimize the laser power and improve the robustness against the random static drifts of the motional frequencies.

Physical Review A•Oct 9, 2023•5 citations
Quantum low-density parity-check (qLDPC) codes admit high encoding rates but require nonlocal entangling gates for syndrome measurement. Instead of physically moving the qubits which slows down with the increasing qubit number, here we propose to achieve parallel nonlocal entangling gates on a two-dimensional (2D) ion crystal using frequency-multiplexing. Adiabatic conditions ensure the suppression of gate infidelity and crosstalk error, as well as their robustness against slow drift in the trap frequency which is a leading error source in ion trap. We consider a numerical example of a [[248,10,18]][[248,10,18]][[248,10,18]] bivariate bicycle code on a 2D crystal of 512 ions. By optimizing the mapping of the qubits and the assignment of the frequency bands for multiplexing, we show that a moderate laser power is sufficient for parallelism, and that a logical error rate of 10−1210^{-12}10−12 can be achieved under realistic noise parameters.
The ability to execute a large number of quantum gates in parallel is a fundamental requirement for quantum error correction, allowing an error threshold to exist under the finite coherence time of physical qubits. Recently, two-dimensional ion crystals have been demonstrated as a plausible approach to scale up the qubit number in a trapped ion quantum computer. However, although the long-range Coulomb interaction between the ions enables their strong connectivity, it also complicates the design of parallel gates and leads to intrinsic crosstalk errors. Here we examine the effects of crosstalk errors on a rotated surface code. We show that, instead of the distance-3 code considered in previous works, a distance-5 code is necessary to correct the two-qubit crosstalk error. We numerically calculate the logical error rates and coherence times under various crosstalk errors, gate infidelities, and coherence times of the physical qubits, and we optimize the parallelism level according to the competition between different error sources. We show that a break-even point can be reached under realistic parameters. We further analyze the spatial dependence of the crosstalk, and discuss the scaling of the logical error rate versus the code distance for the long-term goal of a logical error rate below 10 − 10 .
Quantum low density parity check (qLDPC) codes, particularly bivariate bicycle (BB) codes, achieve competitive fault tolerance thresholds while offering substantially higher encoding rates than planar surface codes. However, their intrinsically long-range stabilizer structure makes them difficult to implement on monolithic devices with nearest neighbor connectivity and limited qubit capacity. In this work, we study the realization of a BB code in a modular multiprocessor architecture, where quantum processors are interconnected through shared Bell pairs. We consider processors with all to all internal connectivity, which is feasible on trapped ion and neutral atom platforms, enabling flexible local gate execution while inter-processor (nonlocal) gates are mediated by shared entanglement. We describe a star network architecture that can realize this distributed setting. We partition the qubits of the [[144,12,12]] BB code across 4, 6, and 12 quantum processors and analyze the resulting logical error rates and pseudo-threshold performance under circuit level noise by varying the number of processors and a scaling factor that captures the additional noise associated with nonlocal operations. We use Monte Carlo simulations with BP+OSD decoding and extend the previously known BB code ansatz to the distributed setting. Our results provide architectural insight and design considerations for distributed BB codes in modular quantum computing architectures.
Geometric locality is an important theoretical and practical factor for quantum low-density parity-check (qLDPC) codes that affects code performance and ease of physical realization. For device architectures restricted to two-dimensional (2D) local gates, naively implementing the high-rate codes suitable for low-overhead fault-tolerant quantum computing incurs prohibitive overhead. In this work, we present an error-correction protocol built on a bilayer architecture that aims to reduce operational overheads when restricted to 2D local gates by measuring some generators less frequently than others. We investigate the family of bivariate-bicycle qLDPC codes and show that they are well suited for a parallel syndrome-measurement scheme using fast routing with local operations and classical communication (LOCC). Through circuit-level simulations, we find that in some parameter regimes, bivariate-bicycle codes implemented with this protocol have logical error rates comparable to the surface code while using fewer physical qubits.
Quantum low-density parity-check (qLDPC) codes are promising candidates for realizing large-scale fault-tolerant quantum computing. Although many codes with favorable theoretical parameters have been developed, their practical adoption must take hardware implementability into account. For mainstream quantum platforms such as superconductors and neutral atoms, the connectivity, the length of non-local couplings, and the complexity of wiring or atom rearrangement are key factors that dictate the difficulty of hardware realization. Here, we propose a new family of qLDPC codes, termed routing codes. Within this family, we find explicit instances whose encoding rates are competitive to those of bivariate bicycle (BB) codes, while systematically reducing qubit connectivity, shortening the length of non-local couplings, and, crucially, making all non-local couplings mutually parallel. This parallelism translates into quantifiable benefits, substantially reducing wiring crossings in superconducting multi-layer architectures and simplifying the scheduling of atom movement in neutral-atom arrays. The weight-7 routing codes maintain a high threshold of 0.7\% and reduce the physical qubit overhead by approximately a factor of 8, compared to surface codes achieving a same logical error rate. Further increasing the weight to 11 yields a [[200, 24, 14]] and [[200, 16, 17]] codes with an encoding rate over 23 times that of the surface code, at the cost of a higher logical error rate. These results establish routing codes as a hardware-centric qLDPC family that bridges the gap between theoretical optimality and near-term physical feasibility.
High-rate quantum low-density parity-check (qLDPC) codes are a leading candidate for fault-tolerant quantum computing. They feature higher encoding rates than planar alternatives such as the surface code, but their implementation often entails significant hardware hurdles like the need for long-range couplers. We leverage the flexibility of a trapped-ion quantum computer to demonstrate nine quantum error-correcting codes with starkly different qubit connectivity requirements on a single device without any hardware reconfiguration. These experiments span three families of quantum error-correcting codes: qLDPC codes, topological codes, and concatenated codes. With a qLDPC code encoding 4 logical qubits into 18 physical qubits, we achieve a logical error rate up to 9×9\times9× better than a previous demonstration of a similar code on superconducting solid-state qubits. Moreover, our implementation exhibits breakeven performance, with some instances achieving qubit lifetimes comparable to or slightly exceeding that of our trapped-ion qubits. We use a novel implementation of the optical-metastable-ground (OMG) architecture for addressable mid-circuit measurement and reset, which enables us to perform these experiments without any ion transport or dedicated coolant ions, requirements that typically consume a large fraction of the runtime or ion count of trapped-ion quantum computers.
A universal quantum computer is an ultimate pursuit, which should possess the ability to perform entangling gate operations in parallel with high quality in a scalable fashion. However, for a long trapped-ion chain, the simultaneous implementation of two-qubit quantum gates is a challenging task due to the drastic increase of the crosstalk resulting from the collective motional modes. In this paper, by utilizing the structure of the localized motional modes in the long mixed-species ion chain, we propose a highly efficient linear iterative scheme to eliminate the crosstalk within the neighboring pairs. We show that this scheme allows the realization of high-fidelity, low-crosstalk, scalable, parallel two-qubit gates with only a few pulse segments for the long chain. In addition, by considering the practical experimental feasibility, we optimize the laser power and improve the robustness against the random static drifts of the motional frequencies.