In the Λ-system, non-adiabatic holonomic quantum phases are used to construct holonomic quantum gates. An interesting approach would be to implement open path holonomies in the Λ-system. By dividing the loop into two curve segments with a unitary transformation between them, universality can be reached. In doing so the exibility of the scheme has been increased by the fact that one single full pulse is now enough for universality, and we have achieved a clearer proof of the geometric property of the Λ system. / I ett Λ-system så används icke-adiabatiska holonoma kvantfaser för att bygga holonoma kvantgrindar. I detta arbete undersöker vi om holonomier för öppna kurvor kan implementeras i Λsystemet. Genom att dela upp en loop i Λ-systemet i två sekvenser med en unitär transformation emellan så kan vi konstruera en universell holonom kvantgrind. Med detta så har vi ökat exibiliteten för systemet genom att vi nu bara behöver ta en loop för att nå universalitet, och vi har även erhållit en klarare bild över den geometriska egenskapen hos Λ-systemet.

Conventional computing based on classical technologies is approaching its limits. Therefore scientists are starting to consider the applications of quantum mechanics as a means for constructing more powerful computers. After proposing theoretical methods, many experimental setups have been designed to achieve quantum computing in reality. This thesis gives some background information on the subject of quantum computing. We first review the concept of quantum entanglement, which plays a key role in quantum computing, and then we discuss the physics of the SQUIDs-cavity method proposed by Yang et al., and give the definitions of quantum gates which are the elements that are needed to construct quantum circuits. Finally we give an overview of recent developments of SQUIDs-cavity systems and quantum circuits after Yang et al.'s proposal in 2003. These new developments help to take a step towards the constructions of higher levels of quantum technologies, e.g. quantum algorithms and quantum circuits.

Since they were first envisioned, quantum computers have oft been portrayed as devices of limitless power, able to perform calculations in a mere instant that would take current computers years to determine. This is, of course, not the case. A huge amount of effort has been invested in trying to understand the limits of quantum computers---under which circumstances they outperform classical computers, how large a speed-up can be gained, and what draws the distinction between quantum and classical computing. In this Ph.D. thesis, I investigate a few intriguing properties of quantum computers involving quantum oracles and classically-simulatable quantum circuits. In Part I I study the notion of black-box unitary operations, and procedures for effecting the inverse operation. Part II looks at how quantum oracles can be used to test properties of probability distributions, and Part III considers classes of quantum circuits that can be simulated efficiently on a classical computer. In more detail, Part I studies procedures for inverting black-box unitary operations. Known techniques are generally limited in some way, often requiring ancilla systems, working only for restricted sets of operators, or simply being too inefficient. We develop a novel procedure without these limitations, and show how it can be applied to lift a requirement of the Solovay-Kitaev theorem, a landmark theorem of quantum compiling. Part II looks at property testing for probability distributions, and in particular considers a special type of access known as the \textit{conditional oracle}. The classical conditional oracle was developed by Canonne et al. in 2015 and subsequently greatly explored. We develop a quantum version of this oracle, and show that it has advantages over the classical process. We use this oracle to develop an algorithm that decides whether or not a mixed state is fully mixed. In Part III we study classically-simulatable quantum circuits in more depth. Two well-known classes are Clifford circuits and matchgate circuits, which we briefly review. Using these as inspiration, we use the Jordan-Wigner transform to develop new classes of non-trivial quantum circuits that are also classically simulatable.

A three-level system can be used in a Λ-type configuration in order to construct auniversal set of non-adiabatic quantum gates through the use of non-Abelian non-adiabatic geometrical phases. Such construction allows for high-speed operation times which diminish the effects of decoherence. This might be, however, accompanied by a breakdown of the validity of the rotating wave approximation (RWA) due to the comparable timescale between the counter-rotating terms and the pulse length, which greatly affects the dynamics. Here we investigate the trade-off between dissipative effects and the RWA validity, obtaining the optimal regime for the operation of the holonomic quantum gates.

The present thesis can be divided in three parts: 1) Quantum gate teleportation; 2) Numerical search of universal entanglers; 3) Connections between quantum information and number theory. Regarding the quantum gate teleportation, a separability criterion of normal matrices is used to find the analytical conditions of the preservation of separability under conjugation. That analytical condition allowed to find the general formula of an element of $mathbb{C}^{4}$ Clifford group, as well to understand the role of the basis of measurement in the quantum gate teleportation protocol. Considering the searching for universal entanglers, the same separability criterion of normal matrices was used as fitness function in a computational heuristics, in prder to find good candidates for universal entanglers in $mathbb{C}^{3} otimes mathbb{C}^{4}$ and $mathbb{C}^{4} otimes mathbb{C}^{4}$ Hilbert spaces. At last, in the connection of quantum information with the number theory, it is presented the study of the preparation and entanglement of several multi-qubit quantum states based in integer sequences, and the Riemannian quantum circuit, a quantum circuit whose eigenvalues are related to the zeros of the Riemann zeta function. The existence of such circuit proves that is always possible to construct a physical system related to a finite amount of zeros. / A presente tese està dividida em trÃs partes: 1) TeleportaÃÃo de portas quÃnticas; 2) Busca numÃrica por entrelaÃadores universais; 3) ConexÃes entre a informaÃÃo quÃntica e a teoria dos nÃmeros. No que diz a teleportaÃÃo de portas quÃnticas, um critÃrio de separabilidade para matrizes normais à usada para encontrar as condiÃÃes analÃticas da preservaÃÃo da separabilidade sob conjugaÃÃo. Tais condiÃÃes analÃticas permitiram encontrar a forma geral de um elemento do grupo de Clifford em $mathbb{C}^{4}$, assim como tambÃm entender o papel da base de mediÃÃo no protocolo de teleportaÃÃo de portas quÃnticas. Considerando a busca por entrelaÃadores universais, o mesmo critÃrio de separabilidade de matrizes normais foi utilizado como funÃÃo de aptidÃo em uma heurÃstica computacional aplicada para encontrar bons candidatos a entrelaÃadores universais nos espaÃos de Hilbert de dimensÃes $mathbb{C}^{3} otimes mathbb{C}^{4}$ e $mathbb{C}^{4} otimes mathbb{C}^{4}$. Por fim, sobre as conexÃes da informaÃÃo quÃntica com a teoria dos nÃmeros, à apresentado um estudo da preparaÃÃo e entrelaÃamento de vÃrios estados quÃnticos de mÃltiplos qubits baseados em sequÃncias de nÃmeros inteiros. Apresenta-se ainda o circuito quÃntico Riemanniano, um circuito quÃntico cujos autovalores sÃo relacionados aos zeros da funÃÃo Zeta de Riemann. A existÃncia deste circuito prova que à sempre possÃvel construir um sistema fÃsico relacionado a uma quantidade finita de zeros.

Kvantová výpočetní technika je rychle rostoucí obor informatiky, který přenáší principy kvantových jevu do našeho každodenního života. Díky své kvantové podstatě získávají kvantové počítače převahu nad klasickými počítači. V této práci jsme se zaměřili na vysvětlení základů kvantového počítání a jeho implementaci na kvantovém počítači. Zejména se zaměřujeme na popis fungování, konstrukci a implementaci Groverova algoritmu jako jednoho ze základních kvantových algoritmů. Demonstrovali jsme sílu tohoto kvantového algoritmu při prohledávání databáze a porovnávali ho s klasickými nekvantovými algoritmy pomocí implementace prostřednictvím simulačního prostředí QISKit. Pro simulaci jsme použili QASM Simulator a State vector Simulator Aer backends a ukázali, že získané výsledky korelují s dříve diskutovanými teoretickými poznatky. Toto ukazuje, že Groverův algoritmus umožňuje kvadratické zrychlení oproti klasickému nekvantovému vyhledávacímu algoritmu, Použitelnost algoritmu stejně jako ostatních kvantových algoritmů je ale stále omezena několika faktory, mezi které patří vysoké úrovně dekoherence a chyby hradla.

Abstract Iris The power of quantum computing lies in its ability to perform certain calculations and solve complex problems exponentially faster than classical computers. This potential has profound implications for a wide range of fields, including particle physics. This thesis lays a fundamental foundation for understanding quantum computing. Particular emphasis is placed on the intricate process of quantum gate decomposition, an elementary lynchpin that underpins the development of quantum algorithms and plays a crucial role in this research. In particular, this concerns the implementation of quantum algorithms designed to simulate the dynamic evolution of multi-particle quantum systems - so-called Hamiltonian simulations. The concept of quantum gate decomposition is introduced and linked to quantum circuit optimisation. The decomposition of quantum gates plays a crucial role in fault-tolerant quantum computing in the sense that an optimal implementation of a quantum gate is essential to efficiently perform a quantum simulation, especially for near-term quantum computers. Part of this thesis aims to propose a new explicit tensorial notation of quantum computing. Two notations are commonly used in the literature. The first is the Dirac notation and the other standard formalism is based on the so-called computational basis. The main disadvantage of the latter is the exponential growth of vector and matrix dimensions and the fact that it hides some relevant quantum properties of the operations by increasing the apparent number of independent variables. A third possible notation is introduced here, which describes qubit states as tensors and quantum gates as multilinear or quasi-multilinear maps. Some advantages for the detection of separable and entangled systems and for measurement techniques are also shown. Finally, this thesis demonstrates the advantage of quantum computing in the description of multi-particle quantum systems by proposing a quantum algorithm to simulate collective neutrino oscillations. Collective flavour oscillations of neutrinos due to forward neutrino-neutrino scattering provide an intriguing many-body system for time evolution simulations on a quantum computer. These phenomena are of particular interest in extreme astrophysical settings such as core-collapse supernovae, neutron star mergers and the early universe. A detailed description of the physical phenomena and environments in which collective flavor oscillations occur is first reported, and the derivation of the Hamiltonian governing the evolution of flavor oscillations is detailed. The aim is to reproduce this evolution using a quantum algorithm. To manage the computational complexity, we use the Trotter approximation of the time evolution operator, which mitigates the exponential growth of circuit complexity. The quantum algorithm was designed to work on a trapped-ion based testbed (the theory of which is presented in detail). After machine-aware optimisation, the quantum circuit implementing the algorithm was run on the real quantum machine 'Quantinuum', and the results are presented and discussed.

[pt] Nesta tese foram estudados três sistemas nanoscópicos compostos de pontos quânticos (PQs). No primeiro deles foi analisada a denominada nuvem Kondo, ou a extensão da blindagem que os spins da banda de condução fazem do spin de uma impureza magnética embebida em uma matriz metálica e representada, no nosso caso, por um PQ. As propriedades da nuvem Kondo foram obtidas através da manifestação da ressonância Kondo na densidade de estados local nos sítios da matriz metálica e também através das correlações de spin entre o spin do elétron no PQ e os spins da banda de condução. Foi possível encontrar uma concordância entre as extensões da nuvem Kondo obtidas com ambos métodos. O segundo sistema estudado consiste em uma estrutura de três PQs alinhados e com o PQ central acoplado a dois contatos metálicos. Foi analisada a operação deste sistema como uma porta lógica quântica cujo funcionamento depende do estado de carga do PQ central. Foi feito um estudo dependente do tempo das propriedades do sistema e, em particular, da correlação dos spins dos PQs laterais. Mostramos que o efeito Kondo, refletido na condutância do sistema, pode ser uma ferramenta fundamental para conhecer o estado da porta quântica. Os primeiros dois sistemas foram tratados usando o método dos Bósons Escravos na aproximação de campo médio. Finalmente, foi estudado o transporte termoelétrico em um sistema de dois PQs quando um deles está acoplado a contatos metálicos unidimensionais. O sistema foi analisado no regime de resposta linear e não linear a um potencial externo no regime de bloqueio de Coulomb. Mostramos que a presença de ressonâncias Fano e de uma singularidade de Van-Hove na densidade de estados dos contatos unidimensionais perto do nível de Fermi são ingredientes fundamentais para o aumento da eficiência termoelétrica do dispositivo. O problema de muitos corpos foi resolvido na aproximação de Hubbard III que permite um estudo correto das propriedades de transporte deste sistema para T maior que TK, onde TK é a temperatura Kondo. / [en] In this thesis, were studied three nanoscopic quantum dot (QD) systems. First, the so-called Kondo cloud was analyzed, the extension of the conduction band spin screening of a magnetic impurity embedded in a metallic matrix and represented, in our case, by a QD. The Kondo cloud properties were obtained studying the way in which the local density of states of the metallic matrix sites reflects the Kondo resonance and also through the spin-spin correlations between the QD and the conduction band spins. It was possible to find a good agreement between the Kondo cloud extensions obtained using both methods. The second system consists of three aligned QDs with the central QD connected to two metallic leads. The operation of this system as a quantum gate was studied, which depends on the central QD charge. A time dependent study of the system properties and, in particular, of the lateral QDs spin correlation was developed. We showed that the Kondo effect, reflected in the conductance, could be a fundamental tool to measure the information contained in the quantum gate state. The first two systems were treated using the Slave Bosons Mean Field Approximation method. Finally, we studied the thermoelectric transport of a two QD system when one of them is connected to two onedimensional leads. The system was analyzed in the linear and nonlinear response to an external applied potential, always in the Coulomb blockade regime. It was found that the presence of Fano resonances and a Van-Hove singularity in the one-dimensional lead density of states near the Fermi level are fundamental ingredients to enhance thermoelectric efficiency. The many-body problem was treated in the Hubbard III approximation, which is a correct approach to study the transport properties for T greater than TK, where TK is the Kondo temperature.

Qubits (quantum bits) are what runs quantum computers, like a bit in classical computers. Quantum gates are used to operate on qubits in order to change their states. As such they are what ”programmes” a quantum computer. An unfortunate side effect of quantum physics is that coupling a quantum system (like our qubits) to an outside environment will lead to a certain loss of information. Reducing this decoherence effect is thus vital for the function of a quantum computer. Geometric quantum computation is a method for creating error robust quantum gates by using so called geometric phases which are solely reliant on the geometry of the evolution of the system. The purpose of this project has been to develop physical schemes of geometric entangling two-qubit gates along the Schmidt sphere, a geometric construct appearing in two-qubit systems. Essentially the overall aim has been to develop new schemes for implementing robust entangling quantum gates solely by means of interactions intrinsic to the computational systems. In order to create this gate four mutually orthogonal states were defined which together spanned the two-qubit state space. Two of the states were given time dependent variables containing a total of two angles,which were used to parameterize the Schmidt sphere. By designing an evolution for these angles that traced out a cyclical evolution along geodesic lines a quantum gate with exclusively geometric phases could be created. This gate was dubbed the ”Schmidt gate” and could be shown to be entangling by analyzing a change in the concurrence of a two qubit system. Two Hamiltonians were also defined which when acted upon the predefined system of states would give rise to the aforementioned evolution on the Schmidt sphere. The project was successful in creating an entangling quantum gate which could be shown by looking at difference in the concurrence of the input and output state of a two-qubit system passing through the gate.

<p>Among computational electromagnetic methods, Integral Equation (IE) solvers have a great capability in solving open-region problems such as scattering and radiation, due to no truncation boundary condition required. Volume Integral Equation (VIE) solvers are especially capable of handling arbitrarily shaped geometries and inhomogeneous materials. However, the numerical system resulting from a VIE analysis is a dense system, having $N^2$ nonzero elements for a problem of $ N $ unknowns. The dense numerical system in conjunction with the large number of unknowns resulting from a volume discretization prevents a practical use of the VIE for solving large-scale problems.</p> <p>In this work, two fast algorithms of $ O(N \log N) $ complexity to generate an rank-minimized $ H^2 $-representation for electrically large VIEs are developed. The algorithms systematically compress the off-diagonal admissible blocks of full VIE matrix into low-rank forms of total storage of $O(N)$. Both algorithms are based on nested cross approximation, which are purely algebraic. The first one is a two-stage algorithm. The second one is optimized to only use one-stage, and has a significant speedup. Numerical experiments on electrically large examples with over 33 million unknowns demonstrate the efficiency and accuracy of the proposed algorithms. </p> <p>Important applications of VIEs in thermal and quantum engineering have also been explored in this work. Creating spin(circularly)-polarized infrared thermal radiation source without an external magnetic field is important in science and engineering. Here we study two materials, magnetic Weyl semimetals and manganese-bismuth(MnBi), which both have permittivity tensors of large gyrotropy, and can emit circularly-polarized thermal radiations without an external magnetic field. We also design symmetry-broken metasurfaces, which show strong circularly-polarized radiations in simulations and experiments. In spin qubit quantum computing systems, metallic gates and antennas are necessary for quantum gate operations. But their existence greatly enhances evanescent wave Johnson noise (EWJN), which induces the decay of spin qubits and limits the quantum gate operation fidelity. Here we first use VIE to accurately simulate realistic quantum gate designs and quantify the influence on gate fidelity due to this noise.</p>