arXiv subjects

Chien-Ying Huang

Publications and source records attributed to Chien-Ying Huang.

3 recordsLinked to original sources

arXiv2024

Scalable Determination of Multipartite Entanglement in Quantum Networks

Quantum networks comprised of entangled end nodes serve stronger than the classical correlation for unparalleled quantum internet applications. However, practical quantum networking is affected by noise, which at its worst, causes end nodes to be described by pre-existing classical data. In such untrusted networks, determining quantum network fidelity and genuine multi-node entanglement becomes crucial. Here, we show that determining quantum network fidelity and genuine $N$-node entanglement in an untrusted star network requires only $N+1$ measurement settings. This method establishes a semi-trusted framework, allowing some nodes to relax their assumptions. Our network determination method is enabled by detecting genuine $N$-node Einstein-Podolsky-Rosen steerability. Experimentally, using spontaneous parametric down-conversion entanglement sources, we demonstrate the determinations of genuine 3-photon and 4-photon quantum networks and the false positives of the widely used entanglement witness, the fidelity criterion of $1/2$. Our results provide a scalable method for the determination of multipartite entanglement in realistic quantum networks.

quant-ph↗

arXiv2020

Counting Classical Nodes in Quantum Networks

Quantum networks illustrate the use of connected nodes of quantum systems as the backbone of distributed quantum information processing. When the network nodes are entangled in graph states, such a quantum platform is indispensable to almost all the existing distributed quantum tasks. Unfortunately, real networks unavoidably suffer from noise and technical restrictions, making nodes transit from quantum to classical at worst. Here, we introduce a figure of merit in terms of the number of classical nodes for quantum networks in arbitrary graph states. Such a network property is revealed by exploiting a novel Einstein-Podolsky-Rosen steerability. Experimentally, we demonstrate photonic quantum networks of $n_q$ quantum nodes and $n_c$ classical nodes with $n_q$ up to 6 and $n_c$ up to 18 using spontaneous parametric down-conversion entanglement sources. We show that the proposed method is faithful in quantifying the classical defects in prepared multiphoton quantum networks. Our results provide novel identification of generic quantum networks and nonclassical correlations in graph states.

quant-ph↗

arXiv2018

Securing quantum networking tasks with multipartite Einstein-Podolsky-Rosen steering

Einstein-Podolsky-Rosen (EPR) steering is the explicit demonstration of the fact that the measurements of one party can in influence the quantum state held by another, distant, party, and do so even if the measurements themselves are untrusted. This has been shown to allow one-sided device-independent quantum-information tasks between two remote parties. However, in general, advanced multiparty protocols for generic quantum technologies, such as quantum secret sharing and blind quantum computing for quantum networks, demand multipartite quantum correlations of graph states shared between more than two parties. Here, we show that, when one part of a quantum multidimensional system composed of a two-colorable graph state (e.g., cluster and Greenberger-Horne-Zeilinger states) is attacked by an eavesdropper using a universal cloning machine, only one of the copy subsystems can exhibit multipartite EPR steering but not both. Such a no-sharing restriction secures both state sources and channels against cloning-based attacks for generic quantum networking tasks, such as distributed quantum-information processing, in the presence of uncharacterized measurement apparatuses.

quant-ph↗