Search NASA⌕ Search

Engineering topics

Dumitrescu, Eugene F.

Publications and source records attributed to Dumitrescu, Eugene F..

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Fully quantum algorithm for mesoscale fluid simulations with application to partial differential equations

Fluid flow simulations marshal our most powerful computational resources. In many cases, even this is not enough. Quantum computers provide an opportunity to speed up traditional algorithms for flow simulations. We show that lattice-based mesoscale numerical methods can be executed as efficient quantum algorithms due to their statistical features. This approach revises a quantum algorithm for lattice gas automata to reduce classical computations and state preparation at every time step. For this, the algorithm approximates the qubit relative phases and subtracts them at the end of each time step. Phases are evaluated using the iterative phase estimation algorithm and subtracted using single-qubit rotation phase gates. Further, this method optimizes the quantum resource required and makes it more appropriate for near-term quantum hardware. We also demonstrate how the checkerboard deficiency that the D1Q2 scheme presents can be resolved using the D1Q3 scheme. The algorithm is validated by simulating two canonical partial differential equations: the diffusion and Burgers' equations on different quantum simulators. We find good agreement between quantum simulations and classical solutions for the presented algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Quantum Computation of Dynamical Quantum Phase Transitions and Entanglement Tomography in a Lattice Gauge Theory

Strongly coupled gauge theories far from equilibrium may exhibit unique features that could illuminate the physics of the early universe and of hadron and ion colliders. Studying real-time phenomena has proven challenging with classical-simulation methods but is a natural application of quantum simulation. To demonstrate this prospect, we quantum compute nonequal-time correlation functions and perform entanglement tomography of nonequilibrium states of a simple lattice gauge theory, the Schwinger model, using a trapped-ion quantum computer by IonQ Inc. As an ideal target for near-term devices, a recently predicted dynamical quantum phase transition in this model is studied by preparing, quenching, and tracking the subsequent nonequilibrium dynamics in three ways: (i) overlap echos signaling dynamical transitions, (ii) nonequal-time correlation functions with an underlying topological nature, and (iii) the entanglement structure of nonequilibrium states, including entanglement Hamiltonians. These results constitute the first observation of a dynamical quantum phase transition in a lattice gauge theory on a quantum computer and are a first step toward investigating topological phenomena in nuclear and high-energy physics using quantum technologies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale

The numerical simulation of quantum circuits is an indispensable tool for development, verification, and validation of hybrid quantum-classical algorithms intended for near-term quantum co-processors. The emergence of exascale high-performance computing (HPC) platforms presents new opportunities for pushing the boundaries of quantum circuit simulation. Here, we present a modernized version of the Tensor Network Quantum Virtual Machine (TNQVM) that serves as the quantum circuit simulation backend in the eXtreme-scale ACCelerator (XACC) framework. The new version is based on the scalable tensor network processing library ExaTN (Exascale Tensor Networks). It provides multiple configurable quantum circuit simulators that perform either an exact quantum circuit simulation via the full tensor network contraction or an approximate simulation via a suitably chosen tensor factorization scheme. Upon necessity, stochastic noise modeling from real quantum processors is incorporated into the simulations by modeling quantum channels with Kraus tensors. By combining the portable XACC quantum programming frontend and the scalable ExaTN numerical processing backend, we introduce an end-to-end virtual quantum development environment that can scale from laptops to future exascale platforms. We report initial benchmarks of our framework, which include a demonstration of the distributed execution, incorporation of quantum decoherence models, and simulation of the random quantum circuits used for the certification of quantum supremacy on Google’s Sycamore superconducting architecture.

Nguyen, Thien↗
DOE OSTI2022

Fixed Depth Hamiltonian Simulation via Cartan Decomposition

Simulating quantum dynamics on classical computers is challenging for large systems due to the significant memory requirements. Simulation on quantum computers is a promising alternative, but fully optimizing quantum circuits to minimize limited quantum resources remains an open problem. In this study, we tackle this problem by presenting a constructive algorithm, based on Cartan decomposition of the Lie algebra generated by the Hamiltonian, which generates quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one-dimensional transverse field $\mathrm{XY}$ model, where $\mathscr{O}$(n 2 )-gate circuits naturally emerge. Compared to product formulas with significantly larger gate counts, our algorithm drastically improves simulation precision. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Robustness of vortex-bound Majorana zero modes against correlated disorder

Here, we investigate the effect of correlated disorder on Majorana zero modes (MZMs) bound to magnetic vortices in two-dimensional topological superconductors. By starting from a lattice model of interacting fermions with a p x ±ip y superconducting ground state in the disorder-free limit, we use perturbation theory to describe the enhancement of the Majorana localization length at weak disorder and a self-consistent numerical solution to understand the breakdown of the MZMs at strong disorder. We find that correlated disorder has a much stronger effect on the MZMs than uncorrelated disorder and that it is most detrimental if the disorder correlation length ℓ is on the same order as the superconducting coherence length ξ. In contrast, MZMs can survive stronger disorder for ℓ $\ll$ξ as random variations cancel each other within the length scale of ξ, while an MZM may survive up to very strong disorder for ℓ$\gg$ξ if it is located in a favorable domain of the given disorder realization.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

The hybrid topological longitudinal transmon qubit

We introduce a new hybrid qubit consisting of a Majorana qubit interacting with a transmon longitudinally coupled to a resonator. To do so, we equip the longitudinal transmon qubit with topological quasiparticles, supported by an array of heterostructure nanowires, and derive charge- and phase-based interactions between the Majorana qubit and the resonator and transmon degrees of freedom. Inspecting the charge coupling, we demonstrate that the Majorana self-charging can be eliminated by a judicious choice of charge offset, thereby maintaining the Majorana degeneracy regardless of the quasiparticles spatial arrangement and parity configuration. We perform analytic and numerical calculations to derive the effective qubit-qubit interaction elements and discuss their potential utility for state readout and quantum error correction. Further, we find that select interactions depend strongly on the overall superconducting parity, which may provide a direct mechanism to characterize deleterious quasiparticle poisoning processes.

36 MATERIALS SCIENCE↗
DOE OSTI2020

XACC: a system-level software infrastructure for heterogeneous quantum–classical computing

Quantum programming techniques and software have advanced significantly over the past five years, with a majority focusing on high-level language frameworks targeting remote REST library APIs. As quantum computing architectures advance and become more widely available, lower-level, system software infrastructures will be needed to enable tighter, co-processor programming and access models. In this work, we present XACC, a system-level software infrastructure for quantum–classical computing that promotes a service-oriented architecture to expose interfaces for core quantum programming, compilation, and execution tasks. Additionally, we detail XACC's interfaces, their interactions, and its implementation as a hardware-agnostic framework for both near-term and future quantum–classical architectures. We provide concrete examples demonstrating the utility of this framework with paradigmatic tasks. Our approach lays the foundation for the development of compilers, associated runtimes, and low-level system tools tightly integrating quantum and classical workflows.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Generative model benchmarks for superconducting qubits

In this paper we demonstrate experimentally how generative model training can be used as a benchmark for small (fewer than five qubits) quantum devices. Performance is quantified using three data analytic metrics: the Kullback-Leibler divergence and two adaptations of the F 1 score. Using the 2×2 bars and stripes data set, we train several different circuit constructions for generative modeling with superconducting qubits. By taking hardware connectivity constraints into consideration, we show that sparsely connected shallow circuits outperform denser counterparts on noisy hardware.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Scalar quantum field theories as a benchmark for near-term quantum computers

Quantum field theory (QFT) simulations are a potentially important application for noisy intermediate scale quantum (NISQ) computers. The ability of a quantum computer to emulate a QFT therefore constitutes a natural application-centric benchmark. Foundational quantum algorithms to simulate QFT processes rely on fault-tolerant computational resources, but to be useful on NISQ machines, error-resilient algorithms are required. Here we outline and implement a hybrid algorithm to calculate the lowest energy levels of the paradigmatic 1+1–dimensional $\phi$ 4 interacting scalar QFT. We calculate energy splittings and compare results with experimental values obtained on currently available quantum hardware. We show that the accuracy of mass-renormalization calculations represents a useful metric with which near-term hardware may be benchmarked. Finally, we also discuss the prospects of scaling the algorithm to full simulation of interacting QFTs on future hardware.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Benchmarking treewidth as a practical component of tensor network simulations

Tensor networks are powerful factorization techniques which reduce resource requirements for numerically simulating principal quantum many-body systems and algorithms. The computational complexity of a tensor network simulation depends on the tensor ranks and the order in which they are contracted. Unfortunately, computing optimal contraction sequences (orderings) in general is known to be a computationally difficult (NP-complete) task. In 2005, Markov and Shi showed that optimal contraction sequences correspond to optimal (minimum width) tree decompositions of a tensor network’s line graph, relating the contraction sequence problem to a rich literature in structural graph theory. While treewidth-based methods have largely been ignored in favor of dataset-specific algorithms in the prior tensor networks literature, we demonstrate their practical relevance for problems arising from two distinct methods used in quantum simulation: multi-scale entanglement renormalization ansatz (MERA) datasets and quantum circuits generated by the quantum approximate optimization algorithm (QAOA). We exhibit multiple regimes where treewidth-based algorithms outperform domain-specific algorithms, while demonstrating that the optimal choice of algorithm has a complex dependence on the network density, expected contraction complexity, and user run time requirements. We further provide an open source software framework designed with an emphasis on accessibility and extendability, enabling replicable experimental evaluations and future exploration of competing methods by practitioners.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Cloud Quantum Computing of an Atomic Nucleus

Here, we report a quantum simulation of the deuteron binding energy on quantum processors accessed via cloud servers. We use a Hamiltonian from pionless effective field theory at leading order. We design a low-depth version of the unitary coupled-cluster ansatz, use the variational quantum eigensolver algorithm, and compute the binding energy to within a few percent. Our work is the first step towards scalable nuclear structure computations on a quantum processor via the cloud, and it sheds light on how to map scientific computing applications onto nascent quantum devices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Plasmon-Mediated Entanglement Dynamics

We explore the steady state entanglement of quantum emitters coupled to a lossy plasmonic reservoir and driven by laser or electron-beam pump fields with picosecond antibunching dynamics.

Lawrie, Benjamin J.↗
DOE OSTI2018

Colossal Photon Bunching Driven by Phonon Recombination Dynamics

We report photon bunching g(2)(0) ≈ 49 due to phonon sidebands in spectrally filtered cathodoluminescence from NV centers in diamond. The result is consistent with fast, phonon-mediated recombination dynamics, and supported by a stochastic model.

Feldman, Matthew A.↗
DOE OSTI2018

Colossal photon bunching in quasiparticle-mediated nanodiamond cathodoluminescence

Nanoscale control over the second-order photon correlation function g (2) (τ) is critical to emerging research in nonlinear nanophotonics and integrated quantum information science. Here we report on quasiparticle control of photon bunching with g (2) (0) > 45 in the cathodoluminescence of nanodiamond nitrogen vacancy (NV 0 ) centers excited by a converged electron beam in an aberration-corrected scanning transmission electron microscope. Plasmon-mediated NV 0 cathodoluminescence exhibits a 16-fold increase in luminescence intensity correlated with a threefold reduction in photon bunching compared with that of uncoupled NV 0 centers. This effect is ascribed to the excitation of single temporally uncorrelated NV 0 centers by single surface plasmon polaritons. Spectrally resolved Hanbury Brown–Twiss interferometry is employed to demonstrate that the bunching is mediated by the NV 0 phonon sidebands, while no observable bunching is detected at the zero-phonon line. As a result, the data are consistent with fast phonon-mediated recombination dynamics, a conclusion substantiated by agreement between Bayesian regression and Monte Carlo models of superthermal NV 0 luminescence.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2017

Tree tensor network approach to simulating Shor's algorithm

Constructively simulating quantum systems furthers our understanding of qualitative and quantitative features which may be analytically intractable. In this paper, we directly simulate and explore the entanglement structure present in the paradigmatic example for exponential quantum speedups: Shor's algorithm. To perform our simulation, we construct a dynamic tree tensor network which manifestly captures two salient circuit features for modular exponentiation. These are the natural two-register bipartition and the invariance of entanglement with respect to permutations of the top-register qubits. Our construction help identify the entanglement entropy properties, which we summarize by a scaling relation. Further, the tree network is efficiently projected onto a matrix product state from which we efficiently execute the quantum Fourier transform. In conclusion, future simulation of quantum information states with tensor networks exploiting circuit symmetries is discussed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Antibunching dynamics of plasmonically mediated entanglement generation

Dissipative entanglement generation protocols embrace open quantum system dynamics to generate long-lived entangled states. In this letter, we report that zero-delay anti-bunching in the $g^{(2)}(\tau)$ correlation function is a signature of dissipative entanglement between actively driven quantum emitters coupled to a plasmonic resirvoir. The anti-bunching effect is a universal signature for entangled bi-partite states generated by relaxation to sub-radiant subspaces. We discuss how the anti-bunching can be validated on experimentally feasible timescales by a Hanburry Brown and Twiss interferometer and analyze the entanglement generation robustness with respect to variations in local detunings, system couplings, and driving fields.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗