Noise-Resilient Quantum Random Access Codes

• URL: http://arxiv.org/abs/2411.07924v1
• Date: Tue, 12 Nov 2024 16:56:41 GMT
• Title: Noise-Resilient Quantum Random Access Codes
• Authors: H. S. Karthik, S. Gómez, F. M. Quinteros, Akshata Shenoy H., M. Pawłowski, S. P. Walborn, G. Lima, E. S. Gómez,
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A $n^d \xrightarrow{p} 1$ Quantum Random Access Code (QRAC) is a communication task where Alice encodes $n$ classical bits into quantum states of dimension $d$ and transmits them to Bob, who performs appropriate measurements to recover the required bit with probability $p$. 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. We perform a photonic implementation of a $2^2 \xrightarrow {\text{p}} 1$ QRAC using polarization-encoded qubits under an amplitude-damping channel, where simple operations allow for noise robustness showing the revival of the quantum advantage when the noisy channel degrades the performance of the QRAC. This revival can be observed by violating a suitable dimension witness, which is closely related to the average success probability of the QRAC. This technique can be extended to other applications in the so-called prepare-and-measure scenario, enhancing the semi-device-independent protocol implementations.

Related papers

• Observation of a Fault Tolerance Threshold with Concatenated Codes [0.0]
  We introduce a fault-tolerant protocol for code concatenation using a butterfly network architecture with high noise thresholds and low ancilla overhead.<n>We develop a probability passing decoder using tensor networks that applies Bayesian updates to the marginal error probabilities after each layer of checks.<n>We implement our state preparation protocol on ion-trap hardware with added noise to demonstrate the threshold behavior in a real quantum device.
  arXiv  Detail & Related papers  (2025-05-31T14:24:43Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Surpassing the loss-noise robustness trade-off in quantum key distribution [0.0]
  Quantum key distribution (QKD) offers theoretically secure method to share secret keys. Traditional QKD protocols require extensive noise compensation. Alternative protocols encode logical qubits in noise-resilient states.
  arXiv  Detail & Related papers  (2024-12-11T19:00:00Z)
• Bayesian Quantum Amplitude Estimation [49.1574468325115]
  We introduce BAE, a noise-aware Bayesian algorithm for quantum amplitude estimation. We show that BAE achieves Heisenberg-limited estimation and benchmark it against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• Optimal Quantum Purity Amplification [2.05170973574812]
  Quantum purity amplification (QPA) offers a novel approach to counteract the pervasive noise that degrades quantum states. We present the optimal QPA protocol for general quantum systems against global depolarizing noise. Our findings suggest that QPA could improve the performance of quantum information processing tasks.
  arXiv  Detail & Related papers  (2024-09-26T17:46:00Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Suppressing Amplitude Damping in Trapped Ions: Discrete Weak Measurements for a Non-unitary Probabilistic Noise Filter [62.997667081978825]
  We introduce a low-overhead protocol to reverse this degradation. We present two trapped-ion schemes for the implementation of a non-unitary probabilistic filter against amplitude damping noise. This filter can be understood as a protocol for single-copy quasi-distillation.
  arXiv  Detail & Related papers  (2022-09-06T18:18:41Z)
• Quantum Random Access Code in Noisy Channels [0.0]
  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.
  arXiv  Detail & Related papers  (2022-04-20T14:33:51Z)
• Error rate reduction of single-qubit gates via noise-aware decomposition into native gates [0.0]
  knowledge of a qubit's initial quantum state and the standard parameters describing its decoherence can be leveraged to mitigate the noise present during the execution of a single-qubit gate. We demonstrate a reduction of the single-qubit error rate by $38%$, from $1.6 times 10 -3$ to $1.0 times 10 -3$, provided the initial state of the input qubit is known.
  arXiv  Detail & Related papers  (2021-04-14T18:00:01Z)
• 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)
• Dynamically Corrected Nonadiabatic Holonomic Quantum Gates [2.436681150766912]
  The noise-resilience feature of nonadiabatic holonomic quantum computation (NHQC) still needs to be improved. We propose a general protocol of universal NHQC with simplified control, which can greatly suppress the effect of accompanied X errors. Numerical simulation shows that the performance of our gate can be much better than previous protocols.
  arXiv  Detail & Related papers  (2020-12-16T15:52:38Z)
• Recycling qubits in near-term quantum computers [1.2891210250935146]
  We propose a protocol that can unitarily reset qubits when the circuit has a common convolutional form. This protocol generates fresh qubits from used ones by partially applying the time-reversed quantum circuit over qubits that are no longer in use.
  arXiv  Detail & Related papers  (2020-12-03T03:24:50Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)
• 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)
• Security Limitations of Classical-Client Delegated Quantum Computing [54.28005879611532]
  A client remotely prepares a quantum state using a classical channel. Privacy loss incurred by employing $RSP_CC$ as a sub-module is unclear. We show that a specific $RSP_CC$ protocol can replace the quantum channel at least in some contexts.
  arXiv  Detail & Related papers  (2020-07-03T13:15:13Z)

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.