Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 1,621 records · Page 90
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Entropy of the Quantum–Classical Interface: A Potential Metric for Security

Hybrid quantum–classical systems are emerging as key platforms in quantum computing, sensing, and communication technologies, but the quantum–classical interface (QCI)—the boundary enabling these systems—introduces unique and largely unexplored security vulnerabilities. This position paper proposes using entropy-based metrics to monitor and enhance security, specifically at the QCI. We present a theoretical security outline that leverages well-established information-theoretic entropy measures, such as Shannon entropy, von Neumann entropy, and quantum relative entropy, to detect anomalous behaviors and potential breaches at the QCI. By linking entropy fluctuations to scenarios of practical relevance—including quantum key distribution, quantum sensing, and hybrid control systems—we promote the potential value and applicability of entropy-based security monitoring. While explicitly acknowledging practical limitations and theoretical assumptions, we argue that entropy-based metrics provide a complementary approach to existing security methods, inviting further empirical studies and theoretical refinements that can strengthen future quantum technologies.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Challenging excited states from adaptive quantum eigensolvers: subspace expansions vs. state-averaged strategies

The prediction of electronic structure for strongly correlated molecules represents a promising application for near-term quantum computers. Significant attention has been paid to ground state wavefunctions, but excited states of molecules are relatively unexplored. In this work, we consider the adaptive, problem-tailored (ADAPT)-variational quantum eigensolver (VQE) algorithm, a single-reference approach for obtaining ground states, and its state-averaged generalization for computing multiple states at once. We demonstrate for both rectangular and linear H4, as well as for BeH2, that this approach, which we call multistate-objective, Ritz-eigenspectral (MORE)-ADAPT-VQE, can make better use of small excitation manifolds than an analogous method based on a single-reference ADAPT-VQE calculation, q-sc-EOM. In particular, MORE-ADAPT-VQE is able to accurately describe both avoided crossings and crossings between states of different symmetries. In addition to more accurate excited state energies, MORE-ADAPT-VQE can recover accurate transition dipole moments in situations where traditional ADAPT-VQE and q-sc-EOM struggle. These improvements suggest a promising direction toward the use of quantum computers for difficult excited state problems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Multilevel Combinatorial Optimization across Quantum Architectures

Emerging quantum processors provide an opportunity to explore new approaches for solving traditional problems in the post Moore’s law supercomputing era. However, the limited number of qubits makes it infeasible to tackle massive real-world datasets directly in the near future, leading to new challenges in utilizing these quantum processors for practical purposes. Furthermore, hybrid quantum-classical algorithms that leverage both quantum and classical types of devices are considered as one of the main strategies to apply quantum computing to large-scale problems. In this article, we advocate the use of multilevel frameworks for combinatorial optimization as a promising general paradigm for designing hybrid quantum-classical algorithms. To demonstrate this approach, we apply this method to two well-known combinatorial optimization problems, namely, the Graph Partitioning Problem, and the Community Detection Problem. We develop hybrid multilevel solvers with quantum local search on D-Wave’s quantum annealer and IBM’s gate-model based quantum processor. We carry out experiments on graphs that are orders of magnitude larger than the current quantum hardware size, and we observe results comparable to state-of-the-art solvers in terms of quality of the solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Weak-antilocalization and surface dominated transport in topological insulator Bi{sub 2}Se{sub 2}Te

We explore the phase coherence of thin films of the topological insulator material Bi{sub 2}Se{sub 2}Te grown through pulsed laser deposition (PLD) technique. The films were characterised using various techniques for phase and composition. The films were found to be of good quality. We carried out extensive magneto-transport studies of these films and found that they exhibit two dimensional weak antilocalization behaviour. A careful analysis revealed a relatively high phase coherence length (58nm at 1.78K) for a PLD grown film. Since PLD is an inexpensive technique, with the possibility to integrate with other materials, one can make devices which can be extremely useful for low power spintronics and topological quantum computation.

36 MATERIALS SCIENCE↗
DOE OSTI2011

Duplex quantum communication through a spin chain

Data multiplexing within a quantum computer can allow for the simultaneous transfer of multiple streams of information over a shared medium thereby minimizing the number of channels needed for requisite data transmission. Here, we investigate a two-way quantum communication protocol using a spin chain placed in an external magnetic field. In our scheme, Alice and Bob each play the role of a sender and a receiver as two states, cos(({theta}{sub 1}/2))0+sin(({theta}{sub 1}/2))e{sup i{phi}{sub 1}}1 and cos(({theta}{sub 2}/2))0+sin(({theta}{sub 2}/2))e{sup i{phi}{sub 2}}1, are transferred through one channel simultaneously. We find that the transmission fidelity at each end of a spin chain can usually be enhanced by the presence of a second party. This is an important result for establishing the viability of duplex quantum communication through spin chain networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Seven open problems in applied combinatorics

We present and discuss seven different open problems in applied combinatorics. Additionally, the application areas relevant to this compilation include quantum computing, algorithmic differentiation, topological data analysis, iterative methods, hypergraph cut algorithms, and power systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Parafermions, induced edge states, and domain walls in fractional quantum Hall effect spin transitions

Search for parafermions and Fibonacci anyons, which are excitations obeying non-Abelian statistics, is driven both by the quest for deeper understanding of nature and prospects for universal topological quantum computation. However, physical systems that can host these exotic excitations are rare and hard to realize in experiments. Here we study the domain walls and the edge states formed in spin transitions in the fractional quantum Hall effect. Effective theory approach and exact diagonalization in a disk and torus geometries proves the existence of the counterpropagating edge modes with opposite spin polarizations at the boundary between the two neighboring regions of the two-dimensional electron liquid in spin-polarized and spin-unpolarized phases. By analytical and numerical analysis, we argue that these systems can host parafermions when coupled to an 𝑠-wave superconductor and are experimentally feasible. We investigate settings based on 𝜈 = 2/3, 4/3, and 5/3 spin transitions and analyze spin-flipping interactions that hybridize counterpropagating modes. Lastly, we discuss spin-orbit interactions of composite fermions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem

Simon’s problem is to find a hidden period (a bitstring) encoded into an unknown 2-to-1 function. It is one of the earliest problems for which an exponential quantum speedup was proven for ideal, noiseless quantum computers, albeit in the oracle model. Here, using two different 127-qubit IBM Quantum superconducting processors, we demonstrate an algorithmic quantum speedup for a variant of Simon’s problem where the hidden period has a restricted Hamming weight 𝑤. For sufficiently small values of 𝑤 and for circuits involving up to 58 qubits, we demonstrate an exponential speedup, albeit of a lower quality than the speedup predicted for the noiseless algorithm. The speedup exponent and the range of 𝑤 values for which an exponential speedup exists are significantly enhanced when the computation is protected by dynamical decoupling. Further enhancement is achieved with measurement error mitigation. This case constitutes a demonstration of a bona fide quantum advantage for an Abelian hidden subgroup problem.

computation↗
DOE OSTI2025

LuGo: An enhanced quantum phase estimation implementation

Quantum Phase Estimation (QPE) is a cardinal algorithm in quantum computing that plays a crucial role in various applications, including cryptography, molecular simulation, and solving systems of linear equations. However, the standard implementation of QPE faces challenges related to time complexity and circuit depth, which limit its practicality for large-scale computations. We introduce LuGo, a novel framework designed to enhance the performance of QPE by reducing circuit duplication, as well as using parallelization techniques to achieve faster generation of the QPE circuit and gate reduction. We validate the effectiveness of our framework by generating quantum linear solver circuits, which require both QPE and inverse QPE, to solve linear systems of equations. LuGo achieves significant improvements in both computational efficiency and hardware requirements without compromising on accuracy. Compared to a standard QPE implementation, LuGo reduces time consumption to generate a circuit that solves a 2 6 × 2 6 system matrix by a factor of 50.68 and over 31× reduction of quantum gates and circuit depth, with no fidelity loss on an ideal quantum simulator. Furthermore, we demonstrated the versatility and scalability of LuGo enabled HHL algorithm by simulating a canonical Hele-Shaw fluid problem using a quantum simulator. With these advantages, LuGo paves the way for more efficient implementations of QPE, enabling broader applications across several quantum computing domains.

Quantum algorithm↗
DOE OSTI2022

A general quantum algorithm for open quantum dynamics demonstrated with the Fenna-Matthews-Olson complex

Using quantum algorithms to simulate complex physical processes and correlations in quantum matter has been a major direction of quantum computing research, towards the promise of a quantum advantage over classical approaches. In this work we develop a generalized quantum algorithm to simulate any dynamical process represented by either the operator sum representation or the Lindblad master equation. We then demonstrate the quantum algorithm by simulating the dynamics of the Fenna-Matthews-Olson (FMO) complex on the IBM QASM quantum simulator. This work represents a first demonstration of a quantum algorithm for open quantum dynamics with a moderately sophisticated dynamical process involving a realistic biological structure. We discuss the complexity of the quantum algorithm relative to the classical method for the same purpose, presenting a decisive query complexity advantage of the quantum approach based on the unique property of quantum measurement.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Electromagnetically induced transparency and fluorescence in blockaded Rydberg atomic system

We investigate the interaction between dark states and Rydberg excitation blockade by using electromagnetically induced transparency (EIT), fluorescence, and four-wave mixing (FWM) signals both theoretically and experimentally. By scanning the frequency detunings of the probe and dressing fields, respectively, we first observe these signals (three coexisting EIT windows, two fluorescence signals, and two FWM signals) under Rydberg excitation blockade. Next, frequency detuning dependences of these signals are obtained, in which the modulated results are well explained by introducing the dressing effects (leading to the dark states) with the corrected factor of the Rydberg excitation blockade. In addition, the variations by changing the principal quantum number n of Rydberg state shown some interesting phenomena resulting from Rydberg blockade are observed. The unique nature of such blockaded signals can have potential application in the demonstration of quantum computing.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

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↗
DOE OSTI2021

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↗
DOE OSTI2026

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↗
DOE OSTI2014

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↗
DOE OSTI2015

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↗
DOE OSTI2016

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↗