اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAchievable rates for the Gaussian quantum channel
109
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the properties of quantum stabilizer codes that embed a finite-dimensional protected code space in an infinite-dimensional Hilbert space. The stabilizer group of such a code is associated with a symplectically integral lattice in the phase space of 2N canonical variables. From the existence of symplectically integral lattices with suitable properties, we infer a lower bound on the quantum capacity of the Gaussian quantum channel that matches the one-shot coherent information optimized over Gaussian input states.
قيم البحث
اقرأ أيضاً
We study the Han-Kobayashi (HK) achievable sum rate for the two-user symmetric Gaussian interference channel. We find the optimal power split ratio between the common and private messages (assuming no time-sharing), and derive a closed form expressio
n for the corresponding sum rate. This provides a finer understanding of the achievable HK sum rate, and allows for precise comparisons between this sum rate and that of orthogonal signaling. One surprising finding is that despite the fact that the channel is symmetric, allowing for asymmetric power split ratio at both users (i.e., asymmetric rates) can improve the sum rate significantly. Considering the high SNR regime, we specify the interference channel value above which the sum rate achieved using asymmetric power splitting outperforms the symmetric case.
We give the trade-off curve showing the capacity of a quantum channel as a function of the amount of entanglement used by the sender and receiver for transmitting information. The endpoints of this curve are given by the Holevo-Schumacher-Westmorelan
d capacity formula and the entanglement-assisted capacity, which is the maximum over all input density matrices of the quantum mutual information. The proof we give is based on the Holevo-Schumacher-Westmoreland formula, and also gives a new and simpler proof for the entanglement-assisted capacity formula.
We propose a quantum optics experiment where a single two-mode Gaussian entangled state is used for realizing the paradigm of an amendable Gaussian channel recently presented in Phys. Rev. A, textbf{87}, 062307 (2013). Depending on the choice of the
experimental parameters the entanglement of the probe state is preserved or not and the relative map belongs or not to the class of entanglement breaking channels. The scheme has been optimized to be as simple as possible: it requires only a single active non-linear operation followed by four passive beam-splitters. The effects of losses, detection inefficiencies and statistical errors are also taken into account, proving the feasibility of the experiment with current realistic resources.
We derive closed-form expressions for the achievable rates of a buffer-aided full-duplex (FD) multiple-input multiple-output (MIMO) Gaussian relay channel. The FD relay still suffers from residual self-interference (RSI) after the application of self
-interference mitigation techniques. We investigate both cases of a slow-RSI channel where the RSI is fixed over the entire codeword, and a fast-RSI channel where the RSI changes from one symbol duration to another within the codeword. We show that the RSI can be completely eliminated in the slow-RSI case when the FD relay is equipped with a buffer while the fast RSI cannot be eliminated. For the fixed-rate data transmission scenario, we derive the optimal transmission strategy that should be adopted by the source node and relay node to maximize the system throughput. We verify our analytical findings through simulations.
We consider error correction procedures designed specifically for the amplitude damping channel. We analyze amplitude damping errors in the stabilizer formalism. This analysis allows a generalization of the [4,1] `approximate amplitude damping code o
f quant-ph/9704002. We present this generalization as a class of [2(M+1),M] codes and present quantum circuits for encoding and recovery operations. We also present a [7,3] amplitude damping code based on the classical Hamming code. All of these are stabilizer codes whose encoding and recovery operations can be completely described with Clifford group operations. Finally, we describe optimization options in which recovery operations may be further adapted according to the damping probability gamma.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
