On quantum channel capacities: an additive refinement
- URL: http://arxiv.org/abs/2205.07205v1
- Date: Sun, 15 May 2022 07:21:38 GMT
- Title: On quantum channel capacities: an additive refinement
- Authors: D.-S. Wang
- Abstract summary: Capacities of quantum channels are fundamental quantities in the theory of quantum information.
Asymptotic regularization is generically necessary making the study of capacities notoriously hard.
We prove additive quantities for quantum channel capacities that can be employed for quantum Shannon theorems.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Capacities of quantum channels are fundamental quantities in the theory of
quantum information. A desirable property is the additivity for a capacity.
However, this cannot be achieved for a few quantities that have been
established as capacity measures. Asymptotic regularization is generically
necessary making the study of capacities notoriously hard. In this work, by a
proper refinement of the physical settings of quantum communication, we prove
additive quantities for quantum channel capacities that can be employed for
quantum Shannon theorems. This refinement, only a tiny step away from the
standard settings, is consistent with the principle of quantum theory, and it
further demonstrates von Neumann entropy as the cornerstone of quantum
information.
Related papers
- The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes.
Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
arXiv Detail & Related papers (2024-10-18T13:59:50Z) - Fundamental limitations on the recoverability of quantum processes [0.6990493129893111]
We determine fundamental limitations on how well the physical transformation on quantum channels can be undone or reversed.
We refine (strengthen) the quantum data processing inequality for quantum channels under the action of quantum superchannels.
We also provide a refined inequality for the entropy change of quantum channels under the action of an arbitrary quantum superchannel.
arXiv Detail & Related papers (2024-03-19T17:50:24Z) - Power Characterization of Noisy Quantum Kernels [52.47151453259434]
We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small.
We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
arXiv Detail & Related papers (2024-01-31T01:02:16Z) - Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
We explore the applicability of quantum-data learning to practical problems in high-energy physics.
We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states.
The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
arXiv Detail & Related papers (2023-06-29T18:00:01Z) - Approximation of the Nearest Classical-Classical State to a Quantum
State [0.0]
A revolutionary step in computation is driven by quantumness or quantum correlations, which are permanent in entanglements but often in separable states.
The exact quantification of quantumness is an NP-hard problem; thus, we consider alternative approaches to approximate it.
We show that the objective value decreases along the flow by proofs and numerical results.
arXiv Detail & Related papers (2023-01-23T08:26:17Z) - Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources.
The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
arXiv Detail & Related papers (2022-09-16T02:37:32Z) - Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems.
Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
arXiv Detail & Related papers (2021-08-30T23:50:05Z) - Characterizing quantum ensemble using geometric measure of quantum
coherence [1.5630592429258865]
We propose a quantumness quantifier for the quantum ensemble.
It satisfies the necessary axioms of a bonafide measure of quantumness.
We compute the quantumness of a few well-known ensembles.
arXiv Detail & Related papers (2021-04-19T07:37:27Z) - Towards understanding the power of quantum kernels in the NISQ era [79.8341515283403]
We show that the advantage of quantum kernels is vanished for large size datasets, few number of measurements, and large system noise.
Our work provides theoretical guidance of exploring advanced quantum kernels to attain quantum advantages on NISQ devices.
arXiv Detail & Related papers (2021-03-31T02:41:36Z) - Cost of quantum entanglement simplified [13.683637401785505]
We introduce an entanglement measure that has a precise information-theoretic meaning as the exact cost required to prepare an entangled state.
Our results bring key insights into the fundamental entanglement structure of arbitrary quantum states, and they can be used directly to assess and quantify the entanglement produced in quantum-physical experiments.
arXiv Detail & Related papers (2020-07-28T14:36:23Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.