Search NASA⌕ Search

Engineering topics

Hamilton, Kathleen E.

Publications and source records attributed to Hamilton, Kathleen E..

Application-level benchmarking of quantum computers using nonlocal game strategies

In a nonlocal game, two noncommunicating players cooperate to convince a referee that they possess a strategy that does not violate the rules of the game. Quantum strategies allow players to optimally win some games by performing joint measurements on a shared entangled state, but computing these strategies can be challenging. We present a variational quantum algorithm to compute quantum strategies for nonlocal games by encoding the rules of a nonlocal game into a Hamiltonian. We show how this algorithm can generate a short-depth optimal quantum strategy for a graph coloring game with a quantum advantage. This quantum strategy is then evaluated on fourteen different quantum hardware platforms to demonstrate its utility as a benchmark. Finally, we discuss potential sources of errors that can explain the observed decreased performance of the executed task and derive an expression for the number of samples required to accurately estimate the win rate in the presence of noise.

nonlocal games↗

Unsupervised quantum circuit learning in high energy physics

Unsupervised training of generative models is a machine learning task that has many applications in scientific computing. Here, in this work, we evaluate the efficacy of using quantum circuit-based generative models to generate synthetic data of high energy physics processes. We use nonadversarial, gradient-based training of quantum circuit Born machines to generate joint distributions over two and three variables.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A review of non-cognitive applications for neuromorphic computing

Abstract Though neuromorphic computers have typically targeted applications in machine learning and neuroscience (‘cognitive’ applications), they have many computational characteristics that are attractive for a wide variety of computational problems. In this work, we review the current state-of-the-art for non-cognitive applications on neuromorphic computers, including simple computational kernels for composition, graph algorithms, constrained optimization, and signal processing. We discuss the advantages of using neuromorphic computers for these different applications, as well as the challenges that still remain. The ultimate goal of this work is to bring awareness to this class of problems for neuromorphic systems to the broader community, particularly to encourage further work in this area and to make sure that these applications are considered in the design of future neuromorphic systems.

97 MATHEMATICS AND COMPUTING↗

Mode connectivity in the loss landscape of parameterized quantum circuits

Variational training of parameterized quantum circuits (PQCs) underpins many workflows employed on near-term noisy intermediate scale quantum (NISQ) devices. It is a hybrid quantum-classical approach that minimizes an associated cost function in order to train a parameterized ansatz. In this work we adapt the qualitative loss landscape characterization for neural networks introduced in Goodfellow et al. (2014); Li et al. (2017) and tests for connectivity used in Draxler et al. (2018) to study the loss landscape features in PQC training. We present results for PQCs trained on a simple regression task, using the bilayer circuit ansatz, which consists of alternating layers of parameterized rotation gates and entangling gates. Multiple circuits are trained with 3 different batch gradient optimizers: stochastic gradient descent, the quantum natural gradient, and Adam. We identify large features in the landscape that can lead to faster convergence in training workflows.

97 MATHEMATICS AND COMPUTING↗

Solar Wind Turbulence from 1 to 45 au. I. Evidence for Dissipation of Magnetic Fluctuations Using Voyager and ACE Observations

As part of a published effort to study low-frequency magnetic waves excited by newborn interstellar pickup ions seen by the Voyager spacecraft, we developed a set of control intervals that represent the background turbulence when the observations are not dominated by wave excitation. This paper begins an effort to better understand solar wind turbulence from 1 to 45 au while spanning greater than one solar cycle. Here, we first focus on the diagnostics marking the onset of dissipation. This includes an expected break in the power spectrum at frequencies greater than the proton cyclotron frequency and a resultant steepening of the spectrum at higher frequencies. Contrary to what is established at 1 au, we only see the spectral break in rare instances. The expected scaling of the spectral index with the turbulence rate is seen, but it is not as clearly established as it was at 1 au. We also find that both Voyager data from 1 to 45 au and Advanced Composition Explorer data from 1 au show significant bias of the magnetic helicity at dissipation scales when the dissipation-range power-law spectral index steepens. We conclude that dissipation dynamics are similar throughout the heliosphere in so far as we have examined to date.

Pine, Zackary B.↗

Solar Wind Turbulence from 1 to 45 au. III. Anisotropy of Magnetic Fluctuations in the Inertial Range Using Voyager and ACE Observations

We examine both Voyager and Advanced Composition Explorer magnetic field measurements at frequencies that characterize the inertial range and evaluate the anisotropy of the fluctuations as they relate to both the compressive component and underlying wavevector anisotropy of the turbulence. The magnetic fluctuation anisotropy as it relates to the compressive component is directly dependent upon both the plasma beta of the thermal proton component and the ratio of magnetic fluctuation magnitude to the strength of the mean magnetic field. This has been seen before at 1 au. The magnetic fluctuation anisotropy in the plane perpendicular to the mean magnetic field, which is a measure of the anisotropy of the underlying wavevector distribution, should depend on the angle between the mean magnetic field and the radial direction and should be confined to values between one and the index of the power spectrum, which is typically 5/3. Our results show that the average of this anisotropy exceeds the value of the spectral index and is out of bounds with the theory. Although the results are suggestive of past analyses, we find that spherical expansion of the turbulence may offer at least a partial explanation of the apparent amplification of this measured anisotropy.

heliosphere↗

Error-mitigated data-driven circuit learning on noisy quantum hardware

Application-level benchmarks measure how well a quantum device performs meaningful calculations. In the case of parameterized circuit training, the computational task is the preparation of a target quantum state via optimization over a loss landscape. This is complicated by various sources of noise, fixed hardware connectivity, and generative modeling, the choice of target distribution. Gradient-based training has become a useful benchmarking task for noisy intermediate-scale quantum computers because of the additional requirement that the optimization step uses the quantum device to estimate the loss function gradient. In this work, we use gradient-based data-driven circuit learning to qualitatively evaluate the performance of several superconducting platform devices and present results that show how error mitigation can improve the training of quantum circuit Born machines with 28 tunable parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Accelerating Scientific Computing in the Post-Moore’s Era

Novel uses of graphical processing units for accelerated computation revolutionized the field of high-performance scientific computing by providing specialized workflows tailored to algorithmic requirements. As the era of Moore’s law draws to a close, many new non–von Neumann processors are emerging as potential computational accelerators, including those based on the principles of neuromorphic computing, tensor algebra, and quantum information. While development of these new processors is continuing to mature, the potential impact on accelerated computing is anticipated to be profound. We discuss how different processing models can advance computing in key scientific paradigms: machine learning and constraint satisfaction. Significantly, each of these new processor types utilizes a fundamentally different model of computation, and this raises questions about how to best use such processors in the design and implementation of applications. While many processors are being developed with a specific domain target, the ubiquity of spin-glass models and neural networks provides an avenue for multi-functional applications. Furthermore, this also hints at the infrastructure needed to integrate next-generation processing units into future high-performance computing systems.

97 MATHEMATICS AND COMPUTING↗

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↗

Sparse Hardware Embedding of Spiking Neuron Systems for Community Detection

We study the applicability of spiking neural networks and neuromorphic hardware for solving general optimization problems without the use of adaptive training or learning algorithms. We leverage the dynamics of Hopfield networks and spin-glass systems to construct a fully connected spiking neural system to generate synchronous spike responses indicative of the underlying community structure in an undirected, unweighted graph. Mapping this fully connected system to current generation neuromorphic hardware is done by embedding sparse tree graphs to generate only the leading-order spiking dynamics. Here, we demonstrate that for a chosen set of benchmark graphs, the spike responses generated on a current generation neuromorphic processor can improve the stability of graph partitions and non-overlapping communities can be identified even with the loss of higher-order spiking behavior if the graphs are sufficiently dense. For sparse graphs, the loss of higher-order spiking behavior improves the stability of certain graph partitions but does not retrieve the known community memberships.

97 MATHEMATICS AND COMPUTING↗

Recall Performance for Content-Addressable Memory Using Adiabatic Quantum Optimization

A content-addressable memory (CAM) stores key-value associations such that the key is recalled by providing its associated value. While CAM recall is traditionally performed using recurrent neural network models, we show how to solve this problem using adiabatic quantum optimization. Our approach maps the recurrent neural network to a commercially available quantum processing unit by taking advantage of the common underlying Ising spin model. We then assess the accuracy of the quantum processor to store key-value associations by quantifying recall performance against an ensemble of problem sets. We observe that different learning rules from the neural network community influence recall accuracy but performance appears to be limited by potential noise in the processor. The strong connection established between quantum processors and neural network problems supports the growing intersection of these two ideas.

97 MATHEMATICS AND COMPUTING↗

Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets

Using quantum annealing to solve an optimization problem requires minor embedding a logic graph into a known hardware graph. We introduce the minor set cover (MSC) of a known graph GG : a subset of graph minors which contain any remaining minor of the graph as a subgraph, in an effort to reduce the complexity of the minor embedding problem. Any graph that can be embedded into GG will be embeddable into a member of the MSC. Focusing on embedding into the hardware graph of commercially available quantum annealers, we establish the MSC for a particular known virtual hardware, which is a complete bipartite graph. Furthermore, we show that the complete bipartite graph K N,N has a MSC of N minors, from which K N+1 is identified as the largest clique minor of K N,N . In the case of determining the largest clique minor of hardware with faults we briefly discussed this open question.

97 MATHEMATICS AND COMPUTING↗