Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum, Quantum Algorithms”

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 361 records · Page 20

Quantum-Accelerated Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

We present two algorithms in the Quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability; One for producing an approximately optimal Steiner Tree, and one for producing an exact Minimum Directed Spanning tree. These use O(n1/4) rounds of communication and O(n9/4) messages, leading to a quantum speedup in round and message complexity compared to any known algorithms in the classical CONGEST-CLIQUE model (vs O(n1/3) and O(n7/3)). At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. Further, these problems can not be sped up in the CONGEST (non-clique) setting, and we characterize the constants involved.

Phillip Kerger↗

Quantum simulation of real-space dynamics

Quantum simulation is a prominent application of quantum computers. While there is extensive previous work on simulating finite-dimensional systems, less is known about quantum algorithms for real-space dynamics. We conduct a systematic study of such algorithms. In particular, we show that the dynamics of a d-dimensional Schrödinger equation with η particles can be simulated with gate complexity O ~ (ηdFpoly(log(g'/ϵ))), where ϵ is the discretization error, g' controls the higher-order derivatives of the wave function, and F measures the time-integrated strength of the potential. Compared to the best previous results, this exponentially improves the dependence on ϵ and g' from poly(g'/ϵ) to poly(log(g'/ϵ)) and polynomially improves the dependence on T and d, while maintaining best known performance with respect to η. For the case of Coulomb interactions, we give an algorithm using η 3 (d + η)Tpoly(log(ηdTg'/(Δϵ)))/Δ one- and two-qubit gates, and another using η 3 (4d) d/2 Tpoly(log(ηdTg'/(Δϵ)))/Δ one- and two-qubit gates and QRAM operations, where T is the evolution time and the parameter Δ regulates the unbounded Coulomb interaction. We give applications to several computational problems, including faster real-space simulation of quantum chemistry, rigorous analysis of discretization error for simulation of a uniform electron gas, and a quadratic improvement to a quantum algorithm for escaping saddle points in nonconvex optimization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Lyapunov controlled counterdiabatic quantum optimization

We introduce a quantum algorithm that integrates counterdiabatic (CD) protocols with quantum Lyapunov control (QLC) to address combinatorial optimization problems. This approach offers versatility, allowing implementation as either a digital-analog or purely digital algorithm based on selected control strategies. By examining spin-glass Hamiltonians, we illustrate how the algorithm can explore alternative paths to enhance solution outcomes compared to conventional CD techniques. This method reduces dependence on extensive higher-order CD terms and on classical optimization techniques, making it more suitable for existing quantum computing platforms. The combination of digital compression via CD protocols and the adaptable nature of QLC methods positions this approach as a promising candidate for near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Computing and Visualization: A Disruptive Technological Change Ahead

The focus of this Visualization Viewpoints article is to provide some background on quantum computing (QC), to explore ideas related to how visualization helps in understanding QC, and examine how QC might be useful for visualization with the growth and maturation of both technologies in the future. In a quickly evolving technology landscape, QC is emerging as a promising pathway to overcome the growth limits in classical computing. In some cases, QC platforms offer the potential to vastly outperform the familiar classical computer by solving problems more quickly or that may be intractable on any known classical platform. As further performance gains for classical computing platforms are limited by diminishing Moore’s Law scaling, QC platforms might be viewed as a potential successor to the current field of exascale-class platforms. Importantly, while present-day QC hardware platforms are still limited in scale, the field of quantum computing is robust and rapidly advancing in terms of hardware capabilities, software environments for developing quantum algorithms, and educational programs for training the next generation of scientists and engineers. After a brief introduction to QC concepts, the focus of this article is to explore the interplay between the fields of visualization and QC. First, visualization has played a role in QC by providing the means to show representations of the quantum state of single-qubits in superposition states and multiple-qubits in entangled states. Second, there are a number of ways in which the field of visual data exploration and analysis may potentially benefit from this disruptive new technology though there are challenges going forward.

97 MATHEMATICS AND COMPUTING↗

Coreset Clustering on Small Quantum Computers

Many quantum algorithms for machine learning require access to classical data in superposition. However, for many natural data sets and algorithms, the overhead required to load the data set in superposition can erase any potential quantum speedup over classical algorithms. Recent work by Harrow introduces a new paradigm in hybrid quantum-classical computing to address this issue, relying on coresets to minimize the data loading overhead of quantum algorithms. We investigated using this paradigm to perform k-means clustering on near-term quantum computers, by casting it as a QAOA optimization instance over a small coreset. We used numerical simulations to compare the performance of this approach to classical k-means clustering. We were able to find data sets with which coresets work well relative to random sampling and where QAOA could potentially outperform standard k-means on a coreset. However, finding data sets where both coresets and QAOA work well—which is necessary for a quantum advantage over k-means on the entire data set—appears to be challenging.

42 ENGINEERING↗

Single-particle digitization strategy for quantum computation of a Φ 4 scalar field theory

Motivated by the parton picture of high-energy quantum chromodynamics, we develop a single-particle digitization strategy for the efficient quantum simulation of relativistic scattering processes in a d + 1-dimensional scalar Φ 4 field theory. Here, we work out quantum algorithms for initial state preparation, time evolution, and final state measurements. We outline a nonperturbative renormalization strategy in this single-particle framework.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Ancilla-free continuous-variable SWAP test

We propose a continuous-variable (CV) SWAP test that requires no ancilla register, thereby generalizing the ancilla-free SWAP test for qubits. In this ancilla-free CV SWAP test, the computational basis measurement is replaced by photon number-resolving measurement, and we calculate an upper bound on the error of the overlap estimate obtained from a finite Fock cutoff in the detector. As an example, we show that estimation of the overlap of pure, centered, single-mode Gaussian states of energy E and squeezed in opposite quadratures can be obtained to error ϵ using photon statistics below a Fock basis cutoff O(Elnϵ –1 ). This cutoff is greatly reduced to E + O(√ Elnϵ –1 ) when the states have rapidly decaying Fock tails, such as coherent states. We show how the ancilla-free CV SWAP test can be extended to many modes and applied to quantum algorithms such as variational compiling and entanglement spectroscopy in the CV setting. For the latter we also provide a new algorithm which does not have an analog in qubit systems. The ancilla-free CV SWAP test is implemented on Xanadu's 8-mode photonic processor in order to estimate the vacuum probability of a two-mode squeezed state.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cloning of a quantum measurement

We analyze quantum algorithms for cloning of a quantum measurement. Our aim is to mimic two uses of a device performing an unknown von Neumann measurement with a single use of the device. When the unknown device has to be used before the bipartite state to be measured is available we talk about 1{yields}2 learning of the measurement, otherwise the task is called 1{yields}2 cloning of a measurement. We perform the optimization for both learning and cloning for arbitrary dimension d of the Hilbert space. For 1{yields}2 cloning we also propose a simple quantum network that achieves the optimal fidelity. The optimal fidelity for 1{yields}2 learning just slightly outperforms the estimate and prepare strategy in which one first estimates the unknown measurement and depending on the result suitably prepares the duplicate.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Three Birds with One Stone: Improving Performance, Convergence, and System Throughput with NEST

Variational quantum algorithms (VQAs) have the potential to demonstrate quantum utility on near-term quantum computers. However, these algorithms often get executed on the highest-fidelity qubits and computers to achieve the best performance, causing low system throughput. Recent efforts have shown that VQAs can be run on low-fidelity qubits initially and high-fidelity qubits later on to still achieve good performance. We take this effort forward and show that carefully varying the qubit fidelity map of the VQA over its execution using our technique, Nest, does not just (1) improve performance (i.e., help achieve close to optimal results), but also (2) lead to faster convergence. We also use Nest to co-locate multiple VQAs concurrently on the same computer, thus (3) increasing the system throughput, and therefore, balancing and optimizing three conflicting metrics simultaneously.

qaoa↗

Filtering states with total spin on a quantum computer

Starting from a general wave-function described on a set of spins or qubits, we propose several quantum algorithms to extract the components of this state on eigenstates of total spin S 2 and its z component S z . The method plays the role of total spin projection and gives access to the amplitudes of the initial state on a total spin basis. Here, the different algorithms have various degrees of sophistication depending on the requested tasks. They can either solely project onto the subspace with good total spin or completely uplift the degeneracy in this subspace. In the former case, when the projection on the total spin j is made, we show that the number of operations for the projection can be reduced from a quadratic to a linear dependence in j. After each measurement, the state collapses to one of the spin eigenstates that could be used for postprocessing. For this reason, we call the method total quantum spin filtering.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Delayed Update Algorithms for Quantum Monte Carlo Simulation on GPU: Extended Abstract

QMCPACK is open source scientific software designed to perform Quantum Monte Carlo (QMC) simulation, a first-principles method for describing many-body systems. The evaluation of each Monte Carlo move requires finding the determinant of a dense matrix in the wave functions. This calculation forms a key computational kernel in QMCPACK. After each accepted event, the wave function matrix undergoes a rank-one update to represent a single particle move within the system. The matrix inverse is updated via the Sherman-Morrison formula; occasionally, the explicit inverse must be recomputed to maintain numerical stability.; We propose an alternate approach to this kernel that utilizes QR factorization to maintain stability without refactorization. In addition, algorithms based on a novel delayed update scheme are explored in this effort. This strategy enables probability evaluation for multiple successive Monte Carlo moves, with application of accepted moves to the wave function matrix delayed until an event is denied, or a predetermined limit on acceptances p is reached. Accepted events grouped in this manner are then applied to the matrix en bloc with enhanced arithmetic intensity and computational efficiency. Delayed update Sherman-Morrison probability evaluation algorithms with CPU and GPU-accelerated implementations are tested, profiled, and analyzed. A QR based delayed update algorithm remains in development. Results are evaluated against existing methods for numerical stability and efficiency; emphasis is placed on large systems, for which acceleration is critical.

Computer Science↗

Key Questions for the Quantum Machine Learner to Ask Themselves

Within the last several years quantum machine learning (QML) has begun to mature; however, many open questions remain. Rather than review open questions, in this perspective piece I will discuss my view about how we should approach problems in QML. In particular I will list a series of questions that I think we should ask ourselves when developing quantum algorithms for machine learning. These questions focus on what the definition of quantum ML is, what is the proper quantum analogue of QML algorithms is, how one should compare QML to traditional ML and what fundamental limitations emerge when trying to build QML protocols. As an illustration of this process I also provide information theoretic arguments that show that amplitude encoding can require exponentially more queries to a quantum model to determine membership of a vector in a concept class than classical bit-encodings would require; however, if the correct analogue is chosen then both the quantum and classical complexities become polynomially equivalent. This example underscores the importance of asking ourselves the right questions when developing and benchmarking QML algorithms.

Wiebe, Nathan O.↗

Thermo Field Dynamics on a Quantum Computer

In this project we develop a quantum algorithm to realize finite temperature simulation on a quantum computer. As quantum computers use real-time evolution we did not use the imaginary time methods popular on classical algorithms. Instead, we implemented a real-time therom field dynamics formalism, which has the added benefit of being able to compute quantities that are both time-and temperature-dependent. To implement thermo field dynamics we apply a unitary transformation [1] to discrete quantum mechanical operators to make new Hamiltoni-ans with encoded temperature dependence. The method works normally for fermions, which have a finite representation, but needs some modification to work with bosons. These Hamilto-nians are then processed into a Pauli matrix representation in order to be used as input for IBM's Qiskit package [2]. We then use IBM's quantum simulator to calculate an approximation to the Hamiltonaian's ground state energy via the variational quantum eigensolver (VQE) algorithm [3]. This approximation is then compared to a classically calculated value for the exact energy. The thermo field dynamics quantum algorithm has general applications to material science, high-energy physics and nuclear physics, particularly in those situations involving realtime evolution at high temperature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Error statistics and scalability of quantum error mitigation formulas

Quantum computing promises advantages over classical computing in many problems. Nevertheless, noise in quantum devices prevents most quantum algorithms from achieving the quantum advantage. Quantum error mitigation provides a variety of protocols to handle such noise using minimal qubit resources. While some of those protocols have been implemented in experiments for a few qubits, it remains unclear whether error mitigation will be effective in quantum circuits with tens to hundreds of qubits. In this paper, we apply statistics principles to quantum error mitigation and analyse the scaling behaviour of its intrinsic error. We find that the error increases linearly O(ϵN) with the gate number N before mitigation and sublinearly O(ϵ'N γ ) after mitigation, where γ ≈ 0.5, ϵ is the error rate of a quantum gate, and ϵ' is a protocol-dependent factor. The $\sqrt{N}$ scaling is a consequence of the law of large numbers, and it indicates that error mitigation can suppress the error by a larger factor in larger circuits. We propose the importance Clifford sampling as a key technique for error mitigation in large circuits to obtain this result.

97 MATHEMATICS AND COMPUTING↗