Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userReconstructing the thermal Green functions at real times from those at imaginary times
49
0
0.0
(
0
)
Added by
Gianaurelio Cuniberti
Publication date
2001
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
By exploiting the analyticity and boundary value properties of the thermal Green functions that result from the KMS condition in both time and energy complex variables, we treat the general (non-perturbative) problem of recovering the thermal functions at real times from the corresponding functions at imaginary times, introduced as primary objects in the Matsubara formalism. The key property on which we rely is the fact that the Fourier transforms of the retarded and advanced functions in the energy variable have to be the `unique Carlsonian analytic interpolations of the Fourier coefficients of the imaginary-time correlator, the latter being taken at the discrete Matsubara imaginary energies, respectively in the upper and lower half-planes. Starting from the Fourier coefficients regarded as `data set, we then develop a method based on the Pollaczek polynomials for constructing explicitly their analytic interpolations.
rate research
Read More
We extend the recently developed Quantum Quasi-Monte Carlo (QQMC) approach to obtain the full frequency dependence of Green functions in a single calculation. QQMC is a general approach for calculating high-order perturbative expansions in power of the electron-electron interaction strength. In contrast to conventional Markov chain Monte Carlo sampling, QQMC uses low-discrepancy sequences for a more uniform sampling of the multi-dimensional integrals involved and can potentially outperform Monte Carlo by several orders of magnitudes. A core concept of QQMC is the a priori construction of a model function that approximates the integrand and is used to optimize the sampling distribution. In this paper, we show that the model function concept extends to a kernel approach for the computation of Green functions. We illustrate the approach on the Anderson impurity model and show that the scaling of the error with the number of integrand evaluations $N$ is $sim 1/N^{0.86}$ in the best cases, and comparable to Monte Carlo scaling $sim 1/N^{0.5}$ in the worst cases. We find a systematic improvement over Monte Carlo sampling by at least two orders of magnitude while using a basic form of model function. Finally, we compare QQMC results with calculations performed with the Fork Tensor Product State (FTPS) method, a recently developed tensor network approach for solving impurity problems. Applying a simple Pade approximant for the series resummation, we find that QQMC matches the FTPS results beyond the perturbative regime.
Recent experiments by Springer and Kenyon have shown that a deep neural network can be trained to predict the action of $t$ steps of Conways Game of Life automaton given millions of examples of this action on random initial states. However, training was never completely successful for $t>1$, and even when successful, a reconstruction of the elementary rule ($t=1$) from $t>1$ data is not within the scope of what the neural network can deliver. We describe an alternative network-like method, based on constraint projections, where this is possible. From a single data item this method perfectly reconstructs not just the automaton rule but also the states in the time steps it did not see. For a unique reconstruction, the size of the initial state need only be large enough that it and the $t-1$ states it evolves into contain all possible automaton input patterns. We demonstrate the method on 1D binary cellular automata that take inputs from $n$ adjacent cells. The unknown rules in our experiments are not restricted to simple rules derived from a few linear functions on the inputs (as in Game of Life), but include all $2^{2^n}$ possible rules on $n$ inputs. Our results extend to $n=6$, for which exhaustive rule-search is not feasible. By relaxing translational symmetry in space and also time, our method is attractive as a platform for the learning of binary data, since the discreteness of the variables does not pose the same challenge it does for gradient-based methods.
In this paper we focus our attention on a particle that follows a unidirectional quantum walk, an alternative version of the nowadays widespread discrete-time quantum walk on a line. Here the walker at each time step can either remain in place or move in a fixed direction, e.g., rightward or upward. While both formulations are essentially equivalent, the present approach leads to consider Discrete Fourier Transforms, which eventually results in obtaining explicit expressions for the wave functions in terms of finite sums, and allows the use of efficient algorithms based on the Fast Fourier Transform. The wave functions here obtained govern the probability of finding the particle at any given location, but determine as well the exit-time probability of the walker from a fixed interval, which is also analyzed.
Building on previous developments, we show that the Diagrammatic Monte Carlo technique allows to compute finite temperature response functions directly on the real-frequency axis within any field-theoretical formulation of the interacting fermion problem. There are no limitations on the type and nature of the systems action or whether partial summation and self-consistent treatment of certain diagram classes are used. In particular, by eliminating the need for numerical analytic continuation from a Matsubara representation, our scheme allows to study spectral densities of arbitrary complexity with controlled accuracy in models with frequency-dependent effective interactions. For illustrative purposes we consider the problem of the plasmon line-width in a homogeneous electron gas (jellium).
We consider near-critical two-dimensional statistical systems with boundary conditions inducing phase separation on the strip. By exploiting low-energy properties of two-dimensional field theories, we compute arbitrary $n$-point correlation of the order parameter field. Finite-size corrections and mixed correlations involving the stress tensor trace are also discussed. As an explicit illustration of the technique, we provide a closed-form expression for a three-point correlation function and illustrate the explicit form of the long-ranged interfacial fluctuations as well as their confinement within the interfacial region.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
