Assisted cloning of an unknown shared quantum state.


Journal

PloS one
ISSN: 1932-6203
Titre abrégé: PLoS One
Pays: United States
ID NLM: 101285081

Informations de publication

Date de publication:
2024
Historique:
received: 29 01 2024
accepted: 21 05 2024
medline: 29 8 2024
pubmed: 29 8 2024
entrez: 28 8 2024
Statut: epublish

Résumé

We first propose a novel protocol to realize quantum cloning of an arbitrary unknown shared state with assistance offered by a state preparer. The initial phase of this protocol involves the utilization of quantum teleportation (QT), enabling the transfer of quantum information from an arbitrary number of senders to another arbitrary number of receivers through a maximally entangled GHZ-type state serving as a network channel, without centralizing the information at any specific location. In the second stage of this protocol, the state preparer performs a special single-qubit projective measurement and multiple Z-basis measurements and then communicates a number of classical bits corresponding to measurement results, the perfect copy or orthogonal-complementing copy of an unknown shared state can be produced at senders hands. Then, using a non-maximally entangled GHZ-type state instead of the aforementioned quantum channel, we extend the proposed protocol from three perspectives: projective measurement, positive operator-value measurement (POVM), and a single generalized Bell-state measurement. Our schemes can relay quantum information over a network without requiring fully trusted central or intermediate nodes, and none of participants can fully access the information.

Identifiants

pubmed: 39196949
doi: 10.1371/journal.pone.0305718
pii: PONE-D-24-03893
doi:

Types de publication

Journal Article

Langues

eng

Sous-ensembles de citation

IM

Pagination

e0305718

Informations de copyright

Copyright: © 2024 Zhai et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

Déclaration de conflit d'intérêts

The authors have declared that no competing interests exist.

Auteurs

Dengxin Zhai (D)

School of Mathematics and Statistics, Kashi University, Kashi, Xinjiang, China.

Jiayin Peng (J)

School of Mathematics and Statistics, Kashi University, Kashi, Xinjiang, China.

Nueraminaimu Maihemuti (N)

School of Mathematics and Statistics, Kashi University, Kashi, Xinjiang, China.

Jiangang Tang (J)

School of Mathematics and Statistics, Kashi University, Kashi, Xinjiang, China.

Articles similaires

Selecting optimal software code descriptors-The case of Java.

Yegor Bugayenko, Zamira Kholmatova, Artem Kruglov et al.
1.00
Software Algorithms Programming Languages
1.00
Humans Magnetic Resonance Imaging Brain Infant, Newborn Infant, Premature
Humans Algorithms Software Artificial Intelligence Computer Simulation

Unsupervised learning for real-time and continuous gait phase detection.

Dollaporn Anopas, Yodchanan Wongsawat, Jetsada Arnin
1.00
Humans Gait Neural Networks, Computer Unsupervised Machine Learning Walking

Classifications MeSH