arXiv subjects

Silvano Garnerone

Publications and source records attributed to Silvano Garnerone.

17 recordsLinked to original sources

arXiv2015

Quantum algorithms for topological and geometric analysis of big data

Extracting useful information from large data sets can be a daunting task. Topological methods for analyzing data sets provide a powerful technique for extracting such information. Persistent homology is a sophisticated tool for identifying such topological features -- connected components, holes, or voids -- and for determining how such features persist as the data is viewed at different scales. This paper provides quantum algorithms for calculating Betti numbers in persistent homology, and for finding eigenvectors and eigenvalues of the combinatorial Laplacian. The algorithms provide an exponential speedup over classical algorithms for topological data analysis.

quant-ph↗

arXiv2013

Pure state thermodynamics with matrix product states

We extend the formalism of pure state thermodynamics to matrix product states. In pure state thermodynamics finite temperature properties of quantum systems are derived without the need of statistical mechanics ensembles, but instead using typical properties of random pure states. We show that this formalism can be useful from the computational point of view when combined with tensor network algorithms. In particular, a recently introduced Monte Carlo algorithm is considered which samples matrix product states at random for the estimation of finite temperature observables. Here we characterize this algorithm as an $(ε, δ)$-approximation scheme and we analytically show that sampling one single state is sufficient to obtain a very good estimation of finite temperature expectation values. These results provide a substantial computational improvement with respect to similar algorithms for one-dimensional quantum systems based on uniformly distributed pure states. The analytical calculations are numerically supported simulating finite temperature interacting spin systems of size up to 100 qubits.

quant-ph↗

arXiv2013

Generalized quantum microcanonical ensemble from random matrix product states

We propose a tensor network algorithm for the efficient sampling of quantum pure states belonging to a generalized microcanonical ensemble. The algorithm consists in an adaptation of the power method to a recently introduced ensemble of random matrix product states. The microcanonical ensemble that we consider is characterized by the fact that the participating energy eigenstates are not required to have identical statistical weight. To test the method we apply it to the Heisenberg model with an external magnetic field, and we find that the magnetization curves, due to the microcanonical constraint, are qualitatively different from those obtained in the canonical ensemble. Possible future applications include the study of isolated quantum systems evolving after a quantum quench.

quant-ph↗

arXiv2013

Phase transition of light on complex quantum networks

Recent advances in quantum optics and atomic physics allow for an unprecedented level of control over light-matter interactions, which can be exploited to investigate new physical phenomena. In this work we are interested in the role played by the topology of quantum networks describing coupled optical cavities and local atomic degrees of freedom. In particular, using a mean-field approximation, we study the phase diagram of the Jaynes-Cummings-Hubbard model on complex networks topologies, and we characterize the transition between a Mott-like phase of localized polaritons and a superfluid phase. We found that, for complex topologies, the phase diagram is non-trivial and well defined in the thermodynamic limit only if the hopping coefficient scales like the inverse of the maximal eigenvalue of the adjacency matrix of the network. Furthermore we provide numerical evidences that, for some complex network topologies, this scaling implies an asymptotically vanishing hopping coefficient in the limit of large network sizes. The latter result suggests the interesting possibility of observing quantum phase transitions of light on complex quantum networks even with very small couplings between the optical cavities.

quant-ph↗

arXiv2012

Thermodynamic formalism for dissipative quantum walks

We consider the dynamical properties of dissipative continuous-time quantum walks on directed graphs. Using a large-deviation approach we construct a thermodynamic formalism allowing us to define a dynamical order parameter, and to identify transitions between dynamical regimes. For a particular class of dissipative quantum walks we propose a quantum generalization of the the classical PageRank vector, used to rank the importance of nodes in a directed graph. We also provide an example where one can characterize the dynamical transition from an effective classical random walk to a dissipative quantum walk as a thermodynamic crossover between distinct dynamical regimes.

quant-ph↗

arXiv2012

Adiabatic quantum algorithm for search engine ranking

We propose an adiabatic quantum algorithm for generating a quantum pure state encoding of the PageRank vector, the most widely used tool in ranking the relative importance of internet pages. We present extensive numerical simulations which provide evidence that this algorithm can prepare the quantum PageRank state in a time which, on average, scales polylogarithmically in the number of webpages. We argue that the main topological feature of the underlying web graph allowing for such a scaling is the out-degree distribution. The top ranked $\log(n)$ entries of the quantum PageRank state can then be estimated with a polynomial quantum speedup. Moreover, the quantum PageRank state can be used in "q-sampling" protocols for testing properties of distributions, which require exponentially fewer measurements than all classical schemes designed for the same task. This can be used to decide whether to run a classical update of the PageRank.

quant-ph↗

arXiv2011

Entanglement and its evolution after a quench in the presence of an energy current

We study the Ising spin chain with a Dzyaloshinskii-Moriya interaction focusing on the static and dynamic properties of the entanglement entropy, following a quantum quench. We show that the effects of the additional anisotropic interaction on the phase diagram and on the dynamics of the system are captured by the properties of the entanglement entropy. In particular, the model provides a way to study the quench dynamics in a system with an energy current. We consider quenches starting from an initial excited state of the Ising spin chain, and we analyze the effects of different initial conditions.

cond-mat.stat-mech↗

arXiv2011

Bipartite quantum states and random complex networks

We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of random graphs known as complex networks. In the case of classical random graphs we derive an analytic expression for the averaged entanglement entropy $\bar S$ while for general complex networks we rely on numerics. For large number of nodes $n$ we find a scaling $\bar{S} \sim c \log n +g_e$ where both the prefactor $c$ and the sub-leading O(1) term $g_e$ are a characteristic of the different classes of complex networks. In particular, $g_e$ encodes topological features of the graphs and is named network topological entropy. Our results suggest that quantum entanglement may provide a powerful tool in the analysis of large complex networks with non-trivial topological properties.

quant-ph↗

arXiv2011

Interplay between coherence and decoherence in LHCII photosynthetic complex

This paper investigates the dynamics of excitonic transport in photocomplex LHCII, the primary component of the photosynthetic apparatus in green plants. The dynamics exhibits a strong interplay between coherent processes mediated by the excitonic Hamiltonian, and incoherent processes due to interactions with the environment. The spreading of the exciton over a single monomer is well described by a proper measure of delocalization that allows one to identify two relevant time scales. An exciton initially localized in one chromophore first spreads coherently to neighboring chromophores. During this initial coherent spreading, quantum effects such as entanglement play a role. As the effects of a decohering environment come into play, coherence and decoherence interact to give rise to efficient and robust excitonic transport, reaching a maximum efficiency at the levels of decoherence found in physiological conditions. We analyze the efficiency for different possible topologies (monomer, dimer, trimer, tetramer) and show how the trimer has a particular role both in the antenna and the wire configuration.

quant-ph↗

arXiv2011

Statistical properties of random matrix product states

We study the set of random matrix product states (RMPS) introduced in arXiv:0908.3877 as a tool to explore foundational aspects of quantum statistical mechanics. In the present work, we provide an accurate numerical and analytical investigation of the properties of RMPS. We calculate the average state of the ensemble in the non-homogeneous case, and numerically check the validity of this result. We also suggest using RMPS as a tool to approximate properties of general quantum random states. The numerical simulations presented here support the accuracy and efficiency of this approximation. These results suggest that any generalized canonical state can be approximated with high probability by the reduced density matrix of a random MPS, if the average MPS coincide with the associated microcanonical ensemble.

quant-ph↗

arXiv2010

Typicality in random matrix product states

Recent results suggest that the use of ensembles in Statistical Mechanics may not be necessary for isolated systems, since typically the states of the Hilbert space would have properties similar to the ones of the ensemble. Nevertheless, it is often argued that most of the states of the Hilbert space are non-physical and not good descriptions of realistic systems. Therefore, to better understand the actual power of typicality it is important to ask if it is also a property of a set of physically relevant states. Here we address this issue, studying if and how typicality emerges in the set of matrix product states. We show analytically that typicality occurs for the expectation value of subsystems' observables when the rank of the matrix product state scales polynomially with the size of the system with a power greater than two. We illustrate this result numerically and present some indications that typicality may appear already for a linear scaling of the rank of the matrix product state.

quant-ph↗

arXiv2009

Efficient quantum processing of 3-manifold topological invariants

A quantum algorithm for approximating efficiently 3--manifold topological invariants in the framework of SU(2) Chern-Simons-Witten (CSW) topological quantum field theory at finite values of the coupling constant k is provided. The model of computation adopted is the q-deformed spin network model viewed as a quantum recognizer in the sense of Wiesner and Crutchfield, where each basic unitary transition function can be efficiently processed by a standard quantum circuit. This achievement is an extension of the algorithm for approximating polynomial invariants of colored oriented links found in Refs 2,3. Thus all the significant quantities - partition functions and observables - of quantum CSW theory can be processed efficiently on a quantum computer, reflecting the intrinsic, field-theoretic solvability of such theory at finite k. The paper is supplemented by a critical overview of the basic conceptual tools underlying the construction of quantum invariants of links and 3-manifolds and connections with algorithmic questions that arise in geometry and quantum gravity models are discussed.

quant-ph↗

arXiv2009

Scaling of the fidelity susceptibility in a disordered quantum spin chain

The phase diagram of a quantum XY spin chain with Gaussian-distributed random anisotropies and transverse fields is investigated, with focus on the fidelity susceptibility, a recently introduced quantum information theoretical measure. Monitoring the finite-size scaling of the probability distribution of this quantity as well as its average and typical values, we detect a disorder-induced disappearance of criticality and the emergence of Griffiths phases in this model. It is found that the fidelity susceptibility is not self-averaging near the disorder-free quantum critical lines. At the Ising critical point the fidelity susceptibility scales as a disorder-strength independent stretched exponential of the system size, in contrast with the quadratic scaling at the corresponding point in the disorder-free XY chain. Along the line where the average anisotropy vanishes the fidelity susceptibility appears to scale extensively, whereas in the disorder-free case this point is quantum critical with quadratic finite-size scaling.

quant-ph↗

arXiv2009

Fidelity in topological quantum phases of matter

Quantum phase transitions that take place between two distinct topological phases remain an unexplored area for the applicability of the fidelity approach. Here, we apply this method to spin systems in two and three dimensions and show that the fidelity susceptibility can be used to determine the boundary between different topological phases particular to these models, while at the same time offering information about the critical exponent of the correlation length. The success of this approach relies on its independence on local order parameters or breaking symmetry mechanisms, with which non-topological phases are usually characterized. We also consider a topological insulator/superconducting phase transition in three dimensions and point out the relevant features of fidelity susceptibility at the boundary between these phases.

cond-mat.str-el↗

arXiv2009

Fidelity approach to the disordered quantum XY model

We study the random XY spin chain in a transverse field by analyzing the susceptibility of the ground state fidelity, numerically evaluated through a standard mapping of the model onto quasi-free fermions. It is found that the fidelity susceptibility and its scaling properties provide useful information about the phase diagram. In particular it is possible to determine the Ising critical line and the Griffiths phase regions, in agreement with previous analytical and numerical results.

quant-ph↗

arXiv2006

Quantum automata, braid group and link polynomials

The spin--network quantum simulator model, which essentially encodes the (quantum deformed) SU(2) Racah--Wigner tensor algebra, is particularly suitable to address problems arising in low dimensional topology and group theory. In this combinatorial framework we implement families of finite--states and discrete--time quantum automata capable of accepting the language generated by the braid group, and whose transition amplitudes are colored Jones polynomials. The automaton calculation of the polynomial of (the plat closure of) a link L on 2N strands at any fixed root of unity is shown to be bounded from above by a linear function of the number of crossings of the link, on the one hand, and polynomially bounded in terms of the braid index 2N, on the other. The growth rate of the time complexity function in terms of the integer k appearing in the root of unity q can be estimated to be (polynomially) bounded by resorting to the field theoretical background given by the Chern-Simons theory.

quant-ph↗

arXiv2005

Spin networks, quantum automata and link invariants

The spin network simulator model represents a bridge between (generalized) circuit schemes for standard quantum computation and approaches based on notions from Topological Quantum Field Theories (TQFT). More precisely, when working with purely discrete unitary gates, the simulator is naturally modelled as families of quantum automata which in turn represent discrete versions of topological quantum computation models. Such a quantum combinatorial scheme, which essentially encodes SU(2) Racah--Wigner algebra and its braided counterpart, is particularly suitable to address problems in topology and group theory and we discuss here a finite states--quantum automaton able to accept the language of braid group in view of applications to the problem of estimating link polynomials in Chern--Simons field theory.

gr-qc↗