Decoding quantum information via the Petz recovery map

• URL: http://arxiv.org/abs/1504.04449v4
• Date: Mon, 30 Dec 2024 03:46:38 GMT
• Title: Decoding quantum information via the Petz recovery map
• Authors: Salman Beigi, Nilanjana Datta, Felix Leditzky,
• Abstract summary: We show that there is a sharp error threshold above which $Qn, epsilon(mathcalN)$ scales as $sqrtn$. Applying our achievability bound to the 50-50 erasure channel, we find that there is a sharp error threshold above which $Qn, epsilon(mathcalN)$ scales as $sqrtn$.
• Score: 16.276576840098254
• License:
• Abstract: We obtain a lower bound on the maximum number of qubits, $Q^{n, \epsilon}(\mathcal{N})$, which can be transmitted over $n$ uses of a quantum channel $\mathcal{N}$, for a given non-zero error threshold $\epsilon$. To obtain our result, we first derive a bound on the one-shot entanglement transmission capacity of the channel, and then compute its asymptotic expansion up to the second order. In our method to prove this achievability bound, the decoding map, used by the receiver on the output of the channel, is chosen to be the \emph{Petz recovery map} (also known as the \emph{transpose channel}). Our result, in particular, shows that this choice of the decoder can be used to establish the coherent information as an achievable rate for quantum information transmission. Applying our achievability bound to the 50-50 erasure channel (which has zero quantum capacity), we find that there is a sharp error threshold above which $Q^{n, \epsilon}(\mathcal{N})$ scales as $\sqrt{n}$.

Related papers

• Achievable rates in non-asymptotic bosonic quantum communication [0.9999629695552193]
  We find easily computable lower bounds on the non-asymptotic capacities of Gaussian channels. We design the first algorithm capable of computing the trace distance between two Gaussian states up to a fixed precision.
  arXiv  Detail & Related papers  (2025-02-08T11:12:26Z)
• Rate-reliability functions for deterministic identification [49.126395046088014]
  We find that for positive exponents linear scaling is restored, now with a rate that is a function of the reliability exponents. We extend our results to classical-quantum channels and quantum channels with product input restriction.
  arXiv  Detail & Related papers  (2025-02-04T15:09:14Z)
• Exploring the quantum capacity of a Gaussian random displacement channel using Gottesman-Kitaev-Preskill codes and maximum likelihood decoding [0.9208007322096532]
  We analyze the error-correction performance of several families of multi-mode Gottesman-Kitaev-Preskill codes. We find that the error threshold of the surface-square GKP code is remarkably close to $sigma=1/sqrtesimeq 0.6065$. By focusing on multi-mode GKP codes that encode just one logical qubit over multiple bosonic modes, we show that GKP codes can achieve non-zero quantum state transmission rates.
  arXiv  Detail & Related papers  (2024-11-06T21:47:20Z)
• Phase Transition in the Quantum Capacity of Quantum Channels [0.0]
  We prove that every quantum channel $Lambda$ in arbitrary dimension, when contaminated by white noise, completely loses its capacity of transmitting quantum states. We also find the quantum capacity of the complement of the depolarizing channel in closed form.
  arXiv  Detail & Related papers  (2024-08-11T09:49:52Z)
• General Communication Enhancement via the Quantum Switch [15.779145740528417]
  We conjecture that $mathcalP_n>0$ is both a necessary and sufficient condition for communication enhancement via the quantum $tt SWITCH$. We then formulate a communication protocol involving the quantum $tt SWITCH$ which enhances the private capacity of the BB84 channel.
  arXiv  Detail & Related papers  (2024-07-03T00:47:13Z)
• Deterministic identification over channels with finite output: a dimensional perspective on superlinear rates [49.126395046088014]
  We consider the problem in its generality for memoryless channels with finite output, but arbitrary input alphabets. Our main findings are that the maximum length of messages thus identifiable scales superlinearly as $R,nlog n$ with the block length $n$. We show that it is sufficient to ensure pairwise reliable distinguishability of the output distributions to construct a DI code.
  arXiv  Detail & Related papers  (2024-02-14T11:59:30Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• 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)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• 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.