Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Quantum Physics

California Polytechnic State University, San Luis Obispo

Physics

Theses/Dissertations

Quantum computing

Publication Year

Articles 1 - 5 of 5

Full-Text Articles in Physical Sciences and Mathematics

Developing A Data Acquisition System For Use In Cold Neutral Atom Traps, Jonathan E. Fuzaro Alencar Jun 2022

Developing A Data Acquisition System For Use In Cold Neutral Atom Traps, Jonathan E. Fuzaro Alencar

Physics

The rising interest in quantum computing has led to new quantum systems being developed and researched. Among these are trapped neutral atoms which have several desirable features and may be configured and operated on using lasers in an optical lattice. This work describes the development of a new data acquisition system for use in tuning lasers near the precise hyperfine transition frequencies of Rb 87 atoms, a crucial step in the functionality of a neutral atom trap. This improves on previous implementations that were deprecated and limited in laser frequency sweep range. Integration into the experiment was accomplished using an …


Optimization Of An Injection Locked Laser System For Cold Neutral Atom Traps, Elliot M. Lehman Mar 2019

Optimization Of An Injection Locked Laser System For Cold Neutral Atom Traps, Elliot M. Lehman

Physics

Many types of quantum systems are being explored for use in quantum computers. One type of quantum system that shows promise for quantum computing is trapped neutral atoms. They have long coherence times, since they have multiple stable ground states and have minimal coupling with other atoms and their environment, and they can be trapped in arrays, making them individu- ally addressable. Once trapped, they can be initialized and operated on using laser pulses. This experiment utilizes a pinhole diffraction pattern, which can trap atoms in both bright and dark areas. To maximize trap strength, an injection-locked laser amplification system …


Monitoring Atom Traps For Neutral Atom Quantum Computing, Taylor Shannon Mar 2014

Monitoring Atom Traps For Neutral Atom Quantum Computing, Taylor Shannon

Physics

To increase computing power for numerous practical advantages, scientists are actively researching the field of quantum computing. Neutral atom quantum computing is a promising avenue towards building a quantum computer that satisfies four of the five DiVincenzo criteria. This involves a magneto-optical trap to cool the atoms and move them to a cloud in the center of a vacuum chamber. Then laser light will be shone through an array of pinholes to trap the atoms in an array of dipole traps. In order to ensure the atoms are trapped, I have set up an imaging system that consists of a …


Quantum Mechanics, Quantum Computation, And The Density Operator In Sympy, Addison Cugini Jun 2011

Quantum Mechanics, Quantum Computation, And The Density Operator In Sympy, Addison Cugini

Physics

Because aspects of quantum mechanics are both difficult to understand and difficult algebraically, there is a need for software which symbolically simulates quantum mechanical phenomena. To accomplish this goal, code has been added to an open-source computer algebra system, called SymPy, which models the abstraction of Dirac notation and the density operator. Additionally, a quantum computer simulation has been built using this abstraction. This paper shall discuss the code that has been added as well as any relevant physics important to understanding the code. In particular, we shall focus on the density operator of statistical quantum mechanics using SymPy's density …


Symbolic Quantum Circuit Simplification In Sympy, Matthew Curry Jun 2011

Symbolic Quantum Circuit Simplification In Sympy, Matthew Curry

Physics

In the field of quantum information science, one can design a series of quantum logic operations known as a circuit. Circuits are the basis for quantum computations in quantum computing. As circuits will most likely be designed from a logical standpoint, there could exist mathematical redundancies which will lead to a larger circuit than necessary. These redundancies are computationally expensive, and there is a need for them to be found and eliminated to simplify the circuit. We present our research on finding the rules for simplifying circuits and its implementation in SymPy.