Modeling lithographic quantum dots and donors for quantum computation and simulation
Explore the source record for details and available documents.
Brickson, Mitchell Ian↗
SEARCH · Search NASA
Results for “quantum modeling”
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.
Predictive Models from Quantum Computer Benchmarks
Explore the source record for details and available documents.
Blume-Kohout, Robin J.↗
Autoregressive neural quantum states of Fermi Hubbard models
Neural quantum states (NQSs) have emerged as a powerful ansatz for variational quantum Monte Carlo studies of strongly correlated systems. Here, we apply recurrent neural networks (RNNs) and autoregressive transformer neural networks to the Fermi-Hubbard and the (non-Hermitian) Hatano-Nelson-Hubbard models in one and two dimensions. In both cases, we observe that the convergence of the RNN ansatz is challenged when increasing the interaction strength. We present a physically motivated and easy-to-implement strategy for improving the optimization, namely, by ramping of the model parameters. Furthermore, we investigate the advantages and disadvantages of the autoregressive sampling property of both network architectures. For the Hatano-Nelson-Hubbard model, we identify convergence issues that stem from the autoregressive sampling scheme in combination with the non-Hermitian nature of the model. Our findings provide insights into the challenges of the NQS approach and make the first step towards exploring strongly correlated electrons using this ansatz. Published by the American Physical Society 2025
Ibarra-García-Padilla, Eduardo (ORCID:000000019165↗
Intrinsically Quantum Effects of Axion Dark Matter Are Undetectable
Is the usual treatment of axion dark matter as a classical field reliable? We show that the answer is subtle: the axion field could well be in a quantum state that has no complete classical description, but realistic detectors cannot tell the difference. To see this, we solve a fully quantum model of axion detection using quantum optics techniques. We show that intrinsically quantum effects are washed out by mode averaging or small amounts of noise, and significantly suppressed by the weakness of the axion coupling. Our Letter exemplifies that there should always be a classical analog for axion dark matter effects, extends to other wave (ultralight) dark-matter candidates, and gives a general method to compute the effects of exotic dark-matter states.
Bao, Yunjia [University of Chicago, IL (United Sta↗
Hamming distance and the onset of quantum criticality
Simulating models for quantum correlated matter unveils the inherent limitations of deterministic classical computations. In particular, in the case of quantum Monte Carlo methods, this is manifested by the emergence of negative weight configurations in the sampling, that is, the sign problem (SP). There have been several recent calculations which exploit the SP to locate underlying critical behavior. Here, utilizing a metric that quantifies phase-space ergodicity in such sampling, the Hamming distance, we suggest a significant advance on these ideas to extract the location of quantum critical points in various fermionic models, in spite of the presence of a severe SP. Combined with other methods, exact diagonalization in our case, it elucidates both the nature of the different phases as well as their location, as we demonstrate explicitly for the honeycomb and triangular Hubbard models, in both their U(1) and SU(2) forms. Furthermore, our approach exemplifies a possible path allowing the exploration of the phase diagram of a variety of fermionic quantum models hitherto considered to be impractical via quantum Monte Carlo simulations.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning
We present an algorithmic framework for quantum-inspired classical algorithms on close-to-low-rank matrices, generalizing the series of results started by Tang’s breakthrough quantum-inspired algorithm for recommendation systems [STOC’19]. Motivated by quantum linear algebra algorithms and the quantum singular value transformation (SVT) framework of Gilyén et al. [STOC’19], we develop classical algorithms for SVT that run in time independent of input dimension, under suitable quantum-inspired sampling assumptions. Our results give compelling evidence that in the corresponding QRAM data structure input model, quantum SVT does not yield exponential quantum speedups. Since the quantum SVT framework generalizes essentially all known techniques for quantum linear algebra, our results, combined with sampling lemmas from previous work, suffice to generalize all prior results about dequantizing quantum machine learning algorithms. In particular, our classical SVT framework recovers and often improves the dequantization results on recommendation systems, principal component analysis, supervised clustering, support vector machines, low-rank regression, and semidefinite program solving. We also give additional dequantization results on low-rank Hamiltonian simulation and discriminant analysis. Our improvements come from identifying the key feature of the quantum-inspired input model that is at the core of all prior quantum-inspired results: ℓ 2 -norm sampling can approximate matrix products in time independent of their dimension. We reduce all our main results to this fact, making our exposition concise, self-contained, and intuitive.
Computer Science↗
Quantum-Inspired Power System Reliability Assessment
To enable an in-depth study of power system operation and planning, the assessment of standard reliability indices is inevitable. The Monte Carlo Simulation (MCS) approach is a broadly used method in replacing the analytical methods in reliability indices assessment. The accuracy of MCS, however, highly depends on the sampling size, and hence, a complicated system with large number of components requires a large sampling size and daunting computational effort. To address this shortcoming, we, in this paper attempt to take advantage of potentials of the quantum computing (QC) for power system reliability assessment by realizing the following contributions: 1) an innovative quantum model designed for reliability assessment; 2) a quantum circuit that achieves the quadratic speed up compared to the classical MCS method; 3) an efficient quantum amplitude estimation (QAE) algorithm to accurately evaluate the reliability indices. The accuracy and efficacy of the quantum reliability method are extensively verified and demonstrated on both radial and mesh distribution systems.
32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
Computational projects with the Landau–Zener problem in the quantum mechanics classroom
The Landau–Zener problem, where a minimum energy separation is passed with constant rate in a two-state quantum-mechanical system, is an excellent model quantum system for a computational project. It requires a low-level computational effort, but has a number of complex numerical and algorithmic issues that can be resolved through dedicated work. It can be used to teach computational concepts, such as accuracy, discretization, and extrapolation, and it reinforces quantum concepts of time-evolution via a time-ordered product and of extrapolation to infinite time via time-dependent perturbation theory. Additionally, we discuss the concept of compression algorithms, which are employed in many advanced quantum computing strategies, and easy to illustrate with the Landau–Zener problem.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NoRA: A Tensor Network Ansatz for Volume-Law Entangled Equilibrium States of Highly Connected Hamiltonians
Motivated by the ground state structure of quantum models with all-to-all interactions such as mean-field quantum spin glass models and the Sachdev-Ye-Kitaev (SYK) model, we propose a tensor network architecture which can accomodate volume law entanglement and a large ground state degeneracy. We call this architecture the non-local renormalization ansatz (NoRA) because it can be viewed as a generalization of MERA, DMERA, and branching MERA networks with the constraints of spatial locality removed. We argue that the architecture is potentially expressive enough to capture the entanglement and complexity of the ground space of the SYK model, thus making it a suitable variational ansatz, but we leave a detailed study of SYK to future work. We further explore the architecture in the special case in which the tensors are random Clifford gates. Here the architecture can be viewed as the encoding map of a random stabilizer code. We introduce a family of codes inspired by the SYK model which can be chosen to have constant rate and linear distance at the cost of some high weight stabilizers. We also comment on potential similarities between this code family and the approximate code formed from the SYK ground space.
Physics↗
Enhancing the accuracy of density functional tight binding models through ChIMES many-body interaction potentials
Semi-empirical quantum models such as Density Functional Tight Binding (DFTB) are attractive methods for obtaining quantum simulation data at longer time and length scales than possible with standard approaches. However, application of these models can require lengthy effort due to the lack of a systematic approach for their development. In this work, we discuss the use of the Chebyshev Interaction Model for Efficient Simulation (ChIMES) to create rapidly parameterized DFTB models, which exhibit strong transferability due to the inclusion of many-body interactions that might otherwise be inaccurate. We apply our modeling approach to silicon polymorphs and review previous work on titanium hydride. We also review the creation of a general purpose DFTB/ChIMES model for organic molecules and compounds that approaches hybrid functional and coupled cluster accuracy with two orders of magnitude fewer parameters than similar neural network approaches. In all cases, DFTB/ChIMES yields similar accuracy to the underlying quantum method with orders of magnitude improvement in computational cost. In conclusion, our developments provide a way to create computationally efficient and highly accurate simulations over varying extreme thermodynamic conditions, where physical and chemical properties can be difficult to interrogate directly, and there is historically a significant reliance on theoretical approaches for interpretation and validation of experimental results.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Quantum utility in simulating the real-time dynamics of the Fermi–Hubbard model using superconducting quantum computers
The Fermi–Hubbard model is a fundamental model in condensed matter physics that describes strongly correlated electrons. On the other hand, quantum computers are emerging as powerful tools for exploring the complex dynamics of these quantum many-body systems. In this work, we demonstrate the quantum simulation of the one-dimensional Fermi–Hubbard model using IBM's superconducting quantum computers, employing over 100 qubits. We introduce a first-order Trotterization scheme and extend it to an optimized second-order Trotterization for the time evolution in the Fermi–Hubbard model, specifically tailored for the limited qubit connectivity of quantum architectures, such as IBM's platforms. Notably, both Trotterization approaches are scalable and maintain a constant circuit depth at each Trotter step, regardless of the qubit count, enabling us to precisely investigate the relaxation dynamics in the Fermi–Hubbard model by measuring the expectation value of the Néel observable (staggered magnetization) for time-evolved quantum states. Lastly, our successful measurement of expectation values in such large-scale quantum many-body systems, especially at longer time scales with larger entanglement, highlights the quantum utility of superconducting quantum platforms over conventional classical approximation methods.
97 MATHEMATICS AND COMPUTING↗
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↗
Bhatnagar-Gross-Krook subgrid model for neutrino quantum kinetics
Here, we present a new subgrid model for neutrino quantum kinetics, which is primarily designed to incorporate effects of collective neutrino oscillations into neutrino-radiation-hydrodynamic simulations for core-collapse supernovae and mergers of compact objects. We approximate the neutrino oscillation term in a quantum kinetic equation using the Bhatnagar-Gross-Krook (BGK) relaxation-time prescription, and the transport equation is directly applicable for classical neutrino transport schemes. The BGK model is motivated by recent theoretical indications that nonlinear phases of collective neutrino oscillations settle into quasisteady structures. We explicitly provide basic equations of the BGK subgrid model for both multiangle and moment-based neutrino transport to facilitate the implementation of the subgrid model in the existing neutrino transport schemes. We also show the capability of our BGK subgrid model by comparing it to fully quantum kinetic simulations for fast neutrino-flavor conversion. We find that the overall properties can be well reproduced in the subgrid model; the error of angular-averaged survival probability of neutrinos is within ~20%. By identifying the source of error, we also discuss perspectives to improve the accuracy of the subgrid model.
79 ASTRONOMY AND ASTROPHYSICS↗
Short-Depth QAOA circuits and Quantum Annealing on Higher-Order Ising Models (Rev.2)
The Quantum Alternating Operator Ansatz (QAOA) and Quantum Annealing (QA) are quantum algorithms that are both based on the adiabatic theorem and both have the goal of sampling the optimal solution(s) of combinatorial optimization problems. Quantum annealing has been physically instantiated on D-Wave devices using superconducting flux qubits, and QAOA can be programmed on digital gate-model quantum computers such as the programmable superconducting transmon qubits devices of the IBMQ series, for instance ibm washington. QAOA and QA address the same types of problems, but it is unclear how they will scale to large problem sizes and to larger and higher-fidelity quantum computers. In this article, we present a direct comparison between QAOA, one and two rounds, run on all 127 qubits of ibm washington and QA run on D-Wave Advantage system4.1 and Advantage system6.1. The problems which allow for this comparison are random Ising model problems whose connectivity matches the heavy hexagonal lattice topology of ibm washington and the Pegasus graph connectivity of the two D-Wave devices. We create two classes of problem instances for this comparison: one with higher order terms (ZZZ variable interactions), linear terms, and quadratic terms, and a separate problem type with only linear and quadratic terms. Our QAOA circuits are novel and extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of ibm washington’s heavy hexagonal lattice and can be applied to future heavy-hex chips. We also test the effectiveness of the error suppression technique digital dynamical decoupling on the QAOA circuits. The QAOA circuits compiled to ibm washington are composed of several thousand circuit instructions, approximately 3, 000 depending on the details of the circuit, making these some the largest quantum circuits ever executed on a digital quantum processor. QAOA and QA are compared against the classical heuristic algorithm of simulated annealing and all problem instances are exactly solved using CPLEX in order to evaluate which samplers, if any, correctly found the ground state solution(s) of the problem instances. We find that (i) QA outperforms QAOA on all problem instances, (ii) QAOA samples the problems better than random sampling, and (iii) QAOA angle computation exhibits clear parameter concentration across the ensemble of Ising models.
127 Qubits↗
Quantum computing and quantum information storage
Quantum storage, transmission, and processing is the future of information technology. Here, the promise of quantum hardware stems from the inherent complexity of an entangled quantum system—the size of the wave-function scales exponentially with the number of particles, whether represented in real space or in a parameter space. In contrast, a classical N-body system can be completely represented by only 6N variables (positions and momenta of all particles). This complexity of quantum systems creates a yet-unsolved challenge of modeling quantum systems by means of classical computing—the curse of dimensionality. Indeed, although we can easily write the Schrödinger equation for any system of interacting nuclei and electrons, we can only solve it exactly on classical computers for very small systems.
97 MATHEMATICS AND COMPUTING↗
Lefschetz thimble quantum Monte Carlo for spin systems
Monte Carlo simulations are useful tools for modeling quantum systems, but in some cases they suffer from a sign problem, leading to an exponential slow down in their convergence to a value. While solving the sign problem is generically NP hard, many techniques exist for mitigating the sign problem in specific cases; in particular, the technique of deforming the Monte Carlo simulation's plane of integration onto Lefschetz thimbles (complex hypersurfaces of stationary phase) has seen significant success in the context of quantum field theories. We extend this methodology to spin systems by utilizing spin coherent state path integrals to reexpress the spin system's partition function in terms of continuous variables. Using some toy systems, we demonstrate its effectiveness at lessening the sign problem in this setting, despite the fact that the initial mapping to spin coherent states introduces its own sign problem. The standard formulation of the spin coherent path integral is known to make use of uncontrolled approximations; despite this, for large spins they are typically considered to yield accurate results, so it is somewhat surprising that our results show significant systematic errors. Furthermore, possibly of independent interest, our use of Lefschetz thimbles to overcome the intrinsic sign problem in spin coherent state path integral Monte Carlo enables a novel numerical demonstration of a breakdown in the spin coherent path integral.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
State preparation of lattice field theories using quantum optimal control
Here, we explore the application of quantum optimal control (QOC) techniques to state preparation of lattice field theories on quantum computers. As a first example, we focus on the Schwinger model, quantum electrodynamics in 1+1 dimensions. We demonstrate that QOC can significantly speed up the ground state preparation compared to gate-based methods, even for models with long-range interactions. Using classical simulations, we explore the dependence on the interqubit coupling strength and the device connectivity, and we study the optimization in the presence of noise. While our simulations indicate potential speedups, the results strongly depend on the device specifications. In addition, we perform exploratory studies on the preparation of thermal states. Our results motivate further studies of QOC techniques in the context of quantum simulations for fundamental physics.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Quantum fluctuations in dense plasma simulations
Molecular dynamics (MD) simulations are a powerful tool for modeling warm and hot dense matter. Density functional theory (DFT) MD simulations are often preferred in dense plasmas in order to accurately model quantum electronic structure. However, DFT-MD simulations neglect interaction effects due to fluctuations in excited states. In this work, we present an MD approach that uses excited state method pseudoatoms to run dense plasma simulations with many different core-electron configurations at classical MD speeds. We also allow for transitions between different configurations in our simulations and find that these fluctuations are especially important for highly excited states. Our results suggest that finite configuration lifetimes that are comparable to the inverse ion plasma frequency need to be accounted for in order to accurately model ion distributions in dense plasma simulations. We also demonstrate that excited state fluctuations have a direct impact on ion plasma microfields, generate different plasma microfields for different excitation levels, and thereby induce absorption–emission line shape asymmetries even in steady-state plasmas.
36 MATERIALS SCIENCE↗