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/0608023

Impossibility of Probabilistic splitting of quantum information

Indranil Chakrabarty, Binayak Samadder Choudhury

Published Aug 2, 2006• 2 citations
arXivHTMLPDF

Abstract

We know that we cannot split the information encoded in two non-orthogonal qubits into complementary parts deterministically. Here we show that each of the copies of the state randomly selected from a set of non orthogonal linearly independent states, splitting of quantum information can not be done even probabilistically. Here in this work we also show that under certain restricted conditions, we can probabilistically split the quantum information encoded in a qubit.

DOI
10.48550/arxiv.quant-ph/0608023

Related papers

Can copies of linearly independent quantum states be deleted?

Jian Feng, Ji‐Suo Wang, Gao Yun-Feng +1 more

It is shown that each of two copies of the non-orthogonal states randomly selected from a certain set can be probabilistically deleted by a general unitary-reduction operation if and only if the states are linearly independent. A bound on the best possible deleting efficiencies is derived.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Sep 11, 2002•0 citations

Deterministic versus probabilistic quantum information masking

Bo Li, Shuhan Jiang, Xiao-Bin Liang +3 more

We investigate quantum information masking for arbitrary dimensional quantum states. We show that mutually orthogonal quantum states can always be served for deterministic masking of quantum information. We further construct a probabilistic masking machine for linearly independent states. It is shown that a set of $d$-dimensional states, ${{|{a}_{1}\ensuremath{\rangle}}_{A},|{a}_{2}{\ensuremath{\rangle}}_{A},\ensuremath{\cdots},|{a}_{n}{\ensuremath{\rangle}}_{A}}, n\ensuremath{\le}d$, can be probabilistically masked by a general unitary-reduction operation if they are linearly independent. The maximal successful probability of probabilistic masking is analyzed and derived for the case of two initial states.

arXiv:1905.00540•Physical Review A•May 28, 2019•28 citations

Quantum information masking in non-Hermitian systems and robustness

Qiao-Qiao Lv, Jin‐Min Liang, Zhi‐Xi Wang +1 more

Abstract By studying quantum information masking (QIM) in non-Hermitian quantum systems, we show that mutually orthogonal quantum states can be deterministically masked, while an arbitrary set of quantum states cannot be masked in non-Hermitian quantum systems. We further demonstrate that a set of linearly independent states which are mutually η -orthogonal can be deterministically masked by a pseudo-unitary operator. Moreover, we study robustness of QIM against noisy environments. The robustness of deterministic and probabilistic QIM under different quantum noise channels is analyzed in detail. Accordingly, we propose and discuss the r -uniform probabilistic QIM in multipartite systems.

arXiv:2203.03864•Laser Physics Letters•Feb 21, 2022•8 citations

Probabilistic Erasing of Quantum Information

Hongtao Zhang

According to the superposition principle of quantum states,an arbitrary quantum state can not be deterministically erased(Pati Braunstein),but may be probabilistically erased.Similar to the probabilistic cloning of quantum states by Duan Guo,in this paper a probabilistic erasing scheme is developed,i.e.,two non-orthogonal states secretly chosen from a certain set {|ψ 1〉,|ψ 2〉} can be probabilistically erased through a unitary transformation U in combination with a subsequent measurement M.The differences in characters and efficiencies between probabilistic cloning and erasing are discussed.

Acta Scicentiarum Naturalum Universitis Pekinesis•Jan 1, 2003•0 citations

Discrimination of quantum states and probabilistic quantum algorithms

János A. Bergou

In quantum information and quantum computing, the carrier of information is some quantum system and information is encoded in its state. The state, however, is not an observable in quantum mechanics, thus a fundamental problem arises: after processing the information it has to be read out or, in other words, the state of the system must be determined. When the possible target states are orthogonal, this is a relatively simple task, provided the set of possible target states is known. But when the possible target states are not orthogonal their discrimination is far from being trivial even if their set is known. Thus the problem of discriminating among non-orthogonal states is ubiquitous in quantum information and quantum computing, underlying all communication and computing schemes. It is the subject of this talk to review recent theoretical and experimental advances in this field.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 25, 2004•0 citations

Minimal classical communication and measurement complexity for quantum information splitting of a two qubit state

Siddharth Karumanchi, Sreraman Muralidharan, Prasanta Kumar Panigrahi

We provide explicit schemes for quantum information splitting (QIS) of real or equatorial two qubit states among two parties, through the five particle cluster and Brown states respectively. The schemes introduced are neither fully deterministic nor completely probabilistic and are carried out in the case where, the information that is to be shared is partially or fully known to the sender. We show that, QIS can be accomplished with just two classical bits, as against four classical bits, when the information is unknown to the sender.

arXiv:0804.4215•Apr 26, 2008•0 citations
We know that we cannot split the information encoded in two non-orthogonal qubits into complementary parts deterministically. Here we show that each of the copies of the state randomly selected from a set of non orthogonal linearly independent states, splitting of quantum information can not be done even probabilistically. Here in this work we also show that under certain restricted conditions, we can probabilistically split the quantum information encoded in a qubit.
We investigate quantum information masking for arbitrary dimensional quantum states. We show that mutually orthogonal quantum states can always be served for deterministic masking of quantum information. We further construct a probabilistic masking machine for linearly independent states. It is shown that a set of ddd-dimensional states, ${{|{a}_{1}\ensuremath{\rangle}}_{A},|{a}_{2}{\ensuremath{\rangle}}_{A},\ensuremath{\cdots},|{a}_{n}{\ensuremath{\rangle}}_{A}}, n\ensuremath{\le}d$, can be probabilistically masked by a general unitary-reduction operation if they are linearly independent. The maximal successful probability of probabilistic masking is analyzed and derived for the case of two initial states.
Abstract By studying quantum information masking (QIM) in non-Hermitian quantum systems, we show that mutually orthogonal quantum states can be deterministically masked, while an arbitrary set of quantum states cannot be masked in non-Hermitian quantum systems. We further demonstrate that a set of linearly independent states which are mutually η -orthogonal can be deterministically masked by a pseudo-unitary operator. Moreover, we study robustness of QIM against noisy environments. The robustness of deterministic and probabilistic QIM under different quantum noise channels is analyzed in detail. Accordingly, we propose and discuss the r -uniform probabilistic QIM in multipartite systems.
According to the superposition principle of quantum states,an arbitrary quantum state can not be deterministically erased(Pati Braunstein),but may be probabilistically erased.Similar to the probabilistic cloning of quantum states by Duan Guo,in this paper a probabilistic erasing scheme is developed,i.e.,two non-orthogonal states secretly chosen from a certain set {|ψ 1〉,|ψ 2〉} can be probabilistically erased through a unitary transformation U in combination with a subsequent measurement M.The differences in characters and efficiencies between probabilistic cloning and erasing are discussed.
In quantum information and quantum computing, the carrier of information is some quantum system and information is encoded in its state. The state, however, is not an observable in quantum mechanics, thus a fundamental problem arises: after processing the information it has to be read out or, in other words, the state of the system must be determined. When the possible target states are orthogonal, this is a relatively simple task, provided the set of possible target states is known. But when the possible target states are not orthogonal their discrimination is far from being trivial even if their set is known. Thus the problem of discriminating among non-orthogonal states is ubiquitous in quantum information and quantum computing, underlying all communication and computing schemes. It is the subject of this talk to review recent theoretical and experimental advances in this field.
We provide explicit schemes for quantum information splitting (QIS) of real or equatorial two qubit states among two parties, through the five particle cluster and Brown states respectively. The schemes introduced are neither fully deterministic nor completely probabilistic and are carried out in the case where, the information that is to be shared is partially or fully known to the sender. We show that, QIS can be accomplished with just two classical bits, as against four classical bits, when the information is unknown to the sender.