Search NASA⌕ Search

Engineering topics

Watkins, Jacob

Publications and source records attributed to Watkins, Jacob.

Techno-economic analysis of bioplastic and biofuel production from a high-ash microalgae biofilm cultivated in effluent from a municipal anaerobic digester

Rotating Algae Biofilm Reactors (RABRs) are a promising technology for efficient treatment of wastewater and production of algae-based bioproducts. However, RABR-grown algae can contain a high content of ash (30–60 wt%, dry basis), which influences the technical and economic feasibility of bioproduct conversion processes. In this report, experimental studies and economic analysis were conducted to compare different processes for bioproduct conversion of a high-ash microalgae biofilm grown using a RABR treating 0.6 million gallons per day of anaerobic digestion centrate at the Central Valley Water Reclamation Facility in Salt Lake City, UT. Process and economic models were developed and compared for three conversion processes: 1) the production of bioplastics, 2) the production of bioplastics with a lipid-extraction pretreatment, and 3) the production of biocrude via hydrothermal liquefaction. Techno-economic analysis was performed for each conversion process, including three cases for algae productivity: 231, 391, and 577 metric tons per year (dry basis). The calculated value for the minimum plastic selling price (MPSP) of bioplastics produced from algae ranges from $\$4050$ to $\$3520$ per metric ton based on the baseline and final productivity cases of the RABR, respectively. The extraction of lipids in addition to bioplastic production results in an MPSP of $\$4570$ to $\$4000$ per metric ton for the same productivity cases. The relatively small production scale and complex processing for hydrothermal liquefaction results in a minimum fuel selling price of the biocrude of $\$5.32$ per gallon of gasoline equivalent. In conclusion, the conversion process for bioplastic production from whole algae has the highest income:expense ratio and the most cost-competitive pricing of the three modeled processes.

09 BIOMASS FUELS↗

Demonstration of the rodeo algorithm on a quantum computer

The rodeo algorithm is an efficient algorithm for eigenstate preparation and eigenvalue estimation for any observable on a quantum computer. This makes it a promising tool for studying the spectrum and structure of atomic nuclei as well as other fields of quantum many-body physics. The only requirement is that the initial state has sufficient overlap probability with the desired eigenstate. While it is exponentially faster than well-known algorithms such as phase estimation and adiabatic evolution for eigenstate preparation, it has yet to be implemented on an actual quantum device. In this work, we apply the rodeo algorithm to determine the energy levels of a random one-qubit Hamiltonian, resulting in a relative error of 0.08% using mid-circuit measurements on the IBM Q device Casablanca. This surpasses the accuracy of directly-prepared eigenvector expectation values using the same quantum device. We take advantage of the high-accuracy energy determination and use the Hellmann-Feynman theorem to compute eigenvector expectation values for a different random one-qubit observable. For the Hellmann-Feynman calculations, we find a relative error of 0.7%. Here, we conclude by discussing possible future applications of the rodeo algorithm for multi-qubit Hamiltonians.

algorithm↗

Improved Accuracy for Trotter Simulations Using Chebyshev Interpolation

Quantum metrology allows for measuring properties of a quantum system at the optimal Heisenberg limit. However, when the relevant quantum states are prepared using digital Hamiltonian simulation, the accrued algorithmic errors will cause deviations from this fundamental limit. In this work, we show how algorithmic errors due to Trotterized time evolution can be mitigated through the use of standard polynomial interpolation techniques. Our approach is to extrapolate to zero Trotter step size, akin to zero-noise extrapolation techniques for mitigating hardware errors. We perform a rigorous error analysis of the interpolation approach for estimating eigenvalues and time-evolved expectation values, and show that the Heisenberg limit is achieved up to polylogarithmic factors in the error. Our work suggests that accuracies approaching those of state-of-the-art simulation algorithms may be achieved using Trotter and classical resources alone for a number of relevant algorithmic tasks.

Rendon, Gumaro↗

Rodeo Algorithm for Quantum Computing

We present a stochastic quantum computing algorithm that can prepare any eigenvector of a quantum Hamiltonian within a selected energy interval $\ [E-\epsilon, E+\epsilon]$. In order to reduce the spectral weight of all other eigenvectors by a suppression factor δ, the required computational effort scales as $\ O[|\log \delta|/(p \epsilon)]$, where p s the squared overlap of the initial state with the target eigenvector. The method, which we call the rodeo algorithm, uses auxiliary qubits to control the time evolution of the Hamiltonian minus some tunable parameter E . In this manner, we converge to the target eigenvector with exponential accuracy in the number of measurements. In addition to preparing eigenvectors, the method can also compute the full spectrum of the Hamiltonian. We illustrate the performance with several examples. For energy eigenvalue determination with error $\epsilon$, the computational scaling is $\ O[(\log \epsilon)^2/(p \epsilon)]$. For eigenstate preparation, the computational scaling is $\ O(\log \Delta/p)$, where $\Delta$ is the magnitude of the orthogonal component of the residual vector. The speed for eigenstate preparation is exponentially faster than that for phase estimation or adiabatic evolution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Time fractals and discrete scale invariance with trapped ions

We show that a one-dimensional chain of trapped ions can be engineered to produce a quantum mechanical system with discrete scale invariance and fractal-like time dependence. By discrete scale invariance we mean a system that replicates itself under a rescaling of distance for some scale factor, and a time fractal is a signal that is invariant under the rescaling of time. These features are reminiscent of the Efimov effect, which has been predicted and observed in bound states of three-body systems. We demonstrate that discrete scale invariance in the trapped ion system can be controlled with two independently tunable parameters. We also discuss the extension to n-body states where the discrete scaling symmetry has an exotic heterogeneous structure. Furthermore, the results we present can be realized using currently available technologies developed for trapped ion quantum systems.

74 ATOMIC AND MOLECULAR PHYSICS↗