Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Quantum computing (5)
- Quantum Computing (4)
- Atom trapping (2)
- CUORE (2)
- Lasers (2)
-
- Majorana (2)
- Neutrino (2)
- Neutrinoless double beta decay (2)
- Optical Dipole Trap (2)
- Optics (2)
- Physics (2)
- Quantum (2)
- Quantum Information (2)
- Quantum Mechanics (2)
- Qubit (2)
- Standard Model Extension (2)
- Algorithm (1)
- Applied Optics (1)
- Atom Trap (1)
- Atomic physics (1)
- Beta decay (1)
- Bolometer (1)
- Bonding (1)
- Bose-Einstein Condensate (1)
- Camera (1)
- Carbon nanotube (1)
- Carrier Recombination (1)
- Chromatic Number (1)
- Circuit optimization (1)
- Circular Aperture (1)
- Publication Year
- Publication
- Publication Type
Articles 31 - 34 of 34
Full-Text Articles in Physical Sciences and Mathematics
Comparison Of A High Purity Germanium Gamma Ray Spectrometer And A Multidimensional Nai(T1) Scintillation Gamma Ray Spectrometer, Greg Stratton
Comparison Of A High Purity Germanium Gamma Ray Spectrometer And A Multidimensional Nai(T1) Scintillation Gamma Ray Spectrometer, Greg Stratton
Aerospace Engineering
This report compares two different gamma ray spectrometers in terms of performance, operation, and apparatus and also investigates the design and integration challenges of using gamma ray spectrometers in space. The first spectrometer is a one-dimensional high purity germanium (HPGe) spectrometer and the second is a multidimensional NaI(Tl) scintillation spectrometer (MGRS). The key results show that the HPGe exhibits 15 to 27 times better energy resolution than the MGRS, but the MGRS is 52 times more sensitive and removes 177 % more of the background radiation.
Quantum Mechanics, Quantum Computation, And The Density Operator In Sympy, Addison Cugini
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 …
Saturated Absorption For A Magneto-Optical Atom Trap As A Step Toward Atomic Dipole Traps In A Diffraction Pattern From A Circular Aperture, Andrew Ferdinand
Saturated Absorption For A Magneto-Optical Atom Trap As A Step Toward Atomic Dipole Traps In A Diffraction Pattern From A Circular Aperture, Andrew Ferdinand
Physics
Neutral atom quantum computing is a promising avenue toward the realization of a physical quantum computer. The diffraction pattern formed by laser light immediately behind a circular aperture can be used as optical atomic dipole traps, and has the potential to be scaled up to create a two dimensional array of individually addressable qubit sites. In working towards experimental demonstration of the dipole traps, we are constructing a MOT. The function of the MOT is to cool and trap 87Rb in a localized cloud in our vacuum chamber, which will be used to load the dipole traps. One critical …
Symbolic Quantum Circuit Simplification In Sympy, Matthew Curry
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.