Zobrazeno 1 - 10
of 1 271
pro vyhledávání: '"S., Sandeep"'
Autor:
He, Xingyi, Pradhan, S. Sandeep
In this paper, we provide a lower and an upper bound for the strong converse exponent of the soft covering problem in the classical setting. This exponent characterizes the slowest achievable convergence speed of the total variation to one when a cod
Externí odkaz:
http://arxiv.org/abs/2409.18307
Federated learning (FL) has emerged as a promising framework for distributed machine learning. It enables collaborative learning among multiple clients, utilizing distributed data and computing resources. However, FL faces challenges in balancing pri
Externí odkaz:
http://arxiv.org/abs/2409.13133
Quantum machine learning through variational quantum algorithms (VQAs) has gained substantial attention in recent years. VQAs employ parameterized quantum circuits, which are typically optimized using gradient-based methods. However, these methods of
Externí odkaz:
http://arxiv.org/abs/2407.13858
Autor:
S, Sandeep, Sawant, Anand
We show that every reciprocity sheaf gives rise to a cycle (pre)module in the sense of Rost over a perfect field. Over a perfect field of positive characteristic, we show that the first cohomology group of a logarithmic de Rham-Witt sheaf has a parti
Externí odkaz:
http://arxiv.org/abs/2403.01735
We propose quantum soft covering problems for fully quantum channels and classical-quantum (CQ) channels using relative entropy as a criterion of operator closeness. We prove covering lemmas by deriving one-shot bounds on the rates in terms of smooth
Externí odkaz:
http://arxiv.org/abs/2402.11112
This work considers the non-interactive source simulation problem (NISS). In the standard NISS scenario, a pair of distributed agents, Alice and Bob, observe a distributed binary memoryless source $(X^d,Y^d)$ generated based on joint distribution $P_
Externí odkaz:
http://arxiv.org/abs/2402.00242
Publikováno v:
Int. J. Quantum Inf. 22(5):2440013, 2024
We propose a quantum soft-covering problem for a given general quantum channel and one of its output states, which consists in finding the minimum rank of an input state needed to approximate the given channel output. We then prove a one-shot quantum
Externí odkaz:
http://arxiv.org/abs/2306.12416
The reliability function of a channel is the maximum achievable exponential rate of decay of the error probability as a function of the transmission rate. In this work, we derive bounds on the reliability function of discrete memoryless multiple-acce
Externí odkaz:
http://arxiv.org/abs/2306.06796
We establish a coding theorem for rate-limited quantum-classical optimal transport systems with limited classical common randomness. This theorem characterizes the rate region of measurement protocols on a product source state for faithful constructi
Externí odkaz:
http://arxiv.org/abs/2305.10004