Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum Computation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

Snowmass Computational Frontier: Topical Group Report on Quantum Computing

Quantum computing will play a pivotal role in the High Energy Physics (HEP) science program over the early parts of the 21$^{st}$ Century, both as a major expansion of our capabilities across the Computational Frontier, and in synthesis with quantum sensing and quantum networks. This report outlines how Quantum Information Science (QIS) and HEP are deeply intertwined endeavors that benefit enormously from a strong engagement together. Quantum computers do not represent a detour for HEP, rather they are set to become an integral part of our discovery toolkit. Problems ranging from simulating quantum field theories, to fully leveraging the most sensitive sensor suites for new particle searches, and even data analysis will run into limiting bottlenecks if constrained to our current computing paradigms. Easy access to quantum computers is needed to build a deeper understanding of these opportunities. In turn, HEP brings crucial expertise to the national quantum ecosystem in quantum domain knowledge, superconducting technology, cryogenic and fast microelectronics, and massive-scale project management. The role of quantum technologies across the entire economy is expected to grow rapidly over the next decade, so it is important to establish the role of HEP in the efforts surrounding QIS. Fully delivering on the promise of quantum technologies in the HEP science program requires robust support. It is important to both invest in the co-design opportunities afforded by the broader quantum computing ecosystem and leverage HEP strengths with the goal of designing quantum computers tailored to HEP science.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Digital-analog quantum computation

Digital quantum computing paradigm offers highly desirable features such as universality, scalability, and quantum error correction. However, physical resource requirements to implement useful error-corrected quantum algorithms are prohibitive in the current era of NISQ devices. As an alternative path to performing universal quantum computation, within the NISQ era limitations, we propose to merge digital single-qubit operations with analog multiqubit entangling blocks in an approach we call digital-analog quantum computing (DAQC). Along these lines, although the techniques may be extended to any resource, we propose to use unitaries generated by the ubiquitous Ising Hamiltonian for the analog entangling block and we prove its universal character. Here, we construct explicit DAQC protocols for efficient simulations of arbitrary inhomogeneous Ising, two-body, and M-body spin Hamiltonian dynamics by means of single-qubit gates and a fixed homogeneous Ising Hamiltonian. Additionally, we compare a sequential approach where the interactions are switched on and off (stepwise DAQC) with an always-on multiqubit interaction interspersed by fast single-qubit pulses (banged DAQC). Finally, we perform numerical tests comparing purely digital schemes with DAQC protocols, showing a remarkably better performance of the latter. The proposed DAQC approach combines the robustness of analog quantum computing with the flexibility of digital methods.

97 MATHEMATICS AND COMPUTING↗

Universal quantum computer from a quantum magnet

We show that a local Hamiltonian of spin-(3/2) particles with only two-body nearest-neighbor Affleck-Kennedy-Lieb-Tasaki and exchange-type interactions has a unique ground state, which can be used to implement universal quantum computation merely with single-spin measurements. We prove that the Hamiltonian is gapped, independent of the system size. Our result provides a further step toward utilizing systems with condensed-matter-type interactions for measurement-based quantum computation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Visualization of Noisy and Less Noisy Computational Basis States in Quantum Computing

Quantum computing technology holds substantial promise as a reliable computational paradigm. However, current noisy intermediate scale quantum (NISQ) systems, are significantly impacted by noise originating from hardware inconsistencies. This noise causes errors and lowers output fidelity. So we must find which basis states cause errors. However, there are two main challenges in analyzing noise corresponding to basis states. First, the noise distribution data is high dimensional in nature, thereby making its analysis challenging. Second, although functional box plots have been used in the state of the art research to understand such a high dimensional data, they suffer from clutter and occlusion issues because of overplotting. In this study, we introduce an innovative visualization pipeline to address the aforementioned challenges to provide a clear depiction of noisy and less-noisy basis states. Specifically, our proposed visualization pipeline comprises three stages namely, low dimensional embedding, clustering, and violin plot visualization, to reduce visual clutter and effectively analyze high-dimensional noise distribution data. Our analysis uses quantum machine learning (QML) circuits as case study for drawing a distinction between noisy and less noisy basis states.

Senapati, Priyabrata [Kent State University]↗

Balanced k -means clustering on an adiabatic quantum computer

Adiabatic quantum computers are a promising platform for efficiently solving challenging optimization problems. Therefore, many are interested in using these computers to train computationally expensive machine learning models. We present a quantum approach to solving the balanced k-means clustering training problem on the D-Wave 2000Q adiabatic quantum computer. In order to do this, we formulate the training problem as a quadratic unconstrained binary optimization (QUBO) problem. Unlike existing classical algorithms, our QUBO formulation targets the global solution to the balanced k-means model. We test our approach on a number of small problems and observe that despite the theoretical benefits of the QUBO formulation, the clustering solution obtained by a modern quantum computer is usually inferior to the solution obtained by the best classical clustering algorithms. Nevertheless, the solutions provided by the quantum computer do exhibit some promising characteristics. We also perform a scalability study to estimate the run time of our approach on large problems using future quantum hardware. Finally, as a final proof of concept, we used the quantum approach to cluster random subsets of the Iris benchmark data set.

97 MATHEMATICS AND COMPUTING↗

Quantum computation with moving quantum dots generated by surface acoustic waves

Motivated by recent experimental observations [M. Kataoka et al., Phys. Rev. Lett. 102, 156801 (2009)], we propose here a theoretical approach to implement quantum computation with bound states of electrons in moving quantum dots generated by the driving of surface acoustic waves. Differing from static quantum dots defined by a series of static electrodes above the two-dimensional electron gas (2DEG), here a single electron is captured from a 2DEG reservoir by a surface acoustic wave and then trapped in a moving quantum dot (MQD) transported across a quasi-one-dimensional channel, wherein all the electrons have been excluded by the actions of the surface gates. The flying qubit introduced here is encoded by the two lowest levels of the electron in the MQD, and the Rabi oscillation between these two levels could be implemented by applying finely selected microwave pulses to the surface gates. By using the Coulomb interaction between the electrons in different MQDs, we show that a desirable two-qubit operation, i.e., iswap gate, could be realized. Readouts of the present flying qubits are also feasible with the current single-electron detected technique.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Universal quantum computation by discontinuous quantum walk

Quantum walks are the quantum-mechanical analog of random walks, in which a quantum ''walker'' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution under the Hamiltonian furnished by the adjacency matrix of the graph. We present a hybrid scheme for universal quantum computation in which a quantum walker takes discrete steps of continuous evolution. This ''discontinuous'' quantum walk employs perfect quantum-state transfer between two nodes of specific subgraphs chosen to implement a universal gate set, thereby ensuring unitary evolution without requiring the introduction of an ancillary coin space. The run time is linear in the number of simulated qubits and gates. The scheme allows multiple runs of the algorithm to be executed almost simultaneously by starting walkers one time step apart.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dissipative quantum computing with open quantum walks

An open quantum walk approach to the implementation of a dissipative quantum computing scheme is presented. The formalism is demonstrated for the example of an open quantum walk implementation of a 3 qubit quantum circuit consisting of 10 gates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

EQC: Ensembled Quantum Computing for Variational Quantum Algorithms

Variational quantum algorithms (VQA), which are comprised of a classical optimizer and a parameterized quantum circuit, emerges as one of the most promising approaches of harvesting quantum power in the noisy-intermediate-scale-quantum (NISQ) era. However, the deployment of VQAs on today's NISQ devices often faces considerable system noise and prohibitively slow training speeds. On the other hand, the expensive supporting sources and infrastructure make quantum computers extremely keen on high utilization. In this paper, we propose a novel way of thinking about a quantum backend: rather than relying on one physical device which tends to introduce platform-specific noise and bias, a quantum ensemble, which distributes quantum tasks across parallel devices, can serve as a virtualized quantum computer for offering reduced noise levels through an adaptive mixture and also provide significantly improved training speeds through parallelization. With this idea, we build a distributive VQA optimization framework called DVQA, serving as the first effort in adopting parallel quantum devices for cooperative VQA training. To further constraint noise and speed-up convergence, we design a model for individual NISQ devices concerning their properties and running conditions, and propose a weighting mechanism for regularizing the returned gradients. Extensive evaluations on 10 IBM-Q quantum devices using the VQE example show that the distributive VQA training framework can substantially boost the training speed by 10.5x on average (up to 86x and at least 5.2x) with improved training accuracy.

Stein, Samuel A.↗

Space-based quantum networks are an essential component of future architecture for distributed quantum computers and quantum-enhanced secure communication

Space-based quantum links show great promise for connecting and communicating between quantum computers over ultra-long distances without the high loss incurred through fiber. A successful US quantum satellite would require large investment, national priority, and a diverse set of expertise. But, it would deliver US-owned quantum links that would allow for quantum-enhanced secure communications and the ability to connect quantum computers over long distances.

97 MATHEMATICS AND COMPUTING↗

Reliable Devices Yield Stable Quantum Computations

Stable quantum computation requires noisy results to remain bounded even in the presence of noise fluctuations. Yet non-stationary noise processes lead to drift in the varying characteristics of a quantum device that can greatly influence the circuit outcomes. Here we address how temporal and spatial variations in noise relate device reliability to quantum computing stability. First, our approach quantifies the differences in statistical distributions of characterization metrics collected at different times and locations using Hellinger distance. We then validate an analytical bound that relates this distance directly to the stability of a computed expectation value. Our demonstration uses numerical simulations with models informed by the washington superconducting transmon device. We find that the stability metric is consistently bounded from above by the corresponding Hellinger distance, which can be cast as a specified tolerance level. These results underscore the significance of reliable quantum computing devices and the impact for stable quantum computation.

Dasgupta, Samudra↗

Noise analysis for the Sorkin and Peres tests performed on a quantum computer

We use quantum computers to test the foundations of quantum mechanics through quantum algorithms that implement some of the experimental tests as the basis of the theory's postulates. These algorithms can be used as a test of the physical theory under the premise of a perfect hardware or as a test of the hardware under the premise that quantum theory is correct. In this paper, we show how the algorithms can be used to test the efficacy of a quantum computer in obeying the postulates of quantum mechanics. We study the effect of different types of errors on the results of experimental tests of the postulates. A salient feature of this error analysis is that it is deeply rooted in the fundamentals of quantum mechanics as it highlights how systematic errors affect the quantumness of the quantum computer.

Sadana, Simanraj↗

Efficiently embedding QUBO problems on adiabatic quantum computers

Adiabatic quantum computers like the D-Wave 2000Q can approximately solve the QUBO problem, which is an NP-hard problem, and have been shown to outperform classical computers on several instances. Solving the QUBO problem literally means solving virtually any NP-hard problem like the traveling salesman problem, airline scheduling problem, protein folding problem, genotype imputation problem, thereby enabling significant scientific progress, and potentially saving millions/billions of dollars in logistics, airlines, healthcare and many other industries. Yet, before QUBO problems are solved on quantum computers, they must be embedded (or compiled) onto the hardware of quantum computers, which in itself is a very hard problem. Here, we propose an efficient embedding algorithm, that lets us embed QUBO problems fast, uses less qubits and gets the objective function value close to the global minimum value. We then compare the performance of our embedding algorithm to that of D-Wave’s embedding algorithm, which is the current state of the art, and show that our embedding algorithm convincingly outperforms D-Wave’s embedding algorithm. Our embedding approach works with perfect Chimera graphs, i.e., Chimera graphs with no missing qubits.

97 MATHEMATICS AND COMPUTING↗