Contextuality of Quantum Error-Correcting Codes

• URL: http://arxiv.org/abs/2502.02553v3
• Date: Tue, 23 Sep 2025 16:06:47 GMT
• Title: Contextuality of Quantum Error-Correcting Codes
• Authors: Derek Khu, Andrew Tanggara, Chao Jin, Kishor Bharti,
• Abstract summary: Universal fault-tolerant quantum computation requires overcoming the Eastin--Knill theorem on quantum error correction (QEC) codes that protect information from noise.<n>We develop a rigorous framework for contextuality in QEC and prove three main results.<n>We establish quantum contextuality as an intrinsic characteristic of fault-tolerant quantum codes and protocols.
• Score: 1.0144068791154617
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Universal fault-tolerant quantum computation requires overcoming the Eastin--Knill theorem on quantum error correction (QEC) codes that protect information from noise. This is often accomplished through strategies like magic state distillation, which prepares computational resources -- namely, magic states -- whose power is rooted in quantum contextuality, a fundamental nonclassical feature generalizing Bell nonlocality. Yet, the broader role of contextuality in enabling universality, including its significance as an inherent feature of QEC codes and protocols themselves, has remained largely unexplored. In this work, we develop a rigorous framework for contextuality in QEC and prove three main results. Fundamentally, we show that subsystem stabilizer codes with two or more gauge qubits are strongly contextual in their partial closure, while others are noncontextual, establishing a clear criterion for identifying contextual codes. Mathematically, we unify Abramsky--Brandenburger's sheaf-theoretic and Kirby--Love's tree-based definitions of contextuality, resolving a conjecture of Kim and Abramsky. Practically, we prove that many widely studied code-switching protocols which admit universal transversal gate sets, such as the doubled color codes introduced by Bravyi and Cross, are necessarily strongly contextual in their partial closure. Collectively, our results establish quantum contextuality as an intrinsic characteristic of fault-tolerant quantum codes and protocols, complementing entanglement and magic as resources for scalable quantum computation. For quantum coding theorists, this provides a new invariant: contextuality classifies which subsystem stabilizer codes can participate in universal fault-tolerant protocols. These findings position contextuality not only as a foundational concept but also as a practical guide for the design and analysis of future QEC architectures.

Related papers

• Quantum-Classical Separation in Bounded-Resource Tasks Arising from Measurement Contextuality [107.84586711462556]
  We show that quantum contextuality enables certain tasks to be performed with success probabilities beyond classical limits.<n>Our work proposes novel ways to benchmark quantum processors using contextuality-based algorithms.
  arXiv  Detail & Related papers  (2025-12-01T23:54:32Z)
• Quantum Key Distribution: Bridging Theoretical Security Proofs, Practical Attacks, and Error Correction for Quantum-Augmented Networks [0.0]
  Quantum Key Distribution (QKD) is revolutionizing cryptography by promising information-theoretic security through the immutable laws of quantum mechanics.<n>Yet, the challenge of transforming idealized security models into practical, resilient systems remains a pressing issue.<n>This review critically dissects and synthesizes the latest advancements in QKD protocols and their security vulnerabilities.
  arXiv  Detail & Related papers  (2025-11-25T18:31:02Z)
• Quantum-Accelerated Wireless Communications: Concepts, Connections, and Implications [59.0413662882849]
  Quantum computing is poised to redefine the algorithmic foundations of communication systems.<n>This article outlines the fundamentals of quantum computing in a style familiar to the communications society.<n>We highlight a mathematical harmony between quantum and wireless systems, which makes the topic more enticing to wireless researchers.
  arXiv  Detail & Related papers  (2025-06-25T22:25:47Z)
• Quantum Information Processing, Sensing and Communications: Their Myths, Realities and Futures [61.25494706587422]
  The state-of-the-art, knowledge gaps and future evolution of quantum machine learning are discussed. We conclude with a set of promising future research ideas in the field of ultimately secure quantum communications.
  arXiv  Detail & Related papers  (2024-12-01T22:28:02Z)
• Quantum Indistinguishable Obfuscation via Quantum Circuit Equivalence [6.769315201275599]
  Quantum computing solutions are increasingly deployed in commercial environments through delegated computing. One of the most critical issues is to guarantee the confidentiality and proprietary of quantum implementations. Since the proposal of general-purpose indistinguishability obfuscation (iO) and functional encryption schemes, iO has emerged as a seemingly versatile cryptography primitive.
  arXiv  Detail & Related papers  (2024-11-19T07:37:24Z)
• Identifying quantum resources in encoded computations [0.6144680854063939]
  We introduce a general framework which allows us to correctly identify quantum resources in encoded computations. We illustrate our general construction with the Gottesman--Kitaev--Preskill encoding of qudits with odd dimension. The resulting Wigner function, which we call the Zak-Gross Wigner function, is shown to correctly identify quantum resources through its phase-space negativity.
  arXiv  Detail & Related papers  (2024-07-25T21:01:18Z)
• Characterizing Contextuality via Rank Separation with Applications to Cloning [0.0]
  Quantum contextuality is a key nonclassical feature essential for understanding advantages in quantum computation and communication. We introduce a new framework to study contextuality based solely on information processing statistics. We show that quantum contextuality provides the resource in optimal phase-covariant and universal cloning schemes.
  arXiv  Detail & Related papers  (2024-06-27T17:56:04Z)
• Separable Power of Classical and Quantum Learning Protocols Through the Lens of No-Free-Lunch Theorem [70.42372213666553]
  The No-Free-Lunch (NFL) theorem quantifies problem- and data-independent generalization errors regardless of the optimization process. We categorize a diverse array of quantum learning algorithms into three learning protocols designed for learning quantum dynamics under a specified observable. Our derived NFL theorems demonstrate quadratic reductions in sample complexity across CLC-LPs, ReQu-LPs, and Qu-LPs. We attribute this performance discrepancy to the unique capacity of quantum-related learning protocols to indirectly utilize information concerning the global phases of non-orthogonal quantum states.
  arXiv  Detail & Related papers  (2024-05-12T09:05:13Z)
• A computational test of quantum contextuality, and even simpler proofs of quantumness [43.25018099464869]
  We show that an arbitrary contextuality game can be compiled into an operational "test of contextuality" involving a single quantum device. Our work can be seen as using cryptography to enforce spatial separation within subsystems of a single quantum device.
  arXiv  Detail & Related papers  (2024-05-10T19:30:23Z)
• Causality and a possible interpretation of quantum mechanics [2.7398542529968477]
  Based on quantum field theory, our work provides a framework that harmoniously integrates relativistic causality, quantum non-locality, and quantum measurement. We use reduced density matrices to represent the local information of the quantum state and show that the reduced density matrices cannot evolve superluminally. Unlike recent approaches that focus on causality by introducing new operators to describe detectors, we consider that everything--including detectors, environments, and humans--is composed of the same fundamental fields.
  arXiv  Detail & Related papers  (2024-02-08T07:07:22Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Classical Verification of Quantum Learning [42.362388367152256]
  We develop a framework for classical verification of quantum learning. We propose a new quantum data access model that we call "mixture-of-superpositions" quantum examples. Our results demonstrate that the potential power of quantum data for learning tasks, while not unlimited, can be utilized by classical agents.
  arXiv  Detail & Related papers  (2023-06-08T00:31:27Z)
• 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)
• Commitments to Quantum States [11.217084610985674]
  A commitment to quantum messages is binding if, after the commit phase, the committed state is hidden from the sender's view. We show that hiding quantum state commitments (QSCs) are implied by any commitment scheme for classical messages. Commitments to quantum states open the door to many new cryptographic possibilities.
  arXiv  Detail & Related papers  (2022-10-11T04:34:36Z)
• Error Correction for Reliable Quantum Computing [0.0]
  We study a phenomenon exclusive to the quantum paradigm, known as degeneracy, and its effects on the performance of sparse quantum codes. We present methods to improve the performance of a specific family of sparse quantum codes in various different scenarios.
  arXiv  Detail & Related papers  (2022-02-17T11:26:52Z)
• Experimental investigation of quantum uncertainty relations with classical shadows [7.675613458661457]
  We experimentally investigate quantum uncertainty relations construed with relative entropy of coherence. We prepare a family of quantum states whose purity can be fully controlled. Our results indicate the tightness of quantum coherence lower bounds dependents on the reference bases as well as the purity of quantum state.
  arXiv  Detail & Related papers  (2022-02-14T00:26:31Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Quantum Causal Inference in the Presence of Hidden Common Causes: an Entropic Approach [34.77250498401055]
  We put forth a new theoretical framework for merging quantum information science and causal inference by exploiting entropic principles. We apply our proposed framework to an experimentally relevant scenario of identifying message senders on quantum noisy links. This approach can lay the foundations of identifying originators of malicious activity on future multi-node quantum networks.
  arXiv  Detail & Related papers  (2021-04-24T22:45:50Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Quantum Entropic Causal Inference [30.939150842529052]
  We put forth a new theoretical framework for merging quantum information science and causal inference by exploiting entropic principles. We apply our proposed framework to an experimentally relevant scenario of identifying message senders on quantum noisy links.
  arXiv  Detail & Related papers  (2021-02-23T15:51:34Z)
• Formalization of Bohr's contextuality within theory of open quantum systems [0.0]
  Bohr was the first who pointed to contextuality of quantum measurements. The original Bohr's contextuality, as contextuality of each quantum measurement, was practically forgotten. This note is applied to formalization of Bohr's contextuality within the the scheme of indirect measurements.
  arXiv  Detail & Related papers  (2021-02-18T06:59:56Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Characterising and bounding the set of quantum behaviours in contextuality scenarios [0.0]
  This work defines contextuality scenarios, along with the polytope of general contextual behaviours. We formulate novel semidefinite programming relaxations for bounding these sets of quantum contextual behaviours. Most significantly, to circumvent the inadequacy of pure states and projective measurements, we present a novel unitary operator based semidefinite relaxation technique.
  arXiv  Detail & Related papers  (2020-10-12T17:00:07Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.