The power of matrix product states to describe infinite-size translational-invariant critical spin chains is investigated. At criticality, the accuracy with which they describe ground-state properties of a system is limited by the size of the matrices that form the approximation. This limitation is quantified in terms of the scaling of the half-chain entanglement entropy. In the case of the quantum Ising model, we find S ϳ 1 6 log with high precision. This result can be understood as the emergence of an effective finite correlation length ruling all the scaling properties in the system. We produce six extra pieces of evidence for this finite-scaling, namely, the scaling of the correlation length, the scaling of magnetization, the shift of the critical point, the scaling of the entanglement entropy for a finite block of spins, the existence of scaling functions, and the agreement with analogous classical results. All our computations are consistent with a scaling relation of the form ϳ , with = 2 for the Ising model. In the case of the Heisenberg model, we find similar results with the value ϳ 1.37. We also show how finite-scaling allows us to extract critical exponents. These results are obtained using the infinite time evolved block decimation algorithm which works in the thermodynamical limit and are verified to agree with density-matrix renormalization-group results and their classical analog obtained with the corner transfer-matrix renormalization group.
It has recently been pointed out that the geometric quantum discord, as defined by the Hilbert-Schmidt norm (2-norm), is not a good measure of quantum correlations, since it may increase under local reversible operations on the unmeasured subsystem. Here, we revisit the geometric discord by considering general Schatten p-norms, explicitly showing that the 1-norm is the only p-norm able to define a consistent quantum correlation measure. In addition, by restricting the optimization to the tetrahedron of two-qubit Bell-diagonal states, we provide an analytical expression for the 1-norm geometric discord, which turns out to be equivalent to the negativity of quantumness. We illustrate the measure by analyzing its monotonicity properties.Comment: v3: published versio
It is well known that a particle cannot freely share entanglement with two or more particles. This restriction is generally called monogamy. However the formal quantification of such restriction is only known for some measures of entanglement and for two-level systems. The first and broadly known monogamy relation was established by Coffman, Kundu, and Wootters for the square of the concurrence. Since then, it is usually said that the entanglement of formation is not monogamous, as it does not obey the same relation. We show here that despite that, the entanglement of formation cannot be freely shared and therefore should be said to be monogamous. Furthermore, the square of the entanglement of formation does obey the same relation of the squared concurrence, a fact recently noted for three particles and extended here for N particles. Therefore the entanglement of formation is as monogamous as the concurrence. We also numerically study how the entanglement is distributed in pure states of three qubits and the relation between the sum of the bipartite entanglement and the classical correlation.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.