Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- Publication Type
Articles 1 - 7 of 7
Full-Text Articles in Physical Sciences and Mathematics
Qwasi: The Quantum Walk Simulator, Warren V. Wilson
Qwasi: The Quantum Walk Simulator, Warren V. Wilson
Theses and Dissertations
As quantum computing continues to evolve, the ability to design and analyze novel quantum algorithms becomes a necessary focus for research. In many instances, the virtues of quantum algorithms only become evident when compared to their classical counterparts, so a study of the former often begins with a consideration of the latter. This is very much the case with quantum walk algorithms, as the success of random walks and their many, varied applications have inspired much interest in quantum correlates. Unfortunately, finding purely algebraic solutions for quantum walks is an elusive endeavor. At best, and when solvable, they require simple …
Many Body Localization With Rydberg Atoms, Alicia Handian
Many Body Localization With Rydberg Atoms, Alicia Handian
Physics and Astronomy Summer Fellows
Systems are known to thermalize, or reach equilibrium, with the passing of time. However, when this does not occur, the quantum states of the system may be localized. Localized states carry information of the system’s initial state that is typically lost during the process of thermalization. We aim to study thermalization and localization in systems of rubidium Rydberg atoms, and to further understand these phenomena via simulation while we are developing a more refined experiment.
Simulating Quantum Systems Using The D-Wave Quantum Computer, Justin M. Copenhaver, Raunaq Kumaran, Birgit Kaufmann, Adam Wasserman
Simulating Quantum Systems Using The D-Wave Quantum Computer, Justin M. Copenhaver, Raunaq Kumaran, Birgit Kaufmann, Adam Wasserman
Discovery Undergraduate Interdisciplinary Research Internship
No abstract provided.
Quantum Computing And Quantum Algorithms, Daniel Serban
Quantum Computing And Quantum Algorithms, Daniel Serban
Senior Honors Theses
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.
On Characterizing Quantum Processes And Detectors, Kevin Valson Jacob
On Characterizing Quantum Processes And Detectors, Kevin Valson Jacob
LSU Doctoral Dissertations
In 2009, physicists at the National Institute of Standards and Technology in Colorado, Boulder developed what could arguable be called the first rudimentary quantum computer [1]. The past decade has seen unprecedented improvements in quantum information science culminating in the demonstration of quantum supremacy --- that quantum computers can solve problems that are impractical to be solved on the best supercomputers [2]. This remarkable progress necessitates the development of techniques to characterize the quantum devices that are being developed. In my thesis, I will focus on such devices that manipulate and detect light.
In Chapter 1, I will introduce the …
Noise Resilience Of Variational Quantum Compiling, Kunal Sharma, Sumeet Khatri2, M. Cerezo, Patrick J. Coles
Noise Resilience Of Variational Quantum Compiling, Kunal Sharma, Sumeet Khatri2, M. Cerezo, Patrick J. Coles
Faculty Publications
Variational hybrid quantum-classical algorithms (VHQCAs) are near-term algorithms that leverage classical optimization to minimize a cost function, which is efficiently evaluated on a quantum computer. Recently VHQCAs have been proposed for quantum compiling, where a target unitary U is compiled into a short-depth gate sequence V. In this work, we report on a surprising form of noise resilience for these algorithms. Namely, we find one often learns the correct gate sequence V (i.e. the correct variational parameters) despite various sources of incoherent noise acting during the cost-evaluation circuit. Our main results are rigorous theorems stating that the optimal variational parameters …
Characterizing Complexity In A Semiconductor With Optical Feedback From Two Mirrors, Layla M. Abrams
Characterizing Complexity In A Semiconductor With Optical Feedback From Two Mirrors, Layla M. Abrams
2020 Symposium Posters
Lasers are stable devices with a broad spectrum of applications. They can be perturbed to induce complex dynamics in their output intensity. One interesting regime in semiconductor lasers is that the output intensity of the laser emits a sequence of non-regular optical spikes. This behavior resembles that of neurons. We use a semiconductor laser with optical feedback from two mirrors to characterize the behavior of the laser's power output. The data is then analyzed by transforming the intensity time series into a sequence of patterns or words. By doing this we want to explore how the laser changes its preferred …