Approximating quantum channels by completely positive maps with small Kraus rank

• URL: http://arxiv.org/abs/1711.00697v3
• Date: Fri, 5 Apr 2024 11:04:03 GMT
• Title: Approximating quantum channels by completely positive maps with small Kraus rank
• Authors: Cécilia Lancien, Andreas Winter,
• Abstract summary: We study the problem of approximating a quantum channel by one with as few Kraus operators as possible. Our main result is that any quantum channel mapping states on some input Hilbert space $mathrmA$ to states on some output Hilbert space $mathrmB$ can be compressed into one with order $dlog d$ Kraus operators.
• Score: 0.6906005491572401
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study the problem of approximating a quantum channel by one with as few Kraus operators as possible (in the sense that, for any input state, the output states of the two channels should be close to one another). Our main result is that any quantum channel mapping states on some input Hilbert space $\mathrm{A}$ to states on some output Hilbert space $\mathrm{B}$ can be compressed into one with order $d\log d$ Kraus operators, where $d=\max(|\mathrm{A}|,|\mathrm{B}|)$, hence much less than $|\mathrm{A}||\mathrm{B}|$. In the case where the channel's outputs are all very mixed, this can be improved to order $d$. We discuss the optimality of this result as well as some consequences.

Related papers

• The Communication Complexity of Approximating Matrix Rank [50.6867896228563]
  We show that this problem has randomized communication complexity $Omega(frac1kcdot n2log|mathbbF|)$. As an application, we obtain an $Omega(frac1kcdot n2log|mathbbF|)$ space lower bound for any streaming algorithm with $k$ passes.
  arXiv  Detail & Related papers  (2024-10-26T06:21:42Z)
• On Quantum Channel Learning [0.0]
  It is shown that a quadratic on $mathcalU$ fidelity can be constructed by considering $sqrtrho(l) to sqrtvarrho(l)$ mapping, and on a general quantum channel of Kraus rank $N_s$. The approach can be applied to study decoherence effects, spontaneous coherence, synchronizing, etc.
  arXiv  Detail & Related papers  (2024-07-05T10:43:24Z)
• Partially Unitary Learning [0.0]
  An optimal mapping between Hilbert spaces $IN$ of $left|psirightrangle$ and $OUT$ of $left|phirightrangle$ is presented. An iterative algorithm for finding the global maximum of this optimization problem is developed.
  arXiv  Detail & Related papers  (2024-05-16T17:13:55Z)
• Dimension Independent Disentanglers from Unentanglement and Applications [55.86191108738564]
  We construct a dimension-independent k-partite disentangler (like) channel from bipartite unentangled input. We show that to capture NEXP, it suffices to have unentangled proofs of the form $| psi rangle = sqrta | sqrt1-a | psi_+ rangle where $| psi_+ rangle has non-negative amplitudes.
  arXiv  Detail & Related papers  (2024-02-23T12:22:03Z)
• Progress on the Kretschmann-Schlingemann-Werner Conjecture [0.0]
  Given any pair of quantum channels $Phi_1,Phi$ such that at least one of them has Kraus rank one, we prove that there exists a unitary $U$ on the environment such that $V_(bf1otimes U)V|_inftyleqsqrt2|Phi|_diamond$. We provide a simple example which shows that the factor $sqrt2$ on the right-hand side is optimal, and we conjecture that this inequality holds for every pair of quantum channels.
  arXiv  Detail & Related papers  (2023-08-29T15:32:58Z)
• On Machine Learning Knowledge Representation In The Form Of Partially Unitary Operator. Knowledge Generalizing Operator [0.0]
  A new form of ML knowledge representation with high generalization power is developed and implemented numerically. $mathcalU$ can be considered as a $mathitIN$ to $mathitOUT$ quantum channel.
  arXiv  Detail & Related papers  (2022-12-22T06:29:27Z)
• Exponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies [68.93512627479197]
  We study quantum Ordered Binary Decision Diagrams($OBDD$) model. We prove lower bounds and upper bounds for OBDD with arbitrary order of input variables. We extend hierarchy for read$k$-times Ordered Binary Decision Diagrams ($k$-OBDD$) of width.
  arXiv  Detail & Related papers  (2022-04-22T12:37:56Z)
• Optimal (controlled) quantum state preparation and improved unitary synthesis by quantum circuits with any number of ancillary qubits [20.270300647783003]
  Controlled quantum state preparation (CQSP) aims to provide the transformation of $|irangle |0nrangle to |irangle |psi_irangle $ for all $iin 0,1k$ for the given $n$-qubit states. We construct a quantum circuit for implementing CQSP, with depth $Oleft(n+k+frac2n+kn+k+mright)$ and size $Oleft(2n+kright)$
  arXiv  Detail & Related papers  (2022-02-23T04:19:57Z)
• A lower bound on the space overhead of fault-tolerant quantum computation [51.723084600243716]
  The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation. We prove an exponential upper bound on the maximal length of fault-tolerant quantum computation with amplitude noise.
  arXiv  Detail & Related papers  (2022-01-31T22:19:49Z)
• An Optimal Separation of Randomized and Quantum Query Complexity [67.19751155411075]
  We prove that for every decision tree, the absolute values of the Fourier coefficients of a given order $ellsqrtbinomdell (1+log n)ell-1,$ sum to at most $cellsqrtbinomdell (1+log n)ell-1,$ where $n$ is the number of variables, $d$ is the tree depth, and $c>0$ is an absolute constant.
  arXiv  Detail & Related papers  (2020-08-24T06:50:57Z)
• Bosonic quantum communication across arbitrarily high loss channels [68.58838842613457]
  A general attenuator $Phi_lambda, sigma$ is a bosonic quantum channel that acts by combining the input with a fixed environment state. We show that for any arbitrary value of $lambda>0$ there exists a suitable single-mode state $sigma(lambda)$. Our result holds even when we fix an energy constraint at the input of the channel, and implies that quantum communication at a constant rate is possible even in the limit of arbitrarily low transmissivity.
  arXiv  Detail & Related papers  (2020-03-19T16:50:11Z)

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.