Searcharxiv⌕ Search

arXiv subjects

Stefano Piemontese

Publications and source records attributed to Stefano Piemontese.

2 recordsLinked to original sources

Entanglement complexity of the Rokhsar-Kivelson-sign wavefunctions

In this paper we study the transitions of entanglement complexity in an exemplary family of states - the Rokhsar-Kivelson-sign wavefunctions - whose degree of entanglement is controlled by a single parameter. This family of states is known to feature a transition between a phase exhibiting volume-law scaling of entanglement entropy and a phase with sub-extensive scaling of entanglement, reminiscent of the many-body-localization transition of disordered quantum Hamiltonians [Physical Review B 92, 214204 (2015)]. We study the singularities of the Rokhsar-Kivelson-sign wavefunctions and their entanglement complexity across the transition using several tools from quantum information theory: fidelity metric; entanglement spectrum statistics; entanglement entropy fluctuations; stabilizer Rényi Entropy; and the performance of a disentangling algorithm. Across the whole volume-law phase the states feature universal entanglement spectrum statistics. Yet a "super-universal" regime appears for small values of the control parameter in which all metrics become independent of the parameter itself; the entanglement entropy as well as the stabilizer Rényi entropy appear to approach their theoretical maximum; the entanglement fluctuations scale to zero as in output states of random universal circuits, and the disentangling algorithm has essentially null efficiency. All these indicators consistently reveal a complex pattern of entanglement. In the sub-volume-law phase, on the other hand, the entanglement spectrum statistics is no longer universal, entanglement fluctuations are larger and exhibiting a non-universal scaling; and the efficiency of the disentangling algorithm becomes finite. Our results, based on model wavefunctions, suggest that a similar combination of entanglement scaling properties and of entanglement complexity features may be found in high-energy Hamiltonian eigenstates.

quant-ph↗

Retrieving information from a black hole using quantum machine learning

In a seminal paper[JHEP09(2007)120], Hayden and Preskill showed that information can be retrieved from a black hole that is sufficiently scrambling, assuming that the retriever has perfect control of the emitted Hawking radiation and perfect knowledge of the internal dynamics of the black hole. In this paper, we show that for $t-$doped Clifford black holes - that is, black holes modeled by random Clifford circuits doped with an amount $t$ of non-Clifford resources - an information retrieval decoder can be learned with fidelity scaling as $\exp(-αt)$ using quantum machine learning while having access only to out-of-time-order correlation functions. We show that the crossover between learnability and non-learnability is driven by the amount of non-stabilizerness present in the black hole and sketch a different approach to quantum complexity.

quant-ph↗