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:1905.00540 · Physical Review A

Deterministic versus probabilistic quantum information masking

Bo Li, Shuhan Jiang, Xiao-Bin Liang, Xianqing Li‐Jost, Heng Fan, Shao-Ming Fei

Published May 28, 2019• 28 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.99.052343

Related papers

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

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

Impossibility of Probabilistic splitting of quantum information

Indranil Chakrabarty, Binayak Samadder Choudhury

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.

arXiv:quant-ph/0608023•Aug 2, 2006•2 citations

Probabilistic Cloning and Identification of Linearly Independent Quantum States

L.-M. Duan, Guang‐Can Guo

We construct a probabilistic quantum cloning machine by a general unitary-reduction operation. With a postselection of the measurement results, the machine yields faithful copies of the input states. It is shown that the states secretly chosen from a certain set $S\phantom{\rule{0ex}{0ex}}=\phantom{\rule{0ex}{0ex}}{|{\ensuremath{\Psi}}_{1}〉,|{\ensuremath{\Psi}}_{2}〉,\dots{},|{\ensuremath{\Psi}}_{n}〉}$ can be probabilistically cloned if and only if $|{\ensuremath{\Psi}}_{1}〉,|{\ensuremath{\Psi}}_{2}〉,\dots{},\mathrm{and}|{\ensuremath{\Psi}}_{n}〉$ are linearly independent. We derive the best possible cloning efficiencies. Probabilistic cloning has a close connection with the problem of identification of a set of states, which is a type of $n+1$ outcome measurement on $n$ linearly independent states. The optimal efficiencies for this type of measurement are obtained.

arXiv:quant-ph/9804064•Physical Review Letters•Jun 1, 1998•469 citations

Probabilistic deletion of copies of linearly independent quantum states

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

We show that each of two copies of the nonorthogonal states randomly selected from a certain set S can be probabilistically deleted by a general unitary-reduction operation if and only if the states are linearly independent. We derive a tight bound on the best possible deleting efficiencies. These results for $\stackrel{\ensuremath{\rightarrow}}{2}1$ probabilistic deleting are also generalized into the case of $\stackrel{\ensuremath{\rightarrow}}{N}M$ deleting (N,M positive integers and $N>M).$

Physical Review A•Apr 25, 2002•9 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
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, ∣a1\ensuremath⟩A,∣a2\ensuremath⟩A,\ensuremath⋯,∣an\ensuremath⟩A,n\ensuremath≤d{{|{a}_{1}\ensuremath{\rangle}}_{A},|{a}_{2}{\ensuremath{\rangle}}_{A},\ensuremath{\cdots},|{a}_{n}{\ensuremath{\rangle}}_{A}}, n\ensuremath{\le}d∣a1​\ensuremath⟩A​,∣a2​\ensuremath⟩A​,\ensuremath⋯,∣an​\ensuremath⟩A​,n\ensuremath≤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.
We construct a probabilistic quantum cloning machine by a general unitary-reduction operation. With a postselection of the measurement results, the machine yields faithful copies of the input states. It is shown that the states secretly chosen from a certain set $S\phantom{\rule{0ex}{0ex}}=\phantom{\rule{0ex}{0ex}}{|{\ensuremath{\Psi}}_{1}〉,|{\ensuremath{\Psi}}_{2}〉,\dots{},|{\ensuremath{\Psi}}_{n}〉}$ can be probabilistically cloned if and only if $|{\ensuremath{\Psi}}_{1}〉,|{\ensuremath{\Psi}}_{2}〉,\dots{},\mathrm{and}|{\ensuremath{\Psi}}_{n}〉$ are linearly independent. We derive the best possible cloning efficiencies. Probabilistic cloning has a close connection with the problem of identification of a set of states, which is a type of n+1n+1n+1 outcome measurement on nnn linearly independent states. The optimal efficiencies for this type of measurement are obtained.
We show that each of two copies of the nonorthogonal states randomly selected from a certain set S can be probabilistically deleted by a general unitary-reduction operation if and only if the states are linearly independent. We derive a tight bound on the best possible deleting efficiencies. These results for $\stackrel{\ensuremath{\rightarrow}}{2}1$ probabilistic deleting are also generalized into the case of $\stackrel{\ensuremath{\rightarrow}}{N}M$ deleting (N,M positive integers and N>M).N>M).N>M).
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.