Union bound for quantum information processing
From MaRDI portal
Abstract: In this paper, we prove a quantum union bound that is relevant when performing a sequence of binary-outcome quantum measurements on a quantum state. The quantum union bound proved here involves a tunable parameter that can be optimized, and this tunable parameter plays a similar role to a parameter involved in the Hayashi-Nagaoka inequality [IEEE Trans. Inf. Theory, 49(7):1753 (2003)], used often in quantum information theory when analyzing the error probability of a square-root measurement. An advantage of the proof delivered here is that it is elementary, relying only on basic properties of projectors, the Pythagorean theorem, and the Cauchy--Schwarz inequality. As a non-trivial application of our quantum union bound, we prove that a sequential decoding strategy for classical communication over a quantum channel achieves a lower bound on the channel's second-order coding rate. This demonstrates the advantage of our quantum union bound in the non-asymptotic regime, in which a communication channel is called a finite number of times. We expect that the bound will find a range of applications in quantum communication theory, quantum algorithms, and quantum complexity theory.
Recommendations
- Quantum information and correlation bounds
- Bounds on Information Combining With Quantum Side Information
- Universal Sets of Quantum Information Processing Primitives and Their Optimal Use
- Universal Sets of Quantum Information Processing Primitives and their optimal use
- Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
- Biunitary constructions in quantum information
- A lower bound of quantum conditional mutual information
- Unbounded-Error Classical and Quantum Communication Complexity
- Unbounded-error quantum query complexity
- Unbounded-Error Quantum Query Complexity
Cites work
- scientific article; zbMATH DE number 5851563 (Why is no real title available?)
- scientific article; zbMATH DE number 3617246 (Why is no real title available?)
- A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
- Applications of position-based coding to classical communication over quantum channels
- Belief propagation decoding of quantum channels by passing quantum messages
- Converse Bounds for Private Communication Over Quantum Channels
- Divide and conquer method for proving gaps of frustration free Hamiltonians
- Entanglement-Assisted Capacities of Constrained Quantum Channels
- Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
- General formulas for capacity of classical-quantum channels
- On channel capacity per unit cost
- On classical capacities of infinite-dimensional quantum channels
- On entanglement-assisted classical capacity
- On the Upper Bound for the Absolute Constant in the Berry–Esseen Inequality
- On the second-order asymptotics for entanglement-assisted communication
- Position-based coding and convex splitting for private communication over quantum channels
- Projection algorithms: Results and open problems
- Quantum continuous variables. A primer of theoretical methods
- Quantum systems, channels, information. A mathematical introduction.
- Second-Order Asymptotics for Source Coding, Dense Coding, and Pure-State Entanglement Conversions
- Second-order asymptotics for quantum hypothesis testing
- Second-order asymptotics for quantum hypothesis testing in settings beyond i.i.d. -- quantum lattice systems and more
- Second-order asymptotics for the classical capacity of image-additive quantum channels
- Second-order coding rates for pure-loss bosonic channels
- Sequential decoding of a general classical-quantum channel
- Sequential measurements, disturbance and property testing
- The Quantum Capacity of Channels With Arbitrarily Correlated Noise
- The capacity of the quantum channel with general signal states
- The classical-quantum channel with random state parameters known to the sender
Cited in
(5)- Ke Li's lemma for quantum hypothesis testing in general von Neumann algebras
- Classical capacities of memoryless but not identical quantum channels
- Sequential decoding of a general classical-quantum channel
- Quantum event learning and gentle random measurements
- On the near-optimality of one-shot classical communication over quantum channels
This page was built for publication: Union bound for quantum information processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5243627)
