Optimizing Qubit Mapping with Quasi-Orthogonal Space-Time Block Codes and Quaternion Orthogonal Designs

• URL: http://arxiv.org/abs/2412.06145v1
• Date: Mon, 09 Dec 2024 01:58:37 GMT
• Title: Optimizing Qubit Mapping with Quasi-Orthogonal Space-Time Block Codes and Quaternion Orthogonal Designs
• Abstract summary: This study explores the qubit mapping through the integration of Quasi-Orthogonal Space-Time Block Codes (QOSTBCs) with Quaternion Orthogonal Designs (QODs) in quantum error correction frameworks.
• Score: 1.25828876338076
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This study explores the qubit mapping through the integration of Quasi-Orthogonal Space-Time Block Codes (QOSTBCs) with Quaternion Orthogonal Designs (QODs) in quantum error correction (QEC) frameworks. QOSTBCs have gained prominence for enhancing performance and reliability in quantum computing and communication systems. These codes draw on stabilizer group formalism and QODs to boost error correction, with QOSTBCs mapping logical qubits to physical ones, refines error handling in complex channels environments. Simulations results demonstrate the effectiveness of this approach by comparing the percentage improvement under various detected and corrected error conditions for four different cases, \textbf{$Z_1$} up to \textbf{$Z_4$}. The obtained simulations and implemental results show that QOSTBCs consistently achieve a higher correction improvement percentage than stabilizer Group for \textbf{$Z_1$}, \textbf{$Z_2$}, and \textbf{$Z_4$}; QOSTBCs can correct more errors than those detected, achieving over 100\% correction rates for first two cases, which indicates their enhanced resilience and redundancy in high-error environments. While for \textbf{$Z_3$}, stabilizer consistently remains above that of QOSTBCs, reflecting its slightly better performance. These outcomes indicate that QOSTBCs are reliable in making better logarithmic efficiency and error resilience, making them a valuable asset for quantum information processing and advanced wireless communication.

Related papers

• Toward Fault-Tolerant Variational Optimization: QAOA under [[4,2,2]] Error Detection [0.0]
  We present a fault-tolerant implementation of QAOA based on the $[[4,2,2]]$ error-detection code.<n>Our main contribution is a novel ancilla-mediated logical $R_ZZ$ gate enabling interactions between qubits in different $[[4,2,2]]$ blocks.
  arXiv  Detail & Related papers  (2026-09-07T14:20:42Z)
• Universal Optimization and Tighter Fidelity Bounds for Approximate Quantum Error Correction [5.2107604548805915]
  Approximate quantum error correction (AQEC) dictates the performance of discrete- and continuous-variable quantum error correction codes.<n>Finding the optimal recovery channel to maximize entanglement fidelity via standard semidefinite programming is computationally bottlenecked by the exponentially growing number of Kraus operators.<n>We establish an efficient framework by leveraging the duality between recovery and environment decoupling.
  arXiv  Detail & Related papers  (2026-07-27T18:18:58Z)
• Theory of approximate quantum error correction and the error-set model [53.73800998389749]
  We develop a theory of approximate quantum error correction based on the error-set model.<n>Code correcting a given error set automatically protects against every channel whose Kraus operators lie in their linear span.<n>This linearity gives rise to code distance, the equivalence between erasures and general errors, and a theory ofally good codes.
  arXiv  Detail & Related papers  (2026-07-25T02:15:33Z)
• StabilizerBench: A Benchmark for AI-Assisted Quantum Error Correction Circuit Synthesis [0.0]
  We introduce StabilizerBench, a benchmark suite of 192 stabilizer codes spanning 12 families, 4-196 qubits, and distances 2-21.<n>We define a unified generator weighted scoring system with two tiers: a capability score measuring breadth of success and a quality score capturing circuit merit.<n>We evaluate three frontier AI agents and find the benchmark discriminates across models and tasks with substantial headroom for improvement.
  arXiv  Detail & Related papers  (2026-04-23T05:04:28Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• Quantum Error Correction on Error-mitigated Physical Qubits [0.0]
  We present a framework for applying quantum error mitigation techniques directly to physical qubits to suppress logical errors.<n>We show that a-3 code with physical-level PEC achieves lower distance than ungated code while using 40% and fewer fewer rates.<n>These results establish physical QEM as a widely compatible and 64% fault-tolerant architecture.
  arXiv  Detail & Related papers  (2026-01-26T11:33:01Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• CAGE: Curvature-Aware Gradient Estimation For Accurate Quantization-Aware Training [73.46600457802693]
  We introduce a new method that counteracts the loss induced by quantization.<n>CAGE significantly improves upon the state-of-theart methods in terms of accuracy, for similar computational cost.<n>For QAT pre-training of Llama models, CAGE matches the accuracy achieved at 4-bits (W4A4) with the prior best method.
  arXiv  Detail & Related papers  (2025-10-21T16:33:57Z)
• Toward Uncertainty-Aware and Generalizable Neural Decoding for Quantum LDPC Codes [0.9453554184019106]
  Quantum error correction (QEC) is essential for scalable quantum computing.<n>We propose textbfQuBA, a Bayesian graph neural decoder that integrates attention to both dot-product and multi-head.<n>We further develop textbfSAGU textbf(Sequential Aggregate Generalization under Uncertainty), a multi-code training framework with enhanced cross-domain robustness.
  arXiv  Detail & Related papers  (2025-10-05T01:08:39Z)
• Branch-and-bound digitized counterdiabatic quantum optimization [39.58317527488534]
  Branch-and-bound algorithms effectively solve convex optimization problems, relying on the relaxation the objective function to obtain tight lower bounds. We propose a branch-and-bound digitized counterdiabatic quantum optimization (BB-DCQO) algorithm that addresses the relaxation difficulties.
  arXiv  Detail & Related papers  (2025-04-21T18:19:19Z)
• A Systematic Approach to Hyperbolic Quantum Error Correction Codes [0.0]
  Hyperbolic quantum error correction codes (HQECCs) leverage the unique geometric properties of hyperbolic space to enhance the capabilities and performance of quantum error correction. By embedding qubits in hyperbolic lattices, HQECCs achieve higher encoding rates and improved error thresholds compared to conventional Euclidean codes.
  arXiv  Detail & Related papers  (2025-04-10T14:38:10Z)
• Fundamental thresholds for computational and erasure errors via the coherent information [1.4767596539913115]
  We propose a framework based on the coherent information (CI) of the mixed-state density operator associated to noisy QEC codes. 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.
  arXiv  Detail & Related papers  (2024-12-21T18:30:30Z)
• Transforming qubits via quasi-geometric approaches [0.0]
  We develop a theory to transform a small number of qubits into a larger number of error-correcting qubits. We use the 2-dimensional quasi-orthogonal complete complementary codes (2D-QOCCCSs) and quasi-cyclic asymmetric quantum error-correcting codes (AQECCs) via quasigroup and group theory properties.
  arXiv  Detail & Related papers  (2024-07-10T11:41:26Z)
• Extracting Error Thresholds through the Framework of Approximate Quantum Error Correction Condition [0.0]
  robustness of quantum memory against physical noises is measured by two methods.<n> exact and approximate quantum error correction (QEC) conditions for error recoverability.<n> decoder-dependent error threshold which assesses if the logical error rate diminishes with system size.
  arXiv  Detail & Related papers  (2023-12-28T12:37:49Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Q-Pandora Unboxed: Characterizing Noise Resilience of Quantum Error Correction Codes [2.348041867134616]
  Quantum error correction codes (QECCs) are critical for realizing reliable quantum computing by protecting fragile quantum states against noise and errors. This paper conducts a comprehensive study analyzing two QECCs under different error types and noise models using simulations. rotated surface codes perform best with higher thresholds attributed to simplicity and lower qubit overhead.
  arXiv  Detail & Related papers  (2023-08-05T02:24:55Z)
• 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)
• Low-overhead quantum error correction codes with a cyclic topology [0.0]
  We propose a resource-efficient scaling of a five-qubit perfect code with cyclic stabilizers for small distances on the ring architecture. We show an approach to construct the quantum circuit of a correction code with ancillas entangled with non-neighboring data qubits.
  arXiv  Detail & Related papers  (2022-11-06T12:22:23Z)
• Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and Cycle Benchmarking [50.8020641352841]
  We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application. We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor. This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
  arXiv  Detail & Related papers  (2022-01-08T23:12:55Z)
• Graph-Theoretic Approach to Quantum Error Correction [0.0]
  We investigate a novel class of quantum error correcting codes to correct errors on both qubits and higher-state quantum systems represented as qudits. These codes arise from an original graph-theoretic representation of sets of quantum errors. We present two instances of optimal encodings: an optimal encoding for fully correlated noise which achieves a higher encoding rate than previously known, and a minimal encoding for single qudits.
  arXiv  Detail & Related papers  (2021-10-16T00:04:24Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Crosstalk Suppression for Fault-tolerant Quantum Error Correction with Trapped Ions [62.997667081978825]
  We present a study of crosstalk errors in a quantum-computing architecture based on a single string of ions confined by a radio-frequency trap, and manipulated by individually-addressed laser beams. This type of errors affects spectator qubits that, ideally, should remain unaltered during the application of single- and two-qubit quantum gates addressed at a different set of active qubits. We microscopically model crosstalk errors from first principles and present a detailed study showing the importance of using a coherent vs incoherent error modelling and, moreover, discuss strategies to actively suppress this crosstalk at the gate level.
  arXiv  Detail & Related papers  (2020-12-21T14:20:40Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)

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.