Optimal quantum teleportation protocols for fixed average fidelity
- URL: http://arxiv.org/abs/2310.18213v1
- Date: Fri, 27 Oct 2023 15:41:12 GMT
- Title: Optimal quantum teleportation protocols for fixed average fidelity
- Authors: Fabricio Toscano, Diego G. Bussandri, Gustavo M. Bosyk, Ana P. Majtey,
and Mariela Portesi
- Abstract summary: Among all quantum teleportation protocols giving rise to the same average fidelity, those with aligned Bloch vectors between input and output states exhibit the minimum average trace distance.
We show that optimal protocols can be interpreted as the perfect quantum teleportation protocol under the action of correlated one-qubit channels.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We demonstrate that among all quantum teleportation protocols giving rise to
the same average fidelity, those with aligned Bloch vectors between input and
output states exhibit the minimum average trace distance. This defines optimal
protocols. Furthermore, we show that optimal protocols can be interpreted as
the perfect quantum teleportation protocol under the action of correlated
one-qubit channels. In particular, we focus on the deterministic case, for
which the final Bloch vector length is equal for all measurement outcomes.
Within these protocols, there exists one type that corresponds to the action of
uncorrelated channels: these are depolarizing channels. Thus, we established
the optimal quantum teleportation protocol under a very common experimental
noise.
Related papers
- Repeater-Based Quantum Communication Protocol: Maximizing Teleportation Fidelity with Minimal Entanglement [0.0]
We propose a more efficient protocol for a certain class of noisy states in any intermediary segment.
Our approach ensures enhanced teleportation fidelity even when the end-to-end state gets noisier.
arXiv Detail & Related papers (2024-06-20T11:31:12Z) - Finding the optimal probe state for multiparameter quantum metrology
using conic programming [61.98670278625053]
We present a conic programming framework that allows us to determine the optimal probe state for the corresponding precision bounds.
We also apply our theory to analyze the canonical field sensing problem using entangled quantum probe states.
arXiv Detail & Related papers (2024-01-11T12:47:29Z) - Semi-device independent nonlocality certification for near-term quantum
networks [46.37108901286964]
Bell tests are the most rigorous method for verifying entanglement in quantum networks.
If there is any signaling between the parties, then the violation of Bell inequalities can no longer be used.
We propose a semi-device independent protocol that allows us to numerically correct for effects of correlations in experimental probability distributions.
arXiv Detail & Related papers (2023-05-23T14:39:08Z) - Multi-User Entanglement Distribution in Quantum Networks Using Multipath
Routing [55.2480439325792]
We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing.
The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
arXiv Detail & Related papers (2023-03-06T18:06:00Z) - Data post-processing for the one-way heterodyne protocol under
composable finite-size security [62.997667081978825]
We study the performance of a practical continuous-variable (CV) quantum key distribution protocol.
We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime.
This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
arXiv Detail & Related papers (2022-05-20T12:37:09Z) - Optimal supplier of single-error-type entanglement via coherent-state
transmission [1.2891210250935146]
We consider protocol that presents single-error-type entanglement for distant qubits via coherent-state transmission over a lossy channel.
This protocol is regarded as a subroutine to serve entanglement for larger protocol to yield a final output, such as ebits or pbits.
arXiv Detail & Related papers (2022-03-31T15:36:54Z) - Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation.
We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z) - Minimum Entanglement Protocols for Function Estimation [0.0]
We prove necessary and sufficient conditions for the existence of optimal protocols using at most $k$-partite entanglement.
Our protocols require some amount of time-dependent control, and we show that a related class of time-independent protocols fail to achieve optimal scaling for generic functions.
arXiv Detail & Related papers (2021-10-14T18:00:00Z) - The Role of Localizable Concurrence in Quantum Teleportation Protocols [0.0]
For mixed multi-partite states the lack of computable entanglement measures has made the identification of the quantum resource responsible for this advantage more challenging.
We show that any teleportation protocol using an arbitrary multi-partite state, that includes a Bell measurement, requires a non-vanishing localizable concurrence between two of its parties in order to perform better than the classical protocol.
arXiv Detail & Related papers (2021-06-12T01:00:52Z) - Composably secure data processing for Gaussian-modulated continuous
variable quantum key distribution [58.720142291102135]
Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties.
We consider a protocol with homodyne detection in the general setting of composable finite-size security.
In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
arXiv Detail & Related papers (2021-03-30T18:02:55Z) - Quantifying the performance of bidirectional quantum teleportation [6.345523830122166]
Bidirectional teleportation is a fundamental protocol for exchanging quantum information between two parties.
We develop two ways of quantifying the simulation error of unideal bidirectional teleportation.
We find semi-definite programming lower bounds on the simulation error of unideal bidirectional teleportation.
arXiv Detail & Related papers (2020-10-15T17:36:17Z)
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.