6 papers
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
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…
Entanglement of multi-qubit quantum graph states and studies structural properties of tripartite graphs with quantum programming
Kh. P. Gnatenko
We propose a method for constructing multi-qubit entangled quantum states representing weighted tripartite graphs. An expression for the entanglement distance for multi-qubit state…
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 $R…
Quantifying the properties of evolutionary quantum states of the XXZ spin model using quantum computing
M. P. Tonne, Kh. P. Gnatenko
The entanglement distance of evolutionary quantum states of a two-spin system with the XXZ model has been studied. The analysis has been conducted both analytically and using quant…
Studies of properties of bipartite graphs with quantum programming
Kh. P. Gnatenko
Multi-qubit quantum states corresponding to bipartite graphs are examined. These states are constructed by applying gates to an arbitrary separable multi-qubit qu…
Relation of curvature and torsion of weighted graph states with graph properties and its studies on a quantum computer
Kh. P. Gnatenko
Quantum states of spin systems that can be represented with weighted graphs are studied. The geometrical characteristics of these states are examined. We find that the ve…