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:2112.06059

Continuous variable graph states: entanglement and graph properties

Kh. P. Gnatenko, V. M. Tkachuk, Mariana Krasnytska, Yurij V. Holovatch

Published Dec 11, 2021• 0 citations
arXivHTMLPDF

Abstract

We propose the definition of the geometric measure of entanglement for continuous variable states. On the basis of this definition we examine entanglement of the graph states obtained as a result of action of a unitary operator on the ground state of a system of $N$ noninteracting harmonic oscillators. We find that the entanglement of a harmonic oscillator with other ones is defined by the value of its vertex degree.

DOI
10.48550/arxiv.2112.06059

Related papers

Geometric measure of entanglement of multi-qubit graph states and its detection on a quantum computer

Kh. P. Gnatenko, N. A. Susulovska

Abstract Multi-qubit graph states generated by the action of controlled phase shift operators on a separable quantum state of a system, in which all the qubits are in arbitrary identical states, are examined. The geometric measure of entanglement of a qubit with other qubits is found for the graph states represented by arbitrary graphs. The entanglement depends on the degree of the vertex representing the qubit, the absolute values of the parameter of the phase shift gate and the parameter of state the gate is acting on. Also the geometric measure of entanglement of the graph states is quantified on the quantum computer . The results obtained on the quantum device are in good agreement with analytical ones.

arXiv:2106.10688•Europhysics Letters (EPL)•Nov 1, 2021•23 citations

Quantifying Geometric Measure of Entanglement of Multi-qubit Graph States on the IBM’s Quantum Computer

N. A. Susulovska, Kh. P. Gnatenko

Quantum entanglement gives rise to a range of non-classical effects, which are extensively exploited in quantum computing and quantum communication. Therefore, detection and quantification of entanglement as well as preparation of highly entangled quantum states remain the fundamental objectives in these fields. Much attention has been devoted to the studies of graph states, which play a role of a central resource in quantum error correction, quantum cryptography and practical quantum metrology in the presence of noise.We examine multi-qubit graph states generated by the action of controlled phase shift operators on a separable quantum state of a system, in which all the qubits are in arbitrary identical states. Analytical expression is obtained for the geometric measure of entanglement of a qubit with other qubits in graph states represented by arbitrary graphs. We conclude that this quantity depends on the degree of the vertex corresponding to the qubit, the absolute values of the parameter of the phase shift gate and the parameter of the initial state the gate is acting on. Moreover, the geometric measure of entanglement of certain types of graph states is quantified on the IBM’s quantum computer ibmq_athens based on the measurements of the mean spin. Namely, we consider states associated with the native connectivity of ibmq_athens, the claw and the complete graphs. Appropriate protocols are proposed to prepare these states on the quantum computer. The results of quantum computations verify our theoretical findings [1].

IEEE International Conference on Quantum Computing and Engineering (QCE)•Oct 1, 2021•3 citations

Entanglement in Quantum Systems Based on Directed Graphs

Lucio De Simone, Roberto Franzosi

Abstract The entanglement properties of quantum states associated with directed graphs are investigated. Using a measure derived from the Fubini–Study metric, multipartite entanglement is quantitatively related to the local connectivity of the graph. In Entanglement in Directed Graph States (2025), arXiv:2505.10716, it is demonstrated that the vertex degree distribution fully determines this entanglement measure and remains invariant under vertex relabeling, highlighting its topological character. As a consequence, the measure depends only on the total degree of each vertex, making it independent of the distinction between incoming and outgoing edges. This framework is applied to several specific graph structures, including hierarchical networks, neural network–inspired graphs, full binary tree and linear bridged cycle graphs, demonstrating how their combinatorial properties influence entanglement distribution. These results provide a geometric perspective on quantum correlations in complex systems, offering potential applications in the design and analysis of quantum networks.

arXiv:2509.05214•Advanced Quantum Technologies•Sep 25, 2025•7 citations

Unveiling the geometric meaning of quantum entanglement: Discrete and continuous variable systems

Arthur Vesperini, Ghofrane Bel-Hadj-Aissa, Lorenzo Capra +1 more

We show that the manifold of quantum states is endowed with a rich and nontrivial geometric structure. We derive the Fubini–Study metric of the projective Hilbert space of a multi-qubit quantum system, endowing it with a Riemannian metric structure, and investigate its deep link with the entanglement of the states of this space. As a measure, we adopt the entanglement distance E preliminary proposed in Phys. Rev. A 101, 042129 (2020). Our analysis shows that entanglement has a geometric interpretation: E(∣ψ〉) is the minimum value of the sum of the squared distances between ∣ψ〉 and its conjugate states, namely the states νμ · σμ∣ψ〉, where νμ are unit vectors and μ runs on the number of parties. Within the proposed geometric approach, we derive a general method to determine when two states are not the same state up to the action of local unitary operators. Furthermore, we prove that the entanglement distance, along with its convex roof expansion to mixed states, fulfils the three conditions required for an entanglement measure, that is: i) E(∣ψ〉) = 0 iff ∣ψ〉 is fully separable; ii) E is invariant under local unitary transformations; iii) E does not increase under local operation and classical communications. Two different proofs are provided for this latter property. We also show that in the case of two qubits pure states, the entanglement distance for a state ∣ψ〉 coincides with two times the square of the concurrence of this state. We propose a generalization of the entanglement distance to continuous variable systems. Finally, we apply the proposed geometric approach to the study of the entanglement magnitude and the equivalence classes properties, of three families of states linked to the Greenberger–Horne–Zeilinger states, the Briegel Raussendorf states and the W states. As an example of application for the case of a system with continuous variables, we have considered a system of two coupled Glauber coherent states.

arXiv:2307.16835•Frontiers of Physics•Apr 16, 2024•23 citations

Geometric Measure of Entanglement of Quantum Graph States Prepared with Controlled Phase Shift Operators

N. A. Susulovska

We will consider graph states generated by the action of controlled phase shift operators on a separable state of a multiqubit system. The case where all the qubits are initially prepared in arbitrary states is investigated. We will obtain the geometric measure of entanglement of a qubit with the remaining system in graph states represented by arbitrary weighted graphs and will establish its relationship with state parameters. For two-qubit graph states, the geometric measure of entanglement is also quantified on IBM’s simulator Qiskit Aer and quantum processor ibmq lima based on auxiliary mean spin measurements. The results of quantum computations verify our analytic predictions.

arXiv:2401.14997•Ukrainian Journal of Physics•Mar 19, 2025•2 citations

Determing the entanglement of quantum nonbinary graph states

Jian Xu, Xiaoyu Chen, Haitao Li

Graph states are multipartite entangled states that correspond to mathematical graphs, where the vertices of the graph now play the role of quantum multilevel systems and edges represent interactions of the systems. Graph states are the basis of quantum error correction and one-way quantum computer. We systematically study the entanglement of non-binary graph states. Using iterative algorithm and entanglement bounds, we calculate the entanglement of all the ternary graph states up to nine vertices and parts of quaternary and quinary graph states modulo local unitary transformations and graph isomorphisms. The entanglement measure can be the geometric measure, the measure of relative entropy of entanglement or the measure of logarithmic robustness. We classify the graph states according to the entanglement values obtained. The closest product states obtained in the calculations are studied.

Acta Physica Sinica•Jan 1, 2012•2 citations
We propose the definition of the geometric measure of entanglement for continuous variable states. On the basis of this definition we examine entanglement of the graph states obtained as a result of action of a unitary operator on the ground state of a system of NNN noninteracting harmonic oscillators. We find that the entanglement of a harmonic oscillator with other ones is defined by the value of its vertex degree.
Abstract Multi-qubit graph states generated by the action of controlled phase shift operators on a separable quantum state of a system, in which all the qubits are in arbitrary identical states, are examined. The geometric measure of entanglement of a qubit with other qubits is found for the graph states represented by arbitrary graphs. The entanglement depends on the degree of the vertex representing the qubit, the absolute values of the parameter of the phase shift gate and the parameter of state the gate is acting on. Also the geometric measure of entanglement of the graph states is quantified on the quantum computer . The results obtained on the quantum device are in good agreement with analytical ones.
Quantum entanglement gives rise to a range of non-classical effects, which are extensively exploited in quantum computing and quantum communication. Therefore, detection and quantification of entanglement as well as preparation of highly entangled quantum states remain the fundamental objectives in these fields. Much attention has been devoted to the studies of graph states, which play a role of a central resource in quantum error correction, quantum cryptography and practical quantum metrology in the presence of noise.We examine multi-qubit graph states generated by the action of controlled phase shift operators on a separable quantum state of a system, in which all the qubits are in arbitrary identical states. Analytical expression is obtained for the geometric measure of entanglement of a qubit with other qubits in graph states represented by arbitrary graphs. We conclude that this quantity depends on the degree of the vertex corresponding to the qubit, the absolute values of the parameter of the phase shift gate and the parameter of the initial state the gate is acting on. Moreover, the geometric measure of entanglement of certain types of graph states is quantified on the IBM’s quantum computer ibmq_athens based on the measurements of the mean spin. Namely, we consider states associated with the native connectivity of ibmq_athens, the claw and the complete graphs. Appropriate protocols are proposed to prepare these states on the quantum computer. The results of quantum computations verify our theoretical findings [1].
Abstract The entanglement properties of quantum states associated with directed graphs are investigated. Using a measure derived from the Fubini–Study metric, multipartite entanglement is quantitatively related to the local connectivity of the graph. In Entanglement in Directed Graph States (2025), arXiv:2505.10716, it is demonstrated that the vertex degree distribution fully determines this entanglement measure and remains invariant under vertex relabeling, highlighting its topological character. As a consequence, the measure depends only on the total degree of each vertex, making it independent of the distinction between incoming and outgoing edges. This framework is applied to several specific graph structures, including hierarchical networks, neural network–inspired graphs, full binary tree and linear bridged cycle graphs, demonstrating how their combinatorial properties influence entanglement distribution. These results provide a geometric perspective on quantum correlations in complex systems, offering potential applications in the design and analysis of quantum networks.
We show that the manifold of quantum states is endowed with a rich and nontrivial geometric structure. We derive the Fubini–Study metric of the projective Hilbert space of a multi-qubit quantum system, endowing it with a Riemannian metric structure, and investigate its deep link with the entanglement of the states of this space. As a measure, we adopt the entanglement distance E preliminary proposed in Phys. Rev. A 101, 042129 (2020). Our analysis shows that entanglement has a geometric interpretation: E(∣ψ〉) is the minimum value of the sum of the squared distances between ∣ψ〉 and its conjugate states, namely the states νμ · σμ∣ψ〉, where νμ are unit vectors and μ runs on the number of parties. Within the proposed geometric approach, we derive a general method to determine when two states are not the same state up to the action of local unitary operators. Furthermore, we prove that the entanglement distance, along with its convex roof expansion to mixed states, fulfils the three conditions required for an entanglement measure, that is: i) E(∣ψ〉) = 0 iff ∣ψ〉 is fully separable; ii) E is invariant under local unitary transformations; iii) E does not increase under local operation and classical communications. Two different proofs are provided for this latter property. We also show that in the case of two qubits pure states, the entanglement distance for a state ∣ψ〉 coincides with two times the square of the concurrence of this state. We propose a generalization of the entanglement distance to continuous variable systems. Finally, we apply the proposed geometric approach to the study of the entanglement magnitude and the equivalence classes properties, of three families of states linked to the Greenberger–Horne–Zeilinger states, the Briegel Raussendorf states and the W states. As an example of application for the case of a system with continuous variables, we have considered a system of two coupled Glauber coherent states.
We will consider graph states generated by the action of controlled phase shift operators on a separable state of a multiqubit system. The case where all the qubits are initially prepared in arbitrary states is investigated. We will obtain the geometric measure of entanglement of a qubit with the remaining system in graph states represented by arbitrary weighted graphs and will establish its relationship with state parameters. For two-qubit graph states, the geometric measure of entanglement is also quantified on IBM’s simulator Qiskit Aer and quantum processor ibmq lima based on auxiliary mean spin measurements. The results of quantum computations verify our analytic predictions.
Graph states are multipartite entangled states that correspond to mathematical graphs, where the vertices of the graph now play the role of quantum multilevel systems and edges represent interactions of the systems. Graph states are the basis of quantum error correction and one-way quantum computer. We systematically study the entanglement of non-binary graph states. Using iterative algorithm and entanglement bounds, we calculate the entanglement of all the ternary graph states up to nine vertices and parts of quaternary and quinary graph states modulo local unitary transformations and graph isomorphisms. The entanglement measure can be the geometric measure, the measure of relative entropy of entanglement or the measure of logarithmic robustness. We classify the graph states according to the entanglement values obtained. The closest product states obtained in the calculations are studied.