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

International Journal of Theoretical Physics

Generation of Multi-qubit Graph States via Spin Networks

Min-Zhe Piao, Hong‐Fu Wang, Xiao‐Qiang Shao, Xin Ji, Shou Zhang

Published May 4, 2011• 3 citations
Publisher
DOI
10.1007/s10773-011-0803-1

Related papers

Quantum LOSR networks cannot generate graph states with high fidelity

Yi-Xuan Wang, Zhen‐Peng Xu, Otfried Gühne

Abstract Quantum networks lead to novel notions of locality and correlations and an important problem concerns the question of which quantum states can be experimentally prepared with a given network structure and devices and which not. We prove that all multi-qubit graph states arising from a connected graph cannot originate from any quantum network with bipartite sources, as long as feed-forward and quantum memories are not available. Moreover, the fidelity of a multi-qubit graph state and any network state cannot exceed 9/10. Similar results can also be established for a large class of multi-qudit graph states.

arXiv:2208.12100•npj Quantum Information•Jan 22, 2024•9 citations

Entangling multi-dot spin qubits

Vanita Srinivasa, Jacob M. Taylor, Charles Tahan

Bulletin of the American Physical Society•Mar 3, 2015•0 citations

Multi-node quantum networks based on spins and photons

Ronald Hanson

Bulletin of the American Physical Society•Mar 8, 2019•0 citations

The generation of a regular dodecahedron graph state with a superconducting qubit network

Zheng Xiao-Hu, Bing Shi, Zhuo‐Liang Cao

We propose an improved architecture for the physical implementation of two-qubit operations between arbitrary pairs of qubits by current biasing of coupled Josephson junctions. This improvement is necessary for the realization of a functional and scalable quantum computer. The proposed architecture is within the reach of current experimental technology. Secondly, we investigate a simple scheme for generating the graph states via the improved architecture. Since the controlled-phase gate between arbitrary pairs of qubits can be implemented easily, we can generate any multi-qubit graph states corresponding to various shape graphs, which meet the expectations of various quantum information processing schemes. It is a simple, scalable and feasible scheme for the generation of various graph states based on the current-controlled superconducting charge qubit network.

Superconductor Science and Technology•Aug 29, 2007•2 citations

Spin Networks, Quantum Topology and Quantum Computation

Louis Hirsch Kauffman, Samuel J. Lomonaco

Lecture notes in computer science•Jan 1, 2007•0 citations

An enhanced graph state distribution method for quantum networks

Jason Lin, Li-Yu Hsieh, Chia‐Wei Tsai

Abstract Multi-particle entanglement state distribution is a crucial component for executing the quantum communication or computation protocols over quantum networks, and the graph state is an important class of multi-particle entanglement states. If the graph states can be efficiently distributed over quantum networks, the execution costs of the quantum communication or computation protocols will be greatly improved. Therefore, this study proposes an enhanced graph state transfer algorithm, which is used to distribute the graph state across a quantum network to reduce the required number of qubit measurements, quantum operation implementation, and qubit consumption without adding any additional quantum device.

Physica Scripta•Mar 7, 2025•2 citations
Abstract Quantum networks lead to novel notions of locality and correlations and an important problem concerns the question of which quantum states can be experimentally prepared with a given network structure and devices and which not. We prove that all multi-qubit graph states arising from a connected graph cannot originate from any quantum network with bipartite sources, as long as feed-forward and quantum memories are not available. Moreover, the fidelity of a multi-qubit graph state and any network state cannot exceed 9/10. Similar results can also be established for a large class of multi-qudit graph states.
We propose an improved architecture for the physical implementation of two-qubit operations between arbitrary pairs of qubits by current biasing of coupled Josephson junctions. This improvement is necessary for the realization of a functional and scalable quantum computer. The proposed architecture is within the reach of current experimental technology. Secondly, we investigate a simple scheme for generating the graph states via the improved architecture. Since the controlled-phase gate between arbitrary pairs of qubits can be implemented easily, we can generate any multi-qubit graph states corresponding to various shape graphs, which meet the expectations of various quantum information processing schemes. It is a simple, scalable and feasible scheme for the generation of various graph states based on the current-controlled superconducting charge qubit network.
Abstract Multi-particle entanglement state distribution is a crucial component for executing the quantum communication or computation protocols over quantum networks, and the graph state is an important class of multi-particle entanglement states. If the graph states can be efficiently distributed over quantum networks, the execution costs of the quantum communication or computation protocols will be greatly improved. Therefore, this study proposes an enhanced graph state transfer algorithm, which is used to distribute the graph state across a quantum network to reduce the required number of qubit measurements, quantum operation implementation, and qubit consumption without adding any additional quantum device.