Quantum Random Access Code in Noisy Channels

• URL: http://arxiv.org/abs/2204.09485v2
• Date: Tue, 6 Feb 2024 16:29:59 GMT
• Title: Quantum Random Access Code in Noisy Channels
• Authors: Breno Marques and Rafael A. da Silva
• Abstract summary: In this work we build upon works that have previously proven quantum random access code (QRAC) We investigate the effects of noisy channel on QRAC performance and how the losses can be mitigated by using the see-saw method optimized by semi-definite programming when the noisy channel is known.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Random access code (RAC) communication protocol particularly useful when the communication between parties is restricted. In this work we built upon works that have previously proven quantum random access code (QRAC), in the absence of noise, to be more advantageous than classical random access code (CRAC), investigate the effects of noisy channel on QRAC performance and how the losses can be mitigated by using the see-saw method optimized by semi-definite programming when the noisy channel is known.

Related papers

• Controlled-Quantum secure remote sensing [0.6749750044497732]
  decoherence in the quantum communication channel and during the evolution of quantum states can erode quantum sensing advantages. We introduce a modified protocol incorporating local quantum optimal control (QOC) operations to address noise in SQS. The protocol actively mitigates noise, enhancing the achievable quantum Fisher information (QFI) and the classical Fisher information (CFI) based on the chosen measurement strategy.
  arXiv  Detail & Related papers  (2025-04-25T06:10:58Z)
• Virtual entanglement purification via noisy entanglement [0.16777183511743468]
  We present a protocol utilizing virtual operations that purifies noisy entanglement at the level of expectation values. Our protocol bridges the gap between DQC with entanglement and with circuit knitting, thus providing a flexible way for further scalability in the presence of hardware limitations.
  arXiv  Detail & Related papers  (2024-11-15T08:09:36Z)
• Noise-Resilient Quantum Random Access Codes [0.0]
  In the presence of a noisy environment, the performance of a QRAC is degraded, losing the advantage over classical strategies. We propose a practical technique that enables noise tolerance in such scenarios, recovering the quantum advantage in retrieving the required bit. This technique can be extended to other applications in the so-called prepare-and-measure scenario.
  arXiv  Detail & Related papers  (2024-11-12T16:56:41Z)
• A Quantum Approximate Optimization Algorithm-based Decoder Architecture for NextG Wireless Channel Codes [6.52154420965995]
  Forward Error Correction (FEC) provides reliable data flow in wireless networks despite the presence of noise and interference. FEC processing demands significant fraction of a wireless network's resources, due to its computationally-expensive decoding process. We present FDeQ, a QAOA-based FEC Decoder design targeting the popular NextG wireless Low Density Parity Check (LDPC) and Polar codes. FDeQ achieves successful decoding with error performance at par with state-of-the-art classical decoders at low FEC code block lengths.
  arXiv  Detail & Related papers  (2024-08-21T15:53:09Z)
• 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)
• Quantum Error Correction via Noise Guessing Decoding [0.0]
  Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation. This paper shows that it is possible to both construct and decode QECCs that can attain the maximum performance of the finite blocklength regime.
  arXiv  Detail & Related papers  (2022-08-04T16:18:20Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Tailored XZZX codes for biased noise [60.12487959001671]
  We study a family of codes having XZZX-type stabilizer generators. We show that these XZZX codes are highly qubit efficient if tailored to biased noise.
  arXiv  Detail & Related papers  (2022-03-30T17:26:31Z)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• 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)

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.