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

Acta Physica Sinica

Collaborative quantum computation with redundant graph state

Yuling Tian, Tianfeng Feng, Xiao-Qi Zhou

Published Jan 1, 2019• 4 citations
Publisher

Abstract

Quantum computation is a computing model based on quantum theory, which can outperform the classical computation in solving certain problems. With the increase of the complexity of quantum computing tasks, it becomes important to distribute quantum computing resources to multi-parties to cooperatively fulfill the complex tasks. Here in this paper a scheme based on the one-way quantum computing model is proposed to realize collaborative quantum computation. The standard one-way quantum computing model is based on graph states. With graph states used as resources, one can realize a universal quantum computer through using single-qubit measurements and feed-forward. In contrast to the standard one-way computation, the main resource for collaborative quantum computation is a redundant graph state (also a multi-particle highly entangled state). Unlike in the traditional graph state where each particle corresponds to a specific node, in a redundant graph state, several particles correspond to a single node, which means that each node of the graph has several redundant copies. With the help of a redundant graph state, several parties can share a graph state flexibly at will. A redundant graph state is prepared and then distributed to several parties where each of them obtains a full copy of all nodes. By communicating with each other and measuring the particles in different ways, a standard graph state is prepared and distributed among these parties. The collaborative computation then finishes through the common one-way quantum computing operations. Besides the general scheme, a concrete optical implementation of a two-party cooperative single-qubit quantum state preparation based on a six-photon redundant graph state is also put forward. Such a redundant graph state is proposed to be prepared by using the spontaneous parametric down-conversion entangled source and quantum interference. With this redundant graph state, a standard three-node graph state can be shared with the two parties in an arbitrary way. This scheme does not only make the collaborative quantum computation across several parties possible and flexible, but also guarantee the privacy of each party’s operations. This feature would be particularly useful in the case where the computing resource is obtained from an outside provider. This scheme paves the way for realizing quantum computation in more general and complicated applications.

DOI
10.7498/aps.68.20190142

Related papers

Distribution and Segmentation Methods of Graph States Based on Quantum Networks

Haomin Chen, Tianze Zhu, G. Yu +2 more

In recent years, quantum communication and quantum computing have become strategic technologies of great importance to countries around the world, with profound implications for individuals, businesses, and even nations. Among these, graph states are a very important class of multi-particle entangled states, playing a crucial role in fields such as quantum secret sharing, measurement-based quantum computing, and quantum metrology. However, the distribution of graph states faces the following challenges: existing quantum communication networks designed for single-qubit transmission cannot effectively accomplish graph state distribution tasks, and current methods for graph state distribution lack consideration of node resources, making it difficult to complete graph state distribution in some cases.We conduct research on cross-node graph states distribution methods in quantum communication networks under limited resource constraints. To address the issue that current quantum communication networks cannot handle graph states and other multi-particle entangled states, a graph state distribution method is proposed. This method combines local operations and classical communication to meet the distribution requirements for graph states, which are multi-particle entangled states. Additionally, to solve the problem of limited quantum resources at individual nodes, we proposed a graph states segmentation method. This method divides a complete graph state into subgraphs for distribution and subsequently integrates them, enabling graph state distribution services in a broader range of resource scenarios.

International Conference on Advanced Communications Technology (ICACT)•Feb 16, 2025•1 citation

Graph-Based Quantum Parallel Teleportation in Quantum Wireless Multi-Hop Networks

Huamei Qi, Tailong Xiao, Ying Guo

Motivated by multi-particle entanglement, we propose a multi-party quantum parallel teleportation scheme in quantum wireless multi-hop networks (QWMNs) investigated with four-vertex graph-based entanglement. We show an ar- bitrary single-qubit quantum teleportation with graph state between directly connected two-party and an arbitrary two- qubit quantum teleportation based on four-vertex graph state followed by the multi-parity quantum teleportation based on four-vertex graph state where source node do not need share any entangled pairs with destination node but via intermediate nodes’ quantum swapping to finish the teleportation. Source node and intermediate nodes conduct von Neumann measurement and transmit their classical outcomes to the destination node independently in a parallel manner. Then destination node applies appropriate unitary operation to recover the source quantum state according to the received outcomes. This graph- based scheme extends the entanglement pattern in quantum teleportation, provides a perfect multi-party teleportation model. The proposed scheme improves the constructing flexibility of the network and reduces the communication delay, which has a wide application in quantum route selection.

IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA)•Dec 1, 2017•2 citations

A compiler for universal photonic quantum computers

Felix Zilk, Korbinian Staudacher, Tobias Guggemos +3 more

Photons are a natural resource in quantum information, and the last decade showed significant progress in high-quality single photon generation and detection. Furthermore, photonic qubits are easy to manipulate and do not require particularly strongly sealed environments, making them an appealing platform for quantum computing. With the one-way model, the vision of a universal and largescale quantum computer based on photonics becomes feasible. In one-way computing, the input state is not an initial product state$\vert\boldsymbol{0}\rangle^{\otimes n}$, but a socalled cluster state. A series of measurements on the cluster state's individual qubits and their temporal order, together with a feed-forward procedure, determine the quantum circuit to be executed. We propose a pipeline to convert a QASM circuit into a graph representation named measurement-graph (m-graph), that can be directly translated to hardware instructions on an optical one-way quantum computer. In addition, we optimize the graph using ZX-Calculus before evaluating the execution on an experimental discrete variable photonic platform.

arXiv:2210.09251•IEEE/ACM International Workshop on Quantum Computing Software (QCS)•Nov 1, 2022•21 citations

Experimental demonstration of one-way quantum computation on an ensemble quantum computer

Chenyong Ju, Jing Zhu, Xinhua Peng +3 more

One-way quantum computing is an important and novel approach to quantum computation. By exploiting the existing particle-particle interactions, we report the first experimental realization of the complete process of deterministic one-way quantum Deutsch-Josza algorithm in NMR, including graph state preparation, single-qubit measurements and feed-forward corrections. The findings in our experiment may shed light on the future scalable one-way quantum computation.

•Jun 5, 2008•0 citations

APPLICATIONS OF ATOMIC ENSEMBLES IN DISTRIBUTED QUANTUM COMPUTING

Marcin Zwierz, Pieter Kok

Thesis chapter. The fragility of quantum information is a fundamental constraint faced by anyone trying to build a quantum computer. A truly useful and powerful quantum computer has to be a robust and scalable machine. In the case of many qubits which may interact with the environment and their neighbors, protection against decoherence becomes quite a challenging task. The scalability and decoherence issues are the main difficulties addressed by the distributed model of quantum computation. A distributed quantum computer consists of a large quantum network of distant nodes — stationary qubits which communicate via flying qubits. Quantum information can be transferred, stored, processed and retrieved in decoherence-free fashion by nodes of a quantum network realized by an atomic medium — an atomic quantum memory. Atomic quantum memories have been developed and demonstrated experimentally in recent years. With the help of linear optics and laser pulses, one is able to manipulate quantum information stored inside an atomic quantum memory by means of electromagnetically induced transparency and associated propagation phenomena. Any quantum computation or communication necessarily involves entanglement. Therefore, one must be able to entangle distant nodes of a distributed network. In this article, we focus on the probabilistic entanglement generation procedures such as well-known DLCZ protocol. We also demonstrate theoretically a scheme based on atomic ensembles and the dipole blockade mechanism for generation of inherently distributed quantum states so-called cluster states. In the protocol, atomic ensembles serve as single qubit systems. Hence, we review single-qubit operations on qubit defined as collective states of atomic ensemble. Our entangling protocol requires nearly identical single-photon sources, one ultra-cold ensemble per physical qubit, and regular photodetectors. The general entangling procedure is presented, as well as a procedure that generates in a single stepQ-qubit GHZ states with success probability psuccess ~ ηQ/2, where η is the combined detection and source efficiency. This is significantly more efficient than any known robust probabilistic entangling operation. The GHZ states form the basic building block for universal cluster states, a resource for the one-way quantum computer.

International Journal of Quantum Information•Feb 1, 2010•4 citations

Quantum Network Security: A Multi-Party Computation Protocol Leveraging Quantum Key Distribution and Quantum State Secure Computation

Jincheng Zhang

This paper presents a novel protocol for secure multi-party computation (MPC) within a quantum network, integrating Quantum Key Distribution (QKD) and quantum state secure computation techniques. The core objective is to enable multiple parties to collaboratively perform computations without revealing their individual inputs. The proposed protocol establishes a secure communication channel using QKD, guaranteeing the exchange of secret keys. Subsequently, a quantum state secure multi-party computation algorithm is employed, ensuring the confidentiality and integrity of the computation process. The utilization of quantum key distribution significantly enhances the security of the entire system, mitigating vulnerabilities associated with traditional MPC schemes. The theoretical analysis demonstrates the protocol's resilience against various attacks, providing a foundation for building robust and secure quantum network applications. The protocol's effectiveness hinges on the ability to maintain quantum coherence during the computational steps and accurately manage the quantum key distribution process. This research contributes to the advancement of secure quantum computing and communication technologies.

•Aug 31, 2026•0 citations
Quantum computation is a computing model based on quantum theory, which can outperform the classical computation in solving certain problems. With the increase of the complexity of quantum computing tasks, it becomes important to distribute quantum computing resources to multi-parties to cooperatively fulfill the complex tasks. Here in this paper a scheme based on the one-way quantum computing model is proposed to realize collaborative quantum computation. The standard one-way quantum computing model is based on graph states. With graph states used as resources, one can realize a universal quantum computer through using single-qubit measurements and feed-forward. In contrast to the standard one-way computation, the main resource for collaborative quantum computation is a redundant graph state (also a multi-particle highly entangled state). Unlike in the traditional graph state where each particle corresponds to a specific node, in a redundant graph state, several particles correspond to a single node, which means that each node of the graph has several redundant copies. With the help of a redundant graph state, several parties can share a graph state flexibly at will. A redundant graph state is prepared and then distributed to several parties where each of them obtains a full copy of all nodes. By communicating with each other and measuring the particles in different ways, a standard graph state is prepared and distributed among these parties. The collaborative computation then finishes through the common one-way quantum computing operations. Besides the general scheme, a concrete optical implementation of a two-party cooperative single-qubit quantum state preparation based on a six-photon redundant graph state is also put forward. Such a redundant graph state is proposed to be prepared by using the spontaneous parametric down-conversion entangled source and quantum interference. With this redundant graph state, a standard three-node graph state can be shared with the two parties in an arbitrary way. This scheme does not only make the collaborative quantum computation across several parties possible and flexible, but also guarantee the privacy of each party’s operations. This feature would be particularly useful in the case where the computing resource is obtained from an outside provider. This scheme paves the way for realizing quantum computation in more general and complicated applications.
In recent years, quantum communication and quantum computing have become strategic technologies of great importance to countries around the world, with profound implications for individuals, businesses, and even nations. Among these, graph states are a very important class of multi-particle entangled states, playing a crucial role in fields such as quantum secret sharing, measurement-based quantum computing, and quantum metrology. However, the distribution of graph states faces the following challenges: existing quantum communication networks designed for single-qubit transmission cannot effectively accomplish graph state distribution tasks, and current methods for graph state distribution lack consideration of node resources, making it difficult to complete graph state distribution in some cases.We conduct research on cross-node graph states distribution methods in quantum communication networks under limited resource constraints. To address the issue that current quantum communication networks cannot handle graph states and other multi-particle entangled states, a graph state distribution method is proposed. This method combines local operations and classical communication to meet the distribution requirements for graph states, which are multi-particle entangled states. Additionally, to solve the problem of limited quantum resources at individual nodes, we proposed a graph states segmentation method. This method divides a complete graph state into subgraphs for distribution and subsequently integrates them, enabling graph state distribution services in a broader range of resource scenarios.
Motivated by multi-particle entanglement, we propose a multi-party quantum parallel teleportation scheme in quantum wireless multi-hop networks (QWMNs) investigated with four-vertex graph-based entanglement. We show an ar- bitrary single-qubit quantum teleportation with graph state between directly connected two-party and an arbitrary two- qubit quantum teleportation based on four-vertex graph state followed by the multi-parity quantum teleportation based on four-vertex graph state where source node do not need share any entangled pairs with destination node but via intermediate nodes’ quantum swapping to finish the teleportation. Source node and intermediate nodes conduct von Neumann measurement and transmit their classical outcomes to the destination node independently in a parallel manner. Then destination node applies appropriate unitary operation to recover the source quantum state according to the received outcomes. This graph- based scheme extends the entanglement pattern in quantum teleportation, provides a perfect multi-party teleportation model. The proposed scheme improves the constructing flexibility of the network and reduces the communication delay, which has a wide application in quantum route selection.
Photons are a natural resource in quantum information, and the last decade showed significant progress in high-quality single photon generation and detection. Furthermore, photonic qubits are easy to manipulate and do not require particularly strongly sealed environments, making them an appealing platform for quantum computing. With the one-way model, the vision of a universal and largescale quantum computer based on photonics becomes feasible. In one-way computing, the input state is not an initial product state∣0⟩⊗n\vert\boldsymbol{0}\rangle^{\otimes n}∣0⟩⊗n, but a socalled cluster state. A series of measurements on the cluster state's individual qubits and their temporal order, together with a feed-forward procedure, determine the quantum circuit to be executed. We propose a pipeline to convert a QASM circuit into a graph representation named measurement-graph (m-graph), that can be directly translated to hardware instructions on an optical one-way quantum computer. In addition, we optimize the graph using ZX-Calculus before evaluating the execution on an experimental discrete variable photonic platform.
Thesis chapter. The fragility of quantum information is a fundamental constraint faced by anyone trying to build a quantum computer. A truly useful and powerful quantum computer has to be a robust and scalable machine. In the case of many qubits which may interact with the environment and their neighbors, protection against decoherence becomes quite a challenging task. The scalability and decoherence issues are the main difficulties addressed by the distributed model of quantum computation. A distributed quantum computer consists of a large quantum network of distant nodes — stationary qubits which communicate via flying qubits. Quantum information can be transferred, stored, processed and retrieved in decoherence-free fashion by nodes of a quantum network realized by an atomic medium — an atomic quantum memory. Atomic quantum memories have been developed and demonstrated experimentally in recent years. With the help of linear optics and laser pulses, one is able to manipulate quantum information stored inside an atomic quantum memory by means of electromagnetically induced transparency and associated propagation phenomena. Any quantum computation or communication necessarily involves entanglement. Therefore, one must be able to entangle distant nodes of a distributed network. In this article, we focus on the probabilistic entanglement generation procedures such as well-known DLCZ protocol. We also demonstrate theoretically a scheme based on atomic ensembles and the dipole blockade mechanism for generation of inherently distributed quantum states so-called cluster states. In the protocol, atomic ensembles serve as single qubit systems. Hence, we review single-qubit operations on qubit defined as collective states of atomic ensemble. Our entangling protocol requires nearly identical single-photon sources, one ultra-cold ensemble per physical qubit, and regular photodetectors. The general entangling procedure is presented, as well as a procedure that generates in a single stepQ-qubit GHZ states with success probability psuccess ~ ηQ/2, where η is the combined detection and source efficiency. This is significantly more efficient than any known robust probabilistic entangling operation. The GHZ states form the basic building block for universal cluster states, a resource for the one-way quantum computer.
This paper presents a novel protocol for secure multi-party computation (MPC) within a quantum network, integrating Quantum Key Distribution (QKD) and quantum state secure computation techniques. The core objective is to enable multiple parties to collaboratively perform computations without revealing their individual inputs. The proposed protocol establishes a secure communication channel using QKD, guaranteeing the exchange of secret keys. Subsequently, a quantum state secure multi-party computation algorithm is employed, ensuring the confidentiality and integrity of the computation process. The utilization of quantum key distribution significantly enhances the security of the entire system, mitigating vulnerabilities associated with traditional MPC schemes. The theoretical analysis demonstrates the protocol's resilience against various attacks, providing a foundation for building robust and secure quantum network applications. The protocol's effectiveness hinges on the ability to maintain quantum coherence during the computational steps and accurately manage the quantum key distribution process. This research contributes to the advancement of secure quantum computing and communication technologies.