arXiv subjects

Alioscia Hamma

Publications and source records attributed to Alioscia Hamma.

At least 55 records · Page 3Linked to original sources

arXiv2023

Nonstabilizerness determining the hardness of direct fidelity estimation

In this work, we show how the resource theory of nonstabilizerness quantifies the hardness of direct fidelity estimation protocols. In particular, the resources needed for a direct fidelity estimation conducted on generic states, such as Pauli fidelity estimation and shadow fidelity estimation protocols, grow exponentially with the stabilizer Rényi entropy. Remarkably, these protocols are shown to be feasible only for those states that are useless to attain any quantum speedup or advantage. This result suggests the impossibility of estimating efficiently fidelity for generic states and, at the same time, leaves the window open to those protocols specialized at directly estimating the fidelity of particular states. We then extend our results to quantum evolutions, showing that the resources needed to certify the quality of the implementation of a given unitary $U$ are governed by the nonstabilizerness in the Choi state associated with $U$, which is shown to possess a profound connection with out-of-time order correlators.

quant-ph↗

arXiv2022

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↗

arXiv2022

Measuring magic on a quantum processor

Magic states are the resource that allows quantum computers to attain an advantage over classical computers. This resource consists in the deviation from a property called stabilizerness which in turn implies that stabilizer circuits can be efficiently simulated on a classical computer. Without magic, no quantum computer can do anything that a classical computer cannot do. Given the importance of magic for quantum computation, it would be useful to have a method for measuring the amount of magic in a quantum state. In this work, we propose and experimentally demonstrate a protocol for measuring magic based on randomized measurements. Our experiments are carried out on two IBM Quantum Falcon processors. This protocol can provide a characterization of the effectiveness of a quantum hardware in producing states that cannot be effectively simulated on a classical computer. We show how from these measurements one can construct realistic noise models affecting the hardware.

quant-ph↗

arXiv2022

Magic-state resource theory for the ground state of the transverse-field Ising model

Ground states of quantum many-body systems are both entangled and possess a kind of quantum complexity as their preparation requires universal resources that go beyond the Clifford group and stabilizer states. These resources - sometimes described as magic - are also the crucial ingredient for quantum advantage. We study the behavior of the stabilizer Rényi entropy in the integrable transverse field Ising spin chain. We show that the locality of interactions results in a localized stabilizer Rényi entropy in the gapped phase thus making this quantity computable in terms of local quantities in the gapped phase, while measurements involving $L$ spins are necessary at the critical point to obtain an error scaling with $O(L^{-1})$.

quant-ph↗

arXiv2022

Transitions in Entanglement Complexity in Random Circuits

Entanglement is the defining characteristic of quantum mechanics. Bipartite entanglement is characterized by the von Neumann entropy. Entanglement is not just described by a number, however; it is also characterized by its level of complexity. The complexity of entanglement is at the root of the onset of quantum chaos, universal distribution of entanglement spectrum statistics, hardness of a disentangling algorithm and of the quantum machine learning of an unknown random circuit, and universal temporal entanglement fluctuations. In this paper, we numerically show how a crossover from a simple pattern of entanglement to a universal, complex pattern can be driven by doping a random Clifford circuit with $T$ gates. This work shows that quantum complexity and complex entanglement stem from the conjunction of entanglement and non-stabilizer resources, also known as magic.

quant-ph↗

arXiv2022

Local Convertibility in quantum spin systems

Local Convertibility refers to the possibility of transforming a given state into a target one, just by means of LOCC with respect to a given bipartition of the system and it is possible if and only if all the Renyi-entropies of the initial state are smaller than those of the target state. We apply this concept to adiabatic evolutions and ask whether they can be rendered through LOCC in the sense above. We argue that a lack of differential local convertibility (dLC) signals a higher computational power of the system's quantum phase, which is also usually connected with the existence of long-range entanglement, topological order, or edge-states. Remarkably, dLC can detect these global properties already by considering small subsystems. Moreover, we connect dLC to spontaneous symmetry breaking by arguing that states with finite order parameters must be the most classical ones and thus be locally convertible.

cond-mat.str-el↗

arXiv2022

Entanglement of random hypergraph states

Random quantum states and operations are of fundamental and practical interests. In this work, we investigate the entanglement properties of random hypergraph states, which generalize the notion of graph states by applying generalized controlled-phase gates on an initial reference product state. In particular, we study the two ensembles generated by random Controlled-Z(CZ) and Controlled-Controlled-Z(CCZ) gates, respectively. By applying tensor network representation and combinational counting, we analytically show that the average subsystem purity and entanglement entropy for the two ensembles feature the same volume law, but greatly differ in typicality, namely the purity fluctuation is small and universal for the CCZ ensemble while it is large for the CZ ensemble. We discuss the implications of these results for the onset of entanglement complexity and quantum chaos.

quant-ph↗

arXiv2022

Stabilizer Rényi entropy

We introduce a novel measure for the quantum property of nonstabilizerness - commonly known as "magic" - by considering the Rényi entropy of the probability distribution associated to a pure quantum state given by the square of the expectation value of Pauli strings in that state. We show that this is a good measure of nonstabilizerness from the point of view of resource theory and show bounds with other known measures. The stabilizer Rényi entropy has the advantage of being easily computable because it does not need a minimization procedure. We present a protocol for an experimental measurement by randomized measurements. We show that the nonstabilizerness is intimately connected to out-of-time-order correlation functions and that maximal levels of nonstabilizerness are necessary for quantum chaos.

quant-ph↗

arXiv2022

Random Quantum Batteries

Quantum nano-devices are fundamental systems in quantum thermodynamics that have been the subject of profound interest in recent years. Among these, quantum batteries play a very important role. In this paper we lay down a theory of random quantum batteries and provide a systematic way of computing the average work and work fluctuations in such devices by investigating their typical behavior. We show that the performance of random quantum batteries exhibits typicality and depends only on the spectral properties of the time evolving operator, the initial state and the measuring Hamiltonian. At given revival times a random quantum battery features a quantum advantage over classical random batteries. Our method is particularly apt to be used both for exactly solvable models like the Jaynes-Cummings model or in perturbation theory, e.g., systems subject to harmonic perturbations. We also study the setting of quantum adiabatic random batteries.

quant-ph↗

arXiv2021

Transitions in entanglement complexity in random quantum circuits by measurements

Random Clifford circuits doped with non Clifford gates exhibit transitions to universal entanglement spectrum statistics[1] and quantum chaotic behavior. In [2] we proved that the injection of $O(n)$ non Clifford gates into a $n$-qubit Clifford circuit drives the transition towards the universal value of the purity fluctuations. In this paper, we show that doping a Clifford circuit with $O(n)$ single qubit non Clifford measurements is both necessary and sufficient to drive the transition to universal fluctuations of the purity.

quant-ph↗

arXiv2021

Towards a Geometrization of Quantum Complexity and Chaos

In this paper, we show how the restriction of the Quantum Geometric Tensor to manifolds of states that can be generated through local interactions provides a new tool to understand the consequences of locality in physics. After a review of a first result in this context, consisting in a geometric out-of-equilibrium extension of the quantum phase transitions, we argue the opportunity and the usefulness to exploit the Quantum Geometric Tensor to geometrize quantum chaos and complexity.

quant-ph↗

arXiv2021

Isospectral twirling and quantum chaos

We show that the most important measures of quantum chaos like frame potentials, scrambling, Loschmidt echo, and out-of-time-order correlators (OTOCs) can be described by the unified framework of the isospectral twirling, namely the Haar average of a $k$-fold unitary channel. We show that such measures can then be always cast in the form of an expectation value of the isospectral twirling. In literature, quantum chaos is investigated sometimes through the spectrum and some other times through the eigenvectors of the Hamiltonian generating the dynamics. We show that, by exploiting random matrix theory, these measures of quantum chaos clearly distinguish the finite time profiles of probes to quantum chaos corresponding to chaotic spectra given by the Gaussian Unitary Ensemble (GUE) from the integrable spectra given by Poisson distribution and the Gaussian Diagonal Ensemble (GDE). On the other hand, we show that the asymptotic values do depend on the eigenvectors of the Hamiltonian. We see that the isospectral twirling of Hamiltonians with eigenvectors stabilizer states does not possess chaotic features, unlike those Hamiltonians whose eigenvectors are taken from the Haar measure. As an example, OTOCs obtained with Clifford resources decay to higher values compared with universal resources. Finally, we show a crossover in the OTOC behavior between a class of integrable models and quantum chaos.

quant-ph↗

arXiv2021

Fluctuations in extractable work bound the charging power of quantum batteries

We study the connection between the charging power of quantum batteries and the fluctuations of the extractable work. We prove that in order to have a non-zero rate of change of the extractable work, the state $ρ_\mathcal{W}$ of the battery cannot be an eigenstate of a `\emph{free energy operator}', defined by $\mathcal{F}~\equiv~H_\mathcal{W}~+~β^{-1}\log(ρ_\mathcal{W})$, where $H_\mathcal{W}$ is the Hamiltonian of the battery and $β$ is the inverse temperature of a reference thermal bath with respect to which the extractable work is calculated. We do so by proving that fluctuations in the free energy operator upper bound the charging power of a quantum battery. Our findings also suggest that quantum coherence in the battery enhances the charging process, which we illustrate on a toy model of a heat engine. \ \emph{Note: this version includes our Reply to a Comment by Cusumano and Rudnicki, both published in Phys. Rev. Lett.}

quant-ph↗

arXiv2021

Energy storage and coherence in closed and open quantum batteries

We study the role of coherence in closed and open quantum batteries. We obtain upper bounds to the work performed or energy exchanged by both closed and open quantum batteries in terms of coherence. Specifically, we show that the energy storage can be bounded by the Hilbert-Schmidt coherence of the density matrix in the spectral basis of the unitary operator that encodes the evolution of the battery. We also show that an analogous bound can be obtained in terms of the battery's Hamiltonian coherence in the basis of the unitary operator by evaluating their commutator. We apply these bounds to a 4-state quantum system and the anisotropic XY Ising model in the closed system case, and the Spin-Boson model in the open case.

quant-ph↗

arXiv2021

Stability of topological purity under random local unitaries

In this work, we provide an analytical proof of the robustness of topological entanglement under a model of random local perturbations. We define a notion of average topological subsystem purity and show that, in the context of quantum double models, this quantity does detect topological order and is robust under the action of a random quantum circuit of shallow depth.

quant-ph↗

arXiv2021

Quantum Chaos is Quantum

It is well known that a quantum circuit on $N$ qubits composed of Clifford gates with the addition of $k$ non Clifford gates can be simulated on a classical computer by an algorithm scaling as $\text{poly}(N)\exp(k)$[1]. We show that, for a quantum circuit to simulate quantum chaotic behavior, it is both necessary and sufficient that $k=O(N)$. This result implies the impossibility of simulating quantum chaos on a classical computer.

quant-ph↗

arXiv2021

Protecting topological order by dynamical localization

As a prototype model of topological quantum memory, two-dimensional toric code is genuinely immune to generic local static perturbations, but fragile at finite temperature and also after non-equilibrium time evolution at zero temperature. We show that dynamical localization induced by disorder makes the time evolution a local unitary transformation at all times, which keeps topological order robust after a quantum quench. We verify this conclusion by investigating the Wilson loop expectation value and topological entanglement entropy. Our results suggest that the two dimensional topological quantum memory can be dynamically robust at zero temperature.

quant-ph↗

arXiv2021

Random Matrix Theory of the Isospectral twirling

We present a systematic construction of probes into the dynamics of isospectral ensembles of Hamiltonians by the notion of Isospectral twirling, expanding the scopes and methods of ref.[1]. The relevant ensembles of Hamiltonians are those defined by salient spectral probability distributions. The Gaussian Unitary Ensembles (GUE) describes a class of quantum chaotic Hamiltonians, while spectra corresponding to the Poisson and Gaussian Diagonal Ensemble (GDE) describe non chaotic, integrable dynamics. We compute the Isospectral twirling of several classes of important quantities in the analysis of quantum many-body systems: Frame potentials, Loschmidt Echos, OTOCs, Entanglement, Tripartite mutual information, coherence, distance to equilibrium states, work in quantum batteries and extension to CP-maps. Moreover, we perform averages in these ensembles by random matrix theory and show how these quantities clearly separate chaotic quantum dynamics from non chaotic ones.

quant-ph↗