Quantitative validation of quantum simulations of dynamical spin response remains challenging because experiment, classical simulation, and quantum simulation do not produce the same native observables. This problem has become increasingly important as quantum simulation protocols for dynamical response have progressed from theory to hardware-level benchmarking against neutron-scattering data, while the longer term goal is validation in regimes that may eventually become classically intractable, including in future fault-tolerant implementations. Here, we develop a cross-pipeline validation framework for quantum simulation, using inelastic neutron scattering and classical many-body simulation as complementary experimental and computational anchors, based on explicit forward and inverse observable maps, covariance- or resampling-based uncertainty propagation, robustness tests for structured distortion, and a hierarchy of complementary metric families. The framework distinguishes stochastic uncertainty from robustness-induced distortion, carries both explicitly through the comparison chain, and uses the resulting metric-level uncertainty and distortion information to support layered validation at the pipeline, solver, and model levels. We also introduce actuator-aware feedback logic aimed at improving agreement without obscuring the physical origin of any remaining mismatch. We close by outlining future extensions of this methodology, including upstream uncertainty and distortion modeling, adaptive feedback, asymmetric validation beyond full classical benchmarking, fault-tolerant workflows, and community infrastructure for reproducible validation.

Learning on sample-limited data is a challenge frequently encountered in many real-world applications. In this work we study how effective quantum ensemble models are when trained on a sample-limited data problem in healthcare and life sciences. We constructed multiple types of quantum ensembles for binary classification using up to 26 qubits in simulation and 56 qubits on quantum hardware. The ensembles include both variational and non-variational methods as well as introducing a new quantum ensemble cosine classifier with randomly sampled unitaries. Our ensemble designs use minimal trainable parameters but require long-range connections between qubits. We tested these quantum ensembles on synthetic datasets and gene expression data from renal cell carcinoma (RCC) patients with the task of predicting patient response to immunotherapy. From the performance observed in simulation and quantum hardware experiments using up to 56 qubits, we demonstrate how quantum embedding structure affects performance and discuss how to extract informative features and build models that can learn and generalize effectively. We also find that quantum ensemble cosine classifiers were effective in learning from few training data, and all quantum ensembles performed comparatively to classical ensembles while using significantly fewer learners. We confirmed this performance characteristic in a separate RCC validation cohort. We present these exploratory results in order to assist other researchers in the design of effective learning using ensembles, particularly for similarly size constrained problems. Incorporating quantum computing in these data constrained problems offers hope for a wide range of studies in healthcare and life sciences where biological samples are relatively scarce given the feature space to be explored.

The increasing demand for cryogenic electronics in superconducting and quantum computing systems calls for ultra-energy-efficient data conversion architectures that remain functional at deep cryogenic temperatures. In this work, we present the first design of a voltage-controlled superconducting flash analog-to-digital converter (ADC) based on a voltage-controlled quantum-enhanced Josephson junction field-effect transistor (JJFET). Exploiting its strong gate tunability and transistor-like behavior, the JJFET offers a scalable alternative to conventional current-controlled superconducting devices while aligning naturally with CMOS-style design methodologies. Building on our previously developed Verilog-A compact model calibrated to experimental data, we design and simulate a three-bit JJFET-based flash ADC targeted for integration within cryogenic control and readout circuitry in quantum computing. The core comparator block is realized through careful bias current selection and augmented with a three-terminal nanocryotron to precisely define reference voltages. Cascaded JJFET comparators ensure robust voltage gain, cascadability, and logic-level restoration across stages. Simulation results demonstrate accurate quantization behavior with ultra-low power dissipation, underscoring the feasibility of voltage-driven superconducting mixed-signal circuits. This work establishes a critical step toward unifying superconducting logic and data conversion, paving the way for scalable cryogenic architectures in quantum-classical co-processors, low-power artificial intelligence accelerators, and next-generation energy-constrained computing platforms.

Oscillators designed to function at cryogenic temperatures play a critical role in superconducting electronics and quantum computing by providing stable, low-noise signals with minimal energy loss. Here, we present a comprehensive numerical study of injection locking and mutual coupling dynamics in superconducting nanowire (ScNW)-based cryogenic oscillators. Using the design space of a standalone ScNW-based oscillator, we investigate two critical mechanisms that govern frequency synchronization and signal coordination in cryogenic computing architectures: (1) injection locking induced by an external AC signal with a frequency near the oscillator's natural frequency, and (2) the mutual coupling dynamics between two ScNW oscillators under varying coupling strengths. We identify key design parameters-such as shunt resistance, nanowire inductance, and coupling strength-that govern the locking range. Additionally, we examine how the amplitude of the injected signal affects the amplitude of the locked oscillation, offering valuable insights for power-aware oscillator synchronization. Furthermore, we analyze mutual synchronization between coupled ScNW oscillators using capacitive and resistive coupling elements. Our results reveal that the phase difference between oscillators can be controlled by tuning the coupling strength, enabling programmable phase-encoded information processing. These findings could enable building ScNW-based oscillatory neural networks, synchronized cryogenic logic blocks, and on-chip cryogenic resonator arrays.

Two-dimensional materials with multiple degrees of freedom, including spin, valleys, and orbitals, open up an exciting avenue for engineering multifunctional devices. Beyond spintronics, these degrees of freedom can lead to novel quantum effects such as valley-dependent Hall effects and orbital magnetism, which could revolutionize next-generation electronics. However, achieving independent control over valley polarization and orbital magnetism has been a challenge due to the need for large electric fields. A recent breakthrough involving pentalayer rhombohedral graphene has demonstrated the ability to individually manipulate anomalous Hall signals and orbital magnetic hysteresis, forming what is known as a valley-magnetic quartet. Here, we leverage the electrically tunable ferro-valleytricity of pentalayer rhombohedral graphene to develop nonvolatile memory and in-memory computation applications. We propose an architecture for a dense, scalable, and selector-less nonvolatile memory array that harnesses the electrically tunable ferro-valleytricity. In our designed array architecture, nondestructive read and write operations are conducted by sensing the valley state through two different pairs of terminals, allowing for independent optimization of read/write peripheral circuits. The power consumption of our PRG-based array is remarkably low, with only ∼6 nW required per write operation and ∼2.3 nW per read operation per cell. This consumption is orders of magnitude lower than that of the majority of state-of-the-art cryogenic memories. Additionally, we engineer in-memory computation by implementing majority logic operations within our proposed nonvolatile memory array without modifying the peripheral circuitry. Our framework presents a promising pathway toward achieving ultra-dense cryogenic memory and in-memory computation capabilities.

Adiabatic quantum computers can solve difficult optimization problems (e.g., the quadratic unconstrained binary optimization problem), and they seem well suited to train machine learning models. In this paper, we describe an adiabatic quantum approach for training support vector machines. We show that the time complexity of our quantum approach is an order of magnitude better than the classical approach. Next, we compare the test accuracy of our quantum approach against a classical approach that uses the Scikit-learn library in Python across five benchmark datasets (Iris, Wisconsin Breast Cancer (WBC), Wine, Digits, and Lambeq). We show that our quantum approach obtains accuracies on par with the classical approach. Finally, we perform a scalability study in which we compute the total training times of the quantum approach and the classical approach with increasing number of features and number of data points in the training dataset. Our scalability results show that the quantum approach obtains a 3.5--4.5 times speedup over the classical approach on datasets with many (millions of) features.

We present proof of principle results for evaluating an entanglement volumetric benchmark [1] on trapped ion platforms. The benchmark quantifies the robustness of multipartite and bipartite entanglement using stabilizer measurements and witness functions. Each n-qubit graph state is prepared and used to evaluate $n$ state-specific stabilizer strings. These stabilizer measurements are used to evaluate entanglement witness functions. The entanglement benchmark defines families of graph states associated with an initial sub-graph of the hardware qubit connectivity - with all-to-all connectivity, trapped ion systems provide a flexibility in the choice of this initial graph, and this will affect the associated family. In this work, we present results targeting several classes of entangled states: 1) 1-D cluster states, 2) n-qubit GHZ states, and 3) cycle graph states. These states have been found in the literature as standard hardware benchmarks, and have connections to many near-term applications.

We investigate the robustness of quantum neural networks (QNNs) trained as binary classifiers against bit flip and depolarizing noise, two channels that emulate a subset of noise present in noisy intermediate-scale quantum (NISQ) devices. The presence of decoherence and other forms of noise poses significant challenges to classification accuracy. To assess the impact of noise on label extraction, and to evaluate the performance and robustness of our models, we trained three different label assignment methods in the presence of various levels of noise. Each QNN model uses 2 qubits to implement a parameterized model and either the qubits of the QNN, or a set of ancilla qubits are used for label extraction. These three different methods project the state of either a single qubit or multiple qubits onto the computational basis. This generates a probability distribution that is post-processed to assign a class label and a class probability. Each QNN is trained using noisy numerical simulation on a dataset with 2 features. Depolarizing noise channels are interleaved with the parameterized gates of the QNN and we include bit flip error prior to extracting the labels. The noise levels for the depolarizing noise and bit flip error are swept over large ranges of values. We deploy QNNs trained at various noise levels on IBM quantum computers- this introduces an additional source of noise due to SWAP gate noise. We observe that the QNNs trained with simulated noise can have good performance on NISQ hardware.

Quantum Natural Language Processing (QNLP) develops natural language processing (NLP) models for deployment on quantum computers. We explore feature and data prototype selection techniques to address challenges posed by encoding high dimensional features. Our study builds quantum circuit classifiers that includes classical feature pre-processing, quantum embedding and quantum model training. The quantum models are built on 4 or 6 qubits and the quantum neural network (QNN) uses the established bricklayer design. We compare the dependence of model performance (in terms of accuracy and F1 scores) on feature length, embedding gates and parameterized unitary design. We compare the performance of quantum machine learning models to classical convolution neural network model (CNN) on binary and multi-class classification tasks using two datasets of synthetic features and labels. The first is the ECP-CANDLE P3B3 dataset a corpus of synthetically generated cancer pathology reports. The second dataset is extracted from well-known benchmark dataset (MADELON) - features are generated with a combination of informative, repeated and uninformative features. Both datasets are used for binary classification and multi-class classification with 3 classes. We observe robust, accurate performance from all models on the binary classification tasks, but multiclass classification is a challenge for the quantum models-there is a notable decrease in accuracy when using 3 classes. Overall the performance is comparable in terms of recall and accuracy between QNNs and CNNs, even with large datasets. These results provide a point of comparison between quantum and classical models on real-world datasets.

In machine learning, overparameterization is associated with qualitative changes in the empirical risk landscape, which can lead to more efficient training dynamics. For many parameterized models used in statistical learning, there exists a critical number of parameters, or model size, above which the model is constructed and trained in the overparameterized regime. There are many characteristics of overparameterized loss landscapes. The most significant is the convergence of standard gradient descent to global or local minima of low loss. In this work, we study the onset of overparameterization transitions for quantum circuit Born machines, generative models that are trained using non-adversarial gradient-based methods. We observe that bounds based on numerical analysis are in general good lower bounds on the overparameterization transition. However, bounds based on the quantum circuit's algebraic structure are very loose upper bounds. Our results indicate that fully understanding the trainability of these models remains an open question.

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

Some of the biggest achievements of the modern era of particle physics, such as the discovery of the Higgs boson, have been made possible by the tremendous effort in building and operating large-scale experiments like the Large Hadron Collider or the Tevatron. In these facilities, the ultimate theory to describe matter at the most fundamental level is constantly probed and verified. These experiments often produce large amounts of data that require storing, processing, and analysis techniques that often push the limits of traditional information processing schemes. Thus, the High-Energy Physics (HEP) field has benefited from advancements in information processing and the development of algorithms and tools for large datasets. More recently, quantum computing applications have been investigated in an effort to understand how the community can benefit from the advantages of quantum information science. In this manuscript, we provide an overview of the state-of-the-art applications of quantum computing to data analysis in HEP, discuss the challenges and opportunities in integrating these novel analysis techniques into a day-to-day analysis workflow, and whether there is potential for a quantum advantage.