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

arXiv:1007.2441 · Journal of Statistical Mechanics Theory and Experiment

Generating Bell states in invariant stratification spin networks

M Ghojavand, M. A. Jafarizadeh, Shahin Rouhani

Published Dec 15, 2010• 1 citation
arXivHTMLPDF

Abstract

In this paper we study the generation of Bell states between distant vertices in a permanently coupled quantum spin network, interacting via invariant stratification graphs. To begin with we establish a class of upper bounds over achievable entanglement between the reference site and various vertices. We observe that the maximum of these upper bounds is 1 e-bit. We conclude that the reference site can generate a Bell state with a vertex if the corresponding upper bound of the vertex is 1 e-bit. Thus for generation of a Bell state this upper bound must be saturated. Taking this into account, we obtain the characteristic constraint of the proper graphs. We introduce a special class of antipodal invariant stratification graphs, which is called reflective, whereas the antipode vertex obeys the characteristic constraint. We also show that the antipodal association scheme graphs are reflective so Bell states can be generated between the antipodal vertices. Moreover we observe that in such graphs the proper Hamiltonian that enables creation of Bell state is the Heisenberg interaction between vertex pairs.

DOI
10.1088/1742-5468/2010/12/p12023

Related papers

Generating a GHZ state in 2m-qubit spin network

M. A. Jafarizadeh, Rahime Sufiani, Seyed Farid Taghavi +3 more

We consider a pure 2 m -qubit initial state to evolve under a particular quantum mechanical spin Hamiltonian, which can be written in terms of the adjacency matrix of the Johnson network J (2 m , m ). Then, by using some techniques such as spectral distribution and stratification associated with the graphs employed in Jafarizadeh and Sufiani (2008 Phys. Rev. A 77 022315), a maximally entangled GHZ state is generated between the antipodes of the network. In fact, an algorithm is given for determining the suitable coupling strengths of the Hamiltonian, so that a maximally entangled state can be generated between antipodes of the network. By using some known multipartite entanglement measures, the amount of entanglement of the final evolved state is calculated, and finally two examples of four-qubit and six-qubit states are considered in detail.

arXiv:1101.6040•Journal of Statistical Mechanics Theory and Experiment•May 12, 2011•3 citations

Transforming graph states to Bell-pairs is NP-Complete

Axel Dahlberg, Jonas Helsen, Stephanie Wehner

Critical to the construction of large scale quantum networks, i.e. a quantum internet, is the development of fast algorithms for managing entanglement present in the network. One fundamental building block for a quantum internet is the distribution of Bell pairs between distant nodes in the network. Here we focus on the problem of transforming multipartite entangled states into the tensor product of bipartite Bell pairs between specific nodes using only a certain class of local operations and classical communication. In particular we study the problem of deciding whether a given graph state, and in general a stabilizer state, can be transformed into a set of Bell pairs on specific vertices using only single-qubit Clifford operations, single-qubit Pauli measurements and classical communication. We prove that this problem is NP -Complete.

arXiv:1907.08019•Quantum•Oct 22, 2020•27 citations

Perfect transfer of m-qubit GHZ states

M. A. Jafarizadeh, Rahime Sufiani, Seyed Farid Taghavi +1 more

By using some techniques such as spectral distribution and stratification associated with the graphs, employed in [1,2] for the purpose of Perfect state transfer (PST) of a single qubit over antipodes of distance-regular spin networks and PST of a $d$-level quantum state over antipodes of pseudo-distance regular networks, PST of an m-qubit GHZ state is investigated. To do so, we employ the particular distance-regular networks (called Johnson networks) J(2m,m) to transfer an m-qubit GHZ state initially prepared in an arbitrary node of the network (called the reference node) to the corresponding antipode, perfectly. Keywords: Perfect state transferenc, GHZ states, Johnson network, Stratification, Spectral distribution PACs Index: 01.55.+b, 02.10.Yn

arXiv:0805.1866•May 13, 2008•1 citation

Multiparty entanglement in graph states

M. Hein, Jens Eisert, Hans J. Briegel

Graph states are multiparticle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of distributed quantum systems that play a significant role in quantum error correction, multiparty quantum communication, and quantum computation within the framework of the one-way quantum computer. We characterize and quantify the genuine multiparticle entanglement of such graph states in terms of the Schmidt measure, to which we provide upper and lower bounds in graph theoretical terms. Several examples and classes of graphs will be discussed, where these bounds coincide. These examples include trees, cluster states of different dimensions, graphs that occur in quantum error correction, such as the concatenated [7,1,3]-CSS code, and a graph associated with the quantum Fourier transform in the one-way computer. We also present general transformation rules for graphs when local Pauli measurements are applied, and give criteria for the equivalence of two graphs up to local unitary transformations, employing the stabilizer formalism. For graphs of up to seven vertices we provide complete characterization modulo local unitary transformations and graph isomorphisms.

arXiv:quant-ph/0307130•Physical Review A•Jun 9, 2004•1,035 citations

Generation and robustness of quantum entanglement in spin graphs

Jan Riegelmeyer, Dan Wignall, Marta P. Estarellas +2 more

Abstract Entanglement is a crucial resource for quantum information processing, and so protocols to generate high-fidelity entangled states on various hardware platforms are in demand. While spin chains have been extensively studied to generate entanglement, graph structures also have such potential; however, only a few classes of graphs have been explored for this specific task. In this paper, we apply a particular coupling scheme involving two different coupling strengths to a graph of two interconnected $$3\times 3$$ 3 × 3 square graphs such that it effectively contains three defects. We show how this structure allows generation of a Bell state whose fidelity depends on the chosen coupling ratio. We apply partitioned graph theory in order to reduce the dimension of the graph and show that, using a reduced graph or a reduced chain, we can still simulate the same protocol with identical dynamics. Finally, we investigate how fabrication errors affect the entanglement generation protocol and how the different equivalent structures are affected, finding that for some specific coupling ratios they are extremely robust.

arXiv:2002.07683•Quantum Information Processing•Dec 18, 2020•3 citations

Distributing Graph States Across Quantum Networks

Alexander Fischer, Don Towsley

Graph states form an important class of multipartite entangled quantum states. We propose a new approach for distributing graph states across a quantum network. We consider a quantum network consisting of nodes—quantum computers within which local operations are free—and EPR pairs shared between nodes that can continually be generated. We prove upper bounds for our approach on the number of EPR pairs consumed, completion time, and amount of classical communication required, all of which are equal to or better than that of prior work [10]. We also reduce the problem of minimizing the completion time to distribute a graph state using our approach to a network flow problem having polynomial time complexity.

arXiv:2009.10888•IEEE International Conference on Quantum Computing and Engineering (QCE)•Oct 1, 2021•27 citations
In this paper we study the generation of Bell states between distant vertices in a permanently coupled quantum spin network, interacting via invariant stratification graphs. To begin with we establish a class of upper bounds over achievable entanglement between the reference site and various vertices. We observe that the maximum of these upper bounds is 1 e-bit. We conclude that the reference site can generate a Bell state with a vertex if the corresponding upper bound of the vertex is 1 e-bit. Thus for generation of a Bell state this upper bound must be saturated. Taking this into account, we obtain the characteristic constraint of the proper graphs. We introduce a special class of antipodal invariant stratification graphs, which is called reflective, whereas the antipode vertex obeys the characteristic constraint. We also show that the antipodal association scheme graphs are reflective so Bell states can be generated between the antipodal vertices. Moreover we observe that in such graphs the proper Hamiltonian that enables creation of Bell state is the Heisenberg interaction between vertex pairs.
We consider a pure 2 m -qubit initial state to evolve under a particular quantum mechanical spin Hamiltonian, which can be written in terms of the adjacency matrix of the Johnson network J (2 m , m ). Then, by using some techniques such as spectral distribution and stratification associated with the graphs employed in Jafarizadeh and Sufiani (2008 Phys. Rev. A 77 022315), a maximally entangled GHZ state is generated between the antipodes of the network. In fact, an algorithm is given for determining the suitable coupling strengths of the Hamiltonian, so that a maximally entangled state can be generated between antipodes of the network. By using some known multipartite entanglement measures, the amount of entanglement of the final evolved state is calculated, and finally two examples of four-qubit and six-qubit states are considered in detail.
Critical to the construction of large scale quantum networks, i.e. a quantum internet, is the development of fast algorithms for managing entanglement present in the network. One fundamental building block for a quantum internet is the distribution of Bell pairs between distant nodes in the network. Here we focus on the problem of transforming multipartite entangled states into the tensor product of bipartite Bell pairs between specific nodes using only a certain class of local operations and classical communication. In particular we study the problem of deciding whether a given graph state, and in general a stabilizer state, can be transformed into a set of Bell pairs on specific vertices using only single-qubit Clifford operations, single-qubit Pauli measurements and classical communication. We prove that this problem is NP -Complete.
By using some techniques such as spectral distribution and stratification associated with the graphs, employed in [1,2] for the purpose of Perfect state transfer (PST) of a single qubit over antipodes of distance-regular spin networks and PST of a ddd-level quantum state over antipodes of pseudo-distance regular networks, PST of an m-qubit GHZ state is investigated. To do so, we employ the particular distance-regular networks (called Johnson networks) J(2m,m) to transfer an m-qubit GHZ state initially prepared in an arbitrary node of the network (called the reference node) to the corresponding antipode, perfectly. Keywords: Perfect state transferenc, GHZ states, Johnson network, Stratification, Spectral distribution PACs Index: 01.55.+b, 02.10.Yn
Graph states are multiparticle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of distributed quantum systems that play a significant role in quantum error correction, multiparty quantum communication, and quantum computation within the framework of the one-way quantum computer. We characterize and quantify the genuine multiparticle entanglement of such graph states in terms of the Schmidt measure, to which we provide upper and lower bounds in graph theoretical terms. Several examples and classes of graphs will be discussed, where these bounds coincide. These examples include trees, cluster states of different dimensions, graphs that occur in quantum error correction, such as the concatenated [7,1,3]-CSS code, and a graph associated with the quantum Fourier transform in the one-way computer. We also present general transformation rules for graphs when local Pauli measurements are applied, and give criteria for the equivalence of two graphs up to local unitary transformations, employing the stabilizer formalism. For graphs of up to seven vertices we provide complete characterization modulo local unitary transformations and graph isomorphisms.
Abstract Entanglement is a crucial resource for quantum information processing, and so protocols to generate high-fidelity entangled states on various hardware platforms are in demand. While spin chains have been extensively studied to generate entanglement, graph structures also have such potential; however, only a few classes of graphs have been explored for this specific task. In this paper, we apply a particular coupling scheme involving two different coupling strengths to a graph of two interconnected 3×33\times 33×3 3 × 3 square graphs such that it effectively contains three defects. We show how this structure allows generation of a Bell state whose fidelity depends on the chosen coupling ratio. We apply partitioned graph theory in order to reduce the dimension of the graph and show that, using a reduced graph or a reduced chain, we can still simulate the same protocol with identical dynamics. Finally, we investigate how fabrication errors affect the entanglement generation protocol and how the different equivalent structures are affected, finding that for some specific coupling ratios they are extremely robust.
Graph states form an important class of multipartite entangled quantum states. We propose a new approach for distributing graph states across a quantum network. We consider a quantum network consisting of nodes—quantum computers within which local operations are free—and EPR pairs shared between nodes that can continually be generated. We prove upper bounds for our approach on the number of EPR pairs consumed, completion time, and amount of classical communication required, all of which are equal to or better than that of prior work [10]. We also reduce the problem of minimizing the completion time to distribute a graph state using our approach to a network flow problem having polynomial time complexity.