Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum Numbers”

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 757 records · Page 42

PQML: Enabling the Predictive Reproducibility on NISQ Machines for Quantum ML Applications

Quantum computing represents a groundbreaking approach to high-performance computing. In recent years, quantum computers have progressed from single-qubit processors to systems boasting over 400 qubits. The presence of such a large number of qubits offers significant advantages, including enhanced computational speed—a capability beyond classical computing methods. However, the current stage of quantum computing is referred to as the noisy intermediate-scale quantum (NISQ) era. The existence of noise in this era presents challenges in testing quantum computing applications, leading to considerable variance in application results. Furthermore, the diverse noise characteristics observed across different machines exacerbate this issue, complicating the selection of the appropriate machine for application execution. In response to these challenges, we introduce our Predictive Quantum Machine Learning (PQML) tool. This tool is designed to predict outcomes when executing identical quantum machine learning applications—specifically, a critical suite of variational quantum algorithms—across various quantum computers during the NISQ era. This effort relies on data collected over a 12-month period. To the best of our knowledge, this study represents the first attempt to ensure reproducibility across quantum computers for complex circuits. Additionally, we have developed a model capable of forecasting the accuracy of quantum computers for variational quantum algorithms, with a particular emphasis on quantum machine learning as a case study.

Senapati, Priyabrata [Kent State University]↗

Dimensional Crossover of the Integer Quantum Hall Plateau Transition and Disordered Topological Pumping

We study the quantum Hall plateau transition on rectangular tori. As the aspect ratio of the torus is increased, the two-dimensional critical behavior, characterized by a subthermodynamic number of topological states in a vanishing energy window around a critical energy, changes drastically. In the thin-torus limit, the entire spectrum is Anderson localized; however, an extensive number of states retain a Chern number C ≠ 0. In this work, we resolve this apparent paradox by mapping the thin-torus quantum Hall system onto a disordered Thouless pump, where the Chern number corresponds to the winding number of an electron’s path in real space during a pump cycle. We then characterize quantitatively the crossover between the one- and two-dimensional regimes for finite torus thickness, where the average Thouless conductance also shows anomalous scaling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Euler-Rodrigues Parameters: A Quantum Circuit to Calculate Rigid-Body Rotations

The use of vectorial parameterization to create geometrical representations in computational models has a large number of applications. One particular application is the calculation of the 3D rotational motion of rigid bodies, that could be used for the spatial location estimation from objects. Provided the algebraic nature of this problem, it could benefit from Quantum Computing, in particular several vectors could be superposed to be transformed with a single operation, providing a quantum processing advantage. In this article, we propose an implementation of a Quantum Computing algorithm to compute Euler-Rodrigues Parameters to model rigid body rotations to transform arbitrary functions, rotating multiple vectors in superposition. We developed this algorithm using Qiskit, taking into account the limitations imposed by the current Noisy Intermediate Scale Quantum (NISQ) devices, such as the reduced number of qubits available and the limited coherence time.

Pelaez, Emilio↗

Quantum pixel representations and compression for N-dimensional images

Abstract We introduce a novel and uniform framework for quantum pixel representations that overarches many of the most popular representations proposed in the recent literature, such as (I)FRQI, (I)NEQR, MCRQI, and (I)NCQI. The proposed QPIXL framework results in more efficient circuit implementations and significantly reduces the gate complexity for all considered quantum pixel representations. Our method scales linearly in the number of pixels and does not use ancilla qubits. Furthermore, the circuits only consist of $$R_y$$ R y gates and $$\text {CNOT}$$ CNOT gates making them practical in the NISQ era. Additionally, we propose a circuit and image compression algorithm that is shown to be highly effective, being able to reduce the necessary gates to prepare an FRQI state for example scientific images by up to 90% without sacrificing image quality. Our algorithms are made publicly available as part of , a Quantum Image Pixel Library.

97 MATHEMATICS AND COMPUTING↗

Fermions, quantum gravity, and holography in two dimensions

We study a model comprising N flavors of Kähler Dirac fermion propagating on a triangulated two-dimensional disk which is constrained to have a negative average bulk curvature. Dirichlet boundary conditions are chosen for the fermions. Quantum fluctuations of the geometry are included by summing over all possible triangulations consistent with these constraints. We show in the limit N → ∞ that the partition function is dominated by a regular triangulation of two-dimensional hyperbolic space. We use strong coupling expansions and Monte Carlo simulation to show that in this limit boundary correlators of the fermions have a power law dependence on boundary separation as one expects from holography. However, we argue that this behavior breaks down for any finite number of massive fields in the thermodynamic limit and quantum fluctuations of the bulk geometry drive the theory into a nonholographic phase. In contrast, for massless fermions, we find evidence that the boundary is conformal even for finite N . This is consistent with theoretical results in quantum Liouville theory. Published by the American Physical Society 2024

Astronomy & Astrophysics↗

SQuaD: Smart Quantum Detection for Photon Recognition and Dark Count Elimination

Quantum detectors of single photons are an essential component for quantum information processing across computing, communication and networking. Today's quantum detection system, which consists of single photon detectors, timing electronics, control and data processing software, is primarily used for counting the number of single photon detection events. However, it is largely incapable of extracting other rich physical characteristics of the detected photons, such as their wavelengths, polarization states, photon numbers, or temporal waveforms. This work, for the first time, demonstrates a smart quantum detection system, SQuaD, which integrates a field programmable gate array (FPGA) with a neural network model, and is designed to recognize the features of photons and to eliminate detector dark-count. The SQuaD is a fully integrated quantum system with high timing-resolution data acquisition, onboard multi-scale data analysis, intelligent feature recognition and extraction, and feedback-driven system control. Our \name experimentally demonstrates 1) reliable photon counting on par with the state-of-the art commercial systems; 2) high-throughput data processing for each individual detection events; 3) efficient dark count recognition and elimination; 4) up to 100% accurate feature recognition of photon wavelength and polarization. Additionally, we deploy the SQuaD to an atomic (erbium ion) photon emitter source to realize noise-free control and readout of a spin qubit in the telecom band, enabling critical advances in quantum networks and distributed quantum information processing.

Linne, Karl C. [U. Chicago (main)] (ORCID:00090009↗

Simulating large one-dimensional neutral-atom quantum systems

While abstract models of quantum computation assume a closed system of two-level states, practical quantum devices inevitably couple to the environment in some way, creating sources of noise. Understanding the tolerance to noise of specific quantum algorithms run on specific devices is important for determining the feasibility of quantum computing in the current noisy intermediate-scale quantum era. Of particular interest is understanding the noise sensitivity of these devices as more qubits are added to the system. Classical simulations are a useful tool to understand the effects of this noise, but direct classical simulations of open quantum systems are burdened by an exponentially growing cost in the number of qubits and a large local Hilbert space dimension. For onedimensional, shallow circuits, using tensor networks can replace this exponential cost with a linear one and simulate far wider systems than what would normally be available. In this paper, we describe a tensor network simulation of a neutral atom quantum system under the presence of noise, while introducing a purity-preserving truncation technique that compromises between the simplicity of the matrix product state and the positivity of the matrix product density operator. We apply this simulation to a near-optimized iteration of the quantum approximate optimization algorithm on a transverse field Ising model in order to investigate the influence of large system sizes on the performance of the algorithm. We find that while circuits with a large number of qubits fail more often under noise that depletes the qubit population, their outputs on a successful measurement are just as robust under Rydberg atom dissipation or qubit dephasing as smaller systems. However, such circuits might not perform as well under coherent multiqubit errors such as Rydberg atom crosstalk. We also find that the optimized parameters are especially robust to noise, suggesting that a noisier quantum system can be used to find the optimal parameters before switching to a cleaner system for measurements of observables.

Allen, James↗

Parallel-in-Time Simulation of Lindblad's Equation

Constructing fast quantum logic gates is critical to building a scalable quantum computer. We consider a qudit, a quantum version of a bit that can take an arbitrary number of states, coupled with a cavity. In this project, we wish to force the qudit to reach the 0-state, for any possible initial state. The coupled system changes in time according to Lindblad’s equation, an ordinary differential equation on the density matrix of the quantum system. Lindblad’s equation contains some parameters that we can control, so-called control functions. We seek control functions which force the qudit to the 0-state within 2 microseconds, which is much faster than what is currently done in practice. The search method is gradient descent, a numerical optimization method that uses gradient information to iteratively improve the control parameters. My contribution to this project is an attempt to speed up the computation of the gradient. It currently takes about 40 seconds to compute the gradient which involves solving a set of ODEs sequentially. Current supercomputers have thousands of cores, but sequential computations can only make use of 1 core at a time. We wish to divide up the work better, so that we can use many more cores at once. To this end, we have implemented the Multigrid Reduction in Time (MGRIT) algorithm. We perform a systematic parameter search on how to best apply this algorithm. Results indicate a 25 percent speed up for solving Lindblad’s equation and determining how close the final state is the 0-state.

97 MATHEMATICS AND COMPUTING↗

Flexibility of the factorized form of the unitary coupled cluster Ansatz

The factorized form of the unitary coupled cluster Ansatz is a popular state preparation Ansatz for electronic structure calculations of molecules on quantum computers. It is often viewed as an approximation (based on the Trotter product formula) for the conventional unitary coupled cluster operator. In this work, we show that the factorized form is quite flexible, allowing one to range from a conventional configuration interaction, to conventional unitary coupled cluster, to efficient approximations that lie in between these two. The variational minimization of the energy often allows simpler factorized unitary coupled cluster approximations to achieve high accuracy, even if they do not accurately approximate the Trotter product formula. This is similar to how quantum approximate optimization algorithms can achieve high accuracy with a small number of levels.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Spectral form factor of a quantum spin glass

It is widely expected that systems which fully thermalize are chaotic in the sense of exhibiting random-matrix statistics of their energy level spacings, whereas integrable systems exhibit Poissonian statistics. In this paper, we investigate a third class: spin glasses. These systems are partially chaotic but do not achieve full thermalization due to large free energy barriers. We examine the level spacing statistics of a canonical infinite-range quantum spin glass, the quantum p-spherical model, using an analytic path integral approach. We find statistics consistent with a direct sum of independent random matrices, and show that the number of such matrices is equal to the number of distinct metastable configurations — the exponential of the spin glass “complexity” as obtained from the quantum Thouless-Anderson-Palmer equations. We also consider the statistical properties of the complexity itself and identify a set of contributions to the path integral which suggest a Poissonian distribution for the number of metastable configurations. Our results show that level spacing statistics can probe the ergodicity-breaking in quantum spin glasses and provide a way to generalize the notion of spin glass complexity beyond models with a semi-classical limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Tunable quantum anomalous Hall effects in ferromagnetic van der Waals heterostructures

ABSTRACT The quantum anomalous Hall effect (QAHE) has unique advantages in topotronic applications, but it is still challenging to realize the QAHE with tunable magnetic and topological properties for building functional devices. Through systematic first-principles calculations, we predict that the in-plane magnetization induced QAHE with Chern numbers C = ±1 and the out-of-plane magnetization induced QAHE with high Chern numbers C = ±3 can be realized in a single material candidate, which is composed of van der Waals (vdW) coupled Bi and MnBi2Te4 monolayers. The switching between different phases of QAHE can be controlled in multiple ways, such as applying strain or (weak) magnetic field or twisting the vdW materials. The prediction of an experimentally available material system hosting robust, highly tunable QAHE will stimulate great research interest in the field. Our work opens a new avenue for the realization of tunable QAHE and provides a practical material platform for the development of topological electronics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Distilling the Essential Elements of Nuclear Binding via Neural-Network Quantum States

To distill the essential elements of nuclear binding, we seek the simplest Hamiltonian capable of modeling atomic nuclei with percent-level accuracy. A critical aspect of this endeavor consists of accurately solving the quantum many-body problem without incurring an exponential computing cost with the number of nucleons. Furthermore, we address this challenge by leveraging a variational Monte Carlo method based on a highly expressive neural-network quantum state ansatz. In addition to computing binding energies and charge radii of nuclei with up to 𝐴 = 20 nucleons, by evaluating their magnetic moments, we demonstrate that neural-network quantum states are able to correctly capture the self-emerging nuclear shell structure. To this end, we introduce a novel computational protocol based on adding an external magnetic field to the nuclear Hamiltonian, which allows the neural network to learn the preferred polarization of the nucleus within the given magnetic field.

Binding energy & masses↗

Fault localization in a microfabricated surface ion trap using diamond nitrogen-vacancy center magnetometry

Here, as quantum computing hardware becomes more complex with ongoing design innovations and growing capabilities, the quantum computing community needs increasingly powerful techniques for fabrication failure root-cause analysis. This is especially true for trapped-ion quantum computing. As trapped-ion quantum computing aims to scale to thousands of ions, the electrode numbers are growing to several hundred, with likely integrated photonic components also adding to the electrical and fabrication complexity, making faults even harder to locate. In this work, we used a high-resolution quantum magnetic imaging technique, based on nitrogen-vacancy centers in diamond, to investigate short-circuit faults in an ion trap chip. We imaged currents from these short-circuit faults to ground and compared them to intentionally created faults, finding that the root cause of the faults was failures in the on-chip trench capacitors. This work, where we exploited the performance advantages of a quantum magnetic sensing technique to troubleshoot a piece of quantum computing hardware, is a unique example of the evolving synergy between emerging quantum technologies to achieve capabilities that were previously inaccessible.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Role of non-Gaussian quantum fluctuations in neutrino entanglement

The flavor evolution of neutrinos in environments with large neutrino number densities is an open problem at the nexus of astrophysics and neutrino flavor physics. Among the many unanswered questions pertaining to this problem, it remains to be determined whether neutrino-neutrino coherent scattering can give rise to nontrivial quantum entanglement among neutrinos, and whether this can affect the flavor evolution in a meaningful way. To gain further insight into this question, here we study a simple system of two interacting neutrino beams and obtain the exact phase space explored by this system using the Husimi quasiprobability distribution. We observe that the entanglement induced by the coupling leads to strong delocalization in phase-space with largely non-Gaussian quantum fluctuations. The link between the neutrino entanglement and quantum fluctuations is illustrated using the one- and two-neutrino entropy. In addition, we propose an approximate phase-space method to describe the interacting neutrinos problem, where the exact evolution is replaced by a set of independent mean-field evolutions with a statistical sampling of the initial conditions. The phase-space approach provides a simple and accurate method to describe the gross features of the neutrino entanglement problem. Applications are shown using time-independent and time-dependent Hamiltonians in the nonadiabatic regime.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Role of non-gaussian quantum fluctuations in neutrino entanglement

The flavor evolution of neutrinos in environments with large neutrino number densities is an open problem at the nexus of astrophysics and neutrino flavor physics. Among the many unanswered questions pertaining to this problem, it remains to be determined whether neutrino-neutrino coherent scattering can give rise to nontrivial quantum entanglement among neutrinos, and whether this can affect the flavor evolution in a meaningful way. To gain further insight into this question, here we study a simple system of two interacting neutrino beams, and obtain the exact phase-space explored by this system using the Husimi quasi-probability distribution. We observe that the entanglement induced by the coupling leads to strong delocalization in phase-space with largely non-Gaussian quantum fluctuations. The link between the neutrino entanglement and quantum fluctuations is illustrated using the one- and two-neutrino entropy. In addition, we propose an approximate phase-space method to describe the interacting neutrinos problem, where the exact evolution is replaced by a set of independent mean-field evolutions with a statistical sampling of the initial conditions. The phase-space approach provides a simple and accurate method to describe the gross features of the neutrino entanglement problem. Applications are shown using time-independent and time-dependent Hamiltonians in the non-adiabatic regime.

Patwardhan, Amol↗

Simulating long-range coherence of atoms and photons in quantum computers

Lasers and Bose-Einstein condensates (BECs) exhibit macroscopic quantum coherence in seemingly unrelated ways. Lasers possess a well-defined global phase and are characterized by large fluctuations in the number of photons. In BECs of atoms, instead, the number of particles is conserved and the global phase is undefined. Here, we present a unified framework to simulate lasers and BECs states in gate-based quantum computers, by mapping bosonic particles to qubit excitations. Our approach relies on a scalable circuit that measures the total number of particles without destroying long-range coherence. We introduce complementary probes to measure the global and relative phase coherence of a quantum state, and demonstrate their functionality on a Rigetti quantum computer. Our work shows that particle-number conservation enhances long-range phase coherence, highlighting a mechanism used by superfluids and superconductors to gain phase stiffness.

Torre, Emanuele Dalla↗

Quantum computing for a profusion of postman problem variants

In this paper we study the viability of solving the Chinese Postman Problem, a graph routing optimization problem, and many of its variants on a quantum annealing device. Routing problem variants considered include graph type, directionally varying weights, number of parties involved in routing, among others. We put emphasis on the explanation of how to convert such problems into quadratic unconstrained binary optimization (QUBO) problems. QUBO is one of two equivalent natural paradigms for quantum annealing devices, the other being the Ising Model. We also expand upon a previously discovered algorithm for solving the Chinese Postman Problem on a closed undirected graph to decrease the number of constraints and variables used in the problem. Optimal annealing parameter settings and constraint weight values are discussed based on results from implementation on the D-Wave 2000Q and Advantage. Results from classical, purely quantum, and hybrid algorithms are compared.

97 MATHEMATICS AND COMPUTING↗

Automating NISQ Application Design with Meta Quantum Circuits with Constraints (MQCC)

Near-term intermediate scale quantum (NISQ) computers are likely to have very restricted hardware resources, where precisely controllable qubits are expensive, error-prone, and scarce. Programmers of such computers must therefore balance trade-offs among a large number of (potentially heterogeneous) factors specific to the targeted application and quantum hardware. To assist them, we propose Meta Quantum Circuits with Constraints (MQCC), a meta-programming framework for quantum programs. Programmers express their application as a succinct collection of normal quantum circuits stitched together by a set of (manually or automatically) added meta-level choice variables, whose values are constrained according to a programmable set of quantitative optimization criteria. MQCC’s compiler generates the appropriate constraints and solves them via an SMT solver, producing an optimized, runnable program. We showcase a few MQCC’s applications for its generality including an automatic generation of efficient error syndrome extraction schemes for fault-tolerant quantum error correction with heterogeneous qubits and an approach to writing approximate quantum Fourier transformation and quantum phase estimation that smoothly trades off accuracy and resource use. We also illustrate that MQCC can easily encode prior one-off NISQ application designs-–multi-programming (MP), crosstalk mitigation (CM)—as well as a combination of their optimization goals (i.e., a combined MP-CM).

97 MATHEMATICS AND COMPUTING↗