Motivated by recent advances in quantum technologies, we investigate entanglement spreading and excitation transport within quantum complex networks. For this purpose, we adopt a description in which network nodes represent sites of the physical system (e.g. qubits), and links represent pairs of sites coupled by the Hamiltonian [Bentsen et al., Phys Rev Lett (2019)]. We consider a random tunable-range model [Gori et al., Phys Rev E (2017)] which, in terms of only two parameters, encompasses a large variety of graphs and reduces, in limiting cases, to well-studied benchmarks. Then, it is equipped with a paradigmatic Hamiltonian consisting of hopping terms on the network links. Building on known results [Gori et al., Phys Rev E (2017)], we first study the classical case, providing new semi-analytical estimates. We then address quantum dynamics: For the single-particle case, we analyse the asymptotic entanglement entropy between two halves of the system, computed by Exact Diagonalization. Surprisingly, we observe a new localization region for intermediate ranges of the network links. To understand this phenomenon, we introduce an approximate one-dimensional model and try to relate dynamics to network measures. The analysis is extended to half-filling using fermionic Gaussian states, obtaining results close to the single-particle ones that raise new interesting questions for future work. It is concluded that this model exhibits non-trivial behaviour, especially in the region where unexpected localization occurs. We infer that this is determined by the interplay between network features and quantum effects, possibly induced by structural disorder.
Motivated by recent advances in quantum technologies, we investigate entanglement spreading and excitation transport within quantum complex networks. For this purpose, we adopt a description in which network nodes represent sites of the physical system (e.g. qubits), and links represent pairs of sites coupled by the Hamiltonian [Bentsen et al., Phys Rev Lett (2019)]. We consider a random tunable-range model [Gori et al., Phys Rev E (2017)] which, in terms of only two parameters, encompasses a large variety of graphs and reduces, in limiting cases, to well-studied benchmarks. Then, it is equipped with a paradigmatic Hamiltonian consisting of hopping terms on the network links. Building on known results [Gori et al., Phys Rev E (2017)], we first study the classical case, providing new semi-analytical estimates. We then address quantum dynamics: For the single-particle case, we analyse the asymptotic entanglement entropy between two halves of the system, computed by Exact Diagonalization. Surprisingly, we observe a new localization region for intermediate ranges of the network links. To understand this phenomenon, we introduce an approximate one-dimensional model and try to relate dynamics to network measures. The analysis is extended to half-filling using fermionic Gaussian states, obtaining results close to the single-particle ones that raise new interesting questions for future work. It is concluded that this model exhibits non-trivial behaviour, especially in the region where unexpected localization occurs. We infer that this is determined by the interplay between network features and quantum effects, possibly induced by structural disorder.
Quantum many-body Hamiltonians with two-body interactions can be represented by graphs, with sites as nodes and two-site couplings as edges. We investigate how the geometry of these graphs affects transport and entanglement growth. To do so, we study dynamics for quantum hopping on a random graph model with an effective range parameter. Tuning it, we interpolate between nearest-neighbor and all-to-all graphs, identifying a new localization regime that is robust in both single-particle and finite-density cases. This provides a model of Anderson localization induced by structural disorder, with implications for amorphous materials and tunable-range analog quantum simulators.
This Thesis contributes to the theory of entanglement distribution in quantum networks, analyzing the generation of long-distance entanglement in particular.We consider that neighboring stations share one partially entangled pair of qubits, which emphasizes the difficulty of creating remote entanglement in realistic settings.The task is then to design local quantum operations at the stations, such that the entanglement present in the links of the whole network gets concentrated between few parties only, regardless of their spatial arrangement.First, we study quantum networks with a two-dimensional lattice structure, where quantum connections between the stations (nodes) are described by non-maximally entangled pure states (links).We show that the generation of a perfectly entangled pair of qubits over an arbitrarily long distance is possible if the initial entanglement of the links is larger than a threshold.This critical value highly depends on the geometry of the lattice, in particular on the connectivity of the nodes, and is related to a classical percolation problem.We then develop a genuine quantum strategy based on multipartite entanglement, improving both the threshold and the success probability of the generation of long-distance entanglement.Second, we consider a mixed-state definition of the connections of the quantum networks.This formalism is well-adapted for a more realistic description of systems in which noise (random errors) inevitably occurs.New techniques are required to create remote entanglement in this setting, and we show how to locally extract and globally process some error syndromes in order to create useful long-distance quantum correlations.Finally, we turn to networks that have a complex topology, which is the case for most real-world communication networks such as the Internet for instance.Besides many other characteristics, these systems have in common the small-world feature, stating that any two nodes are separated by a few links only.Based on the theory of random graphs, we propose a model of quantum complex networks, which exhibit some totally unexpected properties compared to their classical counterparts.5.1 Propagation of a large GHZ state through the lattice . . .5.2 Bit-flip error correction . . . . . . . . . . . . .
The title of the present dissertation Decoherence in Quantum Network sounds very general and all-inclusive. Indeed it embraces two topics (decoherence and quantum network) from the area of Quantum Mechanics each of which is described in all respects by a huge literature developed in the last three decades [...]. Quantum decoherence, as the name lets it mean, is the mechanism that makes a quantum system loose its coherence properties, and with them the capability of giving rise to interference phenomena or to other interesting quantum effects [...]. The key idea promoted by decoherence is the insight that realistic quantum systems are never isolated, but are immersed in the surrounding environment and interact continuously with it [...]. As an example one may consider a two-level quantum system (i.e. a quantum bit, usually shortened with a terminology from information science to \\qubit" ) in contact with a wide environment. Hence, quantum systems are open systems, and continuously interact or exchange information with an external environment whose degrees of freedom are too numerous to be monitored. The resulting correlation between the system and the environment spoils quantum coherence and brings about the transition from a pure quantum state to a mixture of quantum state resulting a classical state. To describe decoherence different kind of approaches can be used (for example Master equation, random matrix, etc). A quantum network typically consists of a number of quantum objects (e.g., atoms, ions, quantum dots, cavities, etc.), to be referred to hereafter as the sites or the nodes of the network. They can interact and the interactions (or their correlations) will be usually described by the edges of a graph. Quantum networks can address different information processing tasks. For instance a quantum state can be transferred from qubit to qubit down a chain solely due to the interactions, that is according to the laws of quantum physics [...]. Quantum networks offer us new opportunities and phenomena as compared to classical networks. An extension to large scale of the idea of a quantum network could lead to a futurible quantum internet [...]. The study of networks has traditionally been the territory of graph theory [...], also with the advent of their quantum versions. Within simple quantum network model information processing is usually described by assuming perfect control of the underlying graph. However, this is not much realistic since randomness is often present and it leads to decoherence effects [...]. In contrast, the conservation of coherence is essential for any quantum information process [...], hence there is a persistent interest in decoherence effects in quantum networks, which motivate us to study models for describing such noisy effects. We consider a simple model of quantum network, employing qubits (spin-1/2 particles) attached to the nodes of an underlying graph and we study the simplest task, namely information storage (on a single and two qubits), when the graph randomly changes in time. Actually we randomly add edges to an initially disconnected graph according to the Gilbert model characterized by a weighting parameter ex [...] and in an identically and independent way at each time step. We find that by increasing ex the dynamics of relevant quantities like fidelity, entropy or concurrence, gradually transforms from damped to damped oscillatory and finally to purely oscillatory. That leads to the paper [see, Information dissipation in random quantum networks, by U. Farooq and S. Mancini, OSID 21(3), 1450004, 2014]. We also study a system composed by pairs of qubits attached to each node of a linear chain, a model that stems from quantum dot arrays. Here we use the approach of evolution with a stochastic Hamiltonian to describe the noisy effects. We then evaluate the effect of two most common disorders, namely exchange coupling and hyperfine interaction fluctuations, in adiabatic preparation of ground state in such model. We show that the adiabatic ground state preparation is highly robust against these disorders making the chain a good analog simulator. Moreover, we also study the adiabatic information transfer, using singlet-triplet states, across the chain. In contrast to ground state preparation the transfer mechanism is highly affected by disorders. This suggested that for communication tasks across such chains adiabatic evolution is not as effective and quantum quenches would be preferable. That leads to the paper [see, Adiabatic many-body state preparation and information transfer in quantum dot arrays, by U. Farooq, A. Bayat, S. Mancini and S. Bose Phys. Rev. B 91, 134303, 2015]. The present work is organized as follows. In chapter 1, we shall give a survey of the various types of approach which can be employed to analyse the dynamics of open quantum systems that leads to decoherence effects. In chapter 2, we shall give a general description about quantum network and its possible applications. In chapter 3, we shall discuss the problem of quantum state transfer in qubit network and shall give a brief overview of some scheme that enable nearly prefect state transfer. In chapter 4, we shall discuss singlet-triplet networks, that is networks having on each site a pair of (generally entangled) qubit. Then within this framework we propose a model stemming from quantum dot array. There we shall address the problem of ground state preparation and state transfer. Finally we shall describe the inherent entanglement of the ground state of strongly correlated systems can be exploited for both classical and quantum communications. In chapter 5, we shall propose a decoherence model for qubit networks based on edges representing XY interactions randomly added to a disconnected graph accordingly to a suitable probability distribution. In this way we shall describe dissipation of information initially localize in single or two qubits all over the network. In chapter 6 we shall model the noisy effects in the quantum dot array introduced in chapter 4 and investigate their consequences on the preparation of ground state and quantum state transfer mechanism. Finally we shall draw conclusions.
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 while for general complex networks we rely on numerics. For a large number of nodes n we find a scaling where both the prefactor c and the sub-leading O (1) term g e are 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 for the analysis of large complex networks with non-trivial topological properties.
We consider two measures of entanglement, the logarithmic negativity, and the entanglement entropy, between regions of space in excited states of many-body systems formed by a finite number of particle excitations. In Papers I and II [O. A. Castro-Alvaredo et al., J. High Energy Phys. 2018(10), 39; ibid., e-print arXiv:1904.01035 (2019)], it has been shown in one-dimensional free-particle models that, in the limit of large system’s and regions’ sizes, the contribution from the particles is given by the entanglement of natural qubit states, representing the uniform distribution of particles in space. We show that the replica logarithmic negativity and Rényi entanglement entropy of such qubit states are equal to the partition functions of certain graphs, formed out of Wick pairings, which encode the topology of the manifold induced by permutation twist fields. Using this new connection, we provide a general proof, in the massive free boson model, which the qubit result holds in any dimensionality and for any regions’ shapes and topology. The proof is based on clustering and the permutation-twist exchange relations and is potentially generalizable to other situations, such as lattice models, particle and hole excitations above generalized Gibbs ensembles, and interacting integrable models.
In this thesis I present contributions to the development, analysis and application of tensor network state methods for numerically exact quantum dynamics in one and two-dimensional lattice systems. The setting of numerically exact quantum dynamics is introduced in Chapter 2. This includes a discussion of exact diagonalization approaches and massively parallel implementations thereof as well as a brief introduction of tensor network states. In Chapter 3, I perform a detailed analysis of the performance of n-ary tree tensor network states for simulating the dynamics of two-dimensional lattices. This constitutes the first application of this class of tensor network to dynamics in two spatial dimensions, a long-standing challenge, and the method is found to perform on par with existing state-of-the-art approaches. Chapter 4 showcases the efficacy of a novel tensor network format I developed, tailored to electron-phonon coupled problems in their single-electron sector, through an application to the Holstein model. The applicability of the approach to a broad range of parameters of the model allows to reveal the strong influence of the spread of the electron distribution on the initial state of the phonons at the site where the electron is introduced, for which a simple physical picture is offered. I depart from method development in Chapter 5 and analyse the prospects of using tensor network states evolved using the time-dependent variational principle as an approximate approach to determine asymptotic transport properties with a finite, moderate computational effort. The method is shown to not yield the correct asymptotics in a clean, non-integrable system and can thus not be expected to work in generic systems, outside of finely tuned parameter regimes of certain models. Chapters 6 and 7 are concerned with studies of spin transport in long-range interacting systems using tensor network state methods. For the clean case, discussed in Chapter 6, we find that for sufficiently short-ranged interactions, the spreading of the bulk of the excitation is diffusive and thus dominated by the local part of the interaction, while the tail of the excitation decays with a powerlaw that is twice as large as the powerlaw of the interaction. Similarly, in the disordered case, analysed in Chapter 7, we find subdiffusive transport of spin and sub-linear growth of entanglement entropy. This behaviour is in agreement with the behaviour of systems with local interactions at intermediate disorder strength, but provides evidence against the phenomelogical Griffith picture of rare, strongly disordered insulating regions. We generalize the latter to long-ranged interactions and show that it predicts to diffusion, in contrast to the local case where it results in subdiffusive behaviour.