Geometric properties of evolutionary graph states and their detection on a quantum computer
arXiv:2108.12909 · doi:10.1016/j.physleta.2022.128434
Abstract
Geometric properties of evolutionary graph states of spin systems generated by the operator of evolution with Ising Hamiltonian are examined, using their relationship with fluctuations of energy. We find that the geometric characteristics of the graph states depend on properties of the corresponding graphs. Namely, it is obtained that the fluctuations of energy in graph states and therefore the velocity of quantum evolution, the curvature and the torsion of the states are related with the total number of edges, triangles and squares in the corresponding graphs. The obtained results give a possibility to quantify the number of edges, triangles and squares in a graph on a quantum devise and achieve quantum supremacy in solving this problem with the development of a multi-qubit quantum computer. Geometric characteristics of graph states corresponding to a chain, a triangle, and a square are detected on the basis of calculations on IBM's quantum computer ibmq-manila.
References in corpus (9)
- Multi-party entanglement in graph states
- Bell Inequalities for Graph States
- Experimental demonstration of a graph state quantum error-correction code
- Quantum Brachistochrone Problem and the Geometry of the State Space in Pseudo-Hermitian Quantum Mechanics
- Quantum brachistochrone problem for spin-1 in a magnetic field
- The quantum brachistochrone problem for an arbitrary spin in a magnetic field
- Entanglement of graph states of spin system with Ising interaction and its quantifying on IBM's quantum computer
- Geometric measure of entanglement of multi-qubit graph states and its detection on a quantum computer
- Quantifying the difference between many-body quantum states