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

Universality of Entanglement Near a Quantum Phase Transition

Rouhollah Jafari

Published Jan 12, 2011• 0 citations
OpenAlex

Related papers

Entanglement and Quantum Phase Transition Revisited

Yang Min-Fong

Bulletin of the American Physical Society•Mar 21, 2005•0 citations

Universality and Scaling Properties of Correlation Functions Near a Quantum Phase Transition

Rouhollah Jafari

In this paper we investigate the universality and scaling properties of the well-known quantities in classical statistical mechanics near the quantum phase transition point. We show that transverse susceptibility and derivatives of correlation functions with respect to the parameter that drives the quantum phase transitions, exhibit logarithmic divergence and finite size scaling the same as entanglement. In other words the non-analytic and finite size scaling behaviors of entanglement is not its intrinsic properties and inherit from the non-analytic and scaling behaviors of correlation functions and surveying at least the nearest neighbor correlation functions could specify the scaling and divergence properties of entanglement. However we show that the correlation functions could capture the quantum critical point without pre-assumed order parameters even for the cases where the two-body entanglement is absent.

arXiv:1101.2354•Jan 12, 2011•2 citations

Entanglement and quantum phase transitions

Hai‐Qing Lin, Shi-Jian Gu, Guang-Shan Tian

Bulletin of the American Physical Society•Mar 21, 2005•0 citations

Two-point entanglement near a quantum phase transition

Han-Dong Chen

In this work, we study the two-point entanglement S ( i , j ), which measures the entanglement between two separated degrees of freedom ( ij ) and the rest of system, near a quantum phase transition. Away from the critical point, S ( i , j ) saturates with a characteristic length scale ξ E , as the distance | i − j | increases. The entanglement length ξ E agrees with the correlation length. The universality and finite size scaling of entanglement are demonstrated in a class of exactly solvable one-dimensional spin model. By connecting the two-point entanglement to correlation functions in the long range limit, we argue that the prediction power of a two-point entanglement is universal as long as the two involved points are separated far enough.

arXiv:cond-mat/0606126•Journal of Physics A Mathematical and Theoretical•Aug 1, 2007•18 citations

Universality of entanglement and quantum-computation complexity

Román Orús, José Ignacio Latorre

We study the universality of scaling of entanglement in Shor's factoring algorithm and in adiabatic quantum algorithms across a quantum phase transition for both the $NP$-complete exact cover problem as well as Grover's problem. The analytic result for Shor's algorithm shows a linear scaling of the entropy in terms of the number of qubits, therefore making it hard to generate an efficient classical simulation protocol. A similar result is obtained numerically for the quantum adiabatic evolution exact cover algorithm, which also shows universality of the quantum phase transition near which the system evolves. On the other hand, entanglement in Grover's adiabatic algorithm remains a bounded quantity even at the critical point. The classification of scaling of entanglement appears as a natural grading of the computational complexity of simulating quantum phase transitions.

arXiv:quant-ph/0311017•Physical Review A•May 12, 2004•84 citations

Scaling of entanglement close to a quantum phase transition

Andreas Osterloh, Luigi Amico A, G. Falci +1 more

arXiv:quant-ph/0202029•Nature•Apr 1, 2002•1,843 citations
In this paper we investigate the universality and scaling properties of the well-known quantities in classical statistical mechanics near the quantum phase transition point. We show that transverse susceptibility and derivatives of correlation functions with respect to the parameter that drives the quantum phase transitions, exhibit logarithmic divergence and finite size scaling the same as entanglement. In other words the non-analytic and finite size scaling behaviors of entanglement is not its intrinsic properties and inherit from the non-analytic and scaling behaviors of correlation functions and surveying at least the nearest neighbor correlation functions could specify the scaling and divergence properties of entanglement. However we show that the correlation functions could capture the quantum critical point without pre-assumed order parameters even for the cases where the two-body entanglement is absent.
In this work, we study the two-point entanglement S ( i , j ), which measures the entanglement between two separated degrees of freedom ( ij ) and the rest of system, near a quantum phase transition. Away from the critical point, S ( i , j ) saturates with a characteristic length scale ξ E , as the distance | i − j | increases. The entanglement length ξ E agrees with the correlation length. The universality and finite size scaling of entanglement are demonstrated in a class of exactly solvable one-dimensional spin model. By connecting the two-point entanglement to correlation functions in the long range limit, we argue that the prediction power of a two-point entanglement is universal as long as the two involved points are separated far enough.
We study the universality of scaling of entanglement in Shor's factoring algorithm and in adiabatic quantum algorithms across a quantum phase transition for both the NPNPNP-complete exact cover problem as well as Grover's problem. The analytic result for Shor's algorithm shows a linear scaling of the entropy in terms of the number of qubits, therefore making it hard to generate an efficient classical simulation protocol. A similar result is obtained numerically for the quantum adiabatic evolution exact cover algorithm, which also shows universality of the quantum phase transition near which the system evolves. On the other hand, entanglement in Grover's adiabatic algorithm remains a bounded quantity even at the critical point. The classification of scaling of entanglement appears as a natural grading of the computational complexity of simulating quantum phase transitions.