SearcharxivSearch

arXiv subjects

Benjamin C. A. Morrison

Publications and source records attributed to Benjamin C. A. Morrison.

6 recordsLinked to original sources

The table maker's quantum search

We show that quantum search can be used to compute the hardness to round an elementary function, that is, to determine the minimum working precision required to compute the values of an elementary function correctly rounded to a target precision of $n$ digits for all possible precision-$n$ floating-point inputs in a given interval. For elementary functions $f$ related to the exponential function, quantum search takes time $\tilde O(2^{n/2} \log (1/δ))$ to return, with probability $1-δ$, the hardness to round $f$ over all $n$-bit floating-point inputs in a given binade. For periodic elementary functions in large binades, standalone quantum search yields an asymptotic speedup over the best known classical algorithms and heuristics. We then estimate the resources required for a fault-tolerant implementation of the proposed algorithm for the $\sin$ and $\cos$ functions in double precision. We find that, although the algorithm can in principle compete with the fastest known practical method for computing the hardness to round over all binades in the format, it requires qubit coherence times that are unrealistically long for present technology.

quant-ph

Logical fermions for fault-tolerant quantum simulation

We show how to absorb fermionic quantum simulation's expensive fermion-to-qubit mapping overhead into the overhead already incurred by surface-code-based fault-tolerant quantum computing. The key idea is to process information in surface-code twist defects, which behave like logical Majorana fermions. Our approach encodes Dirac fermions, a key data type for simulation applications, directly into logical Majorana fermions rather than atop a logical qubit layer in the architecture. Using quantum simulation of the $N$-fermion 2D Fermi-Hubbard model as an exemplar, we demonstrate two immediate algorithmic improvements. First, by preserving the model's locality at the logical level, we reduce the asymptotic Trotter-Suzuki quantum circuit depth from $\mathcal{O}(\sqrt{N})$ in a typical Jordan-Wigner encoding to $\mathcal{O}(1)$ in our encoding. Second, by exploiting optimizations manifest for logical fermions but less obvious for logical qubits, we reduce the $T$-count of the block-encoding \textsc{select} oracle by 20\% over standard implementations, even when realized by logical qubits and not logical fermions.

quant-ph

JaqalPaw: A Guide to Defining Pulses and Waveforms for Jaqal

One of the many challenges of developing an open user testbed such as QSCOUT is providing an interface that maintains simplicity without compromising expressibility or control. This interface comprises two distinct elements: a quantum assembly language designed for specifying quantum circuits at the gate level, and a low-level counterpart used for describing gates in terms of waveforms that realize specific quantum operations. Jaqal, or "Just another quantum assembly language," is the language used in QSCOUT for gate-level descriptions of quantum circuits. JaqalPaw, or "Jaqal pulses and waveforms," is its pulse-level counterpart. This document concerns the latter, and presents a description of the tools needed for precisely defining the underlying waveforms associated with a gate primitive.

quant-ph

Just another quantum assembly language (Jaqal)

The Quantum Scientific Computing Open User Testbed (QSCOUT) is a trapped-ion quantum computer testbed realized at Sandia National Laboratories on behalf of the Department of Energy's Office of Science and its Advanced Scientific Computing (ASCR) program. Here we describe Jaqal, for Just another quantum assembly language, the programming language we invented to specify programs executed on QSCOUT. Jaqal is useful beyond QSCOUT---it can support mutliple hardware targets because it offloads gate names and their pulse-sequence definitions to external files. We describe the capabilities of the Jaqal language, our approach in designing it, and the reasons for its creation. To learn more about QSCOUT, Jaqal, or JaqalPaq, the metaprogramming Python package we developed for Jaqal, please visit https://qscout.sandia.gov, https://gitlab.com/jaqal, or send an e-mail to qscout@sandia.gov.

quant-ph

Jaqal, the Quantum Assembly Language for QSCOUT

QSCOUT is the Quantum Scientific Computing Open User Testbed, a trapped-ion quantum computer testbed realized at Sandia National Laboratories on behalf of the Department of Energy's Office of Science and its Advanced Scientific Computing (ASCR) program. Jaqal, for Just Another Quantum Assembly Language, is the programming language used to specify programs executed on QSCOUT. This document contains a specification of Jaqal along with a summary of QSCOUT 1.0 capabilities, example Jaqal programs, and plans for possible future extensions. To learn more about QSCOUT and the Jaqal language developed for it, please visit qscout.sandia.gov or send an e-mail to qscout@sandia.gov.

quant-ph

Aqueous ammonium thiocyanate solutions as refractive index-matching fluids with low density and viscosity

We show that aqueous solutions of ammonium thiocyanate (NH4SCN) can be used to match the index of refraction of several transparent materials commonly used in experiments, while maintaining low viscosity and density compared to other common refractive index-matching liquids. We present empirical models for estimating the index of refraction, density, and kinematic viscosity of these solutions as a function of temperature and concentration. Finally, we summarize the chemical compatibility of ammonium thiocyanate with materials commonly used in apparatus.

physics.flu-dyn