ﻻ يوجد ملخص باللغة العربية
Secure quantum conferencing refers to a protocol where a number of trusted users generate exactly the same secret key to confidentially broadcast private messages. By a modification of the techniques first introduced in [Pirandola, arXiv:1601.00966], we derive a single-letter upper bound for the maximal rates of secure conferencing in a quantum network with arbitrary topology, where the users are allowed to perform the most powerful local operations assisted by two-way classical communications, and the quantum systems are routed according to the most efficient multipath flooding strategies. More precisely, our analysis allows us to bound the ultimate rates that are achievable by single-message multiple-multicast protocols, where N senders distribute N independent secret keys, and each key is to be shared with an ensemble of M receivers.
Last years, bounds on the maximal quantum violation of general Bell inequalities were intensively discussed in the literature via different mathematical tools. In the present paper, we analyze quantum violation of general Bell inequalities via the Lq
For the optimal success probability under minimum-error discrimination between $rgeq2$ arbitrary quantum states prepared with any a priori probabilities, we find new general analytical lower and upper bounds and specify the relations between these ne
A family of rigorous upper bounds on the growth rate of local gyrokinetic instabilities in magnetized plasmas is derived from the evolution equation for the Helmholtz free energy. These bounds hold for both electrostatic and electromagnetic instabili
The property of superadditivity of the quantum relative entropy states that, in a bipartite system $mathcal{H}_{AB}=mathcal{H}_A otimes mathcal{H}_B$, for every density operator $rho_{AB}$ one has $ D( rho_{AB} || sigma_A otimes sigma_B ) ge D( rho_A
We consider the evolution of an arbitrary quantum dynamical semigroup of a finite-dimensional quantum system under frequent kicks, where each kick is a generic quantum operation. We develop a generalization of the Baker-Campbell-Hausdorff formula all