Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physics
Determination Of Vortex Locations In A 2x2 Array Of Josephson Junctions For Topological Quantum Computation, Casey L. Kowalski
Determination Of Vortex Locations In A 2x2 Array Of Josephson Junctions For Topological Quantum Computation, Casey L. Kowalski
Theses and Dissertations
A large barrier to practical quantum computation exists in the form of qubit decoherence, which leads to high noise and error when implementing quantum algorithms. A potential solution to this problem is the use of topologically-protected Majorana-based qubits, as their nonlocal nature and unique non-abelian exchange statistics render them virtually immune to decoherence while still allowing the state to be easily manipulated. For such a qubit to be constructed, it is essential to know the locations of the Majorana-hosting vortices in the system. This work presents a solution for the formation locations of vortices in a 2x2 superconducting island array, …
Solving Combinatorial Optimization Problems Using The Quantum Approximation Optimization Algorithm, Nicholas J. Guerrero
Solving Combinatorial Optimization Problems Using The Quantum Approximation Optimization Algorithm, Nicholas J. Guerrero
Theses and Dissertations
The Quantum Approximation Optimization Algorithm (QAOA) is one of the most promising applications for noisy intermediate-scale quantum machines due to the low number of qubits required as well as the relatively low gate count. Much work has been done on QAOA regarding algorithm implementation and development; less has been done checking how these algorithms actually perform on a real quantum computer. Using the IBM Q Network, several instances of combinatorial optimization problems (the max cut problem and dominating set problem) were implemented into QAOA and analyzed. It was found that only the smallest toy max cut algorithms performed adequately: those …