Lower bounds of success probabilities for high-fidelity approach in KLM scheme
From MaRDI portal
Publication:4584436
Abstract: In the Knill-Laflamme-Milburn (KLM) scheme, the success probability of quantum teleportation is given by , wehre is the number of the ancilla qubits. For the high-fidelity approach in the KLM scheme, the success probability is approximately given by for large . We give an explicit prescription to prepare an optimal ancilla state and give an exact lower bound of the success probability for the high-fidelity approach for arbitrary .
Recommendations
- scientific article; zbMATH DE number 67117
- An upper bound on the success probability of minimum-error discrimination
- Kullback-Leibler upper confidence bounds for optimal sequential allocation
- On the Convergence of an Efficient Algorithm for Kullback–Leibler Approximation of Spectral Densities
- Lower Bound on the Error Probability for Families with Bounded Likelihood Ratios
- Probabilistic bounds on one step objective/potential function improvement in Karmarkar's algorithm
- Almost sure convergence of the Kaczmarz algorithm with random measurements
- On the selection of an optimal outer approximation of a coherent lower probability
- On Lower Bounds for Nonstandard Deterministic Estimation
- On the Elicitation of an Optimal Outer Approximation of a Coherent Lower Probability
Cites work
This page was built for publication: Lower bounds of success probabilities for high-fidelity approach in KLM scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4584436)