2 resultados para Vector computers

em AMS Tesi di Dottorato - Alm@DL - Università di Bologna


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Ultra-relativistic heavy ions generate strong electromagnetic fields which offer the possibility to study γ-γ and γ-nucleus processes at the LHC in the so called ultra-peripheral collisions (UPC). The photoproduction of J/ψ vector mesons in UPC is sensitive to the gluon distribution of the interacting nuclei. In this thesis the study of coherent and incoherent J/ψ production in Pb-Pb collisions at √sNN = 2.76 TeV is described. The J/ψ has been measured via its leptonic decay in the rapidity range -0.9 < y < 0.9. The cross section for coherent and incoherent J/ψ are given. The results are compared to theoretical models for J/ψ production and the coherent cross section is found to be in good agreement with those models which include nuclear gluon shadowing consistent with EPS09 parametrization. In addition the cross section for the process γ γ→ e+e− has been measured and found to be in agreement with the STARLIGHT Monte Carlo predictions. The analysis has been published by the ALICE Collaboration in the European Physical Journal C, with one of its main plot depicted on the cover-front of the November 2013 issue.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The aim of this thesis is to investigate the nature of quantum computation and the question of the quantum speed-up over classical computation by comparing two different quantum computational frameworks, the traditional quantum circuit model and the cluster-state quantum computer. After an introductory survey of the theoretical and epistemological questions concerning quantum computation, the first part of this thesis provides a presentation of cluster-state computation suitable for a philosophical audience. In spite of the computational equivalence between the two frameworks, their differences can be considered as structural. Entanglement is shown to play a fundamental role in both quantum circuits and cluster-state computers; this supports, from a new perspective, the argument that entanglement can reasonably explain the quantum speed-up over classical computation. However, quantum circuits and cluster-state computers diverge with regard to one of the explanations of quantum computation that actually accords a central role to entanglement, i.e. the Everett interpretation. It is argued that, while cluster-state quantum computation does not show an Everettian failure in accounting for the computational processes, it threatens that interpretation of being not-explanatory. This analysis presented here should be integrated in a more general work in order to include also further frameworks of quantum computation, e.g. topological quantum computation. However, what is revealed by this work is that the speed-up question does not capture all that is at stake: both quantum circuits and cluster-state computers achieve the speed-up, but the challenges that they posit go besides that specific question. Then, the existence of alternative equivalent quantum computational models suggests that the ultimate question should be moved from the speed-up to a sort of “representation theorem” for quantum computation, to be meant as the general goal of identifying the physical features underlying these alternative frameworks that allow for labelling those frameworks as “quantum computation”.