SearcharxivSearch

arXiv subjects

Christopher D. Phillips

Publications and source records attributed to Christopher D. Phillips.

2 recordsLinked to original sources

Evidence for universal flow and characteristics of early time thermalization in a scalar field model for heavy ion collisions

We study numerically the evolution of an expanding strongly self-coupled real scalar field. We use a conformally invariant action that gives a traceless energy-momentum tensor and is better suited to model the early time behaviour of a system such as QCD, whose action is also conformally invariant.We consider asymmetric initial conditions and observe that when the system is initialized with non-zero spatial eccentricity, the eccentricity decreases and the elliptic flow coefficient increases. We look at a measure of transverse pressure asymmetry that has been shown to behave similarly to the elliptic flow coefficient in hydrodynamic systems and show that in our system their behaviour is strikingly similar. We show that the derivative of the transverse velocity is proportional to the gradient of the energy in Milne coordinates and argue that this result means that transverse velocity initially develops in the same way that it does in hydrodynamic systems. We conclude that some aspects of the early onset of hydrodynamic behaviour that has been observed in quark-gluon plasmas are seen in our numerical simulation of strongly coupled scalar fields.

hep-th

A Quantum Computer Amenable Sparse Matrix Equation Solver

Quantum computation offers a promising alternative to classical computing methods in many areas of numerical science, with algorithms that make use of the unique way in which quantum computers store and manipulate data often achieving dramatic improvements in performance over their classical counterparts. The potential efficiency of quantum computers is particularly important for numerical simulations, where the capabilities of classical computing systems are often insufficient for the analysis of real-world problems. In this work, we study problems involving the solution of matrix equations, for which there currently exists no efficient, general quantum procedure. We develop a generalization of the Harrow/Hassidim/Lloyd algorithm by providing an alternative unitary for eigenphase estimation. This unitary, which we have adopted from research in the area of quantum walks, has the advantage of being well defined for any arbitrary matrix equation, thereby allowing the solution procedure to be directly implemented on quantum hardware for any well-conditioned system. The procedure is most useful for sparse matrix equations, as it allows for the inverse of a matrix to be applied with $\mathcal{O}\left(N_{nz}\log\left(N\right)\right)$ complexity, where $N$ is the number of unknowns, and $N_{nz}$ is the total number of nonzero elements in the system matrix. This efficiency is independent of the matrix structure, and hence the quantum procedure can outperform classical methods for many common system types. We show this using the example of sparse approximate inverse (SPAI) preconditioning, which involves the application of matrix inverses for matrices with $N_{nz}=\mathcal{O}\left(N\right)$.

quant-ph