Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Probabilistic unitary quantum channels

Shengjun Wu

Published Sep 29, 2005• 0 citations
OpenAlex

Abstract

Probabilistic unitary maps and probabilistic unitary quantum channels are introduced, many quantum information applications, including (unambiguous) teleportation, can be described as probabilistic unitary quantum channels. Some properties of probabilistic unitary maps and probabilistic unitary quantum channels are derived. The property of a probabilistic unitary quantum channel ensures certain simple form for the measurements involved in realizing the probabilistic unitary quantum channel. The relation between a probabilistic unitary quantum channel and a uniformly entangled state is established. The combined operation of a noisy quantum channel and the error correction operation is a probabilistic unitary channel, from this point of view the condition for the errors to be correctable is easily derived. The condition for the errors caused by a noisy channel to be correctable with any nonzero probability is also obtained. Dense coding with a partially entangled state can also be viewed as a probabilistic unitary quantum channel when all messages are required to be transmitted with equal probability of success, the maximal achievable probability of success is derived and the optimum protocol is also obtained. 1

Related papers

Unambiguous unitary quantum channels

Shengjun Wu, X.-M. Chen

Unambiguous unitary maps and unambiguous unitary quantum channels are introduced and some of their properties are derived. These properties ensures certain simple form for the measurements involved in realizing an unambiguous unitary quantum channel. Error correction and unambiguous error correction with nonzero probability are discussed in terms of unambiguous unitary quantum channels. We not only re-derive the well-known condition for a set of errors to be correctable with certainty, but also obtain a necessary and sufficient condition for the errors caused by a noisy channel to be correctable with any nonzero probability. Dense coding with a partially entangled state can also be viewed as an unambiguous unitary quantum channel when all messages are required to be transmitted with equal probability of success, the maximal achievable probability of success is derived and the optimum protocol is also obtained.

arXiv:quant-ph/0509212•Quantum Information and Computation•Nov 1, 2007•0 citations

On the Probabilistic Quantum Error Correction

Ryszard Kukulski, Łukasz Pawela, Zbigniew Puchała

Probabilistic quantum error correction is an error-correcting procedure which uses postselection to determine if the encoded information was successfully restored. In this work, we analyze the probabilistic version of the error-correcting procedure for general noise. We generalize the Knill-Laflamme conditions for probabilistically correctable errors. We show that for some noise channels, the initial information has to be encoded into a mixed state to maximize the probability of successful error correction. Finally, the probabilistic error-correcting procedure offers an advantage over the deterministic procedure. Reducing the probability of successful error correction allows for correcting errors generated by a broader class of noise channels. Significantly, if the errors are caused by a unitary interaction with an auxiliary qubit system, we can probabilistically restore a qubit state by using only one additional physical qubit.

arXiv:2206.05232•IEEE Transactions on Information Theory•Mar 8, 2023•8 citations

Quantum Communication with Redundancy-free Error Correction

Sándor Imre

The limits of classical information theory are stretched at several points by the consideration of quantum mechanics. Entanglement in itself is a unique phenomenon, and its application has enabled solutions such as super-dense compression, teleportation or super-activation of quantum channels. Noisy classical channels can only be made error-free by adding redundancy, and even this can only be done for certain channels. However, in this article, we examine an equally unique possibility, namely, what properties can make the quantum channels error-free without adding redundancy just by using appropriate quantum transformations. We will show the quantum coding required for this and illustrate its efficiency through examples.

•Aug 12, 2025•0 citations

Clients Transparency Properties in Probabilistic Teleportation

DU Jian-zhong

A bidirectional protocol of probabilistic teleportation on the clients/server model is proposed,leading to the maximal probability of successful teleportation.It is proved that the partially entangled quantum channel ∑dj=1∑di=1∑nk=1u(ji)biv(ik)|j〉|k〉 by the Schmidt decomposition is transparent to the clients.To perform probabilistic teleportation via the generally entangled quantum channel,the clients must know a unitary operator that transforms the quantum channel into the clients' transparent quantum channel.

Beijing Youdian Xueyuan xuebao•Jan 1, 2007•0 citations

Probabilistic Teleportation of Two-particle State of General Formation Based on Four-particle Entanglement

Yan Feng-Li

A scheme for probabilistic teleportation of two-particle state is shown when quantum channels are four-particle partially entangled states.Teleportation will be realized successfully with certain probability by unitary transformation and introducing an auxiliary particle.

Journal of Hebei Normal University•Jan 1, 2006•1 citation

Probabilistic Dense Coding Using Non-Maximally Entangled Three-Particle States

Zhang Guo-hua, Yan Feng-Li

We present a scheme for probabilistic dense coding via quantum channels of non-maximally entangled three-particle states. Quantum dense coding will succeed with a certain probability if the sender introduces an auxiliary particle and performs a collective unitary transformation. The average information transmitted in this scheme is calculated.

Chinese Physics Letters•Sep 1, 2009•4 citations
Probabilistic unitary maps and probabilistic unitary quantum channels are introduced, many quantum information applications, including (unambiguous) teleportation, can be described as probabilistic unitary quantum channels. Some properties of probabilistic unitary maps and probabilistic unitary quantum channels are derived. The property of a probabilistic unitary quantum channel ensures certain simple form for the measurements involved in realizing the probabilistic unitary quantum channel. The relation between a probabilistic unitary quantum channel and a uniformly entangled state is established. The combined operation of a noisy quantum channel and the error correction operation is a probabilistic unitary channel, from this point of view the condition for the errors to be correctable is easily derived. The condition for the errors caused by a noisy channel to be correctable with any nonzero probability is also obtained. Dense coding with a partially entangled state can also be viewed as a probabilistic unitary quantum channel when all messages are required to be transmitted with equal probability of success, the maximal achievable probability of success is derived and the optimum protocol is also obtained. 1
Unambiguous unitary maps and unambiguous unitary quantum channels are introduced and some of their properties are derived. These properties ensures certain simple form for the measurements involved in realizing an unambiguous unitary quantum channel. Error correction and unambiguous error correction with nonzero probability are discussed in terms of unambiguous unitary quantum channels. We not only re-derive the well-known condition for a set of errors to be correctable with certainty, but also obtain a necessary and sufficient condition for the errors caused by a noisy channel to be correctable with any nonzero probability. Dense coding with a partially entangled state can also be viewed as an unambiguous unitary quantum channel when all messages are required to be transmitted with equal probability of success, the maximal achievable probability of success is derived and the optimum protocol is also obtained.
Probabilistic quantum error correction is an error-correcting procedure which uses postselection to determine if the encoded information was successfully restored. In this work, we analyze the probabilistic version of the error-correcting procedure for general noise. We generalize the Knill-Laflamme conditions for probabilistically correctable errors. We show that for some noise channels, the initial information has to be encoded into a mixed state to maximize the probability of successful error correction. Finally, the probabilistic error-correcting procedure offers an advantage over the deterministic procedure. Reducing the probability of successful error correction allows for correcting errors generated by a broader class of noise channels. Significantly, if the errors are caused by a unitary interaction with an auxiliary qubit system, we can probabilistically restore a qubit state by using only one additional physical qubit.
The limits of classical information theory are stretched at several points by the consideration of quantum mechanics. Entanglement in itself is a unique phenomenon, and its application has enabled solutions such as super-dense compression, teleportation or super-activation of quantum channels. Noisy classical channels can only be made error-free by adding redundancy, and even this can only be done for certain channels. However, in this article, we examine an equally unique possibility, namely, what properties can make the quantum channels error-free without adding redundancy just by using appropriate quantum transformations. We will show the quantum coding required for this and illustrate its efficiency through examples.
A bidirectional protocol of probabilistic teleportation on the clients/server model is proposed,leading to the maximal probability of successful teleportation.It is proved that the partially entangled quantum channel ∑dj=1∑di=1∑nk=1u(ji)biv(ik)|j〉|k〉 by the Schmidt decomposition is transparent to the clients.To perform probabilistic teleportation via the generally entangled quantum channel,the clients must know a unitary operator that transforms the quantum channel into the clients' transparent quantum channel.