Conversion Efficiencies of Heteronuclear Feshbach Molecules

We study the conversion efficiency of heteronuclear Feshbach molecules in population imbalanced atomic gases formed by ramping the magnetic field adiabatically. We extend the recent work [J. E. Williams et al., New J. Phys., 8, 150 (2006)] on the theory of Feshbach molecule formations to various combinations of quantum statistics of each atomic component. A simple calculation for a harmonically trapped ideal gas is in good agreement with the recent experiment [S. B. Papp and C. E. Wieman, Phys. Rev. Lett., 97, 180404 (2006)] without any fitting parameters. We also give the conversion efficiency as an explicit function of initial peak phase space density of the majority species for population imbalanced gases. In the low-density region where Bose-Einstein condensation does not appear, the conversion efficiency is a monotonic function of the initial peak phase space density, but independent of statistics of a minority component. The quantum statistics of majority atoms has a significant effect on the conversion efficiency. In addition, Bose-Einstein condensation of an atomic component is the key element determining the maximum conversion efficiency.Comment: 46 pages, 32 figure

Manger Throne: Worshiping Emmanuel at Christmas

The overwhelming truth of the infinite, Almighty God coming to earth, clothing Himself in flesh in order to begin His grand plan for the redemption of mankind is often lost amid the festive celebrations of the Christmas season. The holidays are a time when joy and sorrow are intensified and people’s hearts are softened, making them more receptive to hear the message of the Gospel and the hope found only in Jesus. The following Worship Ministry Project seeks to elicit the overwhelming truth of God’s love to the unbeliever and to reignite the wonder and worship in the hearts of believers as to how the King of kings came as Emmanuel in order to die for the freedom and restoration of humanity

A Programmable True Random Number Generator Using Commercial Quantum Computers

Random number generators (RNG) are essential elements in many cryptographic systems. True random number generators (TRNG) rely upon sources of randomness from natural processes such as those arising from quantum mechanics phenomena. We demonstrate that a quantum computer can serve as a high-quality, weakly random source for a generalized user-defined probability mass function (PMF). Specifically, QC measurement implements the process of variate sampling according to a user-specified PMF resulting in a word comprised of electronic bits that can then be processed by an extractor function to address inaccuracies due to non-ideal quantum gate operations and other system biases. We introduce an automated and flexible method for implementing a TRNG as a programmed quantum circuit that executes on commercially-available, gate-model quantum computers. The user specifies the desired word size as the number of qubits and a definition of the desired PMF. Based upon the user specification of the PMF, our compilation tool automatically synthesizes the desired TRNG as a structural OpenQASM file containing native gate operations that are optimized to reduce the circuit's quantum depth. The resulting TRNG provides multiple bits of randomness for each execution/measurement cycle; thus, the number of random bits produced in each execution is limited only by the size of the QC. We provide experimental results to illustrate the viability of this approach.Comment: 15 pages, 7 figures, SPIE Defense + Commercial Sensing: Quantum Information Science, Sensing, and Computation X

Automated Quantum Oracle Synthesis with a Minimal Number of Qubits

Several prominent quantum computing algorithms--including Grover's search algorithm and Shor's algorithm for finding the prime factorization of an integer--employ subcircuits termed 'oracles' that embed a specific instance of a mathematical function into a corresponding bijective function that is then realized as a quantum circuit representation. Designing oracles, and particularly, designing them to be optimized for a particular use case, can be a non-trivial task. For example, the challenge of implementing quantum circuits in the current era of NISQ-based quantum computers generally dictates that they should be designed with a minimal number of qubits, as larger qubit counts increase the likelihood that computations will fail due to one or more of the qubits decohering. However, some quantum circuits require that function domain values be preserved, which can preclude using the minimal number of qubits in the oracle circuit. Thus, quantum oracles must be designed with a particular application in mind. In this work, we present two methods for automatic quantum oracle synthesis. One of these methods uses a minimal number of qubits, while the other preserves the function domain values while also minimizing the overall required number of qubits. For each method, we describe known quantum circuit use cases, and illustrate implementation using an automated quantum compilation and optimization tool to synthesize oracles for a set of benchmark functions; we can then compare the methods with metrics including required qubit count and quantum circuit complexity.Comment: 18 pages, 10 figures, SPIE Defense + Commercial Sensing: Quantum Information Science, Sensing, and Computation X