Partially Coherent Direct Sum Channels
- URL: http://arxiv.org/abs/2008.00494v4
- Date: Tue, 13 Jul 2021 15:20:55 GMT
- Title: Partially Coherent Direct Sum Channels
- Authors: Stefano Chessa, Vittorio Giovannetti
- Abstract summary: We introduce Partially Coherent Direct Sum (PCDS) quantum channels, as a generalization of the already known Direct Sum quantum channels.
We derive necessary and sufficient conditions to identify a subset of those maps which are degradable, and provide a simplified expression for their quantum capacities.
- Score: 4.2231191686871234
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We introduce Partially Coherent Direct Sum (PCDS) quantum channels, as a
generalization of the already known Direct Sum quantum channels. We derive
necessary and sufficient conditions to identify the subset of those maps which
are degradable, and provide a simplified expression for their quantum
capacities. Interestingly, the special structure of PCDS allows us to extend
the computation of the quantum capacity formula also for quantum channels which
are explicitly not degradable (nor antidegradable). We show instances of
applications of the results to dephasing channels, amplitude damping channels
and combinations of the two.
Related papers
- Mixed-permutation channel with its application to estimate quantum
coherence [4.171080633895958]
We study a class of special quantum channels named the mixed-permutation channels.
The analytical lower bounds for l1-norm coherence and the relative entropy of coherence are shown.
The extension to bipartite systems is presented for the actions of the mixed-permutation channels.
arXiv Detail & Related papers (2024-01-12T00:12:12Z) - Normal quantum channels and Markovian correlated two-qubit quantum
errors [77.34726150561087]
We study general normally'' distributed random unitary transformations.
On the one hand, a normal distribution induces a unital quantum channel.
On the other hand, the diffusive random walk defines a unital quantum process.
arXiv Detail & Related papers (2023-07-25T15:33:28Z) - Information capacity analysis of fully correlated multi-level amplitude
damping channels [0.9790236766474201]
We investigate some of the information capacities of the simplest member of multi-level Amplitude Damping Channel, a qutrit channel.
We find the upper bounds of the single-shot classical capacities and calculate the quantum capacities associated with a specific class of maps.
arXiv Detail & Related papers (2023-05-08T06:10:56Z) - Capacities of the covariant Pauli channel [0.0]
We study the four well-known capacities of a two- parameter family of qubit Pauli channels.
We find exact expressions for the classical capacity and entanglement assisted capacities.
We analytically determine the regions where the quantum capacity of the channel vanishes.
arXiv Detail & Related papers (2022-06-13T12:48:21Z) - Pauli component erasing quantum channels [58.720142291102135]
We propose a family of quantum maps that preserve or completely erase the components of a multi-qubit system.
For the corresponding channels, it is shown that the preserved components can be interpreted as a finite vector subspace.
We show that the obtained family of channels forms a semigroup and derive its generators.
arXiv Detail & Related papers (2022-05-12T00:11:43Z) - Exact solution for the quantum and private capacities of bosonic
dephasing channels [10.787390511207686]
We provide the first exact calculation of the quantum, private, two-way assisted quantum, and secret-key capacities of bosonic dephasing channels.
arXiv Detail & Related papers (2022-05-11T19:12:12Z) - Creating and destroying coherence with quantum channels [62.997667081978825]
We study optimal ways to create a large amount of quantum coherence via quantum channels.
correlations in multipartite systems do not enhance the ability of a quantum channel to create coherence.
We show that a channel can destroy more coherence when acting on a subsystem of a bipartite state.
arXiv Detail & Related papers (2021-05-25T16:44:13Z) - Coherent control and distinguishability of quantum channels via
PBS-diagrams [59.94347858883343]
We introduce a graphical language for coherent control of general quantum channels inspired by practical quantum optical setups involving polarising beam splitters (PBS)
We characterise the observational equivalence of purified channels in various coherent-control contexts, paving the way towards a faithful representation of quantum channels under coherent control.
arXiv Detail & Related papers (2021-03-02T22:56:25Z) - Fundamental limitations on distillation of quantum channel resources [0.0]
We establish universal limitations on the processing of both quantum states and channels.
We focus on the class of distillation tasks, either as the purification of noisy channels into unitary ones, or the extraction of state-based resources from channels.
We obtain state-of-the-art lower bounds for the overhead cost of magic state distillation, as well as to quantum communication.
arXiv Detail & Related papers (2020-10-22T17:59:28Z) - Quantum Channel State Masking [78.7611537027573]
Communication over a quantum channel that depends on a quantum state is considered when the encoder has channel side information (CSI) and is required to mask information on the quantum channel state from the decoder.
A full characterization is established for the entanglement-assisted masking equivocation region, and a regularized formula is given for the quantum capacity-leakage function without assistance.
arXiv Detail & Related papers (2020-06-10T16:18:03Z) - Using Quantum Metrological Bounds in Quantum Error Correction: A Simple
Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates.
Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
arXiv Detail & Related papers (2020-04-24T17:58:10Z)
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.