Sequential transmission at short times
- URL: http://arxiv.org/abs/2506.10285v2
- Date: Tue, 17 Jun 2025 20:20:38 GMT
- Title: Sequential transmission at short times
- Authors: Archishna Bhattacharyya,
- Abstract summary: We show that it is possible to transmit and preserve information at short time scales over an n-fold composition of quantum channels.<n>We derive an exact error bound for the infinite dimensional pure-loss channel believed to be the dominant source of noise in networks.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We show that it is possible to transmit and preserve information at short time scales over an n-fold composition of quantum channels $(\Xi^n)_{n \in \mathbb{N}}$ modelled as a discrete quantum Markov semigroup, long enough to generate entanglement at some finite $n$. This is achieved by interspersing the action of noise with quantum error correction in succession. We show this by means of a non-trivial lower bound on the one-shot quantum capacity in the sequential setting as a function of $n$, in an attempt to model a linear quantum network and assess its capabilities to distribute entanglement. Intriguingly, the rate of transmission of such a network turns out to be a property of the spectrum of the channels composed in sequence, and the maximum possible error in transmission can be bounded as a function of the noise model only. As an application, we derive an exact error bound for the infinite dimensional pure-loss channel believed to be the dominant source of noise in networks precluding the distribution of entanglement. We exemplify our results by analysing the amplitude damping channel and its bosonic counterpart.
Related papers
- Optimizing entanglement distribution via noisy quantum channels [44.99833362998488]
Entanglement distribution is a crucial problem in quantum information science.<n>We investigate strategies for distributing quantum entanglement between two distant parties through noisy quantum channels.
arXiv Detail & Related papers (2025-06-06T13:48:20Z) - The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes.
Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
arXiv Detail & Related papers (2024-10-18T13:59:50Z) - 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) - Quantum Trajectory Approach to Error Mitigation [0.0]
Quantum Error Mitigation (EM) is a collection of strategies to reduce errors on noisy quantum devices.
We show that the inverse of noise maps can be realised by performing classical post-processing.
We demonstrate our result on a model relevant for current NISQ devices.
arXiv Detail & Related papers (2023-05-31T14:10:35Z) - Compressed quantum error mitigation [0.0]
We introduce a quantum error mitigation technique based on probabilistic error cancellation to eliminate errors which have accumulated during the application of a quantum circuit.
For a simple noise model, we show that efficient, local denoisers can be found, and we demonstrate their effectiveness for the digital quantum simulation of the time evolution of simple spin chains.
arXiv Detail & Related papers (2023-02-10T19:00:02Z) - Quantum emulation of the transient dynamics in the multistate
Landau-Zener model [50.591267188664666]
We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity.
Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
arXiv Detail & Related papers (2022-11-26T15:04:11Z) - Suppressing Amplitude Damping in Trapped Ions: Discrete Weak
Measurements for a Non-unitary Probabilistic Noise Filter [62.997667081978825]
We introduce a low-overhead protocol to reverse this degradation.
We present two trapped-ion schemes for the implementation of a non-unitary probabilistic filter against amplitude damping noise.
This filter can be understood as a protocol for single-copy quasi-distillation.
arXiv Detail & Related papers (2022-09-06T18:18:41Z) - Universal cost bound of quantum error mitigation based on quantum
estimation theory [0.0]
We present a unified approach to analyzing the cost of various quantum error mitigation methods on the basis of quantum estimation theory.
We derive for a generic layered quantum circuit under a wide class of Markovian noise that, unbiased estimation of an observable encounters an exponential growth with the circuit depth in the lower bound on the measurement cost.
Our results contribute to the understanding of the physical limitations of quantum error mitigation and offer a new criterion for evaluating the performance of quantum error mitigation techniques.
arXiv Detail & Related papers (2022-08-19T15:04:36Z) - Quantum Network Tomography with Multi-party State Distribution [10.52717496410392]
characterization of quantum channels in a quantum network is of paramount importance.
We introduce the problem of Quantum Network Tomography.
We study this problem in detail for the case of arbitrary star quantum networks with quantum channels described by a single Pauli operator.
arXiv Detail & Related papers (2022-06-06T21:47:09Z) - Reliable Simulation of Quantum Channels: the Error Exponent [5.8303977553652]
We study the error exponent of quantum channel simulation, which characterizes the optimal speed of exponential convergence.<n>We obtain an achievability bound for quantum channel simulation in the finite-blocklength setting.
arXiv Detail & Related papers (2021-12-08T18:55:54Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z)
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.