Piggybacking on Quantum Streams

• URL: http://arxiv.org/abs/2005.12215v1
• Date: Mon, 25 May 2020 16:33:01 GMT
• Title: Piggybacking on Quantum Streams
• Authors: Marco Chiani, Andrea Conti, Moe Z. Win
• Abstract summary: It is possible to piggyback classical information on a stream of qubits protected by quantum error correcting codes. The piggyback channel can be created by introducing intentional errors corresponding to a controlled sequence of syndromes.
• Score: 26.078611404064397
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper shows that it is possible to piggyback classical information on a stream of qubits protected by quantum error correcting codes. The piggyback channel can be created by introducing intentional errors corresponding to a controlled sequence of syndromes. These syndromes are further protected, when quantum noise is present, by classical error correcting codes according to a performance-delay trade-off. Classical information can thus be added and extracted at arbitrary epochs without consuming additional quantum resources and without disturbing the quantum stream.

Related papers

• When Wyner and Ziv Met Bayes in Quantum-Classical Realm [8.499685241219366]
  We introduce a new formulation based on a backward (posterior) channel, replacing the single-letter distortion observable with a single-letter posterior channel to capture reconstruction error. We establish a connection between rate-distortion and rate-channel theory, showing that a rate-channel compression protocol attains the optimal rate-distortion function for a specific distortion measure and level.
  arXiv  Detail & Related papers  (2025-02-17T18:49:19Z)
• Advantage of Quantum Neural Networks as Quantum Information Decoders [1.1842028647407803]
  We study the problem of decoding quantum information encoded in the groundspaces of topological stabilizer Hamiltonians. We first prove that the standard stabilizer-based error correction and decoding schemes work adequately perturbed well in such quantum codes. We then prove that Quantum Neural Network (QNN) decoders provide an almost quadratic improvement on the readout error.
  arXiv  Detail & Related papers  (2024-01-11T23:56:29Z)
• Improving the performance of quantum cryptography by using the encryption of the error correction data [0.0]
  We introduce the idea of encrypting classical communication related to error-correction in order to decrease the amount of information available to the eavesdropper. We analyze the applicability of the method in the context of additional assumptions concerning the eavesdropper's quantum memory coherence time.
  arXiv  Detail & Related papers  (2023-06-21T15:42:54Z)
• The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
  We introduce a data efficient neural decoder that exploits the symmetries of the problem. We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
  arXiv  Detail & Related papers  (2023-04-14T19:46:39Z)
• 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)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Pauli channels can be estimated from syndrome measurements in quantum error correction [0.7264378254137809]
  We show that a stabilizer code can be used to estimate Pauli channels with correlations across a number of qubits given by the pure distance. It also allows for measurement errors within the framework of quantum data-syndrome codes. It is our hope that this work opens up interesting applications, such as the online adaptation of a decoder to time-varying noise.
  arXiv  Detail & Related papers  (2021-07-29T18:01:10Z)
• Optimizing quantum codes with an application to the loss channel with partial erasure information [1.90365714903665]
  We investigate the loss channel, which plays a key role in quantum communication, and in particular in quantum key distribution over long distances. We develop a numerical set of tools that allows to optimize an encoding specifically for recovering lost particles both deterministically and probabilistically. This allows us to arrive at new codes ideal for the distribution of entangled states in this particular setting, and also to investigate if encoding in qudits or allowing for non-deterministic correction proves advantageous compared to known QECCs.
  arXiv  Detail & Related papers  (2021-05-27T15:24:57Z)
• Quantum information spreading in a disordered quantum walk [50.591267188664666]
  We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport. Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
  arXiv  Detail & Related papers  (2020-10-20T20:03:19Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)

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.