Entanglement of weighted graphs uncovers transitions in variable-range interacting models
arXiv:2307.11739 · doi:10.1103/PhysRevA.110.022431
Abstract
The cluster state acquired by evolving the nearest-neighbor (NN) Ising model from a completely separable state is the resource for measurement-based quantum computation. Instead of an NN system, a variable-range power law interacting Ising model can generate a genuine multipartite entangled (GME) weighted graph state (WGS) that may reveal intrinsic characteristics of the evolving Hamiltonian. We establish that the pattern of generalized geometric measure (GGM) in the evolved state with an arbitrary number of qubits is sensitive to fall-off rates and the range of interactions of the evolving Hamiltonian. We report that the time-derivative and time-averaged GGM at a particular time can detect the transition points present in the fall-off rates of the interaction strength, separating different regions, namely long-range, quasi-local and local ones in one- and two-dimensional lattices with deformation. Moreover, we illustrate that in the quasi-local and local regimes, there exists a minimum coordination number in the evolving Ising model for a fixed total number of qubits which can mimic the GGM of the long-range model. In order to achieve a finite-size subsystem from the entire system, we design a local measurement strategy that allows a WGS of an arbitrary number of qubits to be reduced to a local unitarily equivalent WGS having fewer qubits with modified weights.
v1: 14 pages, 9 figures, v2: close to publish version
References in corpus (36)
- Quantum algorithm for solving linear systems of equations
- Ultracold atomic gases in optical lattices: mimicking condensed matter physics and beyond
- Quantum computing with trapped ions
- Multi-party entanglement in graph states
- Ground-to-satellite quantum teleportation
- High-speed linear optics quantum computing using active feed-forward
- Valence Bond Solids for Quantum Computation
- Entanglement entropy for the long range Ising chain
- Novel schemes for measurement-based quantum computation
- Measurement-based quantum computation beyond the one-way model
- Kitaev chains with long-range pairing
- Equivalence of critical scaling laws for many-body entanglement in the Lipkin-Meshkov-Glick model
- Fast simulation of stabilizer circuits using a graph state representation
- Experimental demonstration of graph-state quantum secret sharing
- Genuinely Multipartite Concurrence of N-qubit X-matrices
- Experimental demonstration of a graph state quantum error-correction code
- Universal quantum computation with little entanglement
- Anomalous Behavior of Spin Systems with Dipolar Interactions
- Hierarchies of Geometric Entanglement
- Universal geometric entanglement close to quantum phase transitions
- Continuous-variable geometric phase and its manipulation for quantum computation in a superconducting circuit
- On the Role of Coherence in Shor's Algorithm
- Geometric Entanglement in a One-Dimensional Valence Bond Solid State
- Entanglement and coherence in Bernstein-Vazirani algorithm
- Generalized Cluster States Based on Finite Groups
- Experimental Simulation of Larger Quantum Circuits with Fewer Superconducting Qubits
- A variational method based on weighted graph states
- Entanglement, fractional magnetization and long-range interactions
- Long-Range Free Fermions: Lieb-Robinson Bound, Clustering Properties, and Topological Phases
- Correlations, long-range entanglement and dynamics in long-range Kitaev chains
- Native three-body interaction in superconducting circuits
- Random circuits by measurements on weighted graph states
- Study of the long-range transverse field Ising model with fermionic Gaussian states
- Exact solution for quantum strong long-range models via a generalized Hubbard-Stratonovich transformation
- Spin Squeezing Property of Weighted Graph States
- Mimicking quantum correlation of a long-range Hamiltonian by finite-range interactions