Pages that link to "Item:Q3547006"

The following pages link to General formulas for capacity of classical-quantum channels (Q3547006):

Displaying 40 items.

• Second-order coding rates for pure-loss bosonic channels (Q291579) (← links)
• On the second-order asymptotics for entanglement-assisted communication (Q332056) (← links)
• Geometrical analysis of physically allowed quantum cloning transformations for quantum cryptography (Q508673) (← links)
• The broadcast classical-quantum capacity region of a two-phase bidirectional relaying channel (Q892654) (← links)
• Entanglement assisted classical capacity of a class of quantum channels with long-term memory (Q1007126) (← links)
• Classical capacity of quantum channels with general Markovian correlated noise (Q1022379) (← links)
• Position-based coding and convex splitting for private communication over quantum channels (Q1702253) (← links)
• A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation (Q1746556) (← links)
• A note on random coding bounds for classical-quantum channels (Q1752307) (← links)
• Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication (Q1937286) (← links)
• Thermodynamic implementations of quantum processes (Q2031130) (← links)
• On composite quantum hypothesis testing (Q2035910) (← links)
• Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender (Q2106027) (← links)
• Properties of noncommutative Rényi and Augustin information (Q2113490) (← links)
• Optimal adaptive strategies for sequential quantum hypothesis testing (Q2142991) (← links)
• Second-order asymptotics for the classical capacity of image-additive quantum channels (Q2354350) (← links)
• Universal coding for classical-quantum channel (Q2391144) (← links)
• Moderate deviation analysis for classical communication over quantum channels (Q2406109) (← links)
• Strong converse exponent for classical-quantum channel coding (Q2408555) (← links)
• Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity (Q2411582) (← links)
• Second-order asymptotics for quantum hypothesis testing (Q2448727) (← links)
• Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication (Q2630723) (← links)
• The smooth entropy formalism for von Neumann algebras (Q2786618) (← links)
• Correlation detection and an operational interpretation of the Rényi mutual information (Q2832714) (← links)
• A Dynamical Point of View of Quantum Information: Entropy and Pressure (Q2908419) (← links)
• Generalized relative entropies and the capacity of classical-quantum channels (Q3069136) (← links)
• Applications of position-based coding to classical communication over quantum channels (Q3120037) (← links)
• Achieving the Holevo bound via a bisection decoding protocol (Q3178312) (← links)
• Universal superposition codes: Capacity regions of compound quantum broadcast channel with confidential messages (Q3298908) (← links)
• Random Quantum Codes from Gaussian Ensembles and an Uncertainty Relation (Q3521589) (← links)
• Asymptotic convertibility of entanglement: An information-spectrum approach to entanglement concentration and dilution (Q4607685) (← links)
• On the near-optimality of one-shot classical communication over quantum channels (Q4621255) (← links)
• Entanglement-assisted private communication over quantum broadcast channels (Q4689541) (← links)
• Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities (Q4915239) (← links)
• The apex of the family tree of protocols: optimal rates and resource inequalities (Q5135904) (← links)
• Union bound for quantum information processing (Q5243627) (← links)
• An achievable rate for private classical information over a quantum broadcast channel (Q5247585) (← links)
• Distilling entanglement from arbitrary resources (Q5253945) (← links)
• Universal coding for transmission of private information (Q5255471) (← links)
• Common Information, Noise Stability, and Their Extensions (Q5863763) (← links)