Search NASA⌕ Search

SEARCH · Search NASA

Results for “Classic”

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 19 records

Calculation and interpretation of classical turning surfaces in solids

Abstract Classical turning surfaces of Kohn–Sham potentials separate classically allowed regions (CARs) from classically forbidden regions (CFRs). They are useful for understanding many chemical properties of molecules but need not exist in solids, where the density never decays to zero. At equilibrium geometries, we find that CFRs are absent in perfect metals, rare in covalent semiconductors at equilibrium, but common in ionic and molecular crystals. In all materials, CFRs appear or grow as the internuclear distances are uniformly expanded. They can also appear at a monovacancy in a metal. Calculations with several approximate density functionals and codes confirm these behaviors. A classical picture of conduction suggests that CARs should be connected in metals, and disconnected in wide-gap insulators, and is confirmed in the limits of extreme compression and expansion. Surprisingly, many semiconductors have no CFR at equilibrium, a key finding for density functional construction. Nonetheless, a strong correlation with insulating behavior can still be inferred. Moreover, equilibrium bond lengths for all cases can be estimated from the bond type and the sum of the classical turning radii of the free atoms or ions.

Chemistry↗

A Comparison of Classical and Aggregation-Based Algebraic Multigrid Preconditioners for High-Fidelity Simulation of Wind Turbine Incompressible Flows

This paper presents a comparison of parallel strong scaling performance of classical and aggregation algebraic multigrid (AMG) preconditioners in the context of wind turbine simulations. Fluid motion is governed by the incompressible Navier--Stokes equations, discretized in space with control-volume finite elements and in time with an inexact projection scheme using an implicit integrator. A discontinuous-Galerkin sliding-mesh algorithm captures rotor motion. The momentum equations are solved with iterative Krylov methods, preconditioned by symmetric Gauss--Seidel (SGS) in Trilinos and $\ell_1$ SGS in hypre. The mass-continuity equation is solved with GMRES preconditioned by AMG and can account for the majority of simulation time. Reducing this continuity solve time is crucial. Wind turbine simulations present two unique challenges for AMG preconditioned solvers: the computational meshes include strongly anisotropic elements, and mesh motion requires matrix reinitialization and computation of preconditioners at each time step. Detailed timing profiles are presented and analyzed, and best practices are discussed for both classical and aggregation-based AMG. Results are presented for simulations of two different wind turbines with up to 6 billion grid points on two different computer architectures. For moving mesh problems that require linear-system reinitialization, the well-established strategy of amortizing preconditioner setup costs over a large number of time steps to reduce the solve time is no longer valid. Instead, results show that faster time to solution is achieved by reducing preconditioner setup costs at the expense of linear-system solve costs. Standard smoothed aggregation with Chebyshev relaxation was found to perform poorly when compared with classical AMG in terms of solve time and robustness. However, plain aggregation was comparable to classical AMG.

97 MATHEMATICS AND COMPUTING↗

Designing noise-robust quantum networks coexisting in the classical fiber infrastructure

The scalability of quantum networking will benefit from quantum and classical communications coexisting in shared fibers, the main challenge being spontaneous Raman scattering noise. We investigate the coexistence of multi-channel O-band quantum and C-band classical communications. We characterize multiple narrowband entangled photon pair channels across 1282 nm-1318 nm co-propagating over 48 km of installed standard fiber with record C-band power (>18 dBm) and demonstrate that some quantum-classical wavelength combinations significantly outperform others. We analyze the Raman noise spectrum, optimal wavelength engineering, multi-photon pair emission in entangled photon-classical coexistence, and evaluate the implications for future quantum applications.

Optics↗

Recent experimental explorations of non-classical nucleation

Nucleation, the early stage of crystallization, is a key step in producing functional materials, but nucleation processes have yet to be understood in detail. Recent advanced characterization techniques, especially atomic force microscopy, liquid-cell transmission electron microscopy (TEM) and cryo-TEM, enable scientists to observe previously inaccessible nucleation details at the nanoscale. In this review, we summarize newly suggested non-classical nucleation models with respect to mechanistic understanding from experimental views, which highlight multi-step nucleation mechanisms. Different intermediated phases such as clusters at the pre-nucleation stage, liquid-like precursors, amorphous phases and even oligomers have been revealed, which play vital roles in nucleation and structure control. Moreover, these intermediated phases practically contribute in general to the structural variances of materials for nanoscience and nanotechnology. Overall, these studies ultimately enable us to control nucleation processes for materials synthesis.

Jin, Biao↗

Characterization of Classical Sheep Scrapie in White-tailed Deer after Experimental Oronasal Exposure

Abstract Background Classic scrapie is a prion disease of sheep and goats that is associated with accumulation of abnormal prion protein (PrPSc) in the central nervous and lymphoid tissues. Chronic wasting disease (CWD) is the prion disease of cervids. This study was conducted to determine the susceptibility of white-tailed deer (WTD) to the classic scrapie agent. Methods We inoculated WTD (n = 5) by means of a concurrent oral/intranasal exposure with the classic scrapie agent from sheep or oronasally with the classic scrapie agent from goats (n = 6). Results All deer exposed to the agent of classic scrapie from sheep accumulated PrPSc. PrPSc was detected in lymphoid tissues at preclinical time points, and necropsies in deer 28 months after inoculation showed clinical signs, spongiform lesions, and widespread PrPSc in neural and lymphoid tissues. Western blots on samples from the brainstem, cerebellum, and lymph nodes of scrapie-infected WTD have a molecular profile similar to CWD and distinct from samples from the cerebral cortex, retina, or the original classic scrapie inoculum. There was no evidence of PrPSc in any of the WTD inoculated with classic scrapie prions from goats. Conclusions WTD are susceptible to the agent of classic scrapie from sheep, and differentiation from CWD may be difficult.

Immunology↗

CAFQA: A Classical Simulation Bootstrap for Variational Quantum Algorithms

Classical computing plays a critical role in the advancement of quantum frontiers in the NISQ era. In this spirit, this work uses classical simulation to bootstrap Variational Quantum Algorithms (VQAs). VQAs rely upon the iterative optimization of a parameterized unitary circuit (ansatz) with respect to an objective function. Since quantum machines are noisy and expensive resources, it is imperative to classically choose the VQA ansatz initial parameters to be as close to optimal as possible to improve VQA accuracy and accelerate their convergence on today’s devices. This work tackles the problem of finding a good ansatz initialization, by proposing CAFQA, a Clifford Ansatz For Quantum Accuracy. The CAFQA ansatz is a hardware-efficient circuit built with only Clifford gates. In this ansatz, the parameters for the tunable gates are chosen by searching efficiently through the Clifford parameter space via classical simulation. The resulting initial states always equal or outperform traditional classical initialization (e.g., Hartree-Fock), and enable high-accuracy VQA estimations. CAFQA is well-suited to classical computation because: a) Clifford-only quantum circuits can be exactly simulated classically in polynomial time, and b) the discrete Clifford space is searched efficiently via Bayesian Optimization. For the Variational Quantum Eigensolver (VQE) task of molecular ground state energy estimation (up to 18 qubits), CAFQA’s Clifford Ansatz achieves a mean accuracy of nearly 99% and recovers as much as 99.99% of the molecular correlation energy that is lost in Hartree-Fock initialization. CAFQA achieves mean accuracy improvements of 6.4x and 56.8x, over the state-of-the-art, on different metrics. Here, the scalability of the approach allows for preliminary ground state energy estimation of the challenging chromium dimer (Cr2) molecule. With CAFQA’s high-accuracy initialization, the convergence of VQAs is shown to accelerate by 2.5x, even for small molecules. Furthermore, preliminary exploration of allowing a limited number of non-Clifford (T) gates in the CAFQA framework, shows that as much as 99.9% of the correlation energy can be recovered at bond lengths for which Clifford-only CAFQA accuracy is relatively limited, while remaining classically simulable.

bayesian optimization↗

Quantum Theory of the Classical: Einselection, Envariance, Quantum Darwinism and Extantons

Core quantum postulates including the superposition principle and the unitarity of evolutions are natural and strikingly simple. I show that—when supplemented with a limited version of predictability (captured in the textbook accounts by the repeatability postulate)—these core postulates can account for all the symptoms of classicality. In particular, both objective classical reality and elusive information about reality arise, via quantum Darwinism, from the quantum substrate. This approach shares with the Relative State Interpretation of Everett the view that collapse of the wavepacket reflects perception of the state of the rest of the Universe relative to the state of observer’s records. However, our “let quantum be quantum” approach poses questions absent in Bohr’s Copenhagen Interpretation that relied on the preexisting classical domain. Thus, one is now forced to seek preferred, predictable, hence effectively classical but ultimately quantum states that allow observers keep reliable records. Without such (i) preferred basis relative states are simply “too relative”, and the ensuing basis ambiguity makes it difficult to identify events (e.g., measurement outcomes). Moreover, universal validity of quantum theory raises the issue of (ii) the origin of Born’s rule, p k =|ψ k | 2 , relating probabilities and amplitudes (that is simply postulated in textbooks). Last not least, even preferred pointer states (defined by einselection—environment—induced superselection)—are still quantum. Therefore, unlike classical states that exist objectively, quantum states of an individual system cannot be found out by an initially ignorant observer through direct measurement without being disrupted. So, to complete the ‘quantum theory of the classical’ one must identify (iii) quantum origin of objective existence and explain how the information about objectively existing states can appear to be essentially inconsequential for them (as it does for states in Newtonian physics) and yet matter in other settings (e.g., thermodynamics). I show how the mathematical structure of quantum theory supplemented by the only uncontroversial measurement postulate (that demands immediate repeatability—hence, predictability) leads to preferred states. These (i) pointer states correspond to measurement outcomes. Their stability is a prerequisite for objective existence of effectively classical states and for events such as quantum jumps. Events at hand, one can now enquire about their probability—the probability of a pointer state (or of a measurement record). I show that the symmetry of entangled states—(ii) entanglement—assisted invariance or envariance—implies Born’s rule. Envariance also accounts for the loss of phase coherence between pointer states. Thus, decoherence can be traced to symmetries of entanglement and understood without its usual tool—reduced density matrices. A simple and manifestly noncircular derivation of p k =|ψ k | 2 follows. Monitoring of the system by its environment in course of decoherence typically leaves behind multiple copies of its pointer states in the environment. Only pointer states can survive decoherence and can spawn such plentiful information-theoretic progeny. This (iii) quantum Darwinism allows observers to use environment as a witness—to find out pointer states indirectly, leaving systems of interest untouched. Quantum Darwinism shows how epistemic and ontic (coexisting in epiontic quantum state) separate into robust objective existence of pointer states and detached information about them, giving rise to extantons—composite objects with system of interest in the core and multiple records of its pointer states in the halo comprising of environment subsystems (e.g., photons) which disseminates that information throughout the Universe.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum computing without quantum computers: Database search and data processing using classical wave superposition

Quantum computers are proven to be more efficient at solving a specific class of problems compared to traditional digital computers. Superposition of states and quantum entanglement are the two key ingredients that make quantum computing so powerful. However, not all quantum algorithms require quantum entanglement (e.g., search through an unsorted database). Is it possible to utilize classical wave superposition to speed up database searching as much as by using quantum computers? There were several attempts to mimic quantum computers using classical waves. It was concluded that the use of classical wave superposition comes with the cost of an exponential increase in resources. In this work, we consider the feasibility of building classical wave-based devices able to provide fundamental speedup over digital counterparts without the exponential overhead. We present experimental data on database searching through a magnetic database using spin wave superposition. The results demonstrate the same speedup as expected for quantum computers. Also, we present examples of numerical modeling demonstrating classical wave interference for period finding. This approach may not compete with quantum computers with efficiency but outperform classical digital computers. We argue that classical wave-based devices can perform some of the quantum algorithms with the same efficiency as quantum computers as long as quantum entanglement is not required.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Emulating Quantum Entangled Biphoton Spectroscopy Using Classical Light Pulses

We show that for a class of quantum light spectroscopy (QLS) experiments using n = 0, 1, 2, ··· classical light pulses and an entangled photon pair (a biphoton state) where one photon acts as a reference without interacting with the matter sample, identical signals can be obtained by replacing the biphotons with classical-like coherent states of light, where these are defined explicitly in terms of the parameters of the biphoton states. An input-output formulation of quantum nonlinear spectroscopy is used to prove this equivalence. We demonstrate the equivalence numerically by comparing a classical pump–quantum probe experiment with the corresponding classical pump–classical probe experiment. This analysis shows that understanding the equivalence between entangled biphoton probes and carefully designed classical-like coherent state probes leads to quantum-inspired classical experiments that yield equivalent signals and provides insights for the future design of QLS experiments that could provide a true quantum advantage.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Testing Classical Properties from Quantum Data

Many properties of Boolean functions can be tested far more efficiently than the function itself can be learned. However, this dramatic advantage often disappears when testers are limited to random samples of ƒ instead of adaptively chosen queries to f. In this work we investigate the quantum version of this restriction: quantum algorithms that test properties of a Boolean function f solely from copies of either the function state |ƒ⟩ ∝ ∑ x |x, ƒ(x)⟩ or the phase state |(-1) ƒ ⟩ ∝ ∑ x (-1) ƒ(x) |x⟩. For monotonicity, symmetry, and triangle-freeness, we show passive quantum testers are unboundedly or super-polynomially better than their classical passive testing counterparts. They are competitive with classic query -based testers in each case. Our new testers use techniques beyond quantum Fourier sampling, and it turns out this is necessary: we show a certain class of bent functions can be tested from 𝒪(1) function states but has a sample complexity lower bound of 2 Ω(n) for any tester relying exclusively on Fourier and classical samples. Our passive quantum testers are competitive with classical query -based testers, but this isn't universal: we exhibit a testing problem that can be solved from 𝒪(1) classical queries but requires Ω(2 n/2 ) function state copies. The Forrelation problem provides a separation of the same magnitude in the opposite direction, so we conclude that quantum data and classical queries are "maximally incomparable" resources for testing. We also begin the study of lower bounds for testing from quantum data. For quantum monotonicity testing, we prove that the ensembles of [Goldreich et al., 2000; Black, 2024], which give exponential lower bounds for classical sample-based testing, do not yield any nontrivial lower bounds for testing from quantum data. New insights specific to quantum data will be required for proving copy complexity lower bounds for testing in this model.

Boolean Functions↗

Phase space quantum–classical hybrid model

Highlights: •Semiclassical model including back-action reaction beyond mean-field approximation. •Quantum–classical hybridization holds for all times as well as all intensities. •Wigner–Weyl phase-space correspondence mixing quantum with classical systems. -- Abstract: In this work we provide a complete model of semiclassical theories by including back-reaction and correlation into the picture. We specially aim at the interaction between light and a two-level atom, and we also illustrate it via the coupling of two harmonic oscillators. Quantum and classical systems are treated on the same grounds via the Wigner–Weyl phase-space correspondence of the quantum theory. We show that this model provides a suitable mixture of the quantum and classical degrees of freedom, including the fact that the evolution transfers nonclassical features to the classical subsystem and nonquantum behaviour to the quantum subsystem. In that sense, we can no longer distinguish between classical and quantum variables and we need to talk about a hybrid model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗