Communication protocols and QECC from the perspective of TQFT, Part II: QECCs as spacetimes

• URL: http://arxiv.org/abs/2405.12364v1
• Date: Mon, 18 Mar 2024 08:03:52 GMT
• Title: Communication protocols and QECC from the perspective of TQFT, Part II: QECCs as spacetimes
• Authors: Chris Fields, James F. Glazebrook, Antonino Marciano,
• Abstract summary: Topological quantum field theories (TQFTs) provide a general language for describing quantum-state preparation and measurement. We show that LOCC protocols induce quantum error-correcting codes (QECCs) on the agent-environment boundary. We show how generic QECCs, as bulk-boundary codes, induce effective spacetimes.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Topological quantum field theories (TQFTs) provide a general, minimal-assumption language for describing quantum-state preparation and measurement. They therefore provide a general language in which to express multi-agent communication protocols, e.g. local operations, classical communication (LOCC) protocols. In the accompanying Part I, we construct LOCC protocols using TQFT, and show that LOCC protocols induce quantum error-correcting codes (QECCs) on the agent-environment boundary. Such QECCs can be regarded as implementing or inducing the emergence of spacetimes on such boundaries. Here we investigate this connection between inter-agent communication and spacetime, exploiting different realizations of TQFT. We delve into TQFTs that support on their boundaries spin-networks as computational systems: these are known as topological quantum neural networks (TQNNs). TQNNs, which have a natural representation as tensor networks, implement QECC. We recognize into the HaPPY code a paradigmatic example. We then show how generic QECCs, as bulk-boundary codes, induce effective spacetimes. The effective spatial and temporal separations that take place in QECC enables LOCC protocols between spatially separated observers. We then consider the implementation of QECCs in BF and Chern-Simons theories, and show that QECC-induced spacetimes provide the classical redundancy required for LOCC. Finally, we consider topological M-theory as an implementation of QECC in higher spacetime dimensions.

Related papers

• Strategic Code: A Unified Spatio-Temporal Framework for Quantum Error-Correction [0.0]
  Quantum error-correcting code (QECC) is the central ingredient in fault-tolerant quantum information processing. An emerging paradigm of dynamical QECC shows that one can robustly encode logical information both temporally and spatially. An overarching theory of how dynamical Qs achieve fault-tolerance is lacking.
  arXiv  Detail & Related papers  (2024-05-27T18:03:00Z)
• 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)
• The Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet [49.8449750761258]
  Quantum secure direct communication (QSDC) is provably secure and overcomes the threat of quantum computing. We will detail the associated point-to-point communication protocols and show how information is protected and transmitted.
  arXiv  Detail & Related papers  (2023-11-23T12:40:47Z)
• Communication protocols and QECCs from the perspective of TQFT, Part I: Constructing LOCC protocols and QECCs from TQFTs [0.0]
  Topological quantum field theories (TQFTs) provide a general language for describing quantum-state preparation and measurement. Here we show that LOCC protocols generically induce quantum error-correcting codes (QECCs) In the accompanying Part II, we show that QECCs can be regarded as implementing, or inducing the emergence of, spacetimes on the boundaries between interacting systems.
  arXiv  Detail & Related papers  (2023-03-29T05:24:03Z)
• Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation [5.33024001730262]
  Protocols for fault-tolerant quantum computation (FTQC) demand excessive space overhead of physical qubits per logical qubit. We introduce an alternative approach using a concatenation of multiple small-size quantum codes for the constant-space-overhead FTQC. Our protocol accomplishes FTQC even if a decoder has non-constant runtime, unlike the existing constant-space-overhead protocol.
  arXiv  Detail & Related papers  (2022-07-18T18:00:00Z)
• Quantum Semantic Communications for Resource-Efficient Quantum Networking [52.3355619190963]
  This letter proposes a novel quantum semantic communications (QSC) framework exploiting advancements in quantum machine learning and quantum semantic representations. The proposed framework achieves approximately 50-75% reduction in quantum communication resources needed, while achieving a higher quantum semantic fidelity.
  arXiv  Detail & Related papers  (2022-05-05T03:49:19Z)
• Entanglement and Causal Relation in distributed quantum computation [0.0]
  We investigate two different aspects of entanglement and classical communication in distributed quantum computation (DQC) In the first part, we analyze implementable computation over a given quantum network resource by introducing a new concept, quantum network coding for quantum computation. In the second part, we show that entanglement required for local state discrimination can be substituted by less entanglement by increasing the rounds of classical communication.
  arXiv  Detail & Related papers  (2022-02-14T07:23:17Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• Quantum Circuits assisted by LOCC: Transformations and Phases of Matter [0.7734726150561088]
  We introduce deterministic state-transformation protocols between many-body quantum states which can be implemented by low-depth Quantum Circuits (QC) followed by Local Operations and Classical Communication (LOCC) We show that this gives rise to a classification of phases in which topologically-ordered states or other paradigmatic entangled states become trivial.
  arXiv  Detail & Related papers  (2021-03-24T17:44:34Z)
• 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.