Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum walks”

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.

16 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Efficient sparse state preparation via quantum walks

Continuous-time quantum walks (CTQWs) on dynamic graphs, referred to as dynamic CTQWs, are a recently introduced universal model of computation that offers a new paradigm in which to envision quantum algorithms. In this work, we develop an algorithm that converts single-edge and self-loop dynamic CTQWs to the gate model of computation. We use this mapping to introduce an efficient sparse quantum state preparation framework based on dynamic CTQWs. Our approach utilizes combinatorics techniques such as minimal hitting sets, minimum spanning trees, and shortest Hamiltonian paths to reduce the number of controlled gates required to prepare sparse states. We show that our framework encompasses the current state of the art ancilla-free sparse state preparation method by reformulating this method as a CTQW. This CTQW-based framework offers an alternative to the uniformly controlled rotation method used by Qiskit by requiring fewer CX gates when the target state has a polynomial number of non-zero amplitudes.

dynamic continuous time quantum walks↗
DOE OSTI2024

Preparing angular momentum eigenstates using engineered quantum walks

Coupled angular-momentum eigenstates are widely used in atomic and nuclear physics calculations and are building blocks for spin networks and the Schur transform. To combine two angular momenta J 1 and J 2 , forming eigenstates of their total angular momentum J=J 1 +J 2 , we develop a quantum-walk scheme that does not require inputting O(j 3 ) nonzero Clebsch–Gordan (CG) coefficients classically. In fact, our scheme may be regarded as a unitary method for computing CG coefficients on quantum computers with a typical complexity of O⁡(j) and a worst-case complexity of O⁡(j 3 ). Equivalently, our scheme provides decompositions of the dense CG unitary into sparser unitary operations. Our scheme prepares angular-momentum eigenstates using a sequence of Hamiltonians to move an initial state deterministically to desired final states, which are usually highly entangled states in the computational basis. In contrast with usual quantum walks, whose Hamiltonians are prescribed, we engineer the Hamiltonians in su⁡(2)×su⁡(2), which are inspired by, but different from, Hamiltonians that govern magnetic resonances and dipole interactions. To achieve a deterministic preparation of both ket and bra states, we use projection and destructive interference to double pinch the quantum walks, such that each step is a unit-probability population transfer within a two-level system. We test our state preparation scheme on classical computers, reproducing tables of CG coefficients. Finally, we also implement small test problems on current quantum hardware.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Quantum Random Walk Simulator Using Ultrafast Optical Switches

Quantum random walk processes have many intriguing applications in high energy physics including the simulation of parton shower evolution. We will present the design and initial results of a fiber loop time-bin quantum walk architecture using the hardware platform already in operation at the Fermilab Quantum Network in which the state of the photon is defined by its time-of-arrival. The fiber loop consists of an unbalanced Mach-Zehnder interferometer implemented using an ultrafast electro-optical switch. The input switch controls the photon path within the interferometer, while the output switch will direct the photon back into the interferometer or to single photon detectors to measure the probability distribution of arrival times. Depending on which path the photon takes each pass through the loop, its wave function will interfere on these optical switches similar to quantum interference on a beam splitter. This work is an important step towards utilizing real-world advantages of quantum information protocols to solve problems in high energy physics.

Cameron, Andrew [Fermilab]↗
DOE OSTI2025

Systematic input scheme for many-boson Hamiltonians with applications to the two-dimensional 𝜙 4 theory

We develop a novel, systematic input scheme for many-boson Hamiltonians in order to solve field theory problems within the light-front Hamiltonian formalism via quantum computing. We present our discussion of this input scheme based on the light-front Hamiltonian of the two-dimensional ϕ 4 theory. In our input scheme, we employ a set of quantum registers, where each register encodes the occupation of a distinct boson mode as binaries. We squeeze the boson operators of each mode and present the Hamiltonian in terms of unique combinations of the squeezed-boson operators. We design the circuit modules for these unique combinations. Based on these circuit modules, we block encode the many-boson Hamiltonian utilizing the idea of quantum walk. For demonstration purposes, we present the spectral calculations of the Hamiltonian utilizing the hybrid quantum-classical symmetry-adapted quantum Krylov subspace diagonalization algorithm based on our input scheme, where the quantum computations are performed with the IBM Qiskit quantum simulator. The results of the hybrid calculations agree with exact results. Here, we can incorporate the input scheme in this work with the input scheme for many-fermion Hamiltonians; they jointly offer new pathways to solving the structure and dynamics of more general field theory problems on future fault-tolerant quantum computers.

Ab initio calculations↗
DOE OSTI2025

Feynman path integrals for discrete-variable systems: Walks on Hamiltonian graphs

We propose a natural, parameter-free, discrete-variable formulation of Feynman path integrals. We show that for discrete-variable quantum systems, Feynman path integrals take the form of walks on the graph whose weighted adjacency matrix is the Hamiltonian. By working out expressions for the partition function and transition amplitudes of discretized versions of continuous-variable quantum systems, and then taking the continuum limit, we explicitly recover Feynman's continuous-variable path integrals. We also discuss the implications of our result.

Feynman diagrams↗
DOE OSTI2025

Staircases of passive and active scalar concentration in cellular flow

This paper develops a unified model for staircase formation in both passive and active scalar systems, building upon prior numerical studies by offering new heuristic and physical insights. While prior studies primarily reported numerical results, they did not explore the underlying unifying physics that governs both types of scalar transport; this work addresses that gap by identifying shared mechanisms across both cases. Results of studies of passive and active scalar staircase formation in cellular flows are presented. Staircase formation in cellular flows occurs due to the interplay of fast mixing within cells and slow transport across the inter-cell boundary. The cell boundary emerges as a de facto transport barrier. Special attention is focused on the effects of cellular fluctuations and noise upon staircase structure. A forced, fluctuating vortex array model is used to drive the underlying flow structure. Cellular Peclet number and staircase profile curvature are identified as figures-of-merit to quantify the resiliency of layering. These are related to simple, multi-scatterer scalar random walk models. Results for Peclet number and curvature scaling with flow excitation are presented. We also study staircases of magnetic potential evolving in two-dimensional magnetohydrodynamics as examples of layering of active scalar concentration. Formation of magnetic potential staircases is indeed observed. Flux expulsion inhibits the intercellular transport of magnetic potential and strengthens staircase barriers. Magnetic staircases can be supported against resistive decay by magnetic potential noise forcing. Implications for staircase formation in magnetic confinement experiments are discussed.

Control theory↗
DOE OSTI2026

Powers of magnetic graph matrix: Fourier spectrum, walk compression, and applications

Magnetic graphs, originally developed to model quantum systems under magnetic fields, have recently emerged as a powerful framework for analyzing complex directed networks. Existing research has primarily used the spectral properties of the magnetic graph matrix to study global and stationary network features. However, their capacity to model local, nonequilibrium behaviors, often described by matrix powers, remains largely unexplored. We present a combinatorial interpretation of the magnetic graph matrix powers through directed walk profiles—counts of graph walks indexed by the number of edge reversals. Crucially, we establish that walk profiles correspond to a Fourier transform of magnetic matrix powers. The connection allows exact reconstruction of walk profiles from magnetic matrix powers at multiple discrete potentials, and more importantly, an even smaller number of potentials often suffices for accurate approximate reconstruction in real networks. This shows the empirical compressibility of the information captured by the magnetic matrix. This fresh perspective suggests further applications; for example, we illustrate how powers of the magnetic matrix can identify frustrated directed cycles (e.g., feedforward loops) and can be effectively employed for link prediction by encoding local structural details in directed graphs.

complex networks↗
DOE OSTI2025

Certifying almost all quantum states with few single-qubit measurements

Certifying that an n -qubit state synthesized in the laboratory is close to a given target state is a fundamental task in quantum information science. However, existing rigorous protocols applicable to general target states have potentially prohibitive resource requirements in the form of either deep quantum circuits or exponentially many single-qubit measurements. Here we prove that almost all n -qubit target states, including those with exponential circuit complexity, can be certified from only O ( n 2 ) single-qubit measurements. Given access to the target state’s amplitudes, our protocol requires only O ( n 3 ) classical computation. This result is established by a technique that relates certification to the mixing time of a random walk. Our protocol has applications for benchmarking quantum systems, for optimizing quantum circuits to generate a desired target state and for learning and verifying neural networks, tensor networks and various other representations of quantum states using only single-qubit measurements. We show that such verified representations can be used to efficiently predict highly non-local properties of a synthesized state that would otherwise require an exponential number of measurements on the state. We demonstrate these applications in numerical experiments with up to 120 qubits and observe an advantage over existing methods such as cross-entropy benchmarking.

information theory and computation↗
DOE OSTI2025

Geometric Delocalization in Two Dimensions

We demonstrate the existence of transient two-dimensional surfaces where a random-walking particle escapes to infinity in contrast to localization in standard flat two-dimensional space. We first prove that any rotationally symmetric two-dimensional membrane embedded in flat three-dimensional space cannot be transient. Then we formulate a criterion for the transience of a general asymmetric two-dimensional membrane. We use it to explicitly construct a class of transient two-dimensional manifolds with a nontrivial metric and height function but “zero average curvature,” which we dub “tablecloth manifolds.” The absence of the logarithmic infrared divergence of the Laplace-Beltrami operator in turn implies the absence of weak localization, nonexistence of bound states in shallow potentials, and breakdown of the Mermin-Wagner theorem and Kosterlitz-Thouless transition on the tablecloth manifolds, which may be realizable in both quantum simulators and corrugated two-dimensional materials.

Anderson localization↗
DOE OSTI2026

Fokker-Planck Equation Governing the Distribution of Walkers in Auxiliary-Field Quantum Monte Carlo

Auxiliary-field quantum Monte Carlo (AFQMC) is typically formulated as an open-ended random walk in an overcomplete space of Slater determinants, implemented through a Langevin equation. However, the explicit form of the underlying Fokker-Planck equation governing the walker population distribution has remained unknown. Here, in this Letter, we derive the Fokker-Planck equation for AFQMC and propose a novel numerical scheme to solve it. The solution of the Fokker-Planck equation reveals the wave function actually sampled by the AFQMC algorithm. Interestingly, we find that even when the exact ground state is used as a guiding wave function in constrained path AFQMC, contrary to the common assumption, the wave function sampled by AFQMC is not exact. Beyond clarifying several fundamental aspects of AFQMC, the availability of a Fokker-Planck equation formulation opens new avenues for systematically improving its accuracy, which we outline in this Letter.

Monte Carlo methods↗
DOE OSTI2025

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Quantum-Inspired Bayesian Sampling for Uncertainty Quantification and Machine Learning (Final Technical Report)

With increasing simulation and measurement data, machine learning and artificial intelligence have been widely used in computational decision-making of complex engineering systems. The resulting tools, such as uncertainty quantification solvers, reinforcement learning, and physics-informed machine learning, have achieved great success in critical DOE tasks such as material discovery and design, energy system modeling and control, and numerical weather and climate prediction. A core topic in scientific machine learning and artificial intelligence is Bayesian inference: given an observed data set, people want to estimate the posterior distribution of a (possibly large) number of hidden parameters. Due to the flexibility and weak assumptions, Bayesian sampling has been the mainstream Bayesian inference solvers despite the rapid progress of approximate Bayesian inference. Classical Bayesian sampling methods such as Markov-chain Monte Carlo suffer from a low-acceptance rate due to the random walk nature, therefore state-of-the-art techniques use Hamiltonian Monte Carlo and its variants to efficiently draw posterior samples in a high dimension. The key idea of Hamiltonian Monte Carlo and its variants is to simulate the Hamiltonian dynamics of a classical particle with a fixed mass, and their performance significantly degrades when the posterior distribution is highly spiky or has multiple modes. Leveraging the idea of quantum physics, this project has investigated new theory, algorithms and applications of Bayesian inference (especially Bayesian sampling). The main results include: (1) novel quantum-inspired Bayesian sampling methods that can lead to better accuracy for challenging multi-modal or spiky distributions, (2) more scalable machine learning framework leveraging tensor-compressed Bayesian inference, and (3) Bayesian and sampling approaches for verifying the robustness of continuous and binary neural networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Optimizing temperature distributions for training neural quantum states using parallel tempering

Parametrized artificial neural networks (ANNs) can be very expressive ansatzes for variational algorithms, reaching state-of-the-art energies on many quantum many-body Hamiltonians. Nevertheless, the training of the ANN can be slow and stymied by the presence of local minima in the parameter landscape. One approach to mitigate this issue is to use parallel tempering methods, and in this work, we focus on the role played by the temperature distribution of the parallel tempering replicas. Using an adaptive method that adjusts the temperatures in order to equate the exchange probability between neighboring replicas, we show that this temperature optimization can significantly increase the success rate of the variational algorithm with negligible computational cost by eliminating bottlenecks in the replicas' random walk. Furthermore, we demonstrate this using two different neural networks, a restricted Boltzmann machine and a feedforward network, which we use to study a toy problem based on a permutation invariant Hamiltonian with a pernicious local minimum and the 𝐽 1 −𝐽 2 model on a rectangular lattice.

Neural network simulations↗
NASA NTRS1973

High-quantum-efficiency infrared up-conversion.

Experimental study in which 100% conversion of infrared photons into visible photons was achieved through three wave interactions in a nonlinear medium. The first experimental evidence of overconversion is presented, and the classical theory of up-conversion in the high-conversion-efficiency region is confirmed. A laser pump light feedback technique is described that promises to make the process practical with modestly powerful pump lasers and less than perfect nonlinear crystals. The nonlinear medium used was a LiIO3 crystal that cannot be 90-deg phase-matched. The 'walk off' that resulted helped make possible the attainment of 100% conversion efficiency.

Gurski, T. R.↗
DOE OSTI2025

Unraveling Adsorbate-Induced Structural Evolution of Iron Carbide Nanoparticles

Iron carbide (Fe x C y ) nanoparticles (NPs) are promising candidates for replacing platinum group metals in industrial applications, such as high-temperature Fischer–Tropsch synthesis. However, due to their amorphous nature, characterization of the active sites has been challenging experimentally and computationally. Here, using a combined density functional theory (DFT), neural network interatomic potential-assisted global optimization, and ensemble learning study, we evaluate dynamic surface changes associated with syngas (H and CO) interactions. For this purpose, we have developed a general procedure that we use to model an experimentally relevant 270-atom Fe 182 C 88 NP using the neural network-assisted stochastic surface walk global optimization algorithm (SSW-NN). Once generated, the Fe 182 C 88 NP active sites and particle morphology are thoroughly characterized before the effects of syngas adsorbate interactions are explored by using DFT and molecular dynamics simulations. Lastly, we explore correlations between geometric and electronic features of the active sites and the adsorption of H (H ads ), using a regularized random forest machine learning algorithm. In doing so, we identified the Fe–C coordination number and p orbital occupancy as the most important descriptors affecting H ads . Furthermore, using a combined ML and quantum chemistry approach, our work demonstrates a general and efficient procedure for generating and probing complex surface phenomena on binary nanoparticles.

Adsorption↗
DOE OSTI2026

Accelerating multicanonical sampling with irreversibility

Flat-histogram Monte Carlo simulations are well-established, robust methods to perform random walks in a physical observable or parameter space, making them suitable for finding ground states or studying phase transitions in complex systems in statistical physics. However, their efficiency can be limited by the time to attain the desired flat distribution, which is generally unknown prior to the simulations. In particular, they might suffer from slowing down towards the end of a simulation due to the diffusive nature of random walks. In this work we apply irreversibility to the multicanonical Monte Carlo method via the lifting approach to alleviate this behavior. We achieve a 2–4 times speedup in ground-state search for a two-dimensional (2D) Ising model, and up to an order of magnitude of speedup for finding the ground-state energy in an Edwards–Anderson spin glass, compared to traditional multicanonical sampling. In conclusion, the round-trip times between ground states show a narrower distribution and are significantly shorter compared to the reversible counterpart, suggesting that a lower convergence time with a smaller time variance is feasible.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗