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

IEEE International Conference on Quantum Computing and Engineering (QCE)

Quantum and Classical Calculations of the Entanglement Distance of Multi-Qubit One-Layer Variational Quantum States

Kh. P. Gnatenko

Published Aug 30, 2025• 0 citations
Publisher

Abstract

We consider multi-qubit entangled quantum states known in the literature as one-layer variational quantum states. The states can also be considered as quantum graph states representing directed and weighted graphs. The corresponding variational quantum protocols include$R Y, R Z$, and entangling blocks with$R X X$gates. We examine the general case in which the entangling blocks have an arbitrary structure, namely,$R X X$gates are applied to arbitrary pairs of qubits. This case corresponds to an arbitrary structure of the associated weighted and directed graphs. Variational quantum states, as well as quantum graph states, have broad applications in various fields of quantum computing, including quantum machine learning, quantum error correction, and optimization algorithms, and others. One of the key resources in quantum computing is entanglement. We analytically calculate the entanglement distance for variational quantum states with entangling blocks of arbitrary structure. The dependence of entanglement on the parameters of the variational quantum state and on the characteristics of the corresponding weighted and directed graphs is investigated. We find that the entanglement of a qubit with other qubits in the state depends on the outdegree and indegree of the corresponding vertex in the graph, as well as on the weights of the incoming and outgoing arcs associated with that vertex. Quantum protocols for quantifying the entanglement distance of variational quantum states have been constructed. For particular cases of variational quantum states, the dependence of entanglement distance on the state parameters has been examined using quantum computation on the Aer simulator.

DOI
10.1109/qce65121.2025.10400

Related papers

Properties of multi-qubit variational quantum states representing weighted graphs and their computing with quantum programming

Kh. P. Gnatenko, A. Kaczmarek

We study multi-qubit variational quantum states that can be considered as vertex- and edge-weighted graph. These states are constructed as single-layer variational circuits with $RX$ rotations and $RZZ$ entangling gates, corresponding to graphs of arbitrary structure. In general case of quantum graph states of arbitrary structure we derive the geometric measure of entanglement and evaluate quantum correlators. It is shown that these quantities are related to the edge-weight structure around the corresponding vertices in the graph (i.e., edge weights incident to the vertices and vertex weights associated with their closed neighborhoods). In the special case of quantum states representing unweighted graphs, these quantities are related to the degrees of the corresponding vertices in the graph. As an example, we analyze the state associated with the star graph $K_{1,4}$ using noisy quantum computing on the AerSimulator. The results are in good agreement with theoretical predictions. These findings demonstrate a connection between graph structure and quantum properties, enabling the study of properties of classical graphs via quantum computing.

quant-pharXiv:2604.00958•Apr 2, 2026•0 citations

Entanglement of multi-qubit quantum graph states and studies structural properties of tripartite graphs with quantum computing

Kh. P. Gnatenko

We propose a method for constructing multi-qubit entangled quantum states that represent weighted tripartite graphs, and develop approaches for investigating their structural properties using quantum computing. In the general case of multi-qubit states corresponding to arbitrary tripartite graph structures, we derive an expression for the entanglement distance. We establish a connection between entanglement and properties of the corresponding tripartite graphs. Namely, we show that the entanglement of a qubit with the rest of the system in a quantum tripartite graph state depends on the weights of the arcs in the neighborhood of the corresponding vertex, as well as on its degree with respect to the vertex sets of the tripartite graph. As an illustrative example, we consider a tripartite graph forming a triangle and evaluate the entanglement distance with quantum computing. We also compute quantum correlators for the general case of tripartite quantum graph states and relate these quantities to structural features of the underlying graphs, including the number of non-overlapping neighbors, the number of common neighbors of the corresponding vertices, and the number of 4-cycles. Obtained relationships between the quantum properties of multi-qubit states and the structural features of tripartite graphs opens up the possibility of investigating classical systems, such as tripartite graphs, using quantum computing. It is worth emphasizing that tripartite graphs have applications in practical problems, including resource allocation, scheduling, and database and hypergraph modeling.

quant-pharXiv:2604.27829•May 1, 2026•0 citations

Entanglement Distance of Two- and Multi-Qubit Variational States and Its Quantification with Quantum Computing

Kh. P. Gnatenko, R. O. Hredil, V. Y. Pinchuk +2 more

We study the entanglement distance of variational quantum states for two-qubit and multi-qubit systems. These states are constructed using variational quantum circuits with $R_Y$ rotations and entangling $CZ$ gates. For the two-qubit case, we analytically derive recurrence relations for expectation values of Pauli observables. This approach allows us to calculate quantum correlators and evaluate the entanglement distance as a function of the circuit parameters and depth. The analysis was extended to a closed one-dimensional chain of $N$ qubits. An explicit analytical expression for the entanglement is derived for the case of two layers. We conclude that the entanglement of a qubit with the rest of the system depends on the parameters of the gates acting on first- and second-nearest neighbors in the chain topology of the entangling layers. We also quantify the entanglement of the variational quantum states using quantum computing on the AerSimulator. The corresponding quantum protocols are constructed, and the dependence of the entanglement on the parameters of the variational quantum states is studied. The results of the quantum programming are in good agreement with the theoretical predictions.

quant-pharXiv:2605.00259•May 4, 2026•0 citations

Evaluation of variational quantum states entanglement on a quantum computer by the mean value of spin

Kh. P. Gnatenko

The geometric measure of entanglement of variational quantum states is studied on the basis of its relation with the mean value of spin. We examine n-qubit quantum states prepared by a variational circuit with a layer formed by the rotational gates and two-qubit controlled phase gates. The variational circuit is a generalization of that used for preparing quantum Generative Adversarial Network states. The entanglement of a qubit with other qubits in the variational quantum states is determined by the angles of rotational gates that act on the qubit and qubits entangled with it by controlled phase gates and also their parameters. In the case of one layer variational circuit, the states can be associated with graphs with vertices representing qubits and edges corresponding to two-qubit gates. The geometric measure of entanglement of a qubit with other qubits in the quantum graph state depends on the properties of the vertex that represents it in the graph, namely it depends on the vertex degree. The dependence of the geometric measure of entanglement of variational quantum states on their parameters is quantified on IBM's quantum computer.

arXiv:2301.03885•Jan 10, 2023•0 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

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•17 citations
We consider multi-qubit entangled quantum states known in the literature as one-layer variational quantum states. The states can also be considered as quantum graph states representing directed and weighted graphs. The corresponding variational quantum protocols includeRY,RZR Y, R ZRY,RZ, and entangling blocks withRXXR X XRXXgates. We examine the general case in which the entangling blocks have an arbitrary structure, namely,RXXR X XRXXgates are applied to arbitrary pairs of qubits. This case corresponds to an arbitrary structure of the associated weighted and directed graphs. Variational quantum states, as well as quantum graph states, have broad applications in various fields of quantum computing, including quantum machine learning, quantum error correction, and optimization algorithms, and others. One of the key resources in quantum computing is entanglement. We analytically calculate the entanglement distance for variational quantum states with entangling blocks of arbitrary structure. The dependence of entanglement on the parameters of the variational quantum state and on the characteristics of the corresponding weighted and directed graphs is investigated. We find that the entanglement of a qubit with other qubits in the state depends on the outdegree and indegree of the corresponding vertex in the graph, as well as on the weights of the incoming and outgoing arcs associated with that vertex. Quantum protocols for quantifying the entanglement distance of variational quantum states have been constructed. For particular cases of variational quantum states, the dependence of entanglement distance on the state parameters has been examined using quantum computation on the Aer simulator.
We study multi-qubit variational quantum states that can be considered as vertex- and edge-weighted graph. These states are constructed as single-layer variational circuits with RXRXRX rotations and RZZRZZRZZ entangling gates, corresponding to graphs of arbitrary structure. In general case of quantum graph states of arbitrary structure we derive the geometric measure of entanglement and evaluate quantum correlators. It is shown that these quantities are related to the edge-weight structure around the corresponding vertices in the graph (i.e., edge weights incident to the vertices and vertex weights associated with their closed neighborhoods). In the special case of quantum states representing unweighted graphs, these quantities are related to the degrees of the corresponding vertices in the graph. As an example, we analyze the state associated with the star graph K1,4K_{1,4}K1,4​ using noisy quantum computing on the AerSimulator. The results are in good agreement with theoretical predictions. These findings demonstrate a connection between graph structure and quantum properties, enabling the study of properties of classical graphs via quantum computing.
We propose a method for constructing multi-qubit entangled quantum states that represent weighted tripartite graphs, and develop approaches for investigating their structural properties using quantum computing. In the general case of multi-qubit states corresponding to arbitrary tripartite graph structures, we derive an expression for the entanglement distance. We establish a connection between entanglement and properties of the corresponding tripartite graphs. Namely, we show that the entanglement of a qubit with the rest of the system in a quantum tripartite graph state depends on the weights of the arcs in the neighborhood of the corresponding vertex, as well as on its degree with respect to the vertex sets of the tripartite graph. As an illustrative example, we consider a tripartite graph forming a triangle and evaluate the entanglement distance with quantum computing. We also compute quantum correlators for the general case of tripartite quantum graph states and relate these quantities to structural features of the underlying graphs, including the number of non-overlapping neighbors, the number of common neighbors of the corresponding vertices, and the number of 4-cycles. Obtained relationships between the quantum properties of multi-qubit states and the structural features of tripartite graphs opens up the possibility of investigating classical systems, such as tripartite graphs, using quantum computing. It is worth emphasizing that tripartite graphs have applications in practical problems, including resource allocation, scheduling, and database and hypergraph modeling.
We study the entanglement distance of variational quantum states for two-qubit and multi-qubit systems. These states are constructed using variational quantum circuits with RYR_YRY​ rotations and entangling CZCZCZ gates. For the two-qubit case, we analytically derive recurrence relations for expectation values of Pauli observables. This approach allows us to calculate quantum correlators and evaluate the entanglement distance as a function of the circuit parameters and depth. The analysis was extended to a closed one-dimensional chain of NNN qubits. An explicit analytical expression for the entanglement is derived for the case of two layers. We conclude that the entanglement of a qubit with the rest of the system depends on the parameters of the gates acting on first- and second-nearest neighbors in the chain topology of the entangling layers. We also quantify the entanglement of the variational quantum states using quantum computing on the AerSimulator. The corresponding quantum protocols are constructed, and the dependence of the entanglement on the parameters of the variational quantum states is studied. The results of the quantum programming are in good agreement with the theoretical predictions.
The geometric measure of entanglement of variational quantum states is studied on the basis of its relation with the mean value of spin. We examine n-qubit quantum states prepared by a variational circuit with a layer formed by the rotational gates and two-qubit controlled phase gates. The variational circuit is a generalization of that used for preparing quantum Generative Adversarial Network states. The entanglement of a qubit with other qubits in the variational quantum states is determined by the angles of rotational gates that act on the qubit and qubits entangled with it by controlled phase gates and also their parameters. In the case of one layer variational circuit, the states can be associated with graphs with vertices representing qubits and edges corresponding to two-qubit gates. The geometric measure of entanglement of a qubit with other qubits in the quantum graph state depends on the properties of the vertex that represents it in the graph, namely it depends on the vertex degree. The dependence of the geometric measure of entanglement of variational quantum states on their parameters is quantified on IBM's quantum computer.
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 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.