Bosonic quantum communication across arbitrarily high loss channels
- URL: http://arxiv.org/abs/2003.08895v2
- Date: Thu, 10 Sep 2020 20:49:03 GMT
- Title: Bosonic quantum communication across arbitrarily high loss channels
- Authors: Ludovico Lami, Martin B. Plenio, Vittorio Giovannetti, and Alexander
S. Holevo
- Abstract summary: 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.
- Score: 68.58838842613457
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A general attenuator $\Phi_{\lambda, \sigma}$ is a bosonic quantum channel
that acts by combining the input with a fixed environment state $\sigma$ in a
beam splitter of transmissivity $\lambda$. If $\sigma$ is a thermal state the
resulting channel is a thermal attenuator, whose quantum capacity vanishes for
$\lambda\leq 1/2$. We study the quantum capacity of these objects for generic
$\sigma$, proving a number of unexpected results. Most notably, we show that
for any arbitrary value of $\lambda>0$ there exists a suitable single-mode
state $\sigma(\lambda)$ such that the quantum capacity of
$\Phi_{\lambda,\sigma(\lambda)}$ is larger than a universal constant $c>0$. 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, provided that the environment
state is appropriately controlled. We also find examples of states $\sigma$
such that the quantum capacity of $\Phi_{\lambda,\sigma}$ is not monotonic in
$\lambda$. These findings may have implications for the study of communication
lines running across integrated optical circuits, of which general attenuators
provide natural models.
Related papers
- 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) - Circuit Complexity of Sparse Quantum State Preparation [0.0]
We show that any $n$-qubit $d$-sparse quantum state can be prepared by a quantum circuit of size $O(fracdnlog d)$ and depth $Theta(log dn)$ using at most $O(fracndlog d )$ ancillary qubits.
We also establish the lower bound $Omega(fracdnlog(n + m) + log d + n)$ on the circuit size with $m$ ancillary qubits available.
arXiv Detail & Related papers (2024-06-23T15:28:20Z) - The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$.
In particular, we design global protocols for small set expansion, unique games, and PCP verification.
We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
arXiv Detail & Related papers (2024-02-29T01:35:46Z) - Quantum Optical Communication in the presence of strong attenuation
noise [8.808993671472349]
We show an even stronger version of D-HQCOM in the context of entanglement-assisted classical communication.
We provide a fully consistent protocol to activate the phenomena of D-HQCOM without directly accessing the environment state.
Our results may offer a concrete scheme to communicate across arbitrarily long optical fibres, without using quantum repeaters.
arXiv Detail & Related papers (2022-04-27T18:00:08Z) - 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) - Random quantum circuits transform local noise into global white noise [118.18170052022323]
We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime.
For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially.
If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
arXiv Detail & Related papers (2021-11-29T19:26:28Z) - Dephasing superchannels [0.09545101073027092]
We characterise a class of environmental noises that decrease coherent properties of quantum channels by introducing and analysing the properties of dephasing superchannels.
These are defined as superchannels that affect only non-classical properties of a quantum channel $mathcalE$.
We prove that such superchannels $Xi_C$ form a particular subclass of Schur-product supermaps that act on the Jamiolkowski state $J(mathcalE)$ of a channel $mathcalE$ via a Schur product, $J'=J
arXiv Detail & Related papers (2021-07-14T10:10:46Z) - 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) - Quantum Coupon Collector [62.58209964224025]
We study how efficiently a $k$-element set $Ssubseteq[n]$ can be learned from a uniform superposition $|Srangle of its elements.
We give tight bounds on the number of quantum samples needed for every $k$ and $n$, and we give efficient quantum learning algorithms.
arXiv Detail & Related papers (2020-02-18T16:14:55Z)
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.