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

arXiv:quant-ph/0603244 · Physical Review A

Probabilistic coding of quantum states

Andrzej Grudka, Antoni Wójcik, Mikołaj Czechlewski

Published Jul 6, 2006• 2 citations
arXivHTMLPDF

Abstract

We discuss the properties of probabilistic coding of two qubits to one qutrit and generalize the scheme to higher dimensions. We show that the protocol preserves the entanglement between the qubits to be encoded and the environment and can also be applied to mixed states. We present a protocol that enables encoding of $n$ qudits to one qudit of dimension smaller than the Hilbert space of the original system and then allows probabilistic but error-free decoding of any subset of $k$ qudits. We give a formula for the probability of successful decoding.

DOI
10.1103/physreva.74.012302

Related papers

Optical implementation of the encoding of two qubits to a single qutrit

Lucie Bartůšková, Antonín Černoch, Radim Filip +3 more

We have devised an optical scheme for the recently proposed protocol for encoding two qubits into one qutrit. In this protocol, Alice encodes an arbitrary pure product state of two qubits into a state of one qutrit. Bob can then restore either of the two encoded qubit states error-free but not both of them simultaneously. We have successfully realized this scheme experimentally using spatial-mode encoding. Each qubit (qutrit) was represented by a single photon that could propagate through two (three) separate fibers. We theoretically propose two generalizations of the original protocol. We have found a probabilistic operation that enables us to retrieve both qubits simultaneously with average fidelity above 90% and we have proposed an extension of the original encoding transformation to encode $N$ qubits into one $(N+1)$-dimensional system.

arXiv:quant-ph/0603174•Physical Review A•Aug 28, 2006•26 citations

Probabilistic implementation of universal quantum processors

Mark S. Hillery, Vladimír Bužek, Mário Ziman

We present a probabilistic quantum processor for qudits on a single qudit of dimension N. The processor itself is represented by a fixed array of gates. The input of the processor consists of two registers. In the program register the set of instructions (program) is encoded. This program is applied to the data register. The processor can perform any operation on a single qudit of dimension N with a certain probability. For a general unitary operation, the probability is ${1/N}^{2},$ but for more restricted sets of operators the probability can be higher. In fact, this probability can be independent of the dimension of the qudit Hilbert space of the qudit under some conditions.

arXiv:quant-ph/0106088•Physical Review A•Jan 3, 2002•79 citations

Probabilistic superdense coding

Arun Kumar Pati, Preeti Parashar, Pankaj Agrawal

We explore the possibility of performing superdense coding with nonmaximally entangled states as a resource. Using this we find that one can send two classical bits in a probabilistic manner by sending a qubit. We generalize our scheme to higher dimensions and show that one can communicate $2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{2}d$ classical bits by sending a $d$-dimensional quantum state with a certain probability of success. The success probability in superdense coding is related to the success probability of distinguishing nonorthogonal states. The optimal average success probabilities are explicitly calculated. We consider the possibility of sending $2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{2}d$ classical bits with a shared resource of a higher dimensional entangled state $(D\ifmmode\times\else\texttimes\fi{}D,D>d)$. It is found that more entanglement does not necessarily lead to higher success probability. This also answers the question as to why we need ${\mathrm{log}}_{2}d$ ebits to send $2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{2}d$ classical bits in a deterministic fashion.

arXiv:quant-ph/0412039•Physical Review A•Jul 22, 2005•97 citations

The generation of Entangled Qudits and their Application in Probabilistic Superdense Coding

Lin Qing

A scheme of the generation of entangled qutrits is presented, and then is generalized to entangled ququads and entangled qudits. With the entangled qutrits, an experimental scheme of probability superdense coding with only linear optical elements is proposed. It is shown that this scheme will be suitable for the entangled ququads, even for the entangled qudits if some nonlinearity is used. This scheme is feasible in the laboratory with the current experimental technology.

Chinese Physics Letters•Mar 31, 2009•7 citations

Quantum Key Distribution with Qubits Encoded in Qutrit

Rupesh Kumar, Rafał Demkowicz-Dobrzański, Konrad Banaszek

We present a novel one-way quantum key distribution protocol based on 3-dimensional quantum state, a qutrit, that encodes two qubits in its 2-dimensional subspaces. The qubits hold the classical bit information that has to be shared between the legitimate users. Alice sends such a qutrit to Bob where he decodes one of the qubit and measures it along the random Pauli basis. This scheme has higher secure key rate at longer transmission distance than the standard BB84 protocol.

arXiv:1202.0456•Feb 2, 2012•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
We discuss the properties of probabilistic coding of two qubits to one qutrit and generalize the scheme to higher dimensions. We show that the protocol preserves the entanglement between the qubits to be encoded and the environment and can also be applied to mixed states. We present a protocol that enables encoding of nnn qudits to one qudit of dimension smaller than the Hilbert space of the original system and then allows probabilistic but error-free decoding of any subset of kkk qudits. We give a formula for the probability of successful decoding.
We have devised an optical scheme for the recently proposed protocol for encoding two qubits into one qutrit. In this protocol, Alice encodes an arbitrary pure product state of two qubits into a state of one qutrit. Bob can then restore either of the two encoded qubit states error-free but not both of them simultaneously. We have successfully realized this scheme experimentally using spatial-mode encoding. Each qubit (qutrit) was represented by a single photon that could propagate through two (three) separate fibers. We theoretically propose two generalizations of the original protocol. We have found a probabilistic operation that enables us to retrieve both qubits simultaneously with average fidelity above 90% and we have proposed an extension of the original encoding transformation to encode NNN qubits into one (N+1)(N+1)(N+1)-dimensional system.
We present a probabilistic quantum processor for qudits on a single qudit of dimension N. The processor itself is represented by a fixed array of gates. The input of the processor consists of two registers. In the program register the set of instructions (program) is encoded. This program is applied to the data register. The processor can perform any operation on a single qudit of dimension N with a certain probability. For a general unitary operation, the probability is 1/N2,{1/N}^{2},1/N2, but for more restricted sets of operators the probability can be higher. In fact, this probability can be independent of the dimension of the qudit Hilbert space of the qudit under some conditions.
We explore the possibility of performing superdense coding with nonmaximally entangled states as a resource. Using this we find that one can send two classical bits in a probabilistic manner by sending a qubit. We generalize our scheme to higher dimensions and show that one can communicate 2log2d2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{2}d2log2​d classical bits by sending a ddd-dimensional quantum state with a certain probability of success. The success probability in superdense coding is related to the success probability of distinguishing nonorthogonal states. The optimal average success probabilities are explicitly calculated. We consider the possibility of sending 2log2d2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{2}d2log2​d classical bits with a shared resource of a higher dimensional entangled state $(D\ifmmode\times\else\texttimes\fi{}D,D>d)$. It is found that more entanglement does not necessarily lead to higher success probability. This also answers the question as to why we need log2d{\mathrm{log}}_{2}dlog2​d ebits to send 2log2d2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{2}d2log2​d classical bits in a deterministic fashion.
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.