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:2307.11739 · Physical Review A

Entanglement of weighted graphs uncovering transitions in variable-range interacting models

Debkanta Ghosh, Keshav Das Agarwal, Pritam Halder, Aditi Sen

Published Aug 20, 2024• 4 citations
arXivHTMLPDF

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 weighted graph state (WGS) whose genuine multipartite entanglement may reveal intrinsic characteristics of the evolving Hamiltonian. We establish that the generalized geometric measure (GGM) in the time evolved state with an arbitrary number of qubits is sensitive to falloff 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 falloff rates of the interaction strength, separating different regions, namely, long-range, quasilocal, and local ones in one- and two-dimensional lattices with deformation. Moreover, we illustrate that in the quasilocal 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.

DOI
10.1103/physreva.110.022431

Related papers

Measurement-based quantum computation with variable-range interacting systems

Ghosh, Debkanta, Keshav Das Agarwal, Pritam Halder +1 more

We demonstrate that weighted graph states (WGS) generated via variable-range interacting Ising spin systems where the interaction strength decays with distance as a power law, characterized by the fall-off rate, can successfully implement single- and two-qubit gates with fidelity exceeding classical limits by performing suitable measurements. In the regime of truly long-range interactions (small fall-off rate), optimizing over local unitary operations, while retaining the local measurement scheme in the original measurement-based quantum computation (MBQC) set-up, enables the scheme to achieve nonclassical average fidelities. Specifically, we identify a threshold fall-off rate of the interaction above which the fidelity of both universal single- and two-qubit gates consistently exceeds $90\%$ accuracy. Moreover, we exhibit that the gate-implementation protocol remains robust under two realistic imperfections -- noise in the measurement process, modeled via unsharp measurements, and disorder in the interaction strengths. These findings confirm WGS produced through long-range systems as a resilient and effective resource for MBQC.

arXiv:2506.11909•Jun 13, 2025•0 citations

Revealing effects of the local dimension on a variable-range interacting model by connecting Lieb-Robinson bounds and multipartite entanglement

Keshav Das Agarwal, Debkanta Ghosh, Pritam Halder +1 more

A spin-$s$ variable-range interacting Ising model may display qualitatively different behaviors depending on the fall-off rate of the interactions, as already seen in equilibrium studies of spin-1/2 systems. We propose a dynamical method using weighted graph states, generated through time evolution that confirms the existence of the transition point in the fall-off rate for the spin-$s$ Ising model. Moreover, the dependence of local dimension on information spreading and multipartite entanglement profile in this model remains unclear, which we establish here. In particular, our analysis shows that the maximum of genuine multipartite entanglement (GME) with the fall-off rate serves as a clear indicator of the information spreading, which aligns with changes in the profile of the Lieb-Robinson bound. Further, in the case of an open chain, the spread of information is related to the divergence in the first derivative of GME. Additionally, we validate this signature by performing a scaling analysis of the time-averaged mutual information.

arXiv:2311.08232•Physical review. B./Physical review. B•Jan 9, 2026•0 citations

Weighted graph states and applications to spin chains, lattices and gases

Ludwig Hartmann, John Calsamiglia, Wolfgang Dür +1 more

Weighted graph states naturally arise when spin systems interact via an Ising-type interaction. First, we abstractly define the class of weighted graph states and demonstrate its computational accessibility. We show how reduced density matrices of a small number of spins (≈10) can be computed from arbitrarily large systems using weighted graph techniques and projected entangled pair techniques, and we discuss various entanglement measures accessible from these reduced density matrices. Second, we apply these findings to spin chains and lattices with long-range interactions and analytically derive area laws for the scaling of block-wise entanglement. Then, we turn to disordered spin systems, spin gases, which are connected to random weighted graph states and which share their entanglement properties. Finally, we use a spin gas as a bath that introduces decoherence in single as well as multipartite spin systems. The microscopic, exact decoherence model we obtain can operate in different regimes and exhibit non-Markovian features as well as spatially correlated noise effects.

Journal of Physics B Atomic Molecular and Optical Physics•Apr 18, 2007•38 citations

Efficient detection of multipartite entanglement structure

You Zhou, Qi Zhao, Xiao Yuan +1 more

Recently, there are tremendous developments on the number of controllable qubits in several quantum computing systems. For these implementations, it is crucial to determine the entanglement structure of the prepared multipartite quantum state as a basis for further information processing tasks. In reality, evaluation of a multipartite state is in general a very challenging task owing to the exponential increase of the Hilbert space with respect to the number of system components. In this work, we propose a systematic method using very few local measurements to detect multipartite entanglement structures based on the graph state --- one of the most important classes of quantum states for quantum information processing. Thanks to the close connection between the Schmidt coefficient and quantum entropy in graph states, we develop a family of efficient witness operators to detect the entanglement between subsystems under any partitions and hence the entanglement intactness. We show that the number of local measurements equals to the chromatic number of the underlying graph, which is a constant number, independent of the number of qubits. In reality, the optimization problem involved in the witnesses can be challenging with large system size. For several widely-used graph states, such as 1-D and 2-D cluster states and the Greenberger-Horne-Zeilinger state, by taking advantage of the area law of entanglement entropy, we derive analytical solutions for the witnesses, which only employ two local measurements. Our method offers a standard tool for entanglement structure detection to benchmark multipartite quantum systems.

•Apr 10, 2019•0 citations

Localizing multipartite entanglement with local and global measurements

Christopher Vairogs, Samihr Hermes, Felix Leditzky

We study the task of localizing multipartite entanglement in pure quantum states onto a subsystem by measuring the remaining systems. To this end, we fix a multipartite entanglement measure and consider two quantities: the multipartite entanglement of assistance (MEA), defined as the entanglement measure averaged over the post-measurement states and maximized over arbitrary measurements; and the localizable multipartite entanglement (LME), defined in the same way but restricted to only local single-system measurements. Both quantities generalize previously considered bipartite entanglement localization measures. In our work we choose the n-tangle, the genuine multipartite entanglement concurrence and the concentratable entanglement (CE) as the underlying seed measure, and discuss the resulting MEA and LME quantities. First, we prove easily computable upper and lower bounds on MEA and LME and establish Lipschitz-continuity for the n-tangle and CE-based LME and MEA. Using these bounds we investigate the typical behavior of entanglement localization by deriving concentration inequalities for the MEA evaluated on Haar-random states and performing numerical studies for small tractable system sizes. We then turn our attention to protocols that transform graph states. We give a simple criterion based on a matrix equation to decided whether states with a specified n-tangle value can be obtained from a given graph state, providing no-go theorems for a broad class of such graph state transformations beyond the usual “local Clifford plus local Pauli measurement” framework. This analysis is generalized to weighted graph states, which provide a realistic error model in current experiments preparing graph state. Our entanglement localization framework certifies the near-optimality of recently discussed local-measurement protocols to transform uniformly weighted line graph states into GHZ states, even when considering arbitrary entangled measurements. Finally, we demonstrate how our MEA and LME quantities can be used to detect critical phenomena such as phase transitions in transversal field Ising models. Since entanglement localization is operationally relevant throughout quantum networking and measurement-based quantum computation, our framework of results based on the MEA and LME has the potential for broad applications in these fields.

arXiv:2411.04080•Quantum•Feb 23, 2026•1 citation

Entanglement Dynamics in Katz-Weighted Graph States

Lucio De Simone, Lorenzo Capra, Roberto Franzosi

We investigate the entanglement dynamics of quantum states defined on graphs with non-local Ising interactions governed by the Katz kernel of the underlying network. The interaction pattern is physically motivated by a gapped fermionic mediator propagating on the same graph, whose perturbative elimination yields an effective Katz-weighted Ising Hamiltonian. Using the Entanglement Distance, we derive an exact analytical expression for the entanglement generated from an initially separable state and apply it to representative deterministic graph families. We then characterize the dynamics in different propagation regimes. In the weak-Katz regime, the dynamics admits a systematic motif expansion with triangles entering at first order order and four-cycles, local degree structure, and overlappin triangles appearing at second order. In the strong-propagation regime, the interaction is instead dominated by the principal adjacency mode and by the localization properties of its eigenvector. For Erdős--Rényi graphs, the weak-propagation expansion can be averaged analytically, revealing a locally tree-like contribution in the sparse regime and saturation of the Entanglement Distance density in the dense regime. Our results connect entanglement dynamics with both the walk-based and spectral structure of complex networks.

quant-pharXiv:2609.20390•Sep 18, 2026•0 citations
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 weighted graph state (WGS) whose genuine multipartite entanglement may reveal intrinsic characteristics of the evolving Hamiltonian. We establish that the generalized geometric measure (GGM) in the time evolved state with an arbitrary number of qubits is sensitive to falloff 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 falloff rates of the interaction strength, separating different regions, namely, long-range, quasilocal, and local ones in one- and two-dimensional lattices with deformation. Moreover, we illustrate that in the quasilocal 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.
We demonstrate that weighted graph states (WGS) generated via variable-range interacting Ising spin systems where the interaction strength decays with distance as a power law, characterized by the fall-off rate, can successfully implement single- and two-qubit gates with fidelity exceeding classical limits by performing suitable measurements. In the regime of truly long-range interactions (small fall-off rate), optimizing over local unitary operations, while retaining the local measurement scheme in the original measurement-based quantum computation (MBQC) set-up, enables the scheme to achieve nonclassical average fidelities. Specifically, we identify a threshold fall-off rate of the interaction above which the fidelity of both universal single- and two-qubit gates consistently exceeds 90%90\%90% accuracy. Moreover, we exhibit that the gate-implementation protocol remains robust under two realistic imperfections -- noise in the measurement process, modeled via unsharp measurements, and disorder in the interaction strengths. These findings confirm WGS produced through long-range systems as a resilient and effective resource for MBQC.
A spin-sss variable-range interacting Ising model may display qualitatively different behaviors depending on the fall-off rate of the interactions, as already seen in equilibrium studies of spin-1/2 systems. We propose a dynamical method using weighted graph states, generated through time evolution that confirms the existence of the transition point in the fall-off rate for the spin-sss Ising model. Moreover, the dependence of local dimension on information spreading and multipartite entanglement profile in this model remains unclear, which we establish here. In particular, our analysis shows that the maximum of genuine multipartite entanglement (GME) with the fall-off rate serves as a clear indicator of the information spreading, which aligns with changes in the profile of the Lieb-Robinson bound. Further, in the case of an open chain, the spread of information is related to the divergence in the first derivative of GME. Additionally, we validate this signature by performing a scaling analysis of the time-averaged mutual information.
Weighted graph states naturally arise when spin systems interact via an Ising-type interaction. First, we abstractly define the class of weighted graph states and demonstrate its computational accessibility. We show how reduced density matrices of a small number of spins (≈10) can be computed from arbitrarily large systems using weighted graph techniques and projected entangled pair techniques, and we discuss various entanglement measures accessible from these reduced density matrices. Second, we apply these findings to spin chains and lattices with long-range interactions and analytically derive area laws for the scaling of block-wise entanglement. Then, we turn to disordered spin systems, spin gases, which are connected to random weighted graph states and which share their entanglement properties. Finally, we use a spin gas as a bath that introduces decoherence in single as well as multipartite spin systems. The microscopic, exact decoherence model we obtain can operate in different regimes and exhibit non-Markovian features as well as spatially correlated noise effects.
Recently, there are tremendous developments on the number of controllable qubits in several quantum computing systems. For these implementations, it is crucial to determine the entanglement structure of the prepared multipartite quantum state as a basis for further information processing tasks. In reality, evaluation of a multipartite state is in general a very challenging task owing to the exponential increase of the Hilbert space with respect to the number of system components. In this work, we propose a systematic method using very few local measurements to detect multipartite entanglement structures based on the graph state --- one of the most important classes of quantum states for quantum information processing. Thanks to the close connection between the Schmidt coefficient and quantum entropy in graph states, we develop a family of efficient witness operators to detect the entanglement between subsystems under any partitions and hence the entanglement intactness. We show that the number of local measurements equals to the chromatic number of the underlying graph, which is a constant number, independent of the number of qubits. In reality, the optimization problem involved in the witnesses can be challenging with large system size. For several widely-used graph states, such as 1-D and 2-D cluster states and the Greenberger-Horne-Zeilinger state, by taking advantage of the area law of entanglement entropy, we derive analytical solutions for the witnesses, which only employ two local measurements. Our method offers a standard tool for entanglement structure detection to benchmark multipartite quantum systems.
We study the task of localizing multipartite entanglement in pure quantum states onto a subsystem by measuring the remaining systems. To this end, we fix a multipartite entanglement measure and consider two quantities: the multipartite entanglement of assistance (MEA), defined as the entanglement measure averaged over the post-measurement states and maximized over arbitrary measurements; and the localizable multipartite entanglement (LME), defined in the same way but restricted to only local single-system measurements. Both quantities generalize previously considered bipartite entanglement localization measures. In our work we choose the n-tangle, the genuine multipartite entanglement concurrence and the concentratable entanglement (CE) as the underlying seed measure, and discuss the resulting MEA and LME quantities. First, we prove easily computable upper and lower bounds on MEA and LME and establish Lipschitz-continuity for the n-tangle and CE-based LME and MEA. Using these bounds we investigate the typical behavior of entanglement localization by deriving concentration inequalities for the MEA evaluated on Haar-random states and performing numerical studies for small tractable system sizes. We then turn our attention to protocols that transform graph states. We give a simple criterion based on a matrix equation to decided whether states with a specified n-tangle value can be obtained from a given graph state, providing no-go theorems for a broad class of such graph state transformations beyond the usual “local Clifford plus local Pauli measurement” framework. This analysis is generalized to weighted graph states, which provide a realistic error model in current experiments preparing graph state. Our entanglement localization framework certifies the near-optimality of recently discussed local-measurement protocols to transform uniformly weighted line graph states into GHZ states, even when considering arbitrary entangled measurements. Finally, we demonstrate how our MEA and LME quantities can be used to detect critical phenomena such as phase transitions in transversal field Ising models. Since entanglement localization is operationally relevant throughout quantum networking and measurement-based quantum computation, our framework of results based on the MEA and LME has the potential for broad applications in these fields.
We investigate the entanglement dynamics of quantum states defined on graphs with non-local Ising interactions governed by the Katz kernel of the underlying network. The interaction pattern is physically motivated by a gapped fermionic mediator propagating on the same graph, whose perturbative elimination yields an effective Katz-weighted Ising Hamiltonian. Using the Entanglement Distance, we derive an exact analytical expression for the entanglement generated from an initially separable state and apply it to representative deterministic graph families. We then characterize the dynamics in different propagation regimes. In the weak-Katz regime, the dynamics admits a systematic motif expansion with triangles entering at first order order and four-cycles, local degree structure, and overlappin triangles appearing at second order. In the strong-propagation regime, the interaction is instead dominated by the principal adjacency mode and by the localization properties of its eigenvector. For Erdős--Rényi graphs, the weak-propagation expansion can be averaged analytically, revealing a locally tree-like contribution in the sparse regime and saturation of the Entanglement Distance density in the dense regime. Our results connect entanglement dynamics with both the walk-based and spectral structure of complex networks.