Distributed Quantum Error Correction with Permutation-Invariant Approximate Codes

• URL: http://arxiv.org/abs/2509.25093v1
• Date: Mon, 29 Sep 2025 17:28:39 GMT
• Title: Distributed Quantum Error Correction with Permutation-Invariant Approximate Codes
• Authors: Connor Clayton, Bruno Avritzer,
• Abstract summary: We introduce a distributed quantum error correction framework based on approximate codes to address this challenge.<n>We derive a lower bound and present corresponding simulations which indicate that this nontraditional approach can provide marked advantage.<n>Results highlight the potential of approximate distributed error correction strategies for scalable, modular, fault-tolerant quantum computation.
• Score: 0.7161783472741748
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Modular quantum computing architectures require error correction schemes that remain effective in the presense of noisy inter-processor operations. We introduce a distributed quantum error correction framework based on approximate codes to address this challenge. Our approach enables concatenation of distinct local codes across modules while allowing logical operations composed primarily of processor-local gates. We derive a lower bound and present corresponding simulations which indicate that this nontraditional approach can provide marked advantage over existing approaches in the highly non-uniform error landscape of a distributed quantum computer. As a concrete realization, we present encoding and decoding circuits for the permutation-invariant W- state code and propose efficient methods for its preparation. These results highlight the potential of approximate distributed error correction strategies for scalable, modular, fault-tolerant quantum computation.

Related papers

• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• Scalable dissipative quantum error correction for discrete-variable codes [0.0]
  Dissipative quantum error correction (QEC) autonomously protects quantum information using engineered dissipation.<n>We present a dissipative QEC protocol for discrete-variable codes, correcting multi-qubit errors via a trickle-down mechanism that sequentially reduces errors weight.
  arXiv  Detail & Related papers  (2025-07-16T18:00:09Z)
• Emergent unitary designs for encoded qubits from coherent errors and syndrome measurements [0.8491161158902805]
  We propose an efficient approach to generate unitary designs for encoded qubits in surface codes.<n>We numerically show that the ensemble of logical unitaries converges to a unitary design in the thermodynamic limit.<n>Our results provide a practical way to realize unitary designs on encoded qubits.
  arXiv  Detail & Related papers  (2024-12-05T18:36:14Z)
• Low-density parity-check representation of fault-tolerant quantum circuits [5.064729356056529]
  In fault-tolerant quantum computing, quantum algorithms are implemented through quantum circuits capable of error correction. This paper presents a toolkit for designing and analysing fault-tolerant quantum circuits.
  arXiv  Detail & Related papers  (2024-03-15T12:56:38Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Hardness of braided quantum circuit optimization in the surface code [0.1759008116536278]
  Large-scale quantum information processing requires the use of quantum error codes to mitigate the effects of noise in quantum devices. Topological error-correcting codes, such as surface codes, are promising candidates as they can be implemented using only local interactions in a two-dimensional array of physical qubits. However, error correction also introduces a significant overhead in time, the number of physical qubits, and the number of physical gates.
  arXiv  Detail & Related papers  (2023-02-01T06:35:50Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Fundamental limits of quantum error mitigation [0.0]
  We show how error-mitigation algorithms can reduce the computation error as a function of their sampling overhead. Our results provide a means to identify when a given quantum error-mitigation strategy is optimal and when there is potential room for improvement.
  arXiv  Detail & Related papers  (2021-09-09T17:56:14Z)
• Quantum Error Mitigation Relying on Permutation Filtering [84.66087478797475]
  We propose a general framework termed as permutation filters, which includes the existing permutation-based methods as special cases. We show that the proposed filter design algorithm always converges to the global optimum, and that the optimal filters can provide substantial improvements over the existing permutation-based methods.
  arXiv  Detail & Related papers  (2021-07-03T16:07:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.