On diagonal quantum channels

• URL: http://arxiv.org/abs/2011.00237v2
• Date: Fri, 5 Mar 2021 22:40:36 GMT
• Title: On diagonal quantum channels
• Authors: Amir R. Arab
• Abstract summary: It is shown that action of every diagonal quantum channel on pure state from computational basis is a convex combination of pure states determined by some transition probabilities. It is presented an algorithmic method to find an explicit form for Kraus operators of diagonal quantum channels.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper we study diagonal quantum channels and their structure by proving some results and giving most applicable instances of them. Firstly, it is shown that action of every diagonal quantum channel on pure state from computational basis is a convex combination of pure states determined by some transition probabilities. Finally, by using the Cholesky decomposition it is presented an algorithmic method to find an explicit form for Kraus operators of diagonal quantum channels.

Related papers

• Quantum channels, complex Stiefel manifolds, and optimization [45.9982965995401]
  We establish a continuity relation between the topological space of quantum channels and the quotient of the complex Stiefel manifold. The established relation can be applied to various quantum optimization problems.
  arXiv  Detail & Related papers  (2024-08-19T09:15:54Z)
• Weyl channels for multipartite systems [42.37986459997699]
  Quantum channels describe unitary and non-unitary evolution of quantum systems. We show that these channels are completely characterized by elements drawn of finite cyclic groups.
  arXiv  Detail & Related papers  (2023-10-17T02:45:47Z)
• Concrete Quantum Channels and Algebraic Structure of Abstract Quantum Channels [0.0]
  An attempt is made to identify generalized invertible channels and also the idempotent channels. The motivation behind this study is its applicability to the reversibility of channel transformations. This is related to the coding-encoding problem in quantum information theory.
  arXiv  Detail & Related papers  (2023-05-19T06:45:41Z)
• Entanglement Breaking Rank via Complementary Channels and Multiplicative Domains [4.588028371034406]
  We introduce a new technique to determine if a channel is entanglement breaking and to evaluate entanglement breaking rank. We show the entanglement breaking and Choi ranks of such channels are equal.
  arXiv  Detail & Related papers  (2022-11-21T23:33:10Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• 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)
• Bernstein-Greene-Kruskal approach for the quantum Vlasov equation [91.3755431537592]
  The one-dimensional stationary quantum Vlasov equation is analyzed using the energy as one of the dynamical variables. In the semiclassical case where quantum tunneling effects are small, an infinite series solution is developed.
  arXiv  Detail & Related papers  (2021-02-18T20:55:04Z)
• Generating random quantum channels [1.0499611180329802]
  Several techniques of generating random quantum channels, which act on the set of $d$-dimensional quantum states, are investigated. We present three approaches to the problem of sampling of quantum channels and show under which conditions they become mathematically equivalent. Additional results focus on the spectral gap and other spectral properties of random quantum channels and their invariant states.
  arXiv  Detail & Related papers  (2020-11-05T17:35:30Z)
• 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)
• Optimal representation of quantum channels [0.0]
  It is achieved by finding a base of the cone of positive semidefinite matrices which represent quantum channels. This is implemented in the Julia programming language as a part of the QuantumInformation.jl package.
  arXiv  Detail & Related papers  (2020-02-13T14:15:34Z)

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.