Search NASA⌕ Search

SEARCH · Search NASA

Results for “classical simulation”

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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Classic and Quantum Task-Based Intelligent Runtime for QIRs Running on Multiple QPUs

High-performance computing systems are rapidly evolving into heterogeneous platforms that fuse quantum accelerators with traditional classical processing units (CPUs) and graphical processing units (GPUs). This convergence calls for runtimes capable of managing both classical and quantum workloads in a unified manner. We introduce an intelligent, task-based runtime that marries the Intelligent RuntIme System (IRIS) asynchronous scheduler with a quantum programming stack through the Quantum Intermediate Representation Execution Engine (QIR-EE). Our design allows programs written in the quantum intermediate representation (QIR) to be dispatched concurrently to a variety of back-ends, including multiple quantum simulators and nascent quantum processors, enabling genuine hybrid execution on a single node. To illustrate its practicality, we partition a 4-qubit and 20-qubit circuit into three sub-circuits using quantum circuit cutting via the QCut library. Each sub-circuit is simulated independently by the QIR-EE driver within IRIS, after which a classical post-processing step merges the simulation results to recover the outcome of the original full-circuit computation. This case study demonstrates how finer task granularity can enable the parallel execution and lower the simulation burden per quantum task while preserving overall accuracy, highlighting the feasibility of our hybrid approach.

Miniskar, Narasinga Rao [ORNL] (ORCID:000000018259↗
DOE OSTI2024

On the statistical theory of self-gravitating collisionless dark matter flow: Scale and redshift variation of velocity and density distributions

The statistics of velocity and density fields are crucial for cosmic structure formation and evolution. Here, this paper extends our previous work on the two-point second-order statistics for the velocity field [Phys. Fluids 35, 077105 (2023)] to one-point probability distributions for both density and velocity fields. The scale and redshift variation of density and velocity distributions are studied by a halo-based non-projection approach. First, all particles are divided into halo and out-of-halo particles so that the redshift variation can be studied via generalized kurtosis of distributions for halo and out-of-halo particles, respectively. Second, without projecting particle fields onto a structured grid, the scale variation is analyzed by identifying all particle pairs on different scales $r$. We demonstrate that: (i) Delaunay tessellation can be used to reconstruct the density field. The density correlation, spectrum, and dispersion functions were obtained, modeled, and compared with the N-body simulation; (ii) the velocity distributions are symmetric on both small and large scales and are non-symmetric with a negative skewness on intermediate scales due to the inverse energy cascade on small scales with a constant rate $\varepsilon_u$; (iii) On small scales, the even order moments of pairwise velocity $\Delta u_L$ follow a two-thirds law $\propto{(-\varepsilon_ur)}^{2/3}$, while the odd order moments follow a linear scaling $\langle(\Delta u_L)^{2n+1}\rangle=(2n+1)\langle(\Delta u_L)^{2n}\rangle\langle\Delta u_L\rangle\propto{r}$; (iv) The scale variation of the velocity distributions was studied for longitudinal velocities $u_L$ or $u_L^{'}$, pairwise velocity (velocity difference) $\Delta u_L$=$u_L^{'}$-$u_L$ and velocity sum $\Sigma u_L$=$u^{'}_L$+$u_L$. Fully developed velocity fields are never Gaussian on any scale, despite that they can initially be Gaussian; (v) On small scales, $u_L$ and $\Sigma u_L$ can be modeled by a $X$ distribution to maximize the entropy of the system. The distribution of $\Delta u_L$ can be different; (vi) On large scales, $\Delta u_L$ and $\Sigma u_L$ can be modeled by a logistic or a $X$ distribution, while $u_L$ has a different distribution; (vii) the redshift variation of the velocity distributions follows the evolution of the $X$ distribution involving a shape parameter $\alpha(z)$ decreasing with time.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Scalable quantum simulations of scattering in scalar field theory on 120 qubits

Simulations of collisions of fundamental particles on a quantum computer are expected to have an exponential advantage over classical methods and promise to enhance searches for new physics. Furthermore, scattering in scalar field theory has been shown to be bounded-error quantum polynomial time (BQP) complete, making it a representative problem for which quantum computation is efficient. As a step toward large-scale quantum simulations of collision processes, scattering of wave packets in one-dimensional scalar field theory is simulated using 120 qubits of IBM’s Heron superconducting quantum computer ibm_fez. Variational circuits compressing vacuum preparation, wave packet initialization, and time evolution are determined using classical resources. By leveraging physical properties of states in the theory, such as symmetries and locality, the variational quantum algorithm constructs scalable circuits that can be used to simulate arbitrarily large system sizes. A new strategy is introduced to mitigate errors in quantum simulations, which enables the extraction of meaningful results from circuits with up to 4924 two-qubit gates and two-qubit gate depths of 103. The effect of interactions is clearly seen, and is found to be in agreement with classical matrix product state simulations. Finally, the developments that will be necessary to simulate high-energy inelastic collisions on a quantum computer are discussed.

quantum circuits↗
DOE OSTI2025

Barrierless nucleation in glassy precursors drives zeolite formation

Zeolites are crystalline, microporous silicates widely used in catalysis and separations, yet the molecular mechanisms of their formation remain unresolved. Experiments indicate that hydrothermal synthesis of silica zeolites from clear solution proceeds through amorphous nanoaggregates that gradually develop zeolite order in an apparently continuous amorphous to crystal transformation. Here, we combine molecular simulations with advanced algorithms that identify zeolite order and computer vision to elucidate the pathway from clear solution to zeolite nanocrystal. We show that at conditions of hydrothermal synthesis of silica zeolites, the transformation of precursor aggregate into zeolite is not limited by nucleation barriers but by the slow dynamics of reorganization in the glassy precursor matrix. The negligible nucleation barriers result in spinodal-like crystallization that leads to a gradual formation of a mosaic of small crystallites that explain the seemingly continuous character of zeolite crystallization and the catalytic activity of X-ray amorphous, protozeolites and embryonic zeolites. We find that zeolite-like porosity and short-range order emerge early within glassy precursors, well before crystallinity is detected in transmission electron microscopy (TEM) images or X-ray diffraction. The nanoaggregate’s temperature-size phase diagram reveals a convergence of the zeolite–amorphous equilibrium and maximum crystallization rate at ~3 nm diameter nanoparticle diameters and ~200 °C. This convergence signals the termination of the first-order amorphous-to-zeolite transition. Our results provide a unifying framework for understanding nucleation of silica zeolites from solution and suggest that barrierless nucleation may govern the formation of other nanoparticle systems, including minerals and oxides synthesized far below their bulk melting points.

36 MATERIALS SCIENCE↗
DOE OSTI2025

General relativistic hydrodynamic simulations of binary strange star mergers

We perform fully general-relativistic simulations of binary strange star mergers considering two different approaches for thermal effects. The first uses a cold equation of state (EOS) derived from a modified version of the MIT bag model which is then supplemented by a Γ-law correction. The second approach employs a microphysical description of the finite-temperature effects. We describe results obtained with the two treatments, highlighting the influence of thermal effects. We find that the postmerger dynamics differs significantly in the two cases, leading to quantitative differences in the postmerger gravitational-wave spectrum and ejecta mass. The peak frequency of the postmerger gravitational-wave emission is consistent with the established quasi-universal relations for binary neutron star mergers and as a result, our simulations cannot distinguish between mergers of neutron stars and those of strange stars. Our models with realistic treatment of finite-temperature effects produce a significant amount of ejecta ≳0.02 M ⊙ ​. Here, the resulting flux of strangelets near the Earth, computed assuming that all neutron star mergers are in fact strange-stars mergers and that the binary considered here is representative, is in tension with experimental upper limits. As such, our results tentatively disfavor a scenario in which strange-quark matter is the lowest energy state of matter.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

The Effect of Large-scale Magnetic Fluctuations on Energetic Particle Profiles across Interplanetary Shocks

In situ observations of energetic particles associated with interplanetary (IP) shocks, known as energetic storm particle (ESP) events, often show time-intensity profiles quite different from predictions of classical diffusive shock acceleration theory. We use numerical simulations, including test-particle simulations and hybrid simulations (with fluid electrons and kinetic protons) for shocks propagating into a turbulent magnetic field to study the ESP intensity-time profiles across a strong IP shock. We find that several types of energetic particle intensity profiles similar to in situ observations can be produced in our simulations. The peak of energetic particle count is often near, but can be shifted from, the locations of the shock front, with the peak usually being observed downstream of the shock. These findings may help understand particle acceleration at both traveling IP shocks and shocks in other heliospheric and astrophysical environments.

Lo, Ming-Yuan [New Mexico Consortium (NMC), Los Al↗
DOE OSTI2026

Strong-Drive Limits in Josephson Circuits: From Chaos to an Unbound-Resonance Threshold

Strong microwave drives enable fast measurement and parametric control in superconducting circuits but can induce transitions out of the intended low-energy manifold. We develop a unified description of strong-drive limits in flux- and charge-driven Josephson circuits across drive frequency and dc flux bias. Using classical phase-space analysis and Floquet--Markov simulations, we identify distinct low- and high-frequency mechanisms. At low frequency, we characterize bound-state resonances and separatrix chaos and find that the flux-drive chaos threshold depends strongly on dc flux bias. At high frequency, these mechanisms are suppressed, and the dissipative steady state transfers from the central bound-state sector to outer resonances formed by above-barrier running trajectories. The resulting unbound-resonance threshold is nearly independent of drive frequency and circuit parameters over the regime studied and is controlled primarily by dc flux bias. Coherent simulations show that parametric operation persists beyond this threshold, but at a reduced rate, setting an effective upper bound on the achievable operation speed. We derive analytical criteria for both thresholds, validate them numerically, and experimentally confirm the predicted dc-bias dependence of the low-frequency threshold in a flux-driven SQUID. We also determine the timescales for transfer into the unbound-resonance regime and relaxation back to the bound-state manifold after the drive is removed. Finally, we relate the stability limits to a complementary picture based on the junction critical current and extend the framework to multitone drives and inductively shunted circuits. Together, these results identify the mechanisms limiting strong driving and suggest routes to extend the stable operating range of Josephson circuits.

You, Xinyuan [Fermilab] (ORCID:0000000291789419)↗
DOE OSTI2025

Parallel-in-time quantum simulation via Page and Wootters quantum time

In the past few decades, researchers have created a veritable zoo of quantum algorithms by drawing inspiration from classical computing, information theory, and even from physical phenomena. Here, we present quantum algorithms for parallel-in-time simulations that are inspired by the Page and Wootters formalism. In this framework, and thus in our algorithms, the classical time variable of quantum mechanics is promoted to the quantum realm by introducing a Hilbert space of “clock” qubits that are then entangled with the “system” qubits. We show that our algorithms can compute temporal properties over 𝑁 different times of many-body systems by only using log⁡(𝑁) clock qubits. As such, we achieve an exponential trade-off between time and spatial complexities. In addition, we rigorously prove that the entanglement created between the system qubits and the clock qubits has operational meaning, as it encodes valuable information about the system’s dynamics. We also provide a circuit depth estimation of all the protocols, showing a running time advantage in computation times over traditional sequential-in-time algorithms. In particular, for the case when the dynamics are determined by the Aubry-Andre model, we present a hybrid method for which our algorithms have a depth that only scales as 𝒪⁡(log⁡(𝑁)⁢𝑛). As a by-product, we can relate the previous schemes to the problem of equilibration of an isolated quantum system, thus indicating that our framework enables a new dimension for studying dynamical properties of many-body systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Insights into the Properties of MXenes and MXene Analogs from Atomistic Simulation

We review the properties that have been predicted for MXenes and MXene analogs from computational simulation with a focus on structural and electronic properties, energy storage, and ion transport. Methods considered range from quantum mechanical approaches to classical molecular dynamics. We conclude by reviewing current limitations and outstanding questions for simulation and MXene properties that have been little explored to-date.

Muraleedharan, Murali Gopal↗
DOE OSTI2025

Programmable simulations of molecules and materials with reconfigurable quantum processors

Simulations of quantum chemistry and quantum materials are believed to be among the most important applications of quantum information processors. However, realizing practical quantum advantage for such problems is challenging because of the prohibitive computational cost of programming typical problems into quantum hardware. Here we introduce a simulation framework for strongly correlated quantum systems represented by model spin Hamiltonians that uses reconfigurable qubit architectures to simulate real-time dynamics in a programmable way. Our approach also introduces an algorithm for extracting chemically relevant spectral properties via classical co-processing of quantum measurement results. We develop a digital–analogue simulation toolbox for efficient Hamiltonian time evolution using digital Floquet engineering and hardware-optimized multi-qubit operations to accurately realize complex spin–spin interactions. As an example, we propose an implementation based on Rydberg atom arrays. In addition, we show how detailed spectral information can be extracted from the dynamics through snapshot measurements and single-ancilla control, enabling the evaluation of excitation energies and finite-temperature susceptibilities from a single dataset. To illustrate the approach, we show how to use the method to compute key properties of a polynuclear transition-metal catalyst and two-dimensional magnetic materials.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2025

Sheath transitions in a cylindrical filament discharge: Axisymmetric 1D3V PIC-MCC simulations

We present the first nonplanar hot cathode discharge simulations that capture the role of the trapped-ions plasma, elucidating new phenomena unobservable in planar geometric discharges. A discharge struck between a single emitting wire filament cathode and a bounding anode is simulated in cylindrical geometry using an axisymmetric (radial) particle-in-cell Monte-Carlo collisions code. Operating the discharge near its ionization energy threshold can lead to the formation of a two plasma mode (TPM). One plasma forms in the conventional upstream region through electron impact ionization of background neutrals. A second plasma, whose global effect on the discharge was not previously well understood, forms downstream through the trapping of cold ions in the potential well of the filament’s virtual cathode, a process enabled by ion-neutral charge exchange collisions. Three space charge regions intersperse the electrode gap—an emissive sheath between the cathode filament and trapped-ions plasma, a double layer between the two plasmas, and a classical sheath between the upstream plasma and the outer anode. Simulations exhibit mode transitions and quenching instabilities that transform the discharge between the TPM and other single-plasma sheath modes that include classical (temperature-limited), space charge limited, and inverse (anode glow) modes. The transitions are explained via “aid-and-compete” dynamics wherein the growth of one plasma enhances growth in the other while concurrently exhibiting expansion dynamics antagonistic to each other. The system exhibits strong hysteresis memory during the mode transitions. Improved understanding and control of these sheath mode transitions are expected to benefit plasma applications with hot cathodes.

Electrical hysteresis↗
DOE OSTI2025

Quantum AI Based Enhanced Detection of Dementia

Quantum computing has the potential to significantly improve the early detection of Alzheimer's Disease and Related Dementias (ADRD). Quantum-enhanced machine learning can be used to perform an early screening of Alzheimer's disease using brain imaging data based on dataset of MRI scans from both healthy individuals and those diagnosed with Alzheimer's. This study aims to demonstrate the potential of quantum transfer learning to enhance the performance of the classical deep learning model for dementia detection. Using the MRI sagittal images available in the OASIS-2 (64 demented and 72 non-demented subjects between 60 and 96 years), we show how quantum techniques can transform a suboptimal classical model into a more effective solution for dementia detection, highlighting their potential impact on advancing healthcare technology. We begin with a simple classical deep learning model with a significantly smaller number of parameters, which gives suboptimal performance on the problem. Then, we apply different configurations of quantum transfer learning based on the pre-trained weak classifier (Figure 1). We fix the weak classifier's initial convolutional layers at their fixed pre-trained parameters and replace the last set of dense layers with a dressed quantum circuit (DQN), which we train to enhance performance. We performed 4-fold cross-validation for both the classical and the hybrid quantum models and trained them using Pennylane's `default.qubit' simulator and IonQ's Aria-1 simulator (noisy simulation). We showed that with significantly fewer parameters, the quantum transfer learning-based hybrid models showed significant performance enhancement over the base weak classical deep learning model for dementia detection. To classify between a demented and non-demented subject, the accuracy of quantum-based AI methods improved by 6 to 14% compared to classical methods. The sensitivity of the models improved by 4 to 17%. This shows that there are fewer chances of misclassifying demented patients. Figure 2 compares the performance of the hybrid quantum models and their base classical model, and Table 1 summarizes the results. We illustrated that with assistance from quantum machine learning, it is possible to enhance detection for dementia based on brain images. This shows the potential for practical utility of quantum computing in ADRD research.

Bhowmik, Sounak [University of Tennessee, Knoxvill↗
DOE OSTI2025

A quantum eigenvalue solver based on tensor networks

Electronic ground states are of central importance in chemical simulations, but have remained beyond the reach of efficient classical algorithms except in cases of weak electron correlation or one-dimensional spatial geometry. We introduce a hybrid quantum-classical eigenvalue solver that constructs a wavefunction ansatz from a linear combination of matrix product states in rotated orbital bases, enabling the characterization of strongly correlated ground states with arbitrary spatial geometry. The energy is converged via a gradient-free generalized sweep algorithm based on quantum subspace diagonalization, with a potentially exponential speedup in the off-diagonal matrix element contractions upon translation into compact quantum circuits of linear depth in the number of qubits. Chemical accuracy is attained in numerical experiments for both a stretched water molecule and an octahedral arrangement of hydrogen atoms, achieving substantially better correlation energies compared to a unitary coupled-cluster benchmark, with orders of magnitude reductions in quantum resource estimates and a surprisingly high tolerance to shot noise. This proof-of-concept study suggests a promising new avenue for scaling up simulations of strongly correlated chemical systems on near-term quantum hardware.

chemistry↗
DOE OSTI2025

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

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

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

From Nonclassical to Classical: Crystallization Seeds Reshape Nucleation Mechanisms

Crystalline seeds are widely employed in crystallization to accelerate nucleation and control product polymorphs; yet, their impact on nucleation mechanisms remains poorly understood. While homogeneous nucleation of crystals from solution often proceeds through nonclassical pathways involving amorphous intermediates, it is unclear how seeds that promote heterogeneous nucleation reshape these mechanisms and govern polymorph selection. Here, in this study, we provide the first direct evidence that crystalline seeds can bypass the need for amorphous intermediates as nucleation sites, converting nonclassical nucleation mechanisms into classical, monomer-by-monomer crystallization pathways. Using molecular dynamics simulations of zeolite synthesis, we uncover a complex reaction network of competing nucleation processes mediated by intermediate interfacial polymorphs. The interplay between thermodynamic stability and kinetic favorability of these interfacial polymorphs dictates nucleation outcomes, creating a dynamic balance between the interfacial polymorph stability and crystallization rates. Furthermore, we show that the synthesis environment-whether monomers or aggregates serve as reactants-profoundly impacts these pathways. At moderate supersaturation, seeds eliminate amorphous intermediates and promote classical nucleation, whereas high supersaturation or aggregate-based reactants favor nonclassical pathways, even in the presence of seeds. These findings establish a general framework for understanding how seeds govern crystallization mechanisms, with broad implications for controlling nucleation kinetics, polymorph selection, and material properties. While focused on zeolites, this work reveals insights that may be applicable to biominerals, pharmaceuticals, functional materials, and catalysts, providing a basis for engineering crystallization pathways in diverse applications.

Chu-Jon, Carlos [Univ. of Utah, Salt Lake City, UT↗
DOE OSTI2025

Potential quantum advantage for simulation of fluid dynamics

Numerical simulation of turbulent fluid dynamics needs to either parametrize turbulence—which introduces large uncertainties—or explicitly resolve the smallest scales—which is prohibitively expensive. Here, we provide evidence through analytic bounds and numerical studies that a potential quantum speedup can be achieved to simulate fluid dynamics using quantum computing. Specifically, we provide a lattice Boltzmann formulation of fluid dynamics for which we give evidence that low-order Carleman linearization is much more accurate than previously believed for these systems. This is achieved via a combination of reformulating the Navier-Stokes nonlinearity (u·$\triangledown$u) to lattice-Boltzmann nonlinearity (u 2 ) and accurately linearizing the dynamical equations, which effectively trades nonlinearity for additional degrees of freedom that add negligible expense in the quantum solver. Based on this, we apply a quantum algorithm for simulating the Carleman-linearized lattice Boltzmann equation and provide evidence that its cost scales logarithmically with system size compared with polynomial scaling in the best known classical algorithms. In this paper, we suggest that a quantum advantage may exist for simulating fluid dynamics, paving the way for simulating nonlinear multiscale transport phenomena in a wide range of disciplines using quantum computing.

42 ENGINEERING↗
DOE OSTI2024

A B-spline based gradient-enhanced micropolar implicit material point method for large localized inelastic deformations

The quasi-brittle response of cohesive-frictional materials in numerical simulations is commonly represented by softening plasticity or continuum damage models, either individually or in combination. However, classical models, particularly when coupled with non-associated plasticity, often suffer from ill-posedness and a lack of objectivity in numerical simulations. Moreover, the performance of the finite element method significantly degrades in simulations involving finite strains when mesh distortion reaches excessive levels. This represents a challenge for modeling cohesive-frictional materials, given their tendency to experience strongly localized deformations, such as those occurring during shear band dominated failure. Hence, accurate modeling of the response of cohesive-frictional solids is a demanding task. To address these challenges, we present an extension of the material point method (MPM) for the unified gradient-enhanced micropolar continuum, aiming at the analysis of finite localized inelastic deformations in cohesive-frictional materials. The generalized gradient-enhanced micropolar continuum formulation is employed to tackle challenges related to localization and softening material behavior, while the MPM addresses issues arising from excessive deformations. The method utilizes a B-spline formulation for the rigid background mesh to mitigate the well-known cell crossing errors of the MPM. To demonstrate the performance of the method, 2D and 3D numerical studies on localized failure in sandstone in plane strain compression and triaxial extension tests are presented. A comparison with finite element results confirms the suitability of the formulation. Moreover, an efficient numerical implementation of the formulation is presented, and it is demonstrated that the additional MPM specific overhead is negligible.

B-spline↗
DOE OSTI2025

Towards large-scale quantum optimization solvers with few qubits

Quantum computers hold the promise of more efficient combinatorial optimization solvers, which could be game-changing for a broad range of applications. However, a bottleneck for materializing such advantages is that, in order to challenge classical algorithms in practice, mainstream approaches require a number of qubits prohibitively large for near-term hardware. Here we introduce a variational solver for MaxCut problems over $m={{\mathcal{O}}}({n}^{k})$ binary variables using only n qubits, with tunable k > 1. The number of parameters and circuit depth display mild linear and sublinear scalings in m , respectively. Moreover, we analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature. Altogether, this leads to high quantum-solver performances. For instance, for m = 7000, numerical simulations produce solutions competitive in quality with state-of-the-art classical solvers. In turn, for m = 2000, experiments with n = 17 trapped-ion qubits feature MaxCut approximation ratios estimated to be beyond the hardness threshold 0.941. Our findings offer an interesting heuristics for quantum-inspired solvers as well as a promising route towards solving commercially-relevant problems on near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗