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.

In this thesis, I present a microscopic theory of quantum circuits based on interacting electron spins in quantum dot molecules. We use the Linear Combination of Harmonic Orbitals-Configuration Interaction (LCHO-CI) formalism for microscopic calculations. We then derive effective Hubbard, t-J, and Heisenberg models. These models are used to predict the electronic, spin and transport properties of a triple quantum dot molecule (TQDM) as a function of topology, gate configuration, bias and magnetic field. With these theoretical tools and fully characterized TQDMs, we propose the following applications: 1. Voltage tunable qubit encoded in the chiral states of a half-filled TQDM. We show how to perform single qubit operations by pulsing voltages. We propose the "chirality-to-charge" conversion as the measurement scheme and demonstrate the robustness of the chirality-encoded qubit due to charge fluctuations. We derive an effective qubit-qubit Hamiltonian and demonstrate the two-qubit gate. This provides all the necessary operations for a quantum computer built with chirality-encoded qubits. 2. Berry's phase. We explore the prospect of geometric quantum computing with chirality-encoded qubit. We construct a Herzberg circuit in the voltage space and show the accumulation of Berry's phase. 3. Macroscopic quantum states on a semiconductor chip. We consider a linear chain of TQDMs, each with 4 electrons, obtained by nanostructuring a metallic gate in a field effect transistor. We theoretically show that the low energy spectrum of the chain maps onto that of a spin-1 chain. Hence, we show that macroscopic quantum states, protected by a Haldane gap from the continuum, emerge. In order to minimize decoherence of electron spin qubits, we consider using electron spins in the p orbitals of the valence band (valence holes) as qubits. We develop a theory of valence hole qubit within the 4-band k.p model. We show that static magnetic fields can be used to perform single qubit operations. We also show that the qubit-qubit interactions are sensitive to the geometry of a quantum dot network. For vertical qubit arrays, we predict that there exists an optimal qubit separation suitable for the voltage control of qubit-qubit interactions.

In this thesis, I present a microscopic theory of quantum circuits based on interacting electron spins in quantum dot molecules. We use the Linear Combination of Harmonic Orbitals-Configuration Interaction (LCHO-CI) formalism for microscopic calculations. We then derive effective Hubbard, t-J, and Heisenberg models. These models are used to predict the electronic, spin and transport properties of a triple quantum dot molecule (TQDM) as a function of topology, gate configuration, bias and magnetic field. With these theoretical tools and fully characterized TQDMs, we propose the following applications: 1. Voltage tunable qubit encoded in the chiral states of a half-filled TQDM. We show how to perform single qubit operations by pulsing voltages. We propose the "chirality-to-charge" conversion as the measurement scheme and demonstrate the robustness of the chirality-encoded qubit due to charge fluctuations. We derive an effective qubit-qubit Hamiltonian and demonstrate the two-qubit gate. This provides all the necessary operations for a quantum computer built with chirality-encoded qubits. 2. Berry's phase. We explore the prospect of geometric quantum computing with chirality-encoded qubit. We construct a Herzberg circuit in the voltage space and show the accumulation of Berry's phase. 3. Macroscopic quantum states on a semiconductor chip. We consider a linear chain of TQDMs, each with 4 electrons, obtained by nanostructuring a metallic gate in a field effect transistor. We theoretically show that the low energy spectrum of the chain maps onto that of a spin-1 chain. Hence, we show that macroscopic quantum states, protected by a Haldane gap from the continuum, emerge. In order to minimize decoherence of electron spin qubits, we consider using electron spins in the p orbitals of the valence band (valence holes) as qubits. We develop a theory of valence hole qubit within the 4-band k.p model. We show that static magnetic fields can be used to perform single qubit operations. We also show that the qubit-qubit interactions are sensitive to the geometry of a quantum dot network. For vertical qubit arrays, we predict that there exists an optimal qubit separation suitable for the voltage control of qubit-qubit interactions.

In this thesis, I present a microscopic theory of quantum circuits based on interacting electron spins in quantum dot molecules. We use the Linear Combination of Harmonic Orbitals-Configuration Interaction (LCHO-CI) formalism for microscopic calculations. We then derive effective Hubbard, t-J, and Heisenberg models. These models are used to predict the electronic, spin and transport properties of a triple quantum dot molecule (TQDM) as a function of topology, gate configuration, bias and magnetic field. With these theoretical tools and fully characterized TQDMs, we propose the following applications: 1. Voltage tunable qubit encoded in the chiral states of a half-filled TQDM. We show how to perform single qubit operations by pulsing voltages. We propose the "chirality-to-charge" conversion as the measurement scheme and demonstrate the robustness of the chirality-encoded qubit due to charge fluctuations. We derive an effective qubit-qubit Hamiltonian and demonstrate the two-qubit gate. This provides all the necessary operations for a quantum computer built with chirality-encoded qubits. 2. Berry's phase. We explore the prospect of geometric quantum computing with chirality-encoded qubit. We construct a Herzberg circuit in the voltage space and show the accumulation of Berry's phase. 3. Macroscopic quantum states on a semiconductor chip. We consider a linear chain of TQDMs, each with 4 electrons, obtained by nanostructuring a metallic gate in a field effect transistor. We theoretically show that the low energy spectrum of the chain maps onto that of a spin-1 chain. Hence, we show that macroscopic quantum states, protected by a Haldane gap from the continuum, emerge. In order to minimize decoherence of electron spin qubits, we consider using electron spins in the p orbitals of the valence band (valence holes) as qubits. We develop a theory of valence hole qubit within the 4-band k.p model. We show that static magnetic fields can be used to perform single qubit operations. We also show that the qubit-qubit interactions are sensitive to the geometry of a quantum dot network. For vertical qubit arrays, we predict that there exists an optimal qubit separation suitable for the voltage control of qubit-qubit interactions.

This thesis deals with a series of quantum computer implementation issues from the Kane 31P in 28Si architecture to Shor’s integer factoring algorithm and beyond. The discussion begins with simulations of the adiabatic Kane CNOT and readout gates, followed by linear nearest neighbor implementations of 5-qubit quantum error correction with and without fast measurement. A linear nearest neighbor circuit implementing Shor’s algorithm is presented, then modified to remove the need for exponentially small rotation gates. Finally, a method of constructing optimal approximations of arbitrary single-qubit fault-tolerant gates is described and applied to the specific case of the remaining rotation gates required by Shor’s algorithm.

Simuladores quânticos têm tido um importante papel no estudo e desenvolvimento da computação quântica ao longo dos anos. A simulação de algoritmos quânticos em computadores clássicos é computacionalmente difícil, principalmente devido à natureza paralela dos sistemas quânticos. Para acelerar essas simulações, alguns trabalhos propõem usar hardware paralelo programável como FPGAs, o que diminui consideravelmente o tempo de execução. Contudo, essa abordagem tem três problemas principais: pouca escalabilidade, já que apenas transfere a complexidade do domínio do tempo para o domínio do espaço; a necessidade de re-síntese a cada mudança no algoritmo; e o esforço extra ao projetar o código RTL para simulação. Para lidar com esses problemas, uma arquitetura de um co-processador SIMD é proposta, cujas operações das portas quânticas está baseada no modelo Network of Butterflies. Com isso, eliminamos a necessidade de re-síntese com mudanças pequenas no algoritmo quântico simulado, e eliminamos a influência de um dos fatores que levam ao crescimento exponencial do uso de recursos da FPGA. Adicionamente, desenvolvemos uma ferramenta para geração automática do código RTL sintetizável do co-processador, reduzindo assim o esforço extra de projeto. / Quantum simulators have had a important role on the studying and development of quantum computing throughout the years. The simulation of quantum algorithms on classical computers is computationally hard, mainly due to the parallel nature of quantum systems. To speed up these simulations, some works have proposed to use programmable parallel hardware such as FPGAs, which considerably shorten the execution time. However this approach has three main problems: low scalability, since it only transfers the complexity from time domain to space domain; the need of re-synthesis on every change on the algorithm; and the extra effort on designing the RTL code for simulation. To handle these problems, an architecture of a SIMD co-processor is proposed, whose operations of quantum gates are based on Network of Butterflies model. Thus, we eliminate the need of re-synthesis on small changes on the simulated quantum algorithm, and we eliminated the influence of one of the factors that lead to the exponential growth on the consumption of FPGA resources. Aditionally, we developed a tool to automatically generate the synthesizable RTL code of the co-processor, thus reducing the extra design effort.

Simuladores quânticos têm tido um importante papel no estudo e desenvolvimento da computação quântica ao longo dos anos. A simulação de algoritmos quânticos em computadores clássicos é computacionalmente difícil, principalmente devido à natureza paralela dos sistemas quânticos. Para acelerar essas simulações, alguns trabalhos propõem usar hardware paralelo programável como FPGAs, o que diminui consideravelmente o tempo de execução. Contudo, essa abordagem tem três problemas principais: pouca escalabilidade, já que apenas transfere a complexidade do domínio do tempo para o domínio do espaço; a necessidade de re-síntese a cada mudança no algoritmo; e o esforço extra ao projetar o código RTL para simulação. Para lidar com esses problemas, uma arquitetura de um co-processador SIMD é proposta, cujas operações das portas quânticas está baseada no modelo Network of Butterflies. Com isso, eliminamos a necessidade de re-síntese com mudanças pequenas no algoritmo quântico simulado, e eliminamos a influência de um dos fatores que levam ao crescimento exponencial do uso de recursos da FPGA. Adicionamente, desenvolvemos uma ferramenta para geração automática do código RTL sintetizável do co-processador, reduzindo assim o esforço extra de projeto. / Quantum simulators have had a important role on the studying and development of quantum computing throughout the years. The simulation of quantum algorithms on classical computers is computationally hard, mainly due to the parallel nature of quantum systems. To speed up these simulations, some works have proposed to use programmable parallel hardware such as FPGAs, which considerably shorten the execution time. However this approach has three main problems: low scalability, since it only transfers the complexity from time domain to space domain; the need of re-synthesis on every change on the algorithm; and the extra effort on designing the RTL code for simulation. To handle these problems, an architecture of a SIMD co-processor is proposed, whose operations of quantum gates are based on Network of Butterflies model. Thus, we eliminate the need of re-synthesis on small changes on the simulated quantum algorithm, and we eliminated the influence of one of the factors that lead to the exponential growth on the consumption of FPGA resources. Aditionally, we developed a tool to automatically generate the synthesizable RTL code of the co-processor, thus reducing the extra design effort.

[pt] A dissertação apresenta detalhadamente o algoritmo de fatoração de Shor, tanto em termos de sua execução passo a passo como mediante sua representação em forma de circuito, abordando aspectos tanto de sua parte clássica como de sua parte quântica. Inicialmente são apresentados aspectos de teoria dos números indispensáveis para a compreensão do algoritmo e em seguida são desenvolvidos conceitos e propriedades de mecânica quântica e de informação quântica pertinentes. Em atenção ao caráter eminentemente estocástico do algoritmo realiza-se um estudo de sua fonte estocástica e demonstram-se os principais teoremas que embasam a avaliação de sua probabilidade de sucesso. Desenvolvem-se exemplos de simulação clássica do algoritmo. Finalmente, a eficiência do algoritmo de fatoração de Shor é comparada com a de algoritmos clássicos. / [en] The dissertation presents in detail Shor s factoring algorithm, including its execution step by step and its representation in the form of a circuit, addressing aspects of both its classical and its quantum parts. Aspects of number theory indispensable to understand the algorithm are presented, followed by a development of concepts and properties of quantum mechanics and quantum information. Considering the eminently stochastic character of the algorithm, a study of its stochastic source is carried out and the main theorems that support the evaluation of its probability of success are proved. Examples of classical simulation of the algorithm are developed. Finally, the efficiency of Shor s factoring algorithm is compared with that of classical algorithms.

Simuladores quânticos têm tido um importante papel no estudo e desenvolvimento da computação quântica ao longo dos anos. A simulação de algoritmos quânticos em computadores clássicos é computacionalmente difícil, principalmente devido à natureza paralela dos sistemas quânticos. Para acelerar essas simulações, alguns trabalhos propõem usar hardware paralelo programável como FPGAs, o que diminui consideravelmente o tempo de execução. Contudo, essa abordagem tem três problemas principais: pouca escalabilidade, já que apenas transfere a complexidade do domínio do tempo para o domínio do espaço; a necessidade de re-síntese a cada mudança no algoritmo; e o esforço extra ao projetar o código RTL para simulação. Para lidar com esses problemas, uma arquitetura de um co-processador SIMD é proposta, cujas operações das portas quânticas está baseada no modelo Network of Butterflies. Com isso, eliminamos a necessidade de re-síntese com mudanças pequenas no algoritmo quântico simulado, e eliminamos a influência de um dos fatores que levam ao crescimento exponencial do uso de recursos da FPGA. Adicionamente, desenvolvemos uma ferramenta para geração automática do código RTL sintetizável do co-processador, reduzindo assim o esforço extra de projeto. / Quantum simulators have had a important role on the studying and development of quantum computing throughout the years. The simulation of quantum algorithms on classical computers is computationally hard, mainly due to the parallel nature of quantum systems. To speed up these simulations, some works have proposed to use programmable parallel hardware such as FPGAs, which considerably shorten the execution time. However this approach has three main problems: low scalability, since it only transfers the complexity from time domain to space domain; the need of re-synthesis on every change on the algorithm; and the extra effort on designing the RTL code for simulation. To handle these problems, an architecture of a SIMD co-processor is proposed, whose operations of quantum gates are based on Network of Butterflies model. Thus, we eliminate the need of re-synthesis on small changes on the simulated quantum algorithm, and we eliminated the influence of one of the factors that lead to the exponential growth on the consumption of FPGA resources. Aditionally, we developed a tool to automatically generate the synthesizable RTL code of the co-processor, thus reducing the extra design effort.

In this thesis, I present a microscopic theory of quantum circuits based on interacting electron spins in quantum dot molecules. We use the Linear Combination of Harmonic Orbitals-Configuration Interaction (LCHO-CI) formalism for microscopic calculations. We then derive effective Hubbard, t-J, and Heisenberg models. These models are used to predict the electronic, spin and transport properties of a triple quantum dot molecule (TQDM) as a function of topology, gate configuration, bias and magnetic field. With these theoretical tools and fully characterized TQDMs, we propose the following applications: 1. Voltage tunable qubit encoded in the chiral states of a half-filled TQDM. We show how to perform single qubit operations by pulsing voltages. We propose the "chirality-to-charge" conversion as the measurement scheme and demonstrate the robustness of the chirality-encoded qubit due to charge fluctuations. We derive an effective qubit-qubit Hamiltonian and demonstrate the two-qubit gate. This provides all the necessary operations for a quantum computer built with chirality-encoded qubits. 2. Berry's phase. We explore the prospect of geometric quantum computing with chirality-encoded qubit. We construct a Herzberg circuit in the voltage space and show the accumulation of Berry's phase. 3. Macroscopic quantum states on a semiconductor chip. We consider a linear chain of TQDMs, each with 4 electrons, obtained by nanostructuring a metallic gate in a field effect transistor. We theoretically show that the low energy spectrum of the chain maps onto that of a spin-1 chain. Hence, we show that macroscopic quantum states, protected by a Haldane gap from the continuum, emerge. In order to minimize decoherence of electron spin qubits, we consider using electron spins in the p orbitals of the valence band (valence holes) as qubits. We develop a theory of valence hole qubit within the 4-band k.p model. We show that static magnetic fields can be used to perform single qubit operations. We also show that the qubit-qubit interactions are sensitive to the geometry of a quantum dot network. For vertical qubit arrays, we predict that there exists an optimal qubit separation suitable for the voltage control of qubit-qubit interactions.