Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum Computing”

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 1,711 records · Page 95

Adiabatic quantum support vector machines

Adiabatic quantum computers can solve difficult optimization problems (e.g., the quadratic unconstrained binary optimization problem), and they seem well suited to train machine learning models. In this paper, we describe an adiabatic quantum approach for training support vector machines. We show that the time complexity of our quantum approach is an order of magnitude better than the classical approach. Next, we compare the test accuracy of our quantum approach against a classical approach that uses the Scikit-learn library in Python across five benchmark datasets (Iris, Wisconsin Breast Cancer (WBC), Wine, Digits, and Lambeq). We show that our quantum approach obtains accuracies on par with the classical approach. Finally, we perform a scalability study in which we compute the total training times of the quantum approach and the classical approach with an increasing number of features and an increasing number of data points in the training dataset. In conclusion, our scalability results show that the quantum approach obtains a 3.5–4.5x speedup over the classical approach on datasets with many (millions of) features.

Computational Complexity↗

Authentication Protocol using Quantum Superposition States

When it became known that quantum computers could break the RSA (named for its creators - Rivest, Shamir, and Adleman) encryption algorithm within a polynomial-time, quantum cryptography began to be actively studied. Other classical cryptographic algorithms are only secure when malicious users do not have sufficient computational power to break security within a practical amount of time. Recently, many quantum authentication protocols sharing quantum entangled particles between communicators have been proposed, providing unconditional security. An issue caused by sharing quantum entangled particles is that it may not be simple to apply these protocols to authenticate a specific user in a group of many users. An authentication protocol using quantum superposition states instead of quantum entangled particles is proposed. The random number shared between a sender and a receiver can be used for classical encryption after the authentication has succeeded. The proposed protocol can be implemented with the current technologies we introduce in this paper.

97 MATHEMATICS AND COMPUTING↗

Quantum-classical hybrid algorithm for the simulation of all-electron correlation

While chemical systems containing hundreds to thousands of electrons remain beyond the reach of quantum devices, hybrid quantum-classical algorithms present a promising pathway toward a quantum advantage. Hybrid algorithms treat the exponentially scaling part of the calculation-the static correlation-on the quantum computer and the non-exponentially scaling part-the dynamic correlation-on the classical computer. While a variety of algorithms have been proposed, the dependence of many methods on the total wave function limits the development of easy-to-use classical post-processing implementations. Here, we present a novel combination of quantum and classical algorithms, which computes the all-electron energy of a strongly correlated molecular system on the classical computer from the 2-electron reduced density matrix (2-RDM) evaluated on the quantum device. Significantly, we circumvent the wave function in the all-electron calculations by using density matrix methods that only require input of the statically correlated 2-RDM. Although the algorithm is completely general, we test it with two classical density matrix methods, the anti-Hermitian contracted Schrödinger equation (ACSE) and multiconfiguration pair-density functional theories, using the recently developed quantum ACSE method for simulating the statically correlated 2-RDM. Furthermore, we obtain experimental accuracy for the relative energies of all three benzyne isomers and thereby demonstrate the ability of the developed algorithm to achieve chemically relevant and accurate results on noisy intermediate-scale quantum devices.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum Time-Space Tradeoffs for Matrix Problems

We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices 𝐴, including the discrete Fourier transform matrix, we prove that quantum circuits with at most 𝑇 input queries and 𝑆 qubits of memory require 𝑇 = Ω⁢(𝑛 2 /𝑆) to compute matrix-vector product 𝐴⁢𝑥 for 𝑥 ∈{0,1 𝑛 . We similarly prove that matrix multiplication for 𝑛 ×𝑛 binary matrices requires 𝑇 = Ω⁢(𝑛 3 /$\sqrt{𝑆}$). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for 𝑛 × 𝑛 Boolean matrix multiplication to 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/4 ) from 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/2 ). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.

lower bounds↗

Observation of squeezed states with strong photon-number oscillations

Squeezed states of light constitute an important nonclassical resource in the field of high-precision measurements, for example, gravitational wave detection, as well as in the field of quantum information, for example, for teleportation, quantum cryptography, and distribution of entanglement in quantum computation networks. Strong squeezing in combination with high purity, high bandwidth, and high spatial mode quality is desirable in order to achieve significantly improved performances contrasting any classical protocols. Here we report on the observation of 11.5 dB of squeezing, together with relatively high state purity corresponding to a vacuum contribution of less than 5%, and a squeezing bandwidth of about 170 MHz. The analysis of our squeezed states reveals a significant production of higher-order pairs of quantum-correlated photons and the existence of strong photon-number oscillations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

How to efficiently select an arbitrary Clifford group element

We give an algorithm which produces a unique element of the Clifford group on n qubits (C{sub n}) from an integer 0≤i<|C{sub n}| (the number of elements in the group). The algorithm involves O(n{sup 3}) operations and provides, in addition to a canonical mapping from the integers to group elements g, a factorization of g into a sequence of at most 4n symplectic transvections. The algorithm can be used to efficiently select random elements of C{sub n} which are often useful in quantum information theory and quantum computation. We also give an algorithm for the inverse map, indexing a group element in time O(n{sup 3})

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A silicon-nanowire memory driven by optical gradient force induced bistability

In this paper, a bistable optical-driven silicon-nanowire memory is demonstrated, which employs ring resonator to generate optical gradient force over a doubly clamped silicon-nanowire. Two stable deformation positions of a doubly clamped silicon-nanowire represent two memory states (“0” and “1”) and can be set/reset by modulating the light intensity (<3 mW) based on the optical force induced bistability. The time response of the optical-driven memory is less than 250 ns. It has applications in the fields of all optical communication, quantum computing, and optomechanical circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fractional charge and inter-Landau–level states at points of singular curvature

Significance Identifying universal topological properties of quantum phases of matter, namely, signatures robust to variations in system-specific details, can elucidate the essential physics of these exotic phases. Here we demonstrate that quantum Hall states behave universally at experimentally accessible singularly curved points on a lattice. At such points they bind an excess fractional charge, universally relatable to their curvatures, as well as bound states with energies at universal fractions of the inter-Landau–level energy gap. These bound states are both spatially as well as energetically isolated, and thus provide a promising new platform for creating qubits for quantum computation. Extensions of these ideas to other lattice topological phases will result in a new method of characterizing such phases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

4-wave mixing for phase-matching free nonlinear optics in quantum cascade structures : LDRD 08-0346 final report.

Optical nonlinearities and quantum coherences have the potential to enable efficient, high-temperature generation of coherent THz radiation. This LDRD proposal involves the exploration of the underlying physics using intersubband transitions in a quantum cascade structure. Success in the device physics aspect will give Sandia the state-of-the-art technology for high-temperature THz quantum cascade lasers. These lasers are useful for imaging and spectroscopy in medicine and national defense. Success may have other far-reaching consequences. Results from the in-depth study of coherences, dephasing and dynamics will eventually impact the fields of quantum computing, optical communication and cryptology, especially if we are successful in demonstrating entangled photons or slow light. An even farther reaching development is if we can show that the QC nanostructure, with its discrete atom-like intersubband resonances, can replace the atom in quantum optics experiments. Having such an 'artificial atom' will greatly improve flexibility and preciseness in experiments, thereby enhancing the discovery of new physics. This is because we will no longer be constrained by what natural can provide. Rather, one will be able to tailor transition energies and optical matrix elements to enhance the physics of interest. This report summarizes a 3-year LDRD program at Sandia National Laboratories exploring optical nonlinearities in intersubband devices. Experimental and theoretical investigations were made to develop a fundamental understanding of light-matter interaction in a semiconductor system and to explore how this understanding can be used to develop mid-IR to THz emitters and nonclassical light sources.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Spoofing Cross-Entropy Measure in Boson Sampling

Cross-entropy (XE) measure is a widely used benchmark to demonstrate quantum computational advantage from sampling problems, such as random circuit sampling using superconducting qubits and boson sampling (BS). We present a heuristic classical algorithm that attains a better XE than the current BS experiments in a verifiable regime and is likely to attain a better XE score than the near-future BS experiments in a reasonable running time. The key idea behind the algorithm is that there exist distributions that correlate with the ideal BS probability distribution and that can be efficiently computed. The correlation and the computability of the distribution enable us to postselect heavy outcomes of the ideal probability distribution without computing the ideal probability, which essentially leads to a large XE. Our method scores a better XE than the recent Gaussian BS experiments when implemented at intermediate, verifiable system sizes. Much like current state-of-the-art experiments, we cannot verify that our spoofer works for quantum-advantage-size systems. However, we demonstrate that our approach works for much larger system sizes in fermion sampling, where we can efficiently compute output probabilities. Finally, we provide analytic evidence that the classical algorithm is likely to spoof noisy BS efficiently.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Efficient Step-Merged Quantum Imaginary Time Evolution Algorithm for Quantum Chemistry

In this work, we develop a resource-efficient step-merged quantum imaginary time evolution approach (smQITE) to solve for the ground state of a Hamiltonian on quantum computers. This heuristic method features a fixed shallow quantum circuit depth along the state evolution path. We use this algorithm to determine the binding energy curves of a set of molecules, including H 2 , H 4 , H 6 , LiH, HF, H 2 O, and BeH 2 , and find highly accurate results. The required quantum resources of smQITE calculations can be further reduced by adopting the circuit form of the variational quantum eigensolver (VQE) technique, such as the unitary coupled cluster ansatz. We demonstrate that smQITE achieves a similar computational accuracy as VQE at the same fixed-circuit ansatz, without requiring a generally complicated high-dimensional nonconvex optimization. Finally, smQITE calculations are carried out on Rigetti quantum processing units, demonstrating that the approach is readily applicable on current noisy intermediate-scale quantum devices.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Photocrosslinking Probes Proximity of Thymine Modifiers Tethering Excitonically Coupled Dye Aggregates to DNA Holliday Junction

A DNA Holliday junction (HJ) has been used as a versatile scaffold to create a variety of covalently templated molecular dye aggregates exhibiting strong excitonic coupling. In these dye-DNA constructs, one way to attach dyes to DNA is to tether them via single long linkers to thymine modifiers incorporated in the core of the HJ. Here, using photoinduced [2 + 2] cycloaddition (photocrosslinking) between thymines, we investigated the relative positions of squaraine-labeled thymine modifiers in the core of the HJ, and whether the proximity of thymine modifiers correlated with the excitonic coupling strength in squaraine dimers. Photocrosslinking between squaraine-labeled thymine modifiers was carried out in two distinct types of configurations: adjacent dimer and transverse dimer. The outcomes of the reactions in terms of relative photocrosslinking yields were evaluated by denaturing polyacrylamide electrophoresis. We found that for photocrosslinking to occur at a high yield, a synergetic combination of three parameters was necessary: adjacent dimer configuration, strong attractive dye–dye interactions that led to excitonic coupling, and an A-T neighboring base pair. The insight into the proximity of dye-labeled thymines in adjacent and transverse configurations correlated with the strength of excitonic coupling in the corresponding dimers. To demonstrate a utility of photocrosslinking, we created a squaraine tetramer templated by a doubly crosslinked HJ with increased thermal stability. These findings provide guidance for the design of HJ-templated dye aggregates exhibiting strong excitonic coupling for exciton-based applications such as organic optoelectronics and quantum computing.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Structure prediction of epitaxial inorganic interfaces by lattice and surface matching with Ogre

We present a new version of the Ogre open source Python package with the capability to perform structure prediction of epitaxial inorganic interfaces by lattice and surface matching. In the lattice matching step, a scan over combinations of substrate and film Miller indices is performed to identify the domain-matched interfaces with the lowest mismatch. Subsequently, surface matching is conducted by Bayesian optimization to find the optimal interfacial distance and in-plane registry between the substrate and the film. For the objective function, a geometric score function is proposed based on the overlap and empty space between atomic spheres at the interface. The score function reproduces the results of density functional theory (DFT) at a fraction of the computational cost. The optimized interfaces are pre-ranked using a score function based on the similarity of the atomic environment at the interface to the bulk environment. Final ranking of the top candidate structures is performed with DFT. Ogre streamlines DFT calculations of interface energies and electronic properties by automating the construction of interface models. The application of Ogre is demonstrated for two interfaces of interest for quantum computing and spintronics, Al/InAs and Fe/InSb.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum simulation of bosons with the contracted quantum eigensolver

Abstract Quantum computers are promising tools for simulating many-body quantum systems due to their potential scaling advantage over classical computers. While significant effort has been expended on many-fermion systems, here we simulate a model entangled many-boson system with the contracted quantum eigensolver (CQE). We generalize the CQE to many-boson systems by encoding the bosonic wavefunction on qubits. The CQE provides a compact ansatz for the bosonic wave function whose gradient is proportional to the residual of a contracted Schrödinger equation. We apply the CQE to a bosonic system, where N quantum harmonic oscillators are coupled through a pairwise quadratic repulsion. The model is relevant to the study of coupled vibrations in molecular systems on quantum devices. Results demonstrate the potential efficiency of the CQE in simulating bosonic processes such as molecular vibrations with good accuracy and convergence even in the presence of noise.

Physics↗

Unitary transformations purely based on geometric phases of two spins with Ising interaction in a rotating magnetic field

We consider how to obtain a nontrivial two-qubit unitary transformation purely based on geometric phases of two spin-1/2 's with Ising-like interaction in a magnetic field with a static z-component and a rotating xy-component. This is an interesting problem both for the purpose of measuring the geometric phases and in quantum computing applications. In previous approach, coupling of one of the qubit with the rotating component of field is ignored. By considering the exact two-spin geometric phases, we find that a nontrivial two-spin unitary transformation purely based on Berry phases can be obtained by using two consecutive cycles with opposite directions of the magnetic field and opposite signs of the interaction constant. In the nonadiabatic case, starting with a certain initial state, a cycle in the projected space of rays and thus Aharonov-Anandan phase can be achieved. The two-cycle scheme cancels the total phases, hence any unknown initial state evolves back to itself without a phase factor.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Trigonometric continuous-variable gates and hybrid quantum simulations of the sine-Gordon model

Hybrid qubit-qumode quantum computing platforms provide a natural setting for simulating interacting bosonic quantum field theories. However, existing continuous-variable gate constructions rely predominantly on polynomial functions of canonical quadratures. In this work, we introduce a complementary universality paradigm based on trigonometric continuous-variable gates, which enable a Fourier-like representation of bosonic operators and are particularly well suited for periodic and non-perturbative interactions. We present an ancilla-based framework for implementing trigonometric gates with arguments given by arbitrary Hermitian functions of qumode quadratures. The protocol yields unitary gates deterministically, and non-unitary gates through probabilistic post-selection. As a concrete application, we develop a hybrid qubit-qumode quantum simulation of the lattice sine-Gordon model. Using these gates, we prepare ground states via quantum imaginary-time evolution, simulate real-time dynamics, compute time-dependent vertex two-point correlation functions, and extract quantum kink profiles under topological boundary conditions. Our results demonstrate that trigonometric continuous-variable gates provide a physically natural framework for simulating interacting field theories on near-term hybrid quantum hardware, while establishing a parallel route to universality beyond polynomial gate constructions. We expect that the trigonometric gates introduced here to find broader applications, including quantum simulations of condensed matter systems, quantum chemistry, and biological models.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Single ion as a shot-noise-limited magnetic-field-gradient probe

It is expected that ion-trap quantum computing can be made scalable through protocols that make use of transport of ion qubits between subregions within the ion trap. In this scenario, any magnetic field inhomogeneity the ion experiences during the transport may lead to dephasing and loss of fidelity. Here we demonstrate how to measure, and compensate for, magnetic field gradients inside a segmented ion trap, by transporting a single ion over variable distances. We attain a relative magnetic field sensitivity of {Delta}B/B{sub 0{approx}}5x10{sup -7} over a test distance of 140 {mu}m, which can be extended to the mm range, still with sub-{mu}m resolution. A fast experimental sequence is presented, facilitating its use as a magnetic-field-gradient calibration routine, and it is demonstrated that the main limitation is the quantum shot noise.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exponential of a matrix, a nonlinear problem, and quantum gates

We describe solutions of the matrix equation exp(z(A − I{sub n})) = A, where z ∈ ℂ. Applications in quantum computing are given. Both normal and non-normal matrices are studied. For normal matrices, the Lambert W-function plays a central role.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗