اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدExperimentally feasible quantum erasure-correcting code for continuous variables
428
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We devise a scheme that protects quantum coherent states of light from probabilistic losses, thus achieving the first continuous-variable quantum erasure-correcting code. If the occurrence of erasures can be probed, then the decoder enables, in principle, a perfect recovery of the original light states. Otherwise, if supplemented with postselection based on homodyne detection, this code can be turned into an efficient erasure-filtration scheme. The experimental feasibility of the proposed protocol is carefully addressed.
قيم البحث
اقرأ أيضاً
A fundamental requirement for enabling fault-tolerant quantum information processing is an efficient quantum error-correcting code (QECC) that robustly protects the involved fragile quantum states from their environment. Just as classical error-corre
cting codes are indispensible in todays information technologies, it is believed that QECC will play a similarly crucial role in tomorrows quantum information systems. Here, we report on the first experimental demonstration of a quantum erasure-correcting code that overcomes the devastating effect of photon losses. Whereas {it errors} translate, in an information theoretic language, the noise affecting a transmission line, {it erasures} correspond to the in-line probabilistic loss of photons. Our quantum code protects a four-mode entangled mesoscopic state of light against erasures, and its associated encoding and decoding operations only require linear optics and Gaussian resources. Since in-line attenuation is generally the strongest limitation to quantum communication, much more than noise, such an erasure-correcting code provides a new tool for establishing quantum optical coherence over longer distances. We investigate two approaches for circumventing in-line losses using this code, and demonstrate that both approaches exhibit transmission fidelities beyond what is possible by classical means.
We report the first nonadditive quantum error-correcting code, namely, a $((9,12,3))$ code which is a 12-dimensional subspace within a 9-qubit Hilbert space, that outperforms the optimal stabilizer code of the same length by encoding more levels while correcting arbitrary single-qubit errors.
We propose a linear-optical implementation of a hyperentanglement-assisted quantum error-correcting code. The code is hyperentanglement-assisted because the shared entanglement resource is a photonic state hyperentangled in polarization and orbital a
ngular momentum. It is possible to encode, decode, and diagnose channel errors using linear-optical techniques. The code corrects for polarization flip errors and is thus suitable only for a proof-of-principle experiment. The encoding and decoding circuits use a Knill-Laflamme-Milburn-like scheme for transforming polarization and orbital angular momentum photonic qubits. A numerical optimization algorithm finds a unit-fidelity encoding circuit that requires only three ancilla modes and has success probability equal to 0.0097.
Quantum information protocols are inevitably affected by decoherence which is associated with the leakage of quantum information into an environment. In this paper we address the possibility of recovering the quantum information from an environmental
measurement. We investigate continuous variable quantum information, and we propose a simple environmental measurement that under certain circumstances fully restores the quantum information of the signal state although the state is not reconstructed with unit fidelity. We implement the protocol for which information is encoded into conjugate quadratures of coherent states of light and the noise added under the decoherence process is of Gaussian nature. The correction protocol is tested using both a deterministic as well as a probabilistic strategy. The potential use of the protocol in a continuous variable quantum key distribution scheme as a means to combat excess noise is also investigated.
Kitaevs quantum double models in 2D provide some of the most commonly studied examples of topological quantum order. In particular, the ground space is thought to yield a quantum error-correcting code. We offer an explicit proof that this is the case
for arbitrary finite groups. Actually a stronger claim is shown: any two states with zero energy density in some contractible region must have the same reduced state in that region. Alternatively, the local properties of a gauge-invariant state are fully determined by specifying that its holonomies in the region are trivial. We contrast this result with the fact that local properties of gauge-invariant states are not generally determined by specifying all of their non-Abelian fluxes -- that is, the Wilson loops of lattice gauge theory do not form a complete commuting set of observables. We also note that the methods developed by P. Naaijkens (PhD thesis, 2012) under a different context can be adapted to provide another proof of the error correcting property of Kitaevs model. Finally, we compute the topological entanglement entropy in Kitaevs model, and show, contrary to previous claims in the literature, that it does not depend on whether the log dim R term is included in the definition of entanglement entropy.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
