Unified and Generalized Approach to Entanglement-Assisted Quantum Error Correction

Abstract: We introduce a framework for entanglement-assisted quantum error correcting codes that unifies the three original frameworks for such codes called entanglement-assisted quantum error correction, entanglement-assisted operator quantum error correction, and entanglement-assisted classical enhanced quantum error correction under a single umbrella. As a consequence, new types of entanglement-assisted codes are identified and constructed. The unification […]

Low-Complexity Syndrome-Based Linear Programming Decoding of Quantum LDPC Codes

Abstract: This article proposes a novel low-complexity syndrome-based linear programming (SB-LP) decoding algorithm for decoding quantum low-density parity-check codes. Under the code-capacity model, the SB-LP decoder can be used as a standalone decoder; however, it is particularly powerful when used as a postprocessing step following SB min-sum (SB-MS) decoding. In the latter case, the proposed […]

Benchmarking the Ability of a Controller to Execute Quantum Error Corrected Non-Clifford Circuits

Abstract: Reaching fault-tolerant quantum computation relies on the successful implementation of non-Clifford circuits with quantum error correction (QEC). In QEC, quantum gates and measurements encode quantum information into an error-protected Hilbert space, while classical processing decodes the measurements into logical errors. QEC non-Clifford gates pose the greatest computation challenge from the classical controller’s perspective, as […]

Reducing Quantum Error Correction Overhead With Versatile Flag-Sharing Syndrome Extraction Circuits

Abstract: Given that quantum error correction processes are unreliable, an efficient error syndrome extraction circuit should use fewer ancillary qubits, quantum gates, and measurements while maintaining low circuit depth, to minimize the circuit area, roughly defined as the product of circuit depth and the number of physical qubits. We propose to design parallel flagged syndrome […]

Noise Robustness of Quantum Relaxation for Combinatorial Optimization

Relaxation is a common way for dealing with combinatorial optimization problems. Quantum random-access optimization (QRAO) is a quantum-relaxation-based optimizer that uses fewer qubits than the number of bits in the original problem by encoding multiple variables per qubit using quantum random-access code (QRAC). Reducing the number of qubits will alleviate physical noise (typically, decoherence), and […]

Convolutional Neural Decoder for Surface Codes

To perform reliable information processing in quantum computers, quantum error correction (QEC) codes are essential for the detection and correction of errors in the qubits. Among QEC codes, topological QEC codes are designed to interact between the neighboring qubits, which is a promising property for easing the implementation requirements. In addition, the locality to the […]

On the Logical Error Rate of Sparse Quantum Codes

The quantum paradigm presents a phenomenon known as degeneracy that can potentially improve the performance of quantum error correcting codes. However, the effects of this mechanism are sometimes ignored when evaluating the performance of sparse quantum codes and the logical error rate is not always correctly reported. In this article, we discuss previously existing methods […]

Neural-Network Decoders for Quantum Error Correction Using Surface Codes: A Space Exploration of the Hardware Cost-Performance Tradeoffs

Quantum error correction (QEC) is required in quantum computers to mitigate the effect of errors on physical qubits. When adopting a QEC scheme based on surface codes, error decoding is the most computationally expensive task in the classical electronic back-end. Decoders employing neural networks (NN) are well-suited for this task but their hardware implementation has […]

Log-Domain Decoding of Quantum LDPC Codes Over Binary Finite Fields

A quantum stabilizer code over GF(q) corresponds to a classical additive code over GF(q2) that is self-orthogonal with respect to a symplectic inner product. We study the decoding of quantum low-density parity-check (LDPC) codes over binary finite fields GF(q = 2l) by the sum-product algorithm, also known as belief propagation (BP). Conventionally, a message in a nonbinary BP for quantum codes […]