arXiv subjects

Vikesh Siddhu

Publications and source records attributed to Vikesh Siddhu.

23 records · Page 2Linked to original sources

arXiv2021

Entropic singularities give rise to quantum transmission

When can noiseless quantum information be sent across noisy quantum devices? And at what maximum rate? These questions lie at the heart of quantum technology, but remain unanswered because of non-additivity -- a fundamental synergy which allows quantum devices (aka quantum channels) to send more information than expected. Previously, non-additivity was known to occur in very noisy channels with coherent information much smaller than that of a perfect channel; but, our work shows non-additivity in a simple low-noise channel. Our results extend even further. We prove a general theorem concerning positivity of a channel's coherent information. A corollary of this theorem gives a simple dimensional test for a channel's capacity. Applying this corollary solves an open problem by characterizing all qubit channels whose complement has non-zero capacity. Another application shows a wide class of zero quantum capacity qubit channels can assist an incomplete erasure channel in sending quantum information. These results arise from introducing and linking logarithmic singularities in the von-Neumann entropy with quantum transmission: changes in entropy caused by this singularity are a mechanism responsible for both positivity and non-additivity of the coherent information. Analysis of such singularities may be useful in other physics problems.

quant-ph↗

arXiv2021

Queue-Channel Capacities with Generalized Amplitude Damping

The generalized amplitude damping channel (GADC) is considered an important model for quantum communications, especially over optical networks. We make two salient contributions in this paper apropos of this channel. First, we consider a symmetric GAD channel characterized by the parameter $n=1/2,$ and derive its exact classical capacity, by constructing a specific induced classical channel. We show that the Holevo quantity for the GAD channel equals the Shannon capacity of the induced binary symmetric channel, establishing at once the capacity result and that the GAD channel capacity can be achieved without the use of entanglement at the encoder or joint measurements at the decoder. Second, motivated by the inevitable buffering of qubits in quantum networks, we consider a generalized amplitude damping \emph{queue-channel} -- that is, a setting where qubits suffer a waiting time dependent GAD noise as they wait in a buffer to be transmitted. This GAD queue channel is characterized by non-i.i.d. noise due to correlated waiting times of consecutive qubits. We exploit a conditional independence property in conjunction with additivity of the channel model, to obtain a capacity expression for the GAD queue channel in terms of the stationary waiting time in the queue. Our results provide useful insights towards designing practical quantum communication networks, and highlight the need to explicitly model the impact of buffering.

quant-ph↗

arXiv2019

Maximum a posteriori estimation of quantum states

Using a Bayesian methodology, we introduce the maximum a posteriori~(MAP) estimator for quantum state and process tomography. The maximum likelihood, hedged maximum likelihood, maximum likelihood-maximum entropy estimator, and estimators of this general type, can be viewed as special cases of the MAP estimator. The MAP, like the Bayes mean estimator includes prior knowledge, however for cases of interest to tomography can take advantage of convex optimization tools making it numerically easier to compute. We show how the MAP and other Bayesian quantum state estimators can be corrected for noise produced if the quantum state passes through a noisy quantum channel prior to measurement.

quant-ph↗

arXiv2017

Degradable Quantum Channels Using Pure to Product of Pure States Isometries

We consider a family of quantum channels characterized by the fact that certain (in general nonorthogonal) Pure states at the channel entrance are mapped to (tensor) Products of Pure states (PPP, hence "pcubed") at the complementary outputs (the main output and the "environment") of the channel. The pcubed construction, a reformulation of the twisted-diagonal procedure by M. M Wolf and D. Perez-Garcia, [Phys. Rev. A 75, 012303 (2007)], can be used to produce a large class of degradable quantum channels; degradable channels are of interest because their quantum capacities are easy to calculate. Several known types of degradable channels are either pcubed channels, or subchannels (employing a subspace of the channel entrance), or continuous limits of pcubed channels. The pcubed construction also yields channels which are neither degradable nor antidegradable (i.e., the complement of a degradable channel); a particular example of a qutrit channel of this type is studied in some detail. Determining whether a pcubed channel is degradable or antidegradable or neither is quite straightforward given the pure input and output states that characterize the channel. Conjugate degradable pcubed channels are always degradable.

quant-ph↗

arXiv2015

Quantum Private Comparison over noisy channels

Quantum Private Comparison (QPC) allows us to protect private information during its comparison. In the past various three-party quantum protocols have been proposed that claim to work well under noisy conditions. Here we tackle the problem of QPC under noise. We analyze the EPR-based protocol under depolarizing noise, bit flip and phase flip noise. We show how noise affects the robustness of the EPR-based protocol. We then present a straightforward protocol based on CSS codes to perform QPC which is robust against noise and secure under general attacks.

quant-ph↗