Quantum Computing and Quantum Algorithms

The field of quantum computing and quantum algorithms is studied from the ground up. Qubits and their quantum-mechanical properties are discussed, followed by how they are transformed by quantum gates. From there, quantum algorithms are explored as well as the use of high-level quantum programming languages to implement them. One quantum algorithm is selected to be implemented in the Qiskit quantum programming language. The validity and success of the resulting computation is proven with matrix multiplication of the qubits and quantum gates involved

The coefficients of the period polynomials

A general description of the Vi\`ete coefficients of the gaussian period polynomials is given, in terms of certain symmetric representations of the subgroups and the corresponding quotient groups of the multiplicative group \mathbf{F}_{p}^{*} of a finite prime field of characteristics p, an odd prime number. The known values of these coefficients are recovered by this technique and further results of general nature are presented.Comment: 28 page

2d random Dirac fermions: large N approach

We study the symmetry classes for the random Dirac fermions in 2 dimensions. We consider $N_f$ species of fermions, coupled by different types of disorder. We analyse the renormalisation group flow at the order of one loop. At $N_f$ large, the disorder distribution flows to an isotropic distribution and the effective action is a sigma model.Comment: 12 pages, contribution to the proceedings of Advanced NATO Workshop on Statistical Field Theories, Como, June 18-23, 200