There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

다중혈관 관상동맥 환자에서 y-문합을 이용하여 양쪽 내흉동맥만을 사용한 우회술의 조기 성적

Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

Pattern Recognition and Machine Learning

Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though most ancient clastic carbonate slope deposits fit the submarine fan systems better. Calciclastic submarine fans are consequently rarely described and are poorly understood. Subsequently, very little is known especially in mud-dominated calciclastic submarine fan systems. Presented in this study are a sedimentological core and petrographic characterisation of samples from eleven boreholes from the Lower Carboniferous of Bowland Basin (Northwest England) that reveals a >250 m thick calciturbidite complex deposited in a calciclastic submarine fan setting. Seven facies are recognised from core and thin section characterisation and are grouped into three carbonate turbidite sequences. They include: 1) Calciturbidites, comprising mostly of highto low-density, wavy-laminated bioclast-rich facies; 2) low-density densite mudstones which are characterised by planar laminated and unlaminated muddominated facies; and 3) Calcidebrites which are muddy or hyper-concentrated debrisflow deposits occurring as poorly-sorted, chaotic, mud-supported floatstones. These

Phd by thesis

We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

Random graphs

What entanglement is present in naturally occurring physical systems at thermal equilibrium? Most such systems are intractable and it is desirable to study simple but realistic systems that can be solved. An example of such a system is the one-dimensional infinite-lattice anisotropic XY model. This model is exactly solvable using the Jordan-Wigner transform, and it is possible to calculate the two-site reduced density matrix for all pairs of sites. Using the two-site density matrix, the entanglement of formation between any two sites is calculated for all parameter values and temperatures. We also study the entanglement in the transverse Ising model, a special case of the XY model, which exhibits a quantum phase transition. It is found that the next-nearest-neighbor entanglement (though not the nearest-neighbor entanglement) is a maximum at the critical point. Furthermore, we show that the critical point in the transverse Ising model corresponds to a transition in the behavior of the entanglement between a single site and the remainder of the lattice.

/pdf/entanglement-in-a-simple-quantum-phase-transition-4xhv6ou3tx.pdf

Entanglement in a simple quantum phase transition

We consider multipartite states of qubits and prove that their bipartite quantum entanglement, as quantified by the concurrence, satisfies a monogamy inequality conjectured by Coffman, Kundu, and Wootters We relate this monogamy inequality to the concept of frustration of correlations in quantum spin systems

/pdf/general-monogamy-inequality-for-bipartite-qubit-entanglement-1eomkslwih.pdf

General monogamy inequality for bipartite qubit entanglement.

We develop a new algorithm based on the time-dependent variational principle applied to matrix product states to efficiently simulate the real- and imaginary-time dynamics for infinite one-dimensional quantum lattices. This procedure (i) is argued to be optimal, (ii) does not rely on the Trotter decomposition and thus has no Trotter error, (iii) preserves all symmetries and conservation laws, and (iv) has low computational complexity. The algorithm is illustrated by using both an imaginary-time and a real-time example.

/pdf/time-dependent-variational-principle-for-quantum-lattices-3fqfo7v4f3.pdf

Time-dependent variational principle for quantum lattices.

Many proposed quantum mechanical models of black holes include highly non-local interactions. The time required for thermalization to occur in such models should reflect the relaxation times associated with classical black holes in general relativity. Moreover, the time required for a particularly strong form of thermalization to occur, sometimes known as scrambling, determines the time scale on which black holes should start to release information. It has been conjectured that black holes scramble in a time logarithmic in their entropy, and that no system in nature can scramble faster. In this article, we address the conjecture from two directions. First, we exhibit two examples of systems that do indeed scramble in logarithmic time: Brownian quantum circuits and the antiferromagnetic Ising model on a sparse random graph. Unfortunately, both fail to be truly ideal fast scramblers for reasons we discuss. Second, we use Lieb-Robinson techniques to prove a logarithmic lower bound on the scrambling time of systems with finite norm terms in their Hamiltonian. The bound holds in spite of any nonlocal structure in the Hamiltonian, which might permit every degree of freedom to interact directly with every other one.

/pdf/towards-the-fast-scrambling-conjecture-1dfelj059w.pdf

Towards the fast scrambling conjecture

A reasonable physical intuition in the study of interacting quantum systems says that, independent of the initial state, the system will tend to equilibrate. In this work we introduce an experimentally accessible setting where relaxation to a steady state is exact, namely, for the Bose-Hubbard model quenched from a Mott quantum phase to the free strong superfluid regime. We rigorously prove that the evolving state locally relaxes to a steady state with maximum entropy constrained by second moments--thus maximizing the entanglement. Remarkably, for this to be true, no time average is necessary. Our argument includes a central limit theorem and exploits the finite speed of information transfer. We also show that for all periodic initial configurations (charge density waves) the system relaxes locally, and identify experimentally accessible signatures in optical lattices as well as implications for the foundations of statistical mechanics.

https://arxiv.org/pdf/cond-mat/0703314.pdf

Tobias J. Osborne

Papers

Entanglement in a simple quantum phase transition

General monogamy inequality for bipartite qubit entanglement.

Time-dependent variational principle for quantum lattices.

Towards the fast scrambling conjecture

Exact relaxation in a class of nonequilibrium quantum lattice systems.