Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum optimization”

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 505 records · Page 28

Understanding and Mitigating Coherence and Frequency Fluctuations in Superconducting Transmon Qubits

Transmon qubits are a cornerstone of superconducting quantum computing platforms. However‚ their frequency and coherence properties exhibit temporal fluctuations‚ leading to performance degradation in quantum processors over time. A common mitigation approach involves frequent recalibration‚ which‚ while effective‚ results in increased system downtime. Enhancing the long-term stability of transmon qubits is therefore critical for scalable and reliable quantum computing. In this study‚ we develop novel techniques for understanding the underlying mechanisms driving frequency and coherence fluctuations in fixed-frequency transmon qubits. We further explore strategies to mitigate these instabilities‚ aiming to improve overall system robustness. Our findings provide insights into optimizing superconducting quantum hardware for practical applications.

Roy, Tanay [Fermilab]↗

Quantum entanglement distribution coexisting with high-rate, broadband classical optical communications over a real-world fiber connecting remote, synchronized nodes

Compatibility with existing classical network infrastructure offers a scalable path towards deploying large-scale quantum networks. Here, we demonstrate O-band polarization-encoded quantum entanglement distribution over an installed 24.4-km fiber while coexisting with a state-of-the-art fully loaded C-band classical communications line system and a picosecond-level precision L-band synchronization signal. The classical system carries two 800-Gbps channels while the remainder of the C-band is filled with amplified spontaneous emission, as is standard for such state-of-the-art communications systems. We examine the spontaneous Raman scattering spectrum generated from this broadband C-band light and offer insights into wavelength allocation for O-band quantum channels. Optimal wavelength selection and narrow filtering enable well-preserved Bell state fidelity when coexisting with 21.4-dBm aggregate launch power across the C-band suitable for 36-Tbps transmission. To the best of our knowledge, this is the first implementation of entanglement-based quantum communications between two remote nodes coexisting with independent classical communications traffic. We demonstrate coexistence of quantum entanglement with ultra-high power levels and record classical bandwidth, offering promise for real-world entanglement-based networking integrated within high-capacity communications infrastructure.

Talcott, Gina M. [Northwestern U.] (ORCID:00000002↗

Inferring the Dynamics of the State Evolution During Quantum Annealing

To solve an optimization problem using a commercial quantum annealer, one has to represent the problem of interest as an Ising or a quadratic unconstrained binary optimization (QUBO) problem and submit its coefficients to the annealer, which then returns a user-specified number of low-energy solutions. It would be useful to know what happens in the quantum processor during the anneal process so that one could design better algorithms or suggest improvements to the hardware. However, existing quantum annealers are not able to directly extract such information from the processor. Hence, in this work we propose to use advanced features of D-Wave 2000Q to indirectly infer information about the dynamics of the state evolution during the anneal process. Specifically, D-Wave 2000Q allows the user to customize the anneal schedule, that is, the schedule with which the anneal fraction is changed from the start to the end of the anneal. Furthermore, using this feature, we design a set of modified anneal schedules whose outputs can be used to generate information about the states of the system at user-defined time points during a standard anneal. With this process, called "slicing", we obtain approximate distributions of lowest-energy anneal solutions as the anneal time evolves. We use our technique to obtain a variety of insights into the annealer, such as the state evolution during annealing, when individual bits in an evolving solution flip during the anneal process and when they stabilize, and we introduce a technique to estimate the freeze-out point of both the system as well as of individual qubits.

42 ENGINEERING↗

Quantum Machine Learning with SQUID

In this work we present the Scaled QUantum IDentifier (SQUID), an open-source framework for exploring hybrid Quantum-Classical algorithms for classification problems. The classical infrastructure is based on PyTorch and we provide a standardized design to implement a variety of quantum models with the capability of back-propagation for efficient training. We present the structure of our framework and provide examples of using SQUID in a standard binary classification problem from the popular MNIST dataset. In particular, we highlight the implications for scalability for gradient-based optimization of quantum models on the choice of output for variational quantum models.

97 MATHEMATICS AND COMPUTING↗

Optimized pulse sequences for suppressing unwanted transitions in quantum systems

We investigate the nature of the pulse sequence so that unwanted transitions in quantum systems can be inhibited optimally. For this purpose we show that the sequence of pulses proposed by Uhrig [Phys. Rev. Lett. 98, 100504 (2007)] in the context of inhibition of environmental dephasing effects is optimal. We derive exact results for inhibiting the transitions and confirm the results numerically. We posit a very significant improvement by usage of the Uhrig sequence over an equidistant sequence in decoupling a quantum system from unwanted transitions. The physics of inhibition is the destructive interference between transition amplitudes before and after each pulse.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multi-pass transmission electron microscopy

Feynman once asked physicists to build better electron microscopes to be able to watch biology at work. While electron microscopes can now provide atomic resolution, electron beam induced specimen damage precludes high resolution imaging of sensitive materials, such as single proteins or polymers. Here, we use simulations to show that an electron microscope based on a multi-pass measurement protocol enables imaging of single proteins, without averaging structures over multiple images. While we demonstrate the method for particular imaging targets, the approach is broadly applicable and is expected to improve resolution and sensitivity for a range of electron microscopy imaging modalities, including, for example, scanning and spectroscopic techniques. The approach implements a quantum mechanically optimal strategy which under idealized conditions can be considered interaction-free.

47 OTHER INSTRUMENTATION↗

Grover-QAOA for 3-SAT: quadratic speedup, fair-sampling, and parameter clustering

Abstract The SAT problem is a prototypical NP-complete problem of fundamental importance in computational complexity theory with many applications in science and engineering; as such, it has long served as an essential benchmark for classical and quantum algorithms. This study shows numerical evidence for a quadratic speedup of the Grover Quantum Approximate Optimization Algorithm (G-QAOA) over random sampling for finding all solutions to 3-SAT (All-SAT) and Max-SAT problems. G-QAOA is less resource-intensive and more adaptable for these problems than Grover’s algorithm, and it surpasses conventional QAOA in its ability to sample all solutions. We show these benefits by classical simulations of many-round G-QAOA on thousands of random 3-SAT instances. We also observe G-QAOA advantages on the IonQ Aria quantum computer for small instances, finding that current hardware suffices to determine and sample all solutions. Interestingly, a single-angle-pair constraint that uses the same pair of angles at each G-QAOA round greatly reduces the classical computational overhead of optimizing the G-QAOA angles while preserving its quadratic speedup. We also find parameter clustering of the angles. The single-angle-pair protocol and parameter clustering significantly reduce obstacles to classical optimization of the G-QAOA angles.

Zhang, Zewen (ORCID:000000032258613X)↗

Fully quantum algorithm for mesoscale fluid simulations with application to partial differential equations

Fluid flow simulations marshal our most powerful computational resources. In many cases, even this is not enough. Quantum computers provide an opportunity to speed up traditional algorithms for flow simulations. We show that lattice-based mesoscale numerical methods can be executed as efficient quantum algorithms due to their statistical features. This approach revises a quantum algorithm for lattice gas automata to reduce classical computations and state preparation at every time step. For this, the algorithm approximates the qubit relative phases and subtracts them at the end of each time step. Phases are evaluated using the iterative phase estimation algorithm and subtracted using single-qubit rotation phase gates. Further, this method optimizes the quantum resource required and makes it more appropriate for near-term quantum hardware. We also demonstrate how the checkerboard deficiency that the D1Q2 scheme presents can be resolved using the D1Q3 scheme. The algorithm is validated by simulating two canonical partial differential equations: the diffusion and Burgers' equations on different quantum simulators. We find good agreement between quantum simulations and classical solutions for the presented algorithm.

97 MATHEMATICS AND COMPUTING↗

Exploring Quantum State Preparation Using Tensor Networks and Sparse Wavefunction Simulations

The variational quantum eigenvalue solver is a powerful hybrid quantum-classical approach that has been suggested as a candidate method to run on near-term quantum hardware for computing ground state electronic energies of molecular systems. However, even for small molecules, the number of variational parameters and qubits required to minimize the electronic energy is beyond the reach of current quantum computers except for small basis sets. We explore a new paradigm for state preparation where we test how much of the optimization can be approximately prepared with classical computers to reduce the number of optimization steps performed using a quantum device. By adapting a recent algorithm for the factorized form of the UCC ansatz, we can study molecular electronic structure problems with up to 64 qubits. In addition, we also test a related approach of using tensor networks to optimize quantum circuits in order to benchmark various lattice models. We present results using these approaches and discuss strategies for incorporating these ideas into variational algorithms involving near-term quantum computers. Our results help demonstrate the strength of the UCC ansatz and address pressing questions about optimal initial parameterizations and circuit construction.

quantum computing↗

Mechanism of electronic-excitation transfer in organic light-emitting devices based on semiconductor quantum dots

The results of an experimental study of organic light-emitting diodes (LEDs) with luminescent layers based on two types of CdSe/CdS semiconductor quantum dots (QDs) with an average CdSe core diameter of 3 and 5 nm and a characteristic CdS shell thickness of 0.5 nm are presented. The dependences of the LED efficiency on the QD concentration are determined. The experimental data are used to determine the mechanism of electronic-excitation transfer from the organic matrix to the semiconductor QDs. Ways of optimizing the design of the LEDs in order to improve their efficiency are suggested on this basis.

36 MATERIALS SCIENCE↗

SU-F-18C-05: Characterization of a Silicon Strip Photon-Counting Detector in the Presence of Compton Scatter: A Simulation Study

Purpose: To investigate the effect of Compton scatter on detection efficiency and charge-sharing for a Si strip photon-counting detector as a function of pixel pitch, slice thickness and total pixel length. Methods: A CT imaging system employing a silicon photon-counting detector was implemented using the GATE Monte Carlo package. A focal spot size of 300 µm, magnification of 1.33, and pixel pitches of 0.1 and 0.5mm were initially investigated. A 60 kVp spectrum with 3 mm Al filter was used and energy spectral degradation based on a prototype detector was simulated. To study charge-sharing, a single pixel was illuminated, and the detector response in neighboring pixels was investigated. A longitudinally semiinfinite detector was simulated to optimize the quantum detection efficiency of the imaging system as a function of pixel pitch, slice thickness and depth of interaction. A 2.5 mm thick tungsten plate with a 0.01 mm by 1.5 mm slit was implemented to calculate the modulation transfer function (MTF) from projection-based images. A threshold of 15 keV was implemented in the detector simulation. The preliminary charge sharing investigation results considered only scattering effects and the detector electronics related factors were neglected. Results: Using a 15 keV threshold, 1% of the pixel charge migrated into neighboring pixels with a pixel size of 0.1×0.1 mm{sup 2}. The quantum detection efficiency was 77%, 84%, 87% and 89% for 15 mm, 22.5 mm, 30 mm, and 45 mm length silicon detector pixels, respectively. For a pixel pitch of 0.1 mm, the spatial frequency at 10% of the maximum MTF was found to be 5.2 lp/mm. This agreed with an experimental MTF measurement of 5.3 lp/mm with a similar detector configuration. Conclusion: Using optimized design parameters, Si strip photon-counting detectors can offer high detection efficiency and spatial resolution even in the presence of Compton scatter.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Optimization of barrier layer thickness in MgSe/CdSe quantum wells for intersubband devices in the near infrared region

The authors report the optimization of MgSe barrier thickness in CdSe/MgSe multiple quantum well structures and its effect on structural, optical qualities and intersubband (ISB) transition characteristics. Three samples with the MgSe thicknesses of 2 nm, 3 nm, and 4 nm were grown on InP substrates by molecular beam epitaxy. X-ray diffraction and photoluminescence measurements showed that the thinner the MgSe barrier thickness the better the structural quality. However, ISB absorption was only observed in the sample with a MgSe thickness of 3 nm. Failing to observe ISB absorption in the sample with a thicker MgSe barrier (≥4 nm) is due to the deteriorated material quality while the missing of ISB transition in the sample with thinner barrier (≤2 nm) is due to the tunneling of electrons out of the CdSe wells. The optimized MgSe barrier thickness of around 3 nm is found to be able to suppress the electron tunneling while maintaining a good material quality of the overall structure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Simulators and Applications on Quantum Framework

Simulating quantum circuits is essential for validating quantum algorithms. However, no single simulator consistently performs best - efficiency depends on circuit structure, entanglement, and depth. In this work, we integrate Qiskit-Aer (state-vector and matrix product state) and QTensor, a tree-tensor-network based simulator, into the Quantum Framework (QFw), a modular platform that supports multiple quantum backends via a unified interface. We also enable distributed quantum approximate optimization algorithm (DQAOA) application compatibility with QFw, allowing sub-problems to be solved in parallel at scale. We then benchmark DQAOA and TFIM (transverse field Ising model) circuits across supported simulators, showing how performance varies significantly with problem type. All simulations are deployed on the Frontier supercomputer using QFw's MPI-based orchestration for distributed, multinode execution. These results underscore the need for simulatoragnostic infrastructure to enable systematic evaluation and highperformance scaling of quantum workloads. QFw provides a practical and extensible path toward reproducible quantum algorithm development across diverse application domains.

Chundury, Srikar [ORNL] (ORCID:0009000183359259)↗

Computation of forces and stresses in solids: Towards accurate structural optimization with auxiliary-field quantum Monte Carlo

The accurate computation of forces and other energy derivatives has been a long-standing challenge for quantum Monte Carlo methods. A number of technical obstacles contribute to this challenge. We discuss how these obstacles can be removed with the auxiliary-field quantum Monte Carlo (AFQMC) approach. AFQMC is a general, high-accuracy, many-body total-energy method for molecules and solids. The implementation of back-propagation for pure estimators allows direct calculation of gradients of the energy via the Hellmann-Feynman theorem. A planewave basis with norm-conserving pseudopotentials is used for the study of periodic bulk materials. Completeness of the planewave basis minimizes the effect of so-called Pulay terms. The ionic pseudopotentials, which can be incorporated in AFQMC in exactly the same manner as in standard independent-electron methods, regulate the force and stress estimators and eliminate any potential divergence of the Monte Carlo variances. The resulting approach allows applications of full geometry optimizations in bulk materials. As a result, it also paves the way for many-body computations of the phonon spectrum in solids.

36 MATERIALS SCIENCE↗

Variational quantum simulation of the critical Ising model with symmetry averaging

Here we investigate the use of deep multiscale entanglement renormalization ansatz (DMERA) circuits as a variational ansatz. We use the exactly solvable one-dimensional critical transverse-field Ising model as a test bed. Numerically exact simulation of the quantum circuit ansatz can in this case be carried out to hundreds of qubits by exploiting efficient classical algorithms for simulating matchgate circuits. We find that, for this system, the DMERA strongly outperforms a standard quantum approximate optimization algorithm (QAOA)–style ansatz, and that a major source of systematic error in correlation functions approximated using the DMERA is the breaking of the translational and Kramers-Wannier symmetries of the transverse-field Ising model. We are able to reduce this error by up to four orders of magnitude by symmetry averaging, without incurring additional cost in qubits or circuit depth. Here, we propose that this technique for mitigating systematic error could be applied to noisy intermediate-scale quantum (NISQ) simulations of physical systems with other symmetries.

1-dimensional spin chains↗

Scaling whole-chip QAOA for higher-order ising spin glass models on heavy-hex graphs

Abstract We show that the quantum approximate optimization algorithm (QAOA) for higher-order, random coefficient, heavy-hex compatible spin glass Ising models has strong parameter concentration across problem sizes from 16 up to 127 qubits for p = 1 up to p = 5, which allows for computationally efficient parameter transfer of QAOA angles. Matrix product state (MPS) simulation is used to compute noise-free QAOA performance. Hardware-compatible short-depth QAOA circuits are executed on ensembles of 100 higher-order Ising models on noisy IBM quantum superconducting processors with 16, 27, and 127 qubits using QAOA angles learned from a single 16-qubit instance using the JuliQAOA tool. We show that the best quantum processors find lower energy solutions up to p = 2 or p = 3, and find mean energies that are about a factor of two off from the noise-free distribution. We show that p = 1 QAOA energy landscapes remain very similar as the problem size increases using NISQ hardware gridsearches with up to a 414 qubit processor.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reduced-complexity numerical method for optimal gate synthesis

Although quantum computers have the potential to efficiently solve certain problems considered difficult by known classical approaches, the design of a quantum circuit remains computationally difficult. It is known that the optimal gate-design problem is equivalent to the solution of an associated optimal-control problem; the solution to which is also computationally intensive. Hence, in this article, we introduce the application of a class of numerical methods (termed the max-plus curse of dimensionality-free techniques) that determine the optimal control, thereby synthesizing the desired unitary gate. The application of this technique to quantum systems has a growth in complexity that depends on the cardinality of the control-set approximation rather than the much larger growth with respect to spatial dimensions in approaches based on gridding of the space, which is used in previous research. This technique is demonstrated by obtaining an approximate solution for the gate synthesis on SU(4) - a problem that is computationally intractable by grid-based approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Comprehensive Comparative Study of Active Learning Schemes for Nanophotonics Design

We present a benchmarking study of active learning (AL) schemes for designing planar multilayer nanophotonic metamaterials, where the design tasks are formulated as binary optimization problems. Different surrogate models, including factorization machine (FM), Gaussian process regression (GPR), and convolutional neural network (CNN), combined with different optimization methods, including exhaustive enumeration, discrete particle swarm optimization (DPSO), quantum annealing (QA), hybrid QA, and simulated annealing are studied. The benchmark cases investigated range from small problems with short binary lengths (N = 25) to large problems with N up to 100, focusing on the design of two classes of photonic structures, including antireflective coatings for the long-wavelength infrared region and transparent radiative coolers. For small problems, CNN coupled with DPSO in AL achieves the best performance. As N increases, FM with QA outperforms GPR and CNN. For FM-based AL, hybrid QA yields the best optimization results, particularly in high-dimensional cases (N = 100). These results demonstrate that the optimization method can significantly affect in AL performance as N increases, and that QA-based optimization can provide practical routes for mitigating the optimization bottleneck in high-dimensional problems.

Jung, Serang [Kyung Hee University, Korea]↗