Evidence map›Paper›PMID 32080312›Full record

ArticleScientific reports2020

Identification of networking quantum teleportation on 14-qubit IBM universal quantum computer.

Ni-Ni Huang, Wei-Hao Huang, Che-Ming Li

Abstract read
In one paragraph

Article in Scientific reports, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Ni-Ni HuangDepartment of Engineering Science, National Cheng Kung University, Tainan, 70101, Taiwan.
Wei-Hao HuangDepartment of Engineering Science, National Cheng Kung University, Tainan, 70101, Taiwan.
Che-Ming LiDepartment of Engineering Science, National Cheng Kung University, Tainan, 70101, Taiwan. cmli@mail.ncku.edu.tw.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Quantum teleportation enables networking participants to move an unknown quantum state between the nodes of a quantum network, and hence constitutes an essential element in constructing large-sale quantum processors with a quantum modular architecture. Herein, we propose two protocols for teleporting qubits through an N-node quantum network in a highly-entangled box-cluster state or chain-type cluster state. The proposed protocols are systematically scalable to an arbitrary finite number N and applicable to arbitrary size of modules. The protocol based on a box-cluster state is implemented on a 14-qubit IBM quantum computer for N up to 12. To identify faithful networking teleportation, namely that the elements on real devices required for the networking teleportation process are all qualified for achieving teleportation task, we quantify quantum-mechanical processes using a generic classical-process model through which any classical strategies of mimicry of teleportation can be ruled out. From the viewpoint of achieving a genuinely quantum-mechanical process, the present work provides a novel toolbox consisting of the networking teleportation protocols and the criteria for identifying faithful teleportation for universal quantum computers with modular architectures and facilitates further improvements in the reliability of quantum-information processing.

Identifiers

PMID32080312
PMCPMC7033242

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.