A formal definition of a computer would be that it is a system whose mechanical time evolution is used to do computation. A computer just like an dassical computer has the bit as unit of information, in the context of computation called a qubit. Because a computer operates in the mechanical domain, a collection of qubits can hold not one value but a superposition of many values. This quantum parallelism is a fundamental advantage that a computer has over a classical computer and algorithms that exploit this feature can be significantly faster than any classical algorithm. That said, the number of algorithm available today is small and their usefulness is limited. Several hardware implementations of computers have been made. Unfortunately existing hardware technology limits the size of these experimental computers to just a few qubits. In chapter 1 we review the field of computation and introduce an interesting new hardware candidate, dubbed the quantum by its creators. This toy is a metallic ring with three embedded ferromagnets. In certain configurations these ferromagnets can induce a current in the ring. In fact the configurations that will or will not induce a current can be identified with an CNOT(XOR) gate. This motivates us to explore the viability of this system using computer simulations. The toy system is related to a long standing problem in condensed matter physics, that of the persistent currents. When a small metal ring is placed in a static magnetic field, the magnetic field will induce a current in the ring. Persistent currents have been observed experimentally and a great discrepancy between theory and experiment was found. The qualitative features of the phenomenon are explained well by theory, but the size of the current measured was one to two orders of magnitude larger then that predicted by experiment. As a second object of this master thesis we will study persistent current numerically using a simple fight-binding model and compare this to existing theory and experiment. In chapter two we review the field of persistent currents and we give an overview of existing theory. To make a simulation tool of a mechanical system basically means that we have to solve the Schrodinger equation numerically. In chapter 3 we briefly discuss two such method, namely the Cranck- Nicholson method and the Suzuki-Trotter method. We will use the latter in our simulation tool. The actual simulation is described in chapter 4. In this chapter we detail the development of the numerical tool and show its correctness at each step. We find that the simulations qualitatively show the same features as we would expect theoretically and experimentally. The size of current is a different matter. When compared to experiment we find that although our results are of the same order of magnitude we cannot make an accurate fit to the experimental data using our simple model. In the last chapter we investigate the properties of the toy system by computer simulations. We will explore its application for computation and its use as a measurement device. Upon investigating how a toy system can be used in a circuit, we find that the toy is not useful for computation. We then focus on the second application1 that of a measurement device. The idea being that we can exploit the dependence of the induced current to the direction of the embedded ferromagnets. To verify if such a scheme will work, we need to investigate if we can reproduce the theoretical values of the induced current. We found major discrepancies between theory and our simulations. We found for instance that the induced current has an erratic dependence on the electron density. We then split our investigation between the single electron case and the half-filled case found in most metals. The single electron case only matches the theory qualitatively. We find that indeed such a single electron system can be build and be used as a measurement device. In the half-filled case we find that the dependence of the current on the various parameters is so erratic that we condude that according to our simulations, a metallic toy could not be used as a measurement device. An explanation for the difference between theory and our simulations could unfortunately not be found. To investigate this we would have to repeat the original calculations, which is outside the scope of this master thesis
A formal definition of a computer would be that it is a system whose mechanical time evolution is used to do computation. A computer just like an dassical computer has the bit as unit of information, in the context of computation called a qubit. Because a computer operates in the mechanical domain, a collection of qubits can hold not one value but a superposition of many values. This quantum parallelism is a fundamental advantage that a computer has over a classical computer and algorithms that exploit this feature can be significantly faster than any classical algorithm. That said, the number of algorithm available today is small and their usefulness is limited. Several hardware implementations of computers have been made. Unfortunately existing hardware technology limits the size of these experimental computers to just a few qubits. In chapter 1 we review the field of computation and introduce an interesting new hardware candidate, dubbed the quantum by its creators. This toy is a metallic ring with three embedded ferromagnets. In certain configurations these ferromagnets can induce a current in the ring. In fact the configurations that will or will not induce a current can be identified with an CNOT(XOR) gate. This motivates us to explore the viability of this system using computer simulations. The toy system is related to a long standing problem in condensed matter physics, that of the persistent currents. When a small metal ring is placed in a static magnetic field, the magnetic field will induce a current in the ring. Persistent currents have been observed experimentally and a great discrepancy between theory and experiment was found. The qualitative features of the phenomenon are explained well by theory, but the size of the current measured was one to two orders of magnitude larger then that predicted by experiment. As a second object of this master thesis we will study persistent current numerically using a simple fight-binding model and compare this to existing theory and experiment. In chapter two we review the field of persistent currents and we give an overview of existing theory. To make a simulation tool of a mechanical system basically means that we have to solve the Schrodinger equation numerically. In chapter 3 we briefly discuss two such method, namely the Cranck- Nicholson method and the Suzuki-Trotter method. We will use the latter in our simulation tool. The actual simulation is described in chapter 4. In this chapter we detail the development of the numerical tool and show its correctness at each step. We find that the simulations qualitatively show the same features as we would expect theoretically and experimentally. The size of current is a different matter. When compared to experiment we find that although our results are of the same order of magnitude we cannot make an accurate fit to the experimental data using our simple model. In the last chapter we investigate the properties of the toy system by computer simulations. We will explore its application for computation and its use as a measurement device. Upon investigating how a toy system can be used in a circuit, we find that the toy is not useful for computation. We then focus on the second application1 that of a measurement device. The idea being that we can exploit the dependence of the induced current to the direction of the embedded ferromagnets. To verify if such a scheme will work, we need to investigate if we can reproduce the theoretical values of the induced current. We found major discrepancies between theory and our simulations. We found for instance that the induced current has an erratic dependence on the electron density. We then split our investigation between the single electron case and the half-filled case found in most metals. The single electron case only matches the theory qualitatively. We find that indeed such a single electron system can be build and be used as a measurement device. In the half-filled case we find that the dependence of the current on the various parameters is so erratic that we condude that according to our simulations, a metallic toy could not be used as a measurement device. An explanation for the difference between theory and our simulations could unfortunately not be found. To investigate this we would have to repeat the original calculations, which is outside the scope of this master thesis
It was Richard Feynman who first proposed, in 1982, the far-reaching concept of \na ”quantum computer”—a device more powerful than classical computers. The idea \nof a quantum computer is to employ the fascinating and often counterintuitive \nlaws of quantum mechanics to process information. It is far from obvious that \nthe proposed concept of a quantum computer is more powerful than its classical \ncounterpart, it was only in 1994 when Peter Shor theoretically demonstrated the \nexistence of a quantum algorithm for factorizing integers into prime factors \nthat runs in polynomial time unlike its classical counterpart which works in \nsub-exponential time. The factorization of integers into prime factors is the \nbasis of asymmetric cryptography. These early theoretical results lunched an \nimmense interest of the scientific community. Already during ’90s, the first \nproposals for the physical implementation of quantum computation emerged. Ever \nsince, many experimental groups around the world pursued different physical \nimplementations of quantum bits (qubits). The first decade of the new century \nsaw a steady improvement in the control and decoherence time (the time over \nwhich the information carried by the qubit is lost) for various qubits by many \norders of magnitude. The natural next step in this context is to answer the \nquestion of how to scale the system up to include many qubits and thus build a \nquantum computer? One of the main parts of this thesis addresses exactly this \nquestion, namely the question of architecture and scalability of future quantum \ncomputer. \n \nAmong various different physical realizations of qubits, the idea of using \nelectron spins trapped in electrostatic semiconductor quantum dots as the \nbuilding blocks of a quantum computer (the so-called spin qubits), put forward \nby Daniel Loss and David DiVincenzo in 1997, triggered tremendous interest in \nscientific community. Nevertheless, the implementation of the original \nLoss-DiVincenzo proposal posed a considerable technical challenge. It used \nquantum tunneling between qubits to enable their communication with each other, \nand thus required that the qubits to be placed very close to each other. This \nrequirement not only leaves little \nspace for the placement of the vast amount of gates and wirings needed to define \nthe electrostatic quantum dots, but also makes it challenging to control the \nlocal magnetic field needed for single-qubit operations. For these reasons, no \nsystem with more than a couple of spin qubits has been \nsuccessfully implemented thus far. In the first part of this thesis, we leap \nover this long-standing problem with an entirely different strategy of using \nmetallic floating gates or ferromagnets to couple together qubits that are \nseparated over a long distance. Our scheme works for any type of \nspin qubits, including the qubits based on nitrogen-vacancy center (NV-center) \nin diamond and technologically very important silicon qubits. \n \nThe main topic of this thesis is related to quantum computer. Still, quite \nunexpectedly, some of the ideas we employed in order to tackle the problem of \nquantum computer scalability can be utilized in a completely different field of \nresearch, namely, in the field of magnetic field sensing. Qubit are not only a \nnecessary ingredient of quantum computer but they also provide a way to measure \nvery accurately magnetic fields. The magnetometer build upon the qubit based on \nNV-center, so-called NV-magnetometer, emerged in recent years as most sensitive \nmagnetic moment sensor. These magnetometers are able to detect about hundred \nnuclear spins within a minute of acquisition time. In the second part of this \nthesis, we propose an entirely novel experimental realization of \nNV-magnetometers which increases present NV-center sensitivities by four orders \nof magnitude at room temperature. This unprecedented amplification of \nsensitivity will render magnetometers capable of detecting individual nuclear \nspins. This amplification is achieved by introducing a ferromagnetic particle \nbetween the nuclear spin that needs to be detected and the NV-magnetometer. Our \nsetup, in contrast to existing schemes, is particularly advantageous because, \ndue to the large amplification of sensitivity, the nuclear spin need not lie \nwithin a few nanometers of the surface but rather can be detectable at a \ndistance of 30 nm. With these novelties, our scheme provides chemically \nsensitive spin detection under ambient conditions allowing nanoscale resolution \nof nuclear magnetic moments in biological systems—the holy grail of nuclear \nmagneticresonance. \n \nIn the last part of the thesis we focus our attention to a new direction in \nquantum computer implementation that deals with topological quantum computer \nintroduced by Alexei Kitaev in 1997; in this approach the idea is to use \nquasiparticles with ”fractional” statistics and to perform the single- and \ntwo-qubit gates by merely exchanging these quasiparticles. Additionally, \ninformation in this system is stored non-locally thus it mitigates the problem \nof decoherence caused by local noise from the environment. Majorana fermions are \none of the most well known examples of such excitations. We analyze transport \nsignatures of different topological states in one-dimensional systems, like \nMajorana fermions and fractionally charged states. We envision an Aharonov-Bohm \nsetup wherein conductance measurement provides a clear signature of presence of \nfractionally charged fermionic states, since oscillations with double period \nemerge in this case. Additionally, we propose a very simple setup that enables \nexistence of degenerate mid-gap states, so-called Tamm-Shockley states that are \ncharacterized by fractional charge and discuss possible ways of detecting these \nstates experimentally. \n
Information is a physical. Physical systems register and process information. These facts generated enormus interest in the development of novel quantum tecnologies, especially because the construction of smaller electronic devices ultimately leads to a consideration of quantum mechanical effects in electronic and computer desingns. The notion of the classical bit of information theory was formally pushed into the realm of the quanta with the introduction of the quantum bit or qubit, in the seminal works of Deutsch (Deutsch, 1985) and Shor (Shor, 1994). They demostrated that, indeed, controlled multipartite qubit interference effects could provide the means for a radical new way of computing, allowing the computation of many intractable computational problems, such as the factoring of large number or exact simulation of large quantum systems. The field of experimental and theoretical research in quantum information and computation has emerged as very important player in the understanding of quantum phenomena the both the basic and technological levels. This has attracted the attention of numerous researchers with backgrounds ranging from computer science, mathematics and engineerin, to the physical sciences, and we now have an interdisciplinary field where great efforts are being made in order to build devices that allow the progressing of information at a quantum level. A concise introduction to the field of quantum information and quantum computation is presented. This stars with the bassic definitions of bits, quantum registers, through to the universal gate-set for building the universal quantum computer, from a quantum network model of computation. The work shows how two-qubit gates suffice for quantum computation, emphasing the power of the quantum circuit representation for entagling and disentagling quantum states. This leads to the “no-cloning theorem”, which leads us to many interesting applications, such as quantum cryptography. Two alternative approaches or performing quantum computation are also described i) the one-way or measurement based quantum computer method, and ii) holonomic or geometric quantum computation. Following this, quantum entaglement quantification is highlighted, particulary its usefulness as a communication resource, in order to describe some of its most celebrated practical applications to date: quantum teleportation, cryptography, dens coding, and data compression. Deutsch’s concept of quantum parallelism is enphasized in order to gain insight into the potential for efficiently solving certain classically intratable algorithms. A subject central to the field of QIP- quantum decoherence- is then introduced.. Possible ways to overcome it, in particular quantum error correction, are discussed. A descriptios of some of the currently available hardware of the practical implementation of quantum computation is provided with a discussion of the main physical quantum bits that are currently employed (or proposed) for a such a purpose.
Over the last decade, quantum simulation and computation has progressed from a purely scientific testbed of quantum mechanics to a mature field that is starting to offer new insights into materials, quantum effects, and algorithms that are intractable with even the most state-of-the-art classical computation. Simulating certain quantum Hamiltonians that are theorized to be at the heart of high-Tc superconductivity, topological quantum systems such as the fractional quantum Hall effect or fundamental questions of thermalization quickly exceed the available memory of even the most advanced supercomputers – and in fact all memory in the world – due to the exponential growth of the Hilbert space with system size. As postulated by Feynman himself, the computational system best suited for solving quantum problems is to use a quantum system itself, as it can intrinsically represent the entanglement that is the key resource making quantum computing challenging but also promising. Apart from simulating problems in physics and chemistry, there is also tremendous excitement for quantum computers to provide speedups for general algorithms in optimization at a rate that is exponentially faster than existing classical programming. So far only a small class of algorithms has been actually proven to provide such a speedup, most prominently Shor's algorithm which can factor large prime numbers, and several other search and oracle algorithms. In the last two decades, many experiments using ultracold atoms, ions, or superconducting circuits have focused on analog quantum simulation. Here, a model Hamiltonian that is believed to capture all the relevant physics of the system of study is experimentally realized using different building blocks and interactions but replicating condensed matter effects at an increased scale. This has led to a number of bespoke experiments such as BEC/Fermigass machines, quantum gas microscopes and more exotic setups that are purpose built to study a particular effect. More recently, there has been a shift to develop more universal simulation platforms and optical tweezer arrays have emerged as a leading solution due to their high degree of reconfigurability. Through tremendous improvements in the degree of control and measurement of single qubits, error correction has become a viable route to build a true universal digital quantum computer. Even as we transition into the digital age of quantum simulation, certain classes of problems with additional physics constraints such as Fermionic statistics, gauge fields and lattice gauge theories still incur too large of an overhead to be encoded on these digital simulators. In this thesis, we use a highly degenerate twisted cavity to simulate the effect of a magnetic field on a two-dimensional system of interacting photons to enable realization of states of the quantum Hall effect. We design, build, and commission a new lens based cavity apparatus realizing a lowest Landau level for a mesoscopic number of modes. We demonstrate the integration of highly excited Rydberg atoms to mediate strong interactions and demonstrate photon blockade as well as mean field interactions. As a second application of cavities to quantum information leveraging our newfound comfort with intra-cavity optics, and experience with aberration modeling in resonators, we demonstrate a new class of small waist optical resonators enabled by lens-based cavities and then apply our understanding of optical aberrations in cavities to the development of a new class of cavity array. This Cavity Array Microscope (CAM) realizes a large number of cavities (up to currently 600) using only a fixed number of free space optics and is both scalable with constant overhead as well as compatible with Rydberg atoms. This platform provides a route to highly parallel quantum repeater operation or entanglement generation between atom arrays in the future.
This thesis is concerned with the design of numerical methods for quantum simulation and the development of improved models for quantum relaxation. Analysis is presented for the treatment of quantum systems using the density matrix formalism. This approach has been developed from the early days of quantum mechanics as a tool to describe from a statistical point of view a large number of identical quantum ensembles. Traditional methods are well established and reliable, but they perform poorly for practical simulation as the system size is scaled up. Ad hoc schemes for nuclear spin dynamics appearing in the literature can be shown to fail in certain situations. The challenge is therefore to identify efficient reduction methods for the quantum system which are also based on a rigorous foundation. The method presented in the thesis, for the time–independent Hamiltonian case, combines a quantum density matrix formalism with a procedure based on Chebyshev polynomials; application of the method to Nuclear Magnetic Resonance (NMR) spectroscopy is considered, and it is shown that the new technique outperforms existing alternatives in term of computational costs. The case of a time–dependent Hamiltonian in NMR simulation is studied as well and some splitting methods are presented. To the author’s knowledge this is the first time such methods have been applied within the NMR framework, and the numerical results show a better error–to–cost rate than traditional methods. In a separate strand of research, formulations for open quantum systems are studied and new dynamical systems approaches are considered for this problem. Motivations This thesis work is mainly focused on nuclear spin dynamics. Nuclear spin dynamics constitutes the basis for NMR, which is a very powerful spectroscopy technique that exploits the interaction between nuclear spins and magnetic fields. The same technique is used to reveal the presence of hydrogen atoms in the blood for Magnetic Resonance Imaging (MRI). Within this framework the role of simulations is extremely important, as it provides a benchmark for studies of new materials, and the development of new magnetic fields. The main computational issue is that with current software for NMR simulation it is extremely expensive to deal with systems made of more than few (7–10) spins. There is therefore a strong need to develop new algorithms capable of simulating larger systems. In recent years NMR simulations have been found to be one of the most favorable candidates for quantum computing. There are two reasons for this: nuclear quantum states maintain extremely long coherences, and it is possible to attain a very strong control on the quantum state via the application of sequences of pulses. In order to develop a proper quantum computer it is fundamental to understand how the entangled states lose coherence and relax back to equilibrium by means of external interactions. This process is described as relaxation in an open quantum system. The theory for such systems has been available for 50 years but there are still substantial limitations in the two main approaches. There are also relatively few numerical approaches for the simulation of such systems, for this reason it is important to develop numerical alternatives for the description of open quantum systems. Thesis Outline The thesis is organized as follow: the first two chapters provide background material to familiarize the reader with fundamental concepts of both quantum mechanics and nuclear spin dynamics; in this part of the thesis no new results are presented. The first chapter introduces the concept of quantum systems and the mathematical environment with which we describe those systems. We also present the main equations we need to solve to determine the dynamics of a quantum system in a statistical framework. In the second chapter we introduce the nuclear spin system, that is the physical system that has been the main reference frame in this work, for both tests and practical applications of the new algorithms. We describe how nuclear spin systems are at the basis of very important applications like NMR spectroscopy and MRI. We present in some detail the physical features of the NMR technique and the equations we need to solve to describe the dynamics of a spin system; we also focus on the relevance of numerical simulations for these systems, and consequently which must be the interest in developing new algorithms, and the major obstacles which must be overcome. In the third chapter we investigate the numerical challenges that arise in simulation of quantum systems, we describe some of the methods that have been developed in the literature, focusing on the performances and the computational costs of them, setting the new developments of this thesis in the proper research frame. We discuss one of the major issues: the evaluation of the matrix exponential. We also present the analysis we have done of a recent method called Zero Track Elimination (ZTE) that has been developed specifically for NMR simulations. This analysis shows the limitations of this method but also gives a mathematical explanation of why–and in which cases–it works. In the fourth chapter we present the main result of the thesis, the development of a new method that directly evaluates the expectation values for a quantum simulation via a different application of the well known Chebyshev expansion. We have proved that this new method can provide an excellent boost in terms of performance, with computational costs that can be reduced by a factor ten in common cases. (The results of this chapter and the new method have been presented in international conferences and recently they have been submitted for publication). We also present some attempts we have made in the application of splitting methods for the evolution of the system in a time dependent environment. To our knowledge this is the first time splitting methods have been used for NMR simulations. The results of this approach are as follows: for a particular splitting technique combined with a Lanczos iteration method it is possible to speed up the calculation by a third if compared with a Lanczos type method whilst keeping the error below a critical threshold. This last approach is still a work in progress especially in terms of developing clever ways to split the Hamiltonian. The last chapter of this thesis deals with simulation of quantum systems interacting with an external environment. After presenting the main theoretical approaches for the description of such systems we then survey several the techniques that are currently used for the numerical implementation of such theories. As a work in progress we present a considerably different new approach we have been developing aiming to overcome some of the issues that arise when treating this kind of system within usual frameworks. This is somewhat speculative work that gives rise to some new directions in the development of a numerical description for open quantum systems. We also present some numerical results. (The main core of this chapter has been presented in international conferences).
Quantum computation is not an imminent achievement . We will not wake up tomorrow and find quantum computers on our desks. At the time of this writing, IBM has just unveiled the Condor – a chip containing 1,121 superconducting qubits. This number will likely increase (perhaps spectacularly) in the near future. However, the qubits have a relatively large error rate and, in the absence of a breakthrough advance that significantly lowers this rate, one would need hundreds of physical qubits to realize an error-corrected logical qubit. Predicting how long it will take to achieve the controlled manipulation of thousands of (logical) qubits (i.e., a number of qubits consistent with the “useful” implementation of known quantum algorithms) is probably not a rational undertaking, at least for a scientist. The most pessimistic experts regard the lively research activity in quantum computation as a waste of time and resources. But the pervading mood in this field is one of cautious optimism, particularly considering the possibility of achieving useful tasks (e.g., simulating quantum systems) with a sufficiently large number of “imperfect” qubits. Expediency may be responsible for some of this optimism; a good feeling about the prospects for quantum computation certainly helps when it comes to publishing papers and getting funded. Ultimately, however, the responsibility for the wise distribution of resources rests with the funding agencies; scientists, on the other hand, are called to explore every aspect of real and possible worlds that looks fascinating and worthy of their curiosity. From this perspective, quantum computation (defined broadly) offers plenty of opportunities for producing “good science.” The problems brought to the fore by the development of this field range from basic questions regarding the foundations of quantum mechanics and unsolved problems in computational complexity, to the investigation of new phases of matter (e.g., topological quantum phases), the quest for “complete” control over quantum systems, and the critical need for significant advances in materials science and device fabrication (e.g., engineering nanoscale heterostructures with atomic precision). Progress in these areas will naturally open new possibilities for interesting applications. Precisely identifying these applications is premature, but building a (general purpose) quantum computer will not necessarily be among the first of them.
The theory of statistical mechanics provides a powerful conceptual framework within which the relevant (macroscopic) features of systems at equilibrium can be described. As there is currently no equivalent capable of encompassing the much richer class of non-equilibrium phenomena, research in this direction proceeds mainly on an instance-by-instance basis. The aim of this Thesis is to describe in some detail three such attempts, which involve different dynamical aspects of classical and quantum systems. As summarised below, each of the last three Chapters of this document delves into one of these different topics, while Chapter 2 provides a brief introduction on the study of non-equilibrium dynamics. In Chapter 3 we investigate the purely relaxational dynamics of classical critical ferromagnetic systems in the proximity of surfaces, paying particular attention to the effects that the latter induce on the early stages of the evolution following an abrupt change in the temperature of the sample. When the latter ends close enough to the critical value which separates the paramagnetic from the ferromagnetic phase, it effectively introduces a temporal boundary which can be treated as if it were a surface. Within this picture, we highlight the emergence of novel effects near the effective edge formed by the intersection of the two spatial and temporal boundaries. Our findings are apparently in disagreement with previous predictions which were based on the assumption that the presence of such an edge would not affect the scaling behaviour of observables; in order to explain this discrepancy, we propose an alternative for the original power-counting argument which, at least, correctly predicts the emergence of novel field-theoretical divergences in our one-loop calculations. We show that said singularities are associated with the scaling at the edge. Moreover, by encoding our findings in a boundary renormalisation group framework, we argue that the new predicted behaviour represents a universal feature associated to the short-distance expansion of the order parameter of the transition near the edge; we also calculate explicitly its anomalous dimension at the first-order in a dimensional expansion. As a qualitative feature, this anomalous dimension depends on the type of phase transition occurring at the surface. We exploit this fact in order to provide numerical support to our predictions via Monte Carlo simulations of the dynamical behaviour of a three-dimensional Ising model. The main results reported in Chap. 3 have appeared in Ref. [1]. In Chapter 4 we revisit the Euclidean mapping to imaginary times which has been recently proposed [2, 3] as an alternative for approaching the problem of quantum dynamics following a quench. This is expected to allow one to reformulate the original problem as a static one confined in a film geometry. We show that this interpretation actually holds only if the initial state of the dynamics is pure. Statistical mixtures, instead, intertwine the effects due to the two boundaries, which therefore cannot be regarded as being independent. We emphasize that, although the aforementioned reinterpretation as a confined static problem fails, one is still able, in principle, to write down and solve the corresponding equations. We also discuss in some detail the relation between this approach and the real-time field-theoretical one which makes use of the two-time Keldysh contour. For this purpose, we study the analytical structure of relevant observables — such as correlation functions — in the complex plane of times, identifying a subdivision of this domain into several sectors which depend on the ordering of the imaginary parts of the involved time coordinates. Within each of these subdomains, the analytic continuation to the real axis provides in principle a different result. This feature allows one to reconstruct from the Euclidean formalism all possible non-time-ordered functions, which in particular include all those which can be calculated via the Keldysh two-time formalism. Moreover, we give a prescription on how to retrieve response functions, discussing some simple examples and rationalising some recent numerical data obtained for one of these observables in a one-dimensional quantum Ising chain [4]. We also highlight the emergence of a light-cone effect fairly similar to the one previously found for correlation functions [2], which therefore provides further confirmation to the fact that information travels across the system in the form of the entanglement of quasi-particles produced by the quenching procedure. We have reported part of this analysis in Ref. [5]. Chapter 5 presents part of our recent work on effective relaxation in quantum systems following a quench and on the observed prethermalisation. We analyse the effects caused by the introduction of a long-range integrability-breaking interaction in the early stages of the dynamics of an otherwise integrable quantum spin chain following a quench in the magnetic field. By employing a suitable transformation, we redefine the theory in terms of a fully-connected model of hard-core bosons, which allows us to exploit the (generically) low density of excitations for rendering our model exactly solvable (in a numerical sense, i.e., by numerically diagonalising an exact matrix). We verify that, indeed, as long as the parameters of the quench are not too close to the critical point, the low-density approximation captures the dynamical features of the elementary operators, highlighting the appearance of marked plateaux in their dynamics, which we reinterpret as the emergence of a prethermal regime in the original model. As expected, the latter behaviour is reflected also on extensive observables which can be constructed as appropriate combinations of the mode populations. For these quantities, the typical approach to the quasi-stationary value is algebraic with exponent a ≈ 3, independently of the size of the system, the strength of the interaction and the amplitude of the magnetic field (as long as it is kept far from the critical point). The plateaux mentioned above last until a recurrence time — which can be approximately identified with tR ≈ N/2 for single modes and t′R ≈ N/4 for extensive quantities — after which quantum oscillations due to the finite size of the chain reappear. Our procedure allows us to shed some light over prethermal features without having to considerably limit the size of the system, which we can choose to be quite large, as we discuss in Ref. [6].