Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum work”

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 433 records · Page 24

The quantum entropy cone of hypergraphs

In this work, we generalize the graph-theoretic techniques used for the holographic entropy cone to study hypergraphs and their analogously-defined entropy cone. This allows us to develop a framework to efficiently compute entropies and prove inequalities satisfied by hypergraphs. In doing so, we discover a class of quantum entropy vectors which reach beyond those of holographic states and obey constraints intimately related to the ones obeyed by stabilizer states and linear ranks. We show that, at least up to 4 parties, the hypergraph cone is identical to the stabilizer entropy cone, thus demonstrating that the hypergraph framework is broadly applicable to the study of entanglement entropy. We conjecture that this equality continues to hold for higher party numbers and report on partial progress on this direction. To physically motivate this conjectured equivalence, we also propose a plausible method inspired by tensor networks to construct a quantum state from a given hypergraph such that their entropy vectors match.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SU(1,1) Echoes for Breathers in Quantum Gases

Though the celebrated spin echoes have been widely used to reverse quantum dynamics, they are not applicable to systems whose constituents are beyond the control of the su(2) algebra. In this work, we design echoes to reverse quantum dynamics of breathers in three-dimensional unitary fermions and two-dimensional bosons and fermions with contact interactions, which are governed by an underlying su(1, 1) algebra. Geometrically, SU(1, 1) echoes produce closed trajectories on a single or multiple Poincaré disks and thus could recover any initial states without changing the sign of the Hamiltonian. In particular, the initial shape of a breather determines the superposition of trajectories on multiple Poincaré disks and whether the revival time has period multiplication. Our work provides physicists with a recipe to tailor collective excitations of interacting many-body systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Superconducting microwave cavities and qubits for quantum information systems

Superconducting microwave cavities featuring ultrahigh Q-factors, which measure the efficiency of energy storage in relation to energy loss in a system, are revolutionizing quantum computing by providing long coherence times exceeding 1 ms, crucial for the development of scalable multi-qubit quantum systems with low error rates. Here, in this work, we provide an in-depth analysis of recent advances in ultrahigh Q-factor cavities, integration of Josephson junction-based qubits, and bosonic-encoded qubits in 3D cavities. We examine the sources of quantum state dephasing caused by damping and noise mechanisms in cavities and qubits, highlighting the critical challenges that need to be addressed to achieve even higher coherence times. We critically survey the latest progress made in implementing single 3D qubits using superconducting materials, normal metals, and multi-qubit and multi-state quantum systems. Our work sheds light on the promising future of this research area, including novel materials for cavities and qubits, modes with nontrivial topological properties, error correction techniques for bosonic qubits, and new light–matter interaction effects.

3D printing↗

Architecture for Quantum-in-the Loop Real-Time Simulations for Designing Resilient Smart Grids

With the power grid growing more complex every day with the inclusion of new sensors and regulatory approvals that enable end-users and small local developers to participate in the grid, it is becoming challenging for conventional smart grid simulation, emulation, and testing technologies to keep up. In this work, we propose that quantum-encoded real-time simulations can be helpful under the new paradigm and operational circumstances to solve optimization problems for power grids. By leveraging the principles of quantum mechanics, the proposed quantum-in-loop (QIL) framework will enable better and faster optimization solutions based on real-world, real-time data streams, facilitating the real-time planning and operations of electrical grids that rely on millions of distributed sensors and controllers. Furthermore, QIL will allow researchers and engineers to assist utilities in designing, developing, and de-risking algorithms to optimize power grid operation and resilience by considering inputs from millions of grid-connected devices. QIL framework is being developed to have a self-limiting triage mechanism, which will help engineers and practitioners identify fundamental physical limits on quantum processors, revealing what quantum algorithms can and cannot do in utility-specific use cases and must continue to count on classical high-performance computing infrastructure.

digital real-time simulation↗

Towards provably efficient quantum algorithms for large-scale machine-learning models

Large machine learning models are revolutionary technologies of artificial intelligence whose bottlenecks include huge computational expenses, power, and time used both in the pre-training and fine-tuning process. In this work, we show that fault-tolerant quantum computing could possibly provide provably efficient resolutions for generic (stochastic) gradient descent algorithms, scaling as $\mathcal{O}$(T 2 x polylog($n$)), where n is the size of the models and T is the number of iterations in the training, as long as the models are both sufficiently dissipative and sparse, with small learning rates. Based on earlier efficient quantum algorithms for dissipative differential equations, we find and prove that similar algorithms work for (stochastic) gradient descent, the primary algorithm for machine learning. In practice, we benchmark instances of large machine learning models from 7 million to 103 million parameters. We find that, in the context of sparse training, a quantum enhancement is possible at the early stage of learning after model pruning, motivating a sparse parameter download and re-upload scheme. Our work shows solidly that fault-tolerant quantum algorithms could potentially contribute to most state-of-the-art, large-scale machine-learning problems.

97 MATHEMATICS AND COMPUTING↗

Robust implementation of generative modeling with parametrized quantum circuits

Although the performance of hybrid quantum-classical algorithms is highly dependent on the selection of the classical optimizer and the circuit ansätze, a robust and thorough assessment on-hardware of such features has been missing to date. From the optimizer perspective, the primary challenge lies in the solver’s stochastic nature, and their significant variance over the random initialization. Therefore, a robust comparison requires one to perform several training curves for each solver before one can reach conclusions about their typical performance. Since each of the training curves requires the execution of thousands of quantum circuits in the quantum computer, such a robust study remained a steep challenge for most hybrid platforms available today. In this work, we leverage on Rigetti’s Quantum Cloud Services (QCS™) to overcome this implementation barrier, and we study the on-hardware performance of the data-driven quantum circuit learning (DDQCL) for three different state-of-the-art classical solvers, and on two-different circuit ansätze associated to different entangling connectivity graphs for the same task. Additionally, we assess the gains in performance from varying circuit depths. To evaluate the typical performance associated with each of these settings in this benchmark study, we use at least five independent runs of DDQCL towards the generation of quantum generative models capable of capturing the patterns of the canonical Bars and Stripes dataset. In this experimental benchmarking, the gradient-free optimization algorithms show an outstanding performance compared to the gradient-based solver. In particular, one of them had better performance when handling the unavoidable noisy objective function to be minimized under experimental conditions.

97 MATHEMATICS AND COMPUTING↗

Proximity-Induced Exchange Interaction: A New Pathway for Quantum Sensing Using Spin Centers in Hexagonal Boron Nitride

Defects in hexagonal boron nitride (hBN), a two-dimensional van der Waals material, have attracted a great deal of interest because of its potential in various quantum applications. Due to hBN’s two-dimensional nature, the spin center in hBN can be engineered in the proximity of the target material, providing advantages over its three-dimensional counterparts, such as the nitrogen-vacancy center in diamond. Here, in this work, we propose a novel quantum sensing protocol driven by exchange interaction between the spin center in hBN and the underlying magnetic substrate induced by the magnetic proximity effect. By first-principles calculation, we demonstrate that the induced exchange interaction dominates over the dipole–dipole interaction by orders of magnitude when in the proximity. The interaction remains antiferromagnetic across all stacking configurations between the spin center in hBN and the target van der Waals magnets. Additionally, we explored the scaling behavior of the exchange field as a function of the spatial separation between the spin center and the targets.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum Machine Learning Applications in High-Energy Physics

Some of the most significant achievements of the modern era of particle physics, such as the discovery of the Higgs boson, have been made possible by the tremendous effort in building and operating large-scale experiments like the Large Hadron Collider or the Tevatron. In these facilities, the ultimate theory to describe matter at the most fundamental level is constantly probed and verified. These experiments often produce large amounts of data that require storing, processing, and analysis techniques that continually push the limits of traditional information processing schemes. Thus, the High-Energy Physics (HEP) field has benefited from advancements in information processing and the development of algorithms and tools for large datasets. More recently, quantum computing applications have been investigated to understand how the community can benefit from the advantages of quantum information science. Nonetheless, to unleash the full potential of quantum computing, there is a need to understand the quantum behavior and, thus, scale up current algorithms beyond what can be simulated in classical processors. In this work, we explore potential applications of quantum machine learning to data analysis tasks in HEP and how to overcome the limitations of algorithms targeted for Noisy Intermediate-Scale Quantum (NISQ) devices.

Delgado, Andrea↗

Quantum solver for single-impurity Anderson models with particle-hole symmetry

Quantum embedding methods, such as dynamical mean-field theory (DMFT), provide a powerful framework for investigating strongly correlated materials. A central computational bottleneck in DMFT is in solving the Anderson impurity model (AIM), whose exact solution is classically intractable for large bath sizes. In this work, we benchmark a quantum-classical hybrid solver tailored for particle-hole symmetric AIMs, using the variational quantum eigensolver to prepare the ground state of the model with shallow quantum circuits. The solver uses shallow quantum ansätze and one set of variational parameters to prepare the ground state and its particle and hole excitations, enabling the construction of the impurity Green’s function through a continued-fraction expansion. We evaluate the performance of this approach across a few bath sizes and interaction strengths under noisy, shot-limited conditions. We compare three optimization routines (COBYLA, Adam, and L-BFGS-B) in terms of convergence and fidelity, assess the benefits of estimating a quantum-computed moment correction to the variational energies, and benchmark the approach by comparing the density of states computed from the impurity Green’s function against that obtained using a classical pipeline. Our results demonstrate the feasibility of Green’s function construction on near-term devices and establish practical benchmarks for quantum impurity solvers embedded within self-consistent DMFT loops.

Karabin, Mariia [ORNL]↗

Scheme for Quantum Computing Immune to Decoherence

A constructive scheme has been devised to enable mapping of any quantum computation into a spintronic circuit in which the computation is encoded in a basis that is, in principle, immune to quantum decoherence. The scheme is implemented by an algorithm that utilizes multiple physical spins to encode each logical bit in such a way that collective errors affecting all the physical spins do not disturb the logical bit. The scheme is expected to be of use to experimenters working on spintronic implementations of quantum logic. Spintronic computing devices use quantum-mechanical spins (typically, electron spins) to encode logical bits. Bits thus encoded (denoted qubits) are potentially susceptible to errors caused by noise and decoherence. The traditional model of quantum computation is based partly on the assumption that each qubit is implemented by use of a single two-state quantum system, such as an electron or other spin-1.2 particle. It can be surprisingly difficult to achieve certain gate operations . most notably, those of arbitrary 1-qubit gates . in spintronic hardware according to this model. However, ironically, certain 2-qubit interactions (in particular, spin-spin exchange interactions) can be achieved relatively easily in spintronic hardware. Therefore, it would be fortunate if it were possible to implement any 1-qubit gate by use of a spin-spin exchange interaction. While such a direct representation is not possible, it is possible to achieve an arbitrary 1-qubit gate indirectly by means of a sequence of four spin-spin exchange interactions, which could be implemented by use of four exchange gates. Accordingly, the present scheme provides for mapping any 1-qubit gate in the logical basis into an equivalent sequence of at most four spin-spin exchange interactions in the physical (encoded) basis. The complexity of the mathematical derivation of the scheme from basic quantum principles precludes a description within this article; it must suffice to report that the derivation provides explicit constructions for finding the exchange couplings in the physical basis needed to implement any arbitrary 1-qubit gate. These constructions lead to spintronic encodings of quantum logic that are more efficient than those of a previously published scheme that utilizes a universal but fixed set of gates.

Williams, Colin↗

On the Trotter Error in Many-body Quantum Dynamics with Coulomb Potentials

Efficient simulation of many-body quantum systems is central to advances in physics, chemistry, and quantum computing, with a key question being whether the simulation cost scales polynomially with the system size. Here, in this work, we analyze many-body quantum systems with Coulomb interactions, which are fundamental to electronic and molecular systems. We prove that Trotterization for such unbounded Hamiltonians achieves a 1/4-order convergence rate, with explicit polynomial dependence on the number of particles. The result holds for all initial wavefunctions in the domain of the Hamiltonian, and the 1/4-order convergence rate is optimal, as previous work has numerically demonstrated that it can be saturated by a specific initial ground state. The main challenges arise from the many-body structure and the singular nature of the Coulomb potential. Our proof strategy differs from prior state-of-the-art Trotter analyses, addressing both difficulties in a unified framework. Our analysis treats the Coulomb potential as an unbounded operator without modification or regularization, and does not rely on spatial discretization, making it compatible with both first- and second-quantized circuit constructions.

Fang, Di [Duke Univ., Durham, NC (United States)]↗

Large Scale Simulations of Quantum Systems on HPC with Analytics for HEP Algorithms

The objective of this work is to combine HEP simulation experience with HPC quantum systems simulations to provide an environment for executing large-scale experiments with advanced analysis capabilities for studying multi-qubit and multi-level reduced-noise, long coherence time quantum systems such as 3D Superconducting RF (SRF) cavities integrated with transmon qubits.

97 MATHEMATICS AND COMPUTING↗

Half-quantum vortices in nematic and chiral phases of 3 He

In this work, we report theoretical results for the stability of half-quantum vortices (HQVs) in the superfluid phases of 3 He confined in highly anisotropic Nafen aerogel. Superfluidity of 3 He confined in Nafen is the realization of a “nematic superfluid” with Cooper pairs condensed into a single p -wave orbital aligned along the anisotropy axis of the Nafen aerogel. In addition to the nematic phase, we predict a second “chiral” phase that onsets at a lower transition temperature. This chiral phase spontaneously breaks time-reversal symmetry and is a topological superfluid. Both superfluid phases are equal-spin pairing condensates that host arrays of HQVs as equilibrium states of rotating superfluid 3 He. We present results for the structure of HQVs, including magnetic and topological signatures of HQVs in both the nematic and chiral phases of 3 He-Nafen.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Magnetic order and disorder in a quasi-two-dimensional quantum Heisenberg antiferromagnet with randomized exchange

In this work, we present an investigation of the effect of randomizing exchange coupling strengths in the S = 1 / 2 square lattice quasi-two-dimensional quantum Heisenberg antiferromagnet (QHAF) ( QuinH ) 2 Cu ( Cl x Br 1 - x ) 4 · 2 H 2 O (QuinH = Quinolinium, C 9 H 8 N + ), with 0 ≤ x ≤ 1 . Pulsed-field magnetization measurements allow us to estimate an effective in-plane exchange strength J in a regime where exchange fosters short-range order, while the temperature T N at which long-range order (LRO) occurs is found using muon-spin relaxation, allowing us to construct a phase diagram for the series. We evaluate the effectiveness of disorder in suppressing T N and the ordered moment size, and we find an extended disordered phase in the region 0.4 ≲ x ≲ 0.8 where no magnetic order occurs. The observed critical substitution levels are accounted for by an energetics-based competition between different local magnetic orders. Furthermore, we demonstrate experimentally that the ground-state disorder is driven by quantum effects of the exchange randomness, which is a feature that has been predicted theoretically and has implications for other disordered quasi-two-dimensional QHAFs.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Magnetic Topological Semimetal Phase with Electronic Correlation Enhancement in SmSbTe

The ZrSiS family of compounds hosts various exotic quantum phenomena due to the presence of both topological nonsymmorphic Dirac fermions and nodal-line fermions. In this material family, the LnSbTe (Ln = lanthanide) compounds are particularly interesting owing to the intrinsic magnetism from magnetic Ln which leads to new properties and quantum states. Here in this work, the authors focus on the previously unexplored compound SmSbTe. The studies reveal a rare combination of a few functional properties in this material, including antiferromagnetism with possible magnetic frustration, electron correlation enhancement, and Dirac nodal-line fermions. These properties enable SmSbTe as a unique platform to explore exotic quantum phenomena and advanced functionalities arising from the interplay between magnetism, topology, and electronic correlations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum optimization algorithms: Energetic implications

Since the dawn of quantum computing (QC), theoretical developments like Shor's algorithm proved the conceptual superiority of QC over traditional computing. However, such quantum supremacy claims are difficult to achieve in practice because of the technical challenges of realizing noiseless qubits. In the near future, QC applications will need to rely on noisy quantum devices that offload part of their work to classical devices. One way to achieve this is by using parameterized quantum circuits in optimization or even in machine learning tasks. The energy requirements of quantum algorithms have not yet been studied extensively. Here in this article, we explore several optimization algorithms using both theoretical insights and numerical experiments to understand their impact on energy consumption. Specifically, we highlight why and how algorithms like quantum natural gradient descent, simultaneous perturbation stochastic approximations or circuit learning methods, are at least 2x to 4x more energy efficient than their classical counterparts; why feedback-based quantum optimization is energy-inefficient; and how techniques like Rosalin can improve the energy efficiency of other algorithms by a factor of ≥2 0 x. Finally, we use the NchooseK high-level programming model to run optimization problems on both gate-based quantum computers and quantum annealers. Empirical data indicate that these optimization problems run faster, have better success rates, and consume less energy on quantum annealers than on their gate-based counterparts.

97 MATHEMATICS AND COMPUTING↗

Two-Center Interference in the Photoionization Delays of Kr 2

Herein we present the experimental observation of two-center interference in the ionization time delays of Kr 2 . Using attosecond electron-ion-coincidence spectroscopy, we simultaneously measure the photoionization delays of krypton monomer and dimer. The relative time delay is found to oscillate as a function of the electron kinetic energy, an effect that is traced back to constructive and destructive interference of the photoelectron wave packets that are emitted or scattered from the two atomic centers. Our interpretation of the experimental results is supported by solving the time-independent Schrödinger equation of a 1D double-well potential, as well as coupled-channel multiconfigurational quantum-scattering calculations of Kr 2 . This work opens the door to the study of a broad class of quantum-interference effects in photoionization delays and demonstrates the potential of attosecond coincidence spectroscopy for studying weakly bound systems.

74 ATOMIC AND MOLECULAR PHYSICS↗

Variational quantum solver employing the PDS energy functional

In our previous work (J. Chem. Phys. 2020, 153, 201102),we reported a new class of quantum algorithms that are based on the quantum computation of the connected moment expansion to find the ground and excited state energies. In particular, the Peeters-Devreese-Soldatov (PDS) formulation is found variational and bearing the potential for further combining with the existing variational quantum infrastructure. Following this direction, here we propose a variational quantum solver employing the PDS energy gradient. In comparison with the usual variational quantum eigensolver (VQE) and the original static PDS approach, the proposed variational quantum solver offers an effective approach to achieve high ac-curacy at finding the ground state and its energy through the rotation of the trial wave function of modest quality guided by the low order PDS energy gradients, thus improves the ac-curacy and efficiency of the quantum simulation. We demonstrate the performance of the proposed variational quantum solver for toy models, H2molecule, and strongly correlated planar H4system in some challenging situations. In all the case studies, the proposed variational quantum approach out-performs the usual VQE and static PDS calculations even at the lowest order.

Peng, Bo↗