Bibliografia

Abstract

Full counting statistics in the gapped XXZ spin chain

We exploit the knowledge of the entanglement spectrum in the ground state of the gapped XXZ spin chain to derive asymptotic exact results for the full counting statistics of the transverse magnetisation in a large spin block of length \u2113. We found that for a subsystem of even length the full counting statistics is Gaussian, while for odd subsystems it is the sum of two Gaussian distributions. We test our analytic predictions with accurate tensor networks simulations. As a byproduct, we also obtain the symmetry (magnetisation) resolved entanglement entropies

Appendice

Abstract

Introduzione

EnThe aim of this work is to present,in a sufficiently complete manner,the theory of idempotent semigroups.The results here exposed are essentially due to Mc Lean,Kimura,Petrich,Warne,Green,Rees, Gerhardt,Yamada,Fennemore.Examples are provided and open problems indicated

Indice

Abstract

Introduzione

EnThe aim of this work is to present, in a sufficiently complete manner,the theory of idempotent semigroups.The results here exposed are essentially due to Mc Lean,Kimura,Petrich,Warne,Green,Gerhardt,Yamada.Examples are provided and open problems indicate

Appendice

Abstract

Traslazioni di un semigruppo

Abstract

Partitioning Interpolant-Based Verificationfor effective Unbounded Model Checking

Interpolant-based model checking has been shown to be effective on large verification instances, as it efficiently combines automated abstraction and reachability fixed-point checks. On the other hand, methods based on variable quantification have proved their ability to remove free inputs, thus projecting the search space over state variables. In this paper we propose an integrated approach which combines the abstraction power of interpolation with techniques that rely on AIG and/or BDD representations of states, directly supporting variable quantification and fixed-point checks. The underlying idea of this combination is to adopt AIG- or BDD-based quantifications to limit and restrict the search space and the complexity of the interpolant-based approach. The exploited strategies, most of which are individually well-known, are integrated with a new flavor, specifically designed to improve their effectiveness on difficult verification instances. Experimental results, specifically oriented to hard-to-solve verification problems, show the robustness of our approach