Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum efficiency”

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

Efficient use of quantum computers for collider physics

Most observables at particle colliders involve physics at a wide variety of distance scales. Due to asymptotic freedom of the strong interaction, the physics at short distances can be calculated reliably using perturbative techniques, while long distance physics is non-perturbative in nature. Factorization theorems separate the contributions from different scales, allowing to identify the pieces that can be determined perturbatively from those that require non-perturbative information, and if the non-perturbative pieces can be reliably determined, one can use experimental measurements to extract the short distance effects, sensitive to possible new physics. Without the ability to compute the non-perturbative ingredients from first principles one typically identifies observables for which the non-perturbative information is universal in the sense that it can be extracted from some experimental observables and then used to predict other observables. In this paper we argue that the future ability to use quantum computers to calculate non-perturbative matrix elements from first principles will allow to make predictions for observables with non-universal non-perturbative long-distance physics.

Algorithms and Theoretical Developments↗

Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures

Quantum low-density parity-check codes are promising candidates towards scalable fault-tolerant quantum computation. Among these, bivariate bicycle (BB) codes offer superior encoding rates and large code distance compared to surface codes. However, their requirement on long-range stabilizer measurements poses significant challenges for implementation on realistic hardware with limited connectivity, such as superconducting circuit platforms. In this work, we introduce a novel hardware-software co-design that leverages a programmable communication network architecture to address these limitations. Our approach utilizes a 2D toric network of oscillators as a flexible communication fabric linking qubits at each site. Such architecture significantly reduces the number of long-range couplers required from O ( n ) to O (√ n ). Dual-rail qubits, along with native gates including Swap-Wait-Swap gates and beamsplitter SWAPs, ensure that long-range two-qubit gates can be executed with high fidelity and low latency. To further enhance performance, our qubit layout and routing algorithm utilize symmetries of the codes and enable maximum parallelism for long-range two-qubit gates, maintaining a low syndrome extraction cycle duration and scalability over the code length. We perform circuit-level simulation with realistic noise modeling based on experimental hardware parameters, observing an logical error rate per logical qubit per cycle of 3.06% for [[18,4,4]] BB code, 2.6× less than the existing experimental result. These findings provide a practical roadmap and identify key technological advancements needed to achieve low-overhead fault-tolerant quantum computing at scale.

Liu, Kun [Yale Univ., New Haven, CT (United States↗

Efficiently improving the performance of noisy quantum computers

Using near-term quantum computers to achieve a quantum advantage requires efficient strategies to improve the performance of the noisy quantum devices presently available. We develop and experimentally validate two efficient error mitigation protocols named "Noiseless Output Extrapolation" and "Pauli Error Cancellation" that can drastically enhance the performance of quantum circuits composed of noisy cycles of gates. By combining popular mitigation strategies such as probabilistic error cancellation and noise amplification with efficient noise reconstruction methods, our protocols can mitigate a wide range of noise processes that do not satisfy the assumptions underlying existing mitigation protocols, including non-local and gate-dependent processes. We test our protocols on a four-qubit superconducting processor at the Advanced Quantum Testbed. We observe significant improvements in the performance of both structured and random circuits, with up to 86 % improvement in variation distance over the unmitigated outputs. Our experiments demonstrate the effectiveness of our protocols, as well as their practicality for current hardware platforms.

97 MATHEMATICS AND COMPUTING↗

Efficient Simulation of Open Quantum Systems on NISQ Trapped‐Ion Hardware

Abstract Simulating open quantum systems, which interact with external environments, presents significant challenges on noisy intermediate‐scale quantum (NISQ) devices due to limited qubit resources and noise. In this study, an efficient framework is proposed for simulating open quantum systems on NISQ hardware by leveraging a time‐perturbative Kraus operator representation of the system's dynamics. This approach avoids the computationally expensive Trotterization method and exploits the Lindblad master equation to represent time evolution in a compact form, particularly for systems satisfying specific commutation relations. The efficiency of this method is demonstrated by simulating quantum channels, such as the continuous‐time Pauli channel and damped harmonic oscillators, on NISQ trapped‐ion hardware, including IonQ Harmony and Quantinuum H1‐1. Additionally, hardware‐agnostic error mitigation techniques are introduced, including Pauli channel fitting and quantum depolarizing channel inversion, to enhance the fidelity of quantum simulations. These results show strong agreement between the simulations on real quantum hardware and exact solutions, highlighting the potential of Kraus‐based methods for scalable and accurate simulation of open quantum systems on NISQ devices. This framework opens pathways for simulating more complex systems under realistic conditions in the near term.

Burdine, Colin [Department of Electrical and Compu↗

Pathways of CdS Quantum Dot Degradation during Photocatalysis: Implications for Enhancing Stability and Efficiency for Organic Synthesis

CdS quantum dots (QDs) are widely employed as photocatalysts for reactions such as hydrogen evolution, and their degradation under aerobic aqueous conditions is well understood. However, despite evidence of aggregation and precipitation of CdS QD photocatalysts under anaerobic conditions, catalyst speciation and degradation under such conditions are underexplored. In this work, we demonstrate that during a reductive dehalogenation reaction, CdS QDs undergo surface ligand etching, which leads to a loss of colloidal stability and the formation of microcrystalline cadmium metal deposits. We hypothesize that this results from the accumulation of electrons on the QD surface. In addition, we demonstrate mild surface sulfur oxidation and the formation of an ammonium salt byproduct of a commonly used hole quencher. Furthermore, this work adds to our atomic-level understanding of the reactions occurring at the QD surface during photocatalysis, so that we can design more stable and efficient photocatalysts for organic synthesis.

cadmium sulfide↗

Exponential concentration in quantum kernel methods

Kernel methods in Quantum Machine Learning (QML) have recently gained significant attention as a potential candidate for achieving a quantum advantage in data analysis. Among other attractive properties, when training a kernel-based model one is guaranteed to find the optimal model’s parameters due to the convexity of the training landscape. However, this is based on the assumption that the quantum kernel can be efficiently obtained from quantum hardware. In this work we study the performance of quantum kernel models from the perspective of the resources needed to accurately estimate kernel values. We show that, under certain conditions, values of quantum kernels over different input data can be exponentially concentrated (in the number of qubits) towards some fixed value. Thus on training with a polynomial number of measurements, one ends up with a trivial model where the predictions on unseen inputs are independent of the input data. We identify four sources that can lead to concentration including expressivity of data embedding, global measurements, entanglement and noise. For each source, an associated concentration bound of quantum kernels is analytically derived. Lastly, we show that when dealing with classical data, training a parametrized data embedding with a kernel alignment method is also susceptible to exponential concentration. Our results are verified through numerical simulations for several QML tasks. Altogether, we provide guidelines indicating that certain features should be avoided to ensure the efficient evaluation of quantum kernels and so the performance of quantum kernel methods.

97 MATHEMATICS AND COMPUTING↗

Efficient sparse state preparation via quantum walks

Continuous-time quantum walks (CTQWs) on dynamic graphs, referred to as dynamic CTQWs, are a recently introduced universal model of computation that offers a new paradigm in which to envision quantum algorithms. In this work, we develop an algorithm that converts single-edge and self-loop dynamic CTQWs to the gate model of computation. We use this mapping to introduce an efficient sparse quantum state preparation framework based on dynamic CTQWs. Our approach utilizes combinatorics techniques such as minimal hitting sets, minimum spanning trees, and shortest Hamiltonian paths to reduce the number of controlled gates required to prepare sparse states. We show that our framework encompasses the current state of the art ancilla-free sparse state preparation method by reformulating this method as a CTQW. This CTQW-based framework offers an alternative to the uniformly controlled rotation method used by Qiskit by requiring fewer CX gates when the target state has a polynomial number of non-zero amplitudes.

dynamic continuous time quantum walks↗

Rational design of efficient defect-based quantum emitters

Single-photon emitters are an essential component of quantum networks, and defects or impurities in semiconductors are a promising platform to realize such quantum emitters. Here, we present a model that encapsulates the essential physics of coupling to phonons, which governs the behavior of real single-photon emitters, and critically evaluate several approximations that are commonly utilized. Emission in the telecom wavelength range is highly desirable, but our model shows that nonradiative processes are greatly enhanced at these low photon energies, leading to a decrease in efficiency. Our results suggest that reducing the phonon frequency is a fruitful avenue to enhance the efficiency.

Optics↗

Efficient simulation of open quantum systems coupled to a reservoir through multiple channels

It is challenging to simulate open quantum systems that are connected to a reservoir through multiple channels. For example, vibrations may induce fluctuations in both energy gaps and electronic couplings, which represent two independent channels of system–bath couplings. Systems of this kind are ubiquitous in the processes of excited state radiationless decay. Combined with density matrix renormalization group (DMRG) and matrix product states (MPS) methods, we develop an interaction-picture chain mapping strategy for vibrational reservoirs to simulate the dynamics of these open systems, resulting in time-dependent spatially local system–bath couplings in the chain-mapped Hamiltonian. This transformation causes the entanglement generated by the system–bath interactions to be restricted within a narrow frequency window of vibrational modes, enabling efficient DMRG/MPS dynamical simulations. We demonstrate the utility of this approach by simulating singlet fission dynamics using a generalized spin-boson Hamiltonian with both diagonal and off-diagonal system–bath couplings. This approach generalizes an earlier interaction-picture chain mapping scheme, allowing for efficient and exact simulation of systems with multi-channel system–bath couplings using matrix product states, which may further our understanding of nonlocal exciton–phonon couplings in exciton transport and the non-Condon effect in energy and electron transfer.

Chemistry↗

Your Best Single-Junction Solar Cell Does Not Always Make an Efficient Tandem Partner

Tandem solar cells, where multiple single-junction cells are combined optically in series, provide a path to making cells with high areal efficiencies, with multiple material systems capable of achieving greater than 30% efficiency under 1-sun conditions. However, there are many different material combinations and configurations used to make a tandem, and it can be challenging to understand how advances in one material system will impact the performance of a tandem device. Here, we have built an open-source calculator based on the spectral efficiency metric proposed by Yu et al. to easily enable calculation of spectral efficiency for single junctions and predicted maximum efficiency of tandem pairs, accounting for different optical and electrical coupling between the top and bottom junctions.

14 SOLAR ENERGY↗

Learning energy-based representations of quantum many-body states

Efficient representation of quantum many-body states on classical computers is a problem of practical importance. An ideal representation of a quantum state combines a succinct characterization informed by the structure and symmetries of the system along with the ability to predict the physical observables of interest. Several machine-learning approaches have been recently used to construct such classical representations, which enable predictions of observables and account for physical symmetries. However, the structure of a quantum state typically gets lost unless a specialized is employed based on prior knowledge of the system. Moreover, most such approaches give no information about what states are easier to learn in comparison with others. Here, we propose a generative energy-based representation of quantum many-body states derived from Gibbs distributions used for modeling the thermal states of classical spin systems. Based on the prior information on a family of quantum states, the energy function can be specified by a small number of parameters using an explicit low-degree polynomial or a generic parametric family such as neural nets and can naturally include the known symmetries of the system. Our results show that such a representation can be efficiently learned from data using exact algorithms in a form that enables the prediction of expectation values of physical observables. Importantly, the structure of the learned energy function provides a natural explanation for the difficulty of learning an energy-based representation of a given class of quantum states when measured in a certain basis. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Bridging paradigms: Designing for HPC-Quantum convergence

Here, this paper presents a comprehensive software stack architecture for integrating quantum computing (QC) capabilities with High-Performance Computing (HPC) environments. While quantum computers show promise as specialized accelerators for scientific computing, their effective integration with classical HPC systems presents significant technical challenges. We propose a hardware-agnostic software framework that supports both current noisy intermediate-scale quantum devices and future fault-tolerant quantum computers, while maintaining compatibility with existing HPC workflows. The architecture includes a quantum gateway interface, standardized APIs for resource management, and robust scheduling mechanisms to handle both simultaneous and interleaved quantum–classical workloads. Key innovations include: (1) a unified resource management system that efficiently coordinates quantum and classical resources, (2) a flexible quantum programming interface that abstracts hardware-specific details, (3) A Quantum Platform Manager API that simplifies the integration of various quantum hardware systems, and (4) a comprehensive tool chain for quantum circuit optimization and execution. We demonstrate our architecture through implementation of quantum–classical algorithms, including the variational quantum linear solver, showcasing the framework’s ability to handle complex hybrid workflows while maximizing resource utilization. This work provides a foundational blueprint for integrating QC capabilities into existing HPC infrastructures, addressing critical challenges in resource management, job scheduling, and efficient data movement between classical and quantum resources.

97 MATHEMATICS AND COMPUTING↗

Bright and durable scintillation from colloidal quantum shells

Abstract Efficient, fast, and robust scintillators for ionizing radiation detection are crucial in various fields, including medical diagnostics, defense, and particle physics. However, traditional scintillator technologies face challenges in simultaneously achieving optimal performance and high-speed operation. Herein we introduce colloidal quantum shell heterostructures as X-ray and electron scintillators, combining efficiency, speed, and durability. Quantum shells exhibit light yields up to 70,000 photons MeV −1 at room temperature, enabled by their high multiexciton radiative efficiency thanks to long Auger-Meitner lifetimes (>10 ns). Radioluminescence is fast, with lifetimes of 2.5 ns and sub-100 ps rise times. Additionally, quantum shells do not exhibit afterglow and maintain stable scintillation even under high X-ray doses (>10 9 Gy). Furthermore, we showcase quantum shells for X-ray imaging achieving a spatial resolution as high as 28 line pairs per millimeter. Overall, efficient, fast, and durable scintillation make quantum shells appealing in applications ranging from ultrafast radiation detection to high-resolution imaging.

47 OTHER INSTRUMENTATION↗

Multifunction Hydrophobic Ligand Engineered Cd(S, Se)/ZnS Quantum Dots for Stabilizing Highly Efficient Carbon‐Based Perovskite Solar Cells

The long-term operational stability of perovskite solar cells (PSCs) remains a key challenge impeding their commercialization, particularly due to ambient environments (e.g., moisture, oxygen, heat)-induced degradation. Carbon electrode-based PSCs have emerged as cost-effective and relatively stable alternatives to metal electrode-based devices due to carbon materials' hydrophobic behavior, yet they still lag in both long-term durability and power conversion efficiency (PCE). In this work, an ultrathin hydrophobic ligand-modified core–shell Cd(S,Se)/ZnS quantum dots (QDs) capping layer is introduced as a multifunctional interfacial modifier for carbon-electrode-based PSCs. This oleic acid ligand-modified QDs capping layer exhibits inherent hydrophobicity, effectively serving as a moisture barrier to retard perovskite degradation under ambient conditions. Furthermore, the strong interfacial bonding between the QDs and perovskite halide surfaces leads to efficient trap state passivation, reducing trap density and creating a more uniform electrical contact. The modified QDs/perovskite interface also features an elevated conduction band edge, promoting improved charge extraction. As a result, devices incorporating this quantum dot capping layer retain 98% of their initial PCE after 450 h of ambient aging and achieve a champion efficiency of 20.74%. As a result, this strategy highlights the potential of hydrophobic ligand-modified chalcogenide QDs as surface modifiers to enhance both the stability and performance of carbon-based PSCs, offering a promising route toward scalable fabrication of durable perovskite solar modules.

14 SOLAR ENERGY↗

On the practical usefulness of the Hardware Efficient Ansatz

Variational Quantum Algorithms (VQAs) and Quantum Machine Learning (QML) models train a parametrized quantum circuit to solve a given learning task. The success of these algorithms greatly hinges on appropriately choosing an ansatz for the quantum circuit. Perhaps one of the most famous ansatzes is the one-dimensional layered Hardware Efficient Ansatz (HEA), which seeks to minimize the effect of hardware noise by using native gates and connectives. The use of this HEA has generated a certain ambivalence arising from the fact that while it suffers from barren plateaus at long depths, it can also avoid them at shallow ones. In this work, we attempt to determine whether one should, or should not, use a HEA. We rigorously identify scenarios where shallow HEAs should likely be avoided (e.g., VQA or QML tasks with data satisfying a volume law of entanglement). More importantly, we identify a Goldilocks scenario where shallow HEAs could achieve a quantum speedup: QML tasks with data satisfying an area law of entanglement. We provide examples for such scenario (such as Gaussian diagonal ensemble random Hamiltonian discrimination), and we show that in these cases a shallow HEA is always trainable and that there exists an anti-concentration of loss function values. Our work highlights the crucial role that input states play in the trainability of a parametrized quantum circuit, a phenomenon that is verified in our numerics.

97 MATHEMATICS AND COMPUTING↗

Theory for Equivariant Quantum Neural Networks

Quantum neural network architectures that have little to no inductive biases are known to face trainability and generalization issues. Inspired by a similar problem, recent breakthroughs in machine learning address this challenge by creating models encoding the symmetries of the learning task. This is materialized through the usage of equivariant neural networks the action of which commutes with that of the symmetry. In this work, we import these ideas to the quantum realm by presenting a comprehensive theoretical framework to design equivariant quantum neural networks (EQNNs) for essentially any relevant symmetry group. We develop multiple methods to construct equivariant layers for EQNNs and analyze their advantages and drawbacks. Our methods can find unitary or general equivariant quantum channels efficiently even when the symmetry group is exponentially large or continuous. As a special implementation, we show how standard quantum convolutional neural networks (QCNNs) can be generalized to group-equivariant QCNNs where both the convolution and pooling layers are equivariant to the symmetry group. We then numerically demonstrate the effectiveness of a S U ( 2 ) -equivariant QCNN over symmetry-agnostic QCNN on a classification task of phases of matter in the bond-alternating Heisenberg model. Our framework can be readily applied to virtually all areas of quantum machine learning. Lastly, we discuss about how symmetry-informed models such as EQNNs provide hopes to alleviate central challenges such as barren plateaus, poor local minima, and sample complexity. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗