Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “information science”

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 559 records · Page 31
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Triplet-pair spin signatures from macroscopically aligned heteroacenes in an oriented single crystal

The photo-driven process of singlet fission generates coupled triplet pairs (TT) with fundamentally intriguing and potentially useful properties. The quintet 5 TT 0 sublevel is particularly interesting for quantum information because it is highly entangled, is addressable with microwave pulses, and could be detected using optical techniques. Previous theoretical work on a model Hamiltonian and nonadiabatic transition theory, called the JDE model, has determined that this sublevel can be selectively populated if certain conditions are met. Among the most challenging, the molecules within the dimer undergoing singlet fission must have their principal magnetic axes parallel to one another and to an applied Zeeman field. Here, we present time-resolved electron paramagnetic resonance (TR-EPR) spectroscopy of a single crystal sample of a tetracenethiophene compound featuring arrays of dimers aligned in this manner, which were mounted so that the orientation of the field relative to the molecular axes could be controlled. The observed spin sublevel populations in the paired TT and unpaired (T+T) triplets are consistent with predictions from the JDE model, including preferential 5 TT 0 formation at z ‖ B 0 , with one caveat—two 5 TT spin sublevels have little to no population. This may be due to crossings between the 5 TT and 3 TT manifolds in the field range investigated by TR-EPR, consistent with the intertriplet exchange energy determined by monitoring photoluminescence at varying magnetic fields.

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

Noise resilience of variational quantum compiling

Variational hybrid quantum-classical algorithms (VHQCAs) are near-term algorithms that leverage classical optimization to minimize a cost function, which is efficiently evaluated on a quantum computer. Recently VHQCAs have been proposed for quantum compiling, where a target unitary U is compiled into a short-depth gate sequence V. In this work, we report on a surprising form of noise resilience for these algorithms. Namely, we find one often learns the correct gate sequence V (i.e. the correct variational parameters) despite various sources of incoherent noise acting during the cost-evaluation circuit. Our main results are rigorous theorems stating that the optimal variational parameters are unaffected by a broad class of noise models, such as measurement noise, gate noise, and Pauli channel noise. Furthermore, our numerical implementations on IBM's noisy simulator demonstrate resilience when compiling the quantum Fourier transform, Toffoli gate, and W-state preparation. Hence, variational quantum compiling, due to its robustness, could be practically useful for noisy intermediate-scale quantum devices. Finally, we speculate that this noise resilience may be a general phenomenon that applies to other VHQCAs such as the variational quantum eigensolver.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Large gradients via correlation in random parameterized quantum circuits

Scaling of variational quantum algorithms to large problem sizes requires efficient optimization of random parameterized quantum circuits. For such circuits with uncorrelated parameters, the presence of exponentially vanishing gradients in cost function landscapes is an obstacle to optimization by gradient descent methods. In this work, we prove that reducing the dimensionality of the parameter space by utilizing circuit modules containing spatially or temporally correlated gate layers can allow one to circumvent the vanishing gradient phenomenon. Here, examples are drawn from random separable circuits and asymptotically optimal variational versions of Grover's algorithm based on the quantum alternating operator ansatz. In the latter scenario, our bounds on cost function variation imply a transition between vanishing gradients and efficient trainability as the number of layers is increased toward $\mathcal{O}\left({2}^{n/2}\right)$, the optimal oracle complexity of quantum unstructured search.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Quantum mixed state compiling

The task of learning a quantum circuit to prepare a given mixed state is a fundamental quantum subroutine. We present a variational quantum algorithm (VQA) to learn mixed states which is suitable for near-term hardware. Our algorithm represents a generalization of previous VQAs that aimed at learning preparation circuits for pure states. We consider two different ansätze for compiling the target state; the first is based on learning a purification of the state and the second on representing it as a convex combination of pure states. In both cases, the resources required to store and manipulate the compiled state grow with the rank of the approximation. Thus, by learning a lower rank approximation of the target state, our algorithm provides a means of compressing a state for more efficient processing. As a byproduct of our algorithm, one effectively learns the principal components of the target state, and hence our algorithm further provides a new method for principal component analysis. We investigate the efficacy of our algorithm through extensive numerical implementations, showing that typical random states and thermal states of many body systems may be learnt this way. Additionally, we demonstrate on quantum hardware how our algorithm can be used to study hardware noise-induced states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Diabatic quantum annealing for the frustrated ring model

Abstract Quantum annealing (QA) is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare ground state and a problem Hamiltonian whose ground state encodes solutions to an optimization problem. The standard implementation relies on the evolution being adiabatic: keeping the system in the instantaneous ground state with high probability and requiring a time scale inversely related to the minimum energy gap between the instantaneous ground and excited states. However, adiabatic evolution can lead to evolution times that scale exponentially with the system size, even for computationally simple problems. Here, we study whether non-adiabatic evolutions with optimized annealing schedules can bypass this exponential slowdown for one such class of problems called the frustrated ring model. For sufficiently optimized annealing schedules and system sizes of up to 39 qubits, we provide numerical evidence that we can avoid the exponential slowdown. Our work highlights the potential of highly-controllable QA to circumvent bottlenecks associated with the standard implementation of QA.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Quantum computer-enabled receivers for optical communication

Abstract Optical communication is the standard for high-bandwidth information transfer in today’s digital age. The increasing demand for bandwidth has led to the maturation of coherent transceivers that use phase- and amplitude-modulated optical signals to encode more bits of information per transmitted pulse. Such encoding schemes achieve higher information density, but also require more complicated receivers to discriminate the signaling states. In fact, achieving the ultimate limit of optical communication capacity, especially in the low light regime, requires coherent joint detection of multiple pulses. Despite their superiority, such joint detection receivers are not in widespread use because of the difficulty of constructing them in the optical domain. In this work we describe how optomechanical transduction of phase information from coherent optical pulses to superconducting qubit states followed by the execution of trained short-depth variational quantum circuits can perform joint detection of communication codewords with error probabilities that surpass all classical, individual pulse detection receivers. Importantly, we utilize a model of optomechanical transduction that captures non-idealities such as thermal noise and loss in order to understand the transduction performance necessary to achieve a quantum advantage with such a scheme. We also execute the trained variational circuits on an IBM-Q device with the modeled transduced states as input to demonstrate that a quantum advantage is possible even with current levels of quantum computing hardware noise.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms

The emergent practical applicability of the Quantum Approximate Optimization Algorithm (QAOA) for approximate combinatorial optimization is a subject of considerable interest. One of the primary limitations of QAOA is the task of finding a set of good parameters, which is usually done using a variational optimization loop. Parameter transfer, or parameter concentration, is a phenomenon where QAOA angles trained on problem instances that are self-similar tend to perform well for other problem instances from that similar class. This suggests a potentially highly efficient and scalable non-variational learning method for QAOA angle finding. In this work, we systematically study QAOA parameter transferability from small problem sizes (16 and 27 decision variables) onto large problem instances (up to 156 qubits) for heavy-hex graph Ising models with geometrically local higher order terms using the Julia based QAOA simulation tool \texttt{JuliQAOA} to perform classical angle finding for up to $49$ QAOA layers ($p$). Parameter transfer of the fixed angles is validated using a combination of full statevector, Projected Entangled Pair States (PEPS), Matrix Product State (MPS), and LOWESA numerical simulations. We find that the QAOA parameter transfer from single instances applied to other (unseen) problem instances does not in general provide monotonically improving performance as a function of $p$ - there are many cases where the performance temporarily decreases as a function of $p$ - but despite this the transferred angles have a general trend of improved expectation value as the QAOA depth increases, in many cases converging close to the true ground-state energy of the $100+$ qubit instances. We also sample the hardware-compatible Ising models using the ensemble of transfer-learned QAOA parameters on several superconducting qubit IBM Quantum processors with 127, 133, and 156 qubits. We find continuous solution quality improvement of the hardware-compatible QAOA circuits run on the IBM NISQ processors up to $p=5$ on \texttt{ibm\_fez}, up to $p=9$ on \texttt{ibm\_torino}, and up to $p=10$ on \texttt{ibm\_pittsburgh}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Entanglement of microwave-optical modes in a strongly coupled electro-optomechanical system

Quantum transduction between microwaves and optics can be realized by quantum teleportation if given reliable microwave-optical entanglement, namely, entanglement-based quantum transduction. To realize this protocol, an entangled source with a high fidelity between the two frequencies is necessary. Here, we study microwave and optical entanglement generation based on a generic cavity electro-optomechanical system in the strong coupling regime. Splittings are shown in the microwave and optical output spectra and the frequency entanglement between the two modes is quantified. We show that entanglement can be straightforwardly encoded in the frequency-bin degree of freedom and propose a feasible experiment to verify entangled photon pairs. The experimental implementation is systematically analyzed, and the preferable parameter regime for entanglement verification is identified. An inequality is given as a criterion for good entanglement verification with analysis of practical imperfections.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Quantum optimal control of ten-level nuclear spin qudits in Sr 87

We study the ability to implement unitary maps on states of the I = 9 / 2 nuclear spin in Sr 87 , a d = 10 dimensional (qudecimal) Hilbert space, using quantum optimal control. Through a combination of nuclear spin resonance and a tensor ac Stark shift, by solely modulating the phase of a radio-frequency magnetic field, the system is quantum controllable. Alkaline-earth-metal atoms, such as Sr 87 , have a very favorable figure of merit for such control due to narrow intercombination lines and the large hyperfine splitting in the excited states. We numerically study the quantum speed limit, optimal parameters, and the fidelity of arbitrary state preparation and full SU(10) maps, including the presence of decoherence due to optical pumping induced by the light-shifting laser. We also study the use of robust control to mitigate some dephasing due to inhomogeneities in the light shift. We find that with an rf Rabi frequency of Ω rf and 0.5% inhomogeneity in the the light shift we can prepare an arbitrary Haar-random state in a time T = 4.5 π / Ω rf with average fidelity ( F ψ ) = 0.9992 , and an arbitrary Haar-random SU(10) map in a time T = 24 π / Ω rf with average fidelity ( F U ) = 0.9923 .

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Shadow process tomography of quantum channels

Quantum process tomography is a critical capability for building quantum computers, enabling quantum networks, and understanding quantum sensors. Like quantum state tomography, the process tomography of an arbitrary quantum channel requires a number of measurements that scales exponentially in the number of quantum bits affected. However, the recent field of shadow tomography, applied to quantum states, has demonstrated the ability to extract key information about a state with only polynomially many measurements. In this work, we apply the concepts of shadow state tomography to the challenge of characterizing quantum processes. Furthermore, we make use of the Choi isomorphism to directly apply rigorous bounds from shadow state tomography to shadow process tomography, and we find additional bounds on the number of measurements that are unique to process tomography. Our results, which include algorithms for implementing shadow process tomography, enable new techniques including evaluation of channel concatenation and the application of channels to shadows of quantum states. This provides a dramatic improvement for understanding large-scale quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Numerical evidence against advantage with quantum fidelity kernels on classical data

Quantum machine learning techniques are commonly considered one of the most promising candidates for demonstrating practical quantum advantage. In particular, quantum kernel methods have been demonstrated to be able to learn certain classically intractable functions efficiently if the kernel is well aligned with the target function. In the more general case, quantum kernels are known to suffer from exponential “flattening” of the spectrum as the number of qubits grows, preventing generalization and necessitating the control of the inductive bias by hyperparameters. We show that the general-purpose hyperparameter-tuning techniques proposed to improve the generalization of quantum kernels lead to the kernel becoming well approximated by a classical kernel, removing the possibility of quantum advantage. We provide extensive numerical evidence for this phenomenon utilizing multiple previously studied quantum feature maps and both synthetic and real data. Our results show that unless novel techniques are developed to control the inductive bias of quantum kernels, they are unlikely to provide a quantum advantage on classical data that lacks special structure.

Quantum Information, Science & Technology↗
DOE OSTI2023

Spin-squeezed Gottesman-Kitaev-Preskill codes for quantum error correction in atomic ensembles

Gottesman-Kitaev-Preskill (GKP) codes encode a qubit in displaced phase-space combs of a continuous-variable (CV) quantum system and are useful for correcting a variety of high-weight photonic errors. Here we propose atomic ensemble analogs of the single-mode CV GKP code by using the quantum central limit theorem to pull back the phase-space structure of a CV system to the compact phase space of a quantum spin system. We study the optimal recovery performance of these codes under error channels described by stochastic relaxation and isotropic ballistic dephasing processes using the diversity combining approach for calculating channel fidelity. Additionally, we find that the spin GKP codes outperform other spin system codes such as cat codes or binomial codes. Our spin GKP codes based on the two-axis countertwisting interaction and superpositions of SU(2) coherent states are direct spin analogs of the finite-energy CV GKP codes, whereas our codes based on one-axis twisting do not yet have well-studied CV analogs. A state preparation scheme for the spin GKP codes is proposed which uses the linear-combination-of-unitaries method, applicable to both the CV and spin GKP settings. Finally, we discuss a fault-tolerant approximate gate set for quantum computing with spin-GKP-encoded qubits, obtained by translating gates from the CV GKP setting using the quantum central limit theorem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Approximate Boltzmann distributions in quantum approximate optimization

Approaches to compute or estimate the output probability distributions from the quantum approximate optimization algorithm (QAOA) are needed to assess the likelihood it will obtain a quantum computational advantage. We analyze output from QAOA circuits solving 7200 random MaxCut instances, with $n$ = 14–23 qubits and depth parameter $p$ ≤ 12 and find that the average basis state probabilities follow approximate Boltzmann distributions: The average probabilities scale exponentially with their energy (cut value), with a peak at the optimal solution. Furthermore, we describe the rate of exponential scaling or effective temperature in terms of a series with a leading-order term $T$ ~ $C$ min /$n$ $\sqrt{p}$, with $C$ min the optimal solution energy. Using this scaling, we generate approximate output distributions with up to 38 qubits and find these give accurate accounts of important performance metrics in cases we can simulate exactly.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Topological orders of monopoles and hedgehogs: From electronic and magnetic spin-orbit coupling to quarks

Topological states of matter are, generally, quantum liquids of conserved topological defects. We establish this by constructing and analyzing topological field theories which introduce gauge fields to describe the dynamics of singularities in the original field configurations. In this work, homotopy groups are utilized to identify topologically protected singularities, and the conservation of their protected number is captured by a topological action term that unambiguously obtains from the given set of symmetries. Stable phases of these theories include quantum liquids with emergent massless Abelian and non-Abelian gauge fields, as well as topological orders with long-range quantum entanglement, fractional excitations, boundary modes, and unconventional responses to external perturbations. This paper focuses on the derivation of topological field theories and basic phenomenological characterization of topological orders associated with homotopy groups π n (S n ), n ≥ 1 . These homotopies govern monopole and hedgehog topological defects in d = n + 1 dimensions, and enable the generalization of both weakly interacting and fractional quantum Hall liquids of vortices to d > 2 . Hedgehogs have not been in the spotlight so far, but they are particularly important defects of magnetic moments because they can be stimulated in realistic systems with spin-orbit coupling, such as chiral magnets and d = 3 topological materials. We predict topological orders in systems with U(1) × Spin(d) symmetry in which fractional electric charge attaches to hedgehogs. Monopoles, the analogous defects of charge or generic U(1) currents, may bind to hedgehogs via Zeeman effect, or effectively emerge in purely magnetic systems. The latter can lead to spin liquids with different topological orders than that of the resonant valence bond spin liquid. Charge fractionalization of quarks in atomic nuclei is also seen as possibly arising from the charge-hedgehog attachment.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Low-energy magnons in the chiral ferrimagnet Cu 2 OSeO 3 : A coarse-grained approach

We report a comprehensive neutron scattering study of low energy magnetic excitations in the breathing pyrochlore helimagnetic Cu2OSeO3. Fully documenting the four lowest energy magnetic modes that leave the ferrimagnetic configuration of the “strong tetrahedra” intact (| ℏ ω| < 13 meV), we find gapless quadratic dispersion at the Γ point for energies above 0.2 meV, two doublets separated by 1.6(2) meV at the R point, and a bounded continuum at the X point. Our constrained rigid spin cluster model relates these features to Dzyaloshinskii-Moriya (DM) interactions and the incommensurate helical ground state. Combining conventional spin wave theory with a spin cluster form factor accurately reproduces the measured equal time structure factor through multiple Brillouin zones. An effective spin Hamiltonian describing complex anisotropic intercluster interactions is obtained.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

High-fidelity dimer excitations using quantum hardware

The quantum simulation of entangled spin systems can play a central role in quantum magnetic materials discovery. Additionally, the simulation of spectroscopic signatures, such as the dynamical structure factor accessed in inelastic neutron scattering (INS), necessitates a long timescale for circuit evolution. This is because the energy resolution is directly related to the time over which the circuit could be meaningfully evolved. However, canonical Trotterization requires deep circuits precluding such long-time evolution—even for a small number of qubits. Here, in this study, we demonstrate “direct” resource efficient fast-forwarding (REFF) measurements with short-depth circuits that can be used to capture longer time dynamics of spin Hamiltonians. We showcase the results of the dynamics of a quantum spin dimer, the basic quantum unit of emergent many-body spin systems, whose density of states we simulate accurately. The long temporal evolution and measurement of the two-spin correlation functions enable the calculation of the dynamical structure factor S⁡(Q = 0, ω) measured in the neutron scattering cross-section. We exhibit the clarity of the triplet gap and the triplet splitting of the quantum dimer with class-leading fidelity that enables comparison to experimental neutron data. Our results on current circuit hardware outline an important workflow to predict and benchmark against the outputs of INS experiments of quantum magnets.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Projection algorithm for state preparation on quantum computers

We present an efficient method to prepare states of a many-body system on quantum hardware, first isolating individual quantum numbers and then using time evolution to isolate the energy. Our method in its simplest form requires only one additional auxiliary qubit. The total time evolved for an accurate solution is proportional to the ratio of the spectrum range of the trial state to the gap to the lowest excited state, a substantial improvement over other projection algorithms, and the accuracy increases exponentially with the time evolved. Isolating the quantum numbers is efficient because of the known eigenvalues and increases the gap thus shortening the propagation time required. The success rate of the algorithm, or the probability of producing the desired state, is a simple function of measurement times and phases and is dominated by the square overlap of the original state to the desired state. We present examples from the nuclear shell model and the Heisenberg model. In conclusion, we compare this algorithm to previous algorithms for short evolution times and discuss potential further improvements.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗