Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum benchmarking”

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 163 records · Page 9

A full-configuration-interaction nuclear orbital approach and application for small doped He clusters

An efficient full-configuration-interaction 'nuclear orbital' treatment was developed as a benchmark quantum-chemistry-like method to calculate, ground and excited, fermionic 'solvent' wave-functions and applied to {sup 3}He{sub N} clusters with atomic or molecular impurities [J. Chem. Phys. (Communication) 125, 221101 (2006)]. The main difficulty in handling doped {sup 3}He{sub N} clusters lies in the Fermi-Dirac nuclear statistics, the wide amplitudes of the He-dopant and He-He motions, and the hard-core He-He interaction at short distances. This paper overviews the theoretical approach and its recent applications to energetic, structural and spectroscopic aspects of different dopant-{sup 3}He{sub N} clusters. Preliminary results by using the latest version of the FCI-NO computational implementation, to bosonic Cl{sub 2}(X)-({sup 4}He){sub N} clusters, are also shown.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Benchmarking a neutral-atom quantum computer

In this study, we simulated the algorithmic performance of a small neutral atom quantum computer and compared its performance when operating with all-to-all versus nearest-neighbor connectivity. This comparison was made using a suite of algorithmic benchmarks developed by the Quantum Economic Development Consortium. Circuits were simulated with a noise model consistent with experimental data from [Nature 604, 457 (2022)]. We find that all-to-all connectivity improves simulated circuit fidelity by [Formula: see text]–[Formula: see text], compared to nearest-neighbor connectivity.

Computer Science↗

Benchmarking characterization methods for noisy quantum circuits

Effective methods for characterizing the noise in quantum computing devices are essential for programming and debugging circuit performance. Existing approaches vary in the information obtained as well as the amount of quantum and classical resources required, with more information generally requiring more resources. Here we benchmark the characterization methods of gate set tomography, Pauli channel noise reconstruction, and empirical direct characterization for developing models that describe noisy quantum circuit performance on a 27-qubit superconducting transmon device. We evaluate these models by comparing the accuracy of noisy circuit simulations with the corresponding experimental observations. Here, we find that the agreement of noise model to experiment does not correlate with the information gained by characterization and that the underlying circuit strongly influences the best choice of characterization approach. Empirical direct characterization scales best of the methods we tested and produced the most accurate characterizations across our benchmarks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal Realization of Yang–Baxter Gate on Quantum Computers

Quantum computers provide a promising method to study the dynamics of many-body systems beyond classical simulation. On the other hand, the analytical methods developed and results obtained from the integrable systems provide deep insights on the many-body system. Quantum simulation of the integrable system not only provides a valid benchmark for quantum computers but is also the first step in studying integrable-breaking systems. The building block for the simulation of an integrable system is the Yang–Baxter gate. It is vital to know how to optimally realize the Yang–Baxter gates on quantum computers. Based on the geometric picture of the Yang–Baxter gates, the optimal realizations of two types of Yang–Baxter gates with a minimal number of controlled NOT (CNOT) or gates are presented. It is also shown how to systematically realize the Yang–Baxter gates via the pulse control. The different realizations on IBM quantum computers are tested and compared. It is found that the pulse realizations of the Yang–Baxter gates always have a higher gate fidelity compared to the optimal CNOT or realizations. On the basis of the above optimal realizations, the simulation of the Yang–Baxter equation on quantum computers is demonstrated. Finally, these results provide a guideline and standard for further experimental studies based on the Yang–Baxter gate.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Benchmarking embedded chain breaking in quantum annealing*

Quantum annealing solves combinatorial optimization problems by finding the energetic ground states of an embedded Hamiltonian. However, quantum annealing dynamics under the embedded Hamiltonian may violate the principles of adiabatic evolution and generate excitations that correspond to errors in the computed solution. Here we empirically benchmark the probability of chain breaks and identify sweet spots for solving a suite of embedded Hamiltonians. We further correlate the physical location of chain breaks in the quantum annealing hardware with the underlying embedding technique and use these localized rates in a tailored post-processing strategies. Our results demonstrate how to use characterization of the quantum annealing hardware to tune the embedded Hamiltonian and remove computational errors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Simulation of an Open System: A Dissipative 1+1D Ising Model

The 1+1D Ising model is an ideal benchmark for quantum algorithms, as it is very well understood theoretically. This is true even when expanding the model to include complex coupling constants. In this work, we implement quantum algorithms designed for the simulation of open or complex coupling quantum field theories on IBM devices with a focus on the measurement of the Lee-Yang edge singularity. This feature corresponds (at large volumes) to a phase transition, and our successful reproduction of the transition represents a non-trivial test for current hardware and its ability to distinguish features of interest in quantum field theories.

Gustafson, Erik↗

QCalEval: Benchmarking Vision-Language Models for Quantum Calibration Plot Understanding

Quantum computing calibration depends on interpreting experimental data, and calibration plots provide the most universal human-readable representation for this task, yet no systematic evaluation exists of how well vision-language models (VLMs) interpret them. We introduce QCalEval, the first VLM benchmark for quantum calibration plots: 243 samples across 87 scenario types from 22 experiment families, spanning superconducting qubits and neutral atoms, evaluated on six question types in both zero-shot and in-context learning settings. The best general-purpose zero-shot model reaches a mean score of 72.3, and many open-weight models degrade under multi-image in-context learning, whereas frontier closed models improve substantially. A supervised fine-tuning ablation at the 9-billion-parameter scale shows that SFT improves zero-shot performance but cannot close the multimodal in-context learning gap. As a reference case study, we release NVIDIA Ising Calibration 1, an open-weight model based on Qwen3.5-35B-A3B that reaches 74.7 zero-shot average score.

Cao, Shuxiang↗

Ab initio molecular dynamics with noisy forces: Validating the quantum Monte Carlo approach with benchmark calculations of molecular vibrational properties

We present a systematic study of a recently developed ab initio simulation scheme based on molecular dynamics and quantum Monte Carlo. In this approach, a damped Langevin molecular dynamics is employed by using a statistical evaluation of the forces acting on each atom by means of quantum Monte Carlo. This allows the use of an highly correlated wave function parametrized by several variational parameters and describing quite accurately the Born-Oppenheimer energy surface, as long as these parameters are determined at the minimum energy condition. However, in a statistical method both the minimization method and the evaluation of the atomic forces are affected by the statistical noise. In this work, we study systematically the accuracy and reliability of this scheme by targeting the vibrational frequencies of simple molecules such as the water monomer, hydrogen sulfide, sulfur dioxide, ammonia, and phosphine. We show that all sources of systematic errors can be controlled and reliable frequencies can be obtained with a reasonable computational effort. This work provides convincing evidence that this molecular dynamics scheme can be safely applied also to realistic systems containing several atoms.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Statistical analysis on random quantum circuit sampling by Sycamore and Zuchongzhi quantum processors

Random quantum circuit sampling, a task to sample bit strings from a random quantum circuit, is considered a suitable benchmark task to demonstrate the outperformance of quantum computers even with noisy qubits. Recently, random quantum circuit sampling was performed on the Sycamore quantum processor with 53 qubits [Nature (London) 574, 505 (2019)] and on the Zuchongzhi quantum processor with 56 qubits [Phys. Rev. Lett. 127, 180501 (2021)]. Here, we analyze and compare the statistical properties of the outputs of the random quantum circuit sampling by the Sycamore and Zuchongzhi processors. Using the Marchenko-Pastur law of random matrices of bit strings and the Wasssertein distances between bit strings, we find that the statistical properties of Sycamore bit strings are quite different from those of Zuchongzhi bit strings, while both processors score similar values of linear cross-entropy fidelity for random circuit sampling. Some bit strings sampled by the Zuchongzhi processor pass the NIST random number tests while both Sycamore and Zuchongzhi processors show similar patterns in the heat maps of bit strings. Zuchongzhi bit strings are much closer to classical uniform random bits than those of Sycamore. It is shown that the statistical properties of bit strings of both random quantum circuits change little as the depth of the random quantum circuits increases. Our findings raise a question about the computational reliability of noisy quantum processors because two quantum processors with similar noise levels and similar qubit structures produced statistically different outputs for the same random quantum circuit sampling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Posiform planting: generating QUBO instances for benchmarking

We are interested in benchmarking both quantum annealing and classical algorithms for minimizing quadratic unconstrained binary optimization (QUBO) problems. Such problems are NP-hard in general, implying that the exact minima of randomly generated instances are hard to find and thus typically unknown. While brute forcing smaller instances is possible, such instances are typically not interesting due to being too easy for both quantum and classical algorithms. In this contribution, we propose a novel method, called posiform planting , for generating random QUBO instances of arbitrary size with known optimal solutions, and use those instances to benchmark the sampling quality of four D-Wave quantum annealers utilizing different interconnection structures (Chimera, Pegasus, and Zephyr hardware graphs) and the simulated annealing algorithm. Posiform planting differs from many existing methods in two key ways. It ensures the uniqueness of the planted optimal solution, thus avoiding groundstate degeneracy, and it enables the generation of QUBOs that are tailored to a given hardware connectivity structure, provided that the connectivity is not too sparse. Posiform planted QUBOs are a type of 2-SAT boolean satisfiability combinatorial optimization problems. Our experiments demonstrate the capability of the D-Wave quantum annealers to sample the optimal planted solution of combinatorial optimization problems with up to 5, 627 qubits.

97 MATHEMATICS AND COMPUTING↗

Quapprox: A Framework for Benchmarking the Approximability of Variational Quantum Circuit

Most of the existing quantum neural network models, such as variational quantum circuits (VQCs), are limited in their ability to explore the non-linear relationships in input data. This gradually becomes the main obstacle for it to tackle realistic applications, such as natural language processing, medical image processing, and wireless communications. Recently, there have emerged research efforts that enable VQCs to perform non-linear operations. However, it is still unclear on the approximability of a given VQC (i.e., the order of non-linearity that can be handled by a specified design). In response to this issue, we developed an automated tool designed to benchmark the approximation of a given VQC. The proposed tool will generate a set of synthetic datasets with different orders of non-linearity and train the given VQC on these datasets to estimate their approximability. Our experiments benchmark VQCs with different designs, where we know their theoretic approximability. We then show that the proposed tool can precisely estimate the approximability, which is consistent with the theoretic value, indicating that the proposed tool can be used for benchmarking the approximability of a given quantum circuit for learning tasks.

artificial intelligence↗

Three attractively interacting fermions in a harmonic trap: Exact solution, ferromagnetism, and high-temperature thermodynamics

Three fermions with strongly repulsive interactions in a spherical harmonic trap constitute the simplest nontrivial system that can exhibit the onset of itinerant ferromagnetism. Here, we present exact solutions for three trapped, attractively interacting fermions near a Feshbach resonance. We analyze energy levels on the upper branch of the resonance where the atomic interaction is effectively repulsive. When the s-wave scattering length a is sufficiently positive, three fully polarized fermions are energetically stable against a single spin-flip, indicating the possibility of itinerant ferromagnetism, as inferred in the recent experiment. We also investigate the high-temperature thermodynamics of a strongly repulsive or attractive Fermi gas using a quantum virial expansion. The second and third virial coefficients are calculated. The resulting equations of state can be tested in future quantitative experimental measurements at high temperatures and can provide a useful benchmark for quantum Monte Carlo simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimized low-depth quantum circuits for molecular electronic structure using a separable-pair approximation

We present a classically tractable model that leads to optimized low-depth quantum circuits leveraging separable-pair approximations. The obtained circuits are well suited as a baseline circuit for emerging quantum hardware and can, in the long term, provide significantly improved initial states for quantum algorithms. The associated wave functions can be represented with linear memory requirement, which allows classical optimization of the circuits and naturally defines a minimum benchmark for quantum algorithms. In this work we employ directly determined pair-natural orbitals within a basis-set-free approach. This leads to accurate representation of the one- and many-body parts for weakly correlated systems and we explicitly illustrate how the model can be integrated into other quantum algorithms for stronger correlated systems.

74 ATOMIC AND MOLECULAR PHYSICS↗

Error-mitigated data-driven circuit learning on noisy quantum hardware

Application-level benchmarks measure how well a quantum device performs meaningful calculations. In the case of parameterized circuit training, the computational task is the preparation of a target quantum state via optimization over a loss landscape. This is complicated by various sources of noise, fixed hardware connectivity, and generative modeling, the choice of target distribution. Gradient-based training has become a useful benchmarking task for noisy intermediate-scale quantum computers because of the additional requirement that the optimization step uses the quantum device to estimate the loss function gradient. In this work, we use gradient-based data-driven circuit learning to qualitatively evaluate the performance of several superconducting platform devices and present results that show how error mitigation can improve the training of quantum circuit Born machines with 28 tunable parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Role for IEEE in Quantum Computing

Will quantum computation become an important milestone in human progress? Here, passionate advocates and equally passionate skeptics abound. IEEE already provides useful, neutral forums for state-of-the-art science and engineering knowledge as well as practical benchmarks for quantum computation evaluation. But could the organization do more?

97 MATHEMATICS AND COMPUTING↗

Exact-Factorization-Based Surface Hopping for Multistate Dynamics

A surface-hopping algorithm recently derived from the exact factorization approach, SHXF, introduces an additional term in the electronic equation of surface hopping that couples electronic states through the quantum momentum. Furthermore, this term not only provides a first-principles description of decoherence, but here we show it is crucial to accurately capture nonadiabatic dynamics when more than two states are occupied at any given time. Using a vibronic coupling model of the uracil cation, we show that the lack of this term in traditional surface-hopping methods, including those with decoherence corrections, leads to failure to predict the dynamics through a three-state intersection, while SHXF performs similarly to the multiconfiguration time-dependent Hartree quantum dynamics benchmark.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exact few-body results for strongly correlated quantum gases in two dimensions

The study of strongly correlated quantum gases in two dimensions has important ramifications for understanding many intriguing phenomena in solid materials, such as high-T{sub c} superconductivity and the fractional quantum-Hall effect. However, theoretical methods are plagued by the existence of significant quantum fluctuations. Here, we present two- and three-body exact solutions for both fermions and bosons trapped in a two-dimensional harmonic potential with an arbitrary s-wave scattering length. These few-particle solutions link in a natural way to the high-temperature properties of many-particle systems via a quantum virial expansion. As a concrete example, using the energy spectrum of few fermions, we calculate the second and third virial coefficients of a strongly interacting Fermi gas in two dimensions, and consequently investigate its high-temperature thermodynamics. Our thermodynamic results may be useful for ongoing experiments on two-dimensional Fermi gases. These exact results also provide an unbiased benchmark for quantum Monte Carlo simulations of two-dimensional Fermi gases at high temperatures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum optimization of maximum independent set using Rydberg atom arrays

Realizing quantum speedup for practically relevant, computationally hard problems is a central challenge in quantum information science. Using Rydberg atom arrays with up to 289 qubits in two spatial dimensions, we experimentally investigate quantum algorithms for solving the maximum independent set problem. We use a hardware-efficient encoding associated with Rydberg blockade, realize closed-loop optimization to test several variational algorithms, and subsequently apply them to systematically explore a class of graphs with programmable connectivity. We find that the problem hardness is controlled by the solution degeneracy and number of local minima, and we experimentally benchmark the quantum algorithm’s performance against classical simulated annealing. On the hardest graphs, we observe a superlinear quantum speedup in finding exact solutions in the deep circuit regime and analyze its origins.

Science & Technology - Other Topics↗