Search NASA⌕ Search

SEARCH · Search NASA

Results for “classical”

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 37 records · Page 2

Classic-Ada(TM)

The SPS product, Classic-Ada, is a software tool that supports object-oriented Ada programming with powerful inheritance and dynamic binding. Object Oriented Design (OOD) is an easy, natural development paradigm, but it is not supported by Ada. Following the DOD Ada mandate, SPS developed Classic-Ada to provide a tool which supports OOD and implements code in Ada. It consists of a design language, a code generator and a toolset. As a design language, Classic-Ada supports the object-oriented principles of information hiding, data abstraction, dynamic binding, and inheritance. It also supports natural reuse and incremental development through inheritance, code factoring, and Ada, Classic-Ada, dynamic binding and static binding in the same program. Only nine new constructs were added to Ada to provide object-oriented design capabilities. The Classic-Ada code generator translates user application code into fully compliant, ready-to-run, standard Ada. The Classic-Ada toolset is fully supported by SPS and consists of an object generator, a builder, a dictionary manager, and a reporter. Demonstrations of Classic-Ada and the Classic-Ada Browser were given at the workshop.

Valley, Lois↗

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↗

Hydrogen Burning of 29 Si and Its Impact on Presolar Stardust Grains from Classical Novae

Abstract Presolar stardust grains found in primitive meteorites are believed to retain the isotopic composition of stellar outflows at the time of grain condensation. Therefore, laboratory measurements of their isotopic ratios represent sensitive probes for investigating open questions related to stellar evolution, stellar explosions, nucleosynthesis, mixing mechanisms, dust formation, and galactic chemical evolution. For a few selected presolar grains, classical novae have been discussed as a potential source. For SiC, silicate, and graphite presolar grains, the association is based on the observation of small N ( 12 C)/ N ( 13 C) and N ( 14 N)/ N ( 15 N) number abundance ratios compared to solar values, and abundance excesses in 30 Si relative to 29 Si, as previously predicted by models of classical novae. We report on a direct measurement of the 29 Si(p, γ ) 30 P reaction, which strongly impacts simulated δ 29 Si values from classical novae. Our new experimental 29 Si(p, γ ) 30 P thermonuclear reaction rate differs from previous results by up to 50% in the classical nova temperature range ( T = 100–400 MK), while the rate uncertainty is reduced by up to a factor of 3. Using our new reaction rate in Monte Carlo reaction network and hydrodynamic simulations of classical novae, we estimate δ 29 Si values with much reduced uncertainties. Our results establish δ 29 Si values measured in presolar grains as a sensitive probe for assessing their classical nova paternity. We also demonstrate that δ 30 Si values from nova simulations are currently not a useful diagnostic tool unless the large uncertainty of the 30 P(p, γ ) 31 S reaction rate can be significantly reduced.

79 ASTRONOMY AND ASTROPHYSICS↗

Hybrid classical-quantum communication networks

Over the past several decades, the proliferation of global classical communication networks has transformed various facets of human society. Concurrently, quantum networking has emerged as a dynamic field of research, driven by its potential applications in distributed quantum computing, quantum sensor networks, and secure communications. This prompts a fundamental question: rather than constructing quantum networks from scratch, can we harness the widely available classical fiber-optic infrastructure to establish hybrid quantum–classical networks? This paper aims to provide a comprehensive review of ongoing research endeavors aimed at integrating quantum communication protocols, such as quantum key distribution, into existing lightwave networks. This approach offers the substantial advantage of reducing implementation costs by allowing classical and quantum communication protocols to share optical fibers, communication hardware, and other network control resources—arguably the most pragmatic solution in the near term. In the long run, classical communication will also reap the rewards of innovative quantum communication technologies, such as quantum memories and repeaters. Accordingly, our vision for the future of the Internet is that of heterogeneous communication networks thoughtfully designed for the seamless support of both classical and quantum communications.

Fiber-optic communication↗

Quantum-classical hybrid algorithm for the simulation of all-electron correlation

While chemical systems containing hundreds to thousands of electrons remain beyond the reach of quantum devices, hybrid quantum-classical algorithms present a promising pathway toward a quantum advantage. Hybrid algorithms treat the exponentially scaling part of the calculation-the static correlation-on the quantum computer and the non-exponentially scaling part-the dynamic correlation-on the classical computer. While a variety of algorithms have been proposed, the dependence of many methods on the total wave function limits the development of easy-to-use classical post-processing implementations. Here, we present a novel combination of quantum and classical algorithms, which computes the all-electron energy of a strongly correlated molecular system on the classical computer from the 2-electron reduced density matrix (2-RDM) evaluated on the quantum device. Significantly, we circumvent the wave function in the all-electron calculations by using density matrix methods that only require input of the statically correlated 2-RDM. Although the algorithm is completely general, we test it with two classical density matrix methods, the anti-Hermitian contracted Schrödinger equation (ACSE) and multiconfiguration pair-density functional theories, using the recently developed quantum ACSE method for simulating the statically correlated 2-RDM. Furthermore, we obtain experimental accuracy for the relative energies of all three benzyne isomers and thereby demonstrate the ability of the developed algorithm to achieve chemically relevant and accurate results on noisy intermediate-scale quantum devices.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A classical model for three-body interactions in aqueous ionic systems

We present a classical induction model to evaluate the three-body ion–water–water (I–W–W) and water–water–water (W–W–W) interactions in aqueous ionic systems. The classical description of the induction energy is based on electrostatic distributed multipoles up to hexadecapole and distributed polarizabilities up to quadrupole–quadrupole on the O and H atoms of water. The monatomic ions were described by a point charge and a dipole–dipole polarizability, while for the polyatomic ions, distributed multipoles up to hexadecapole and distributed polarizabilities up to quadrupole–quadrupole were used. The accuracy of the classical model is benchmarked against an accurate dataset of 936 (I–W–W) and 2184 (W–W–W) three-body terms for 13 different monatomic and polyatomic cation and anion systems. The classical model shows excellent agreement with the reference second order Moller–Plesset and coupled-cluster single double and perturbative triple [CCSD(T)] three-body energies. The Root-Mean-Square-Errors (RMSEs) for monatomic cations, monatomic anions, and polyatomic ions were 0.29, 0.25, and 0.12 kcal/mol, respectively. The corresponding RMSE for 1744 CCSD(T)/aVTZ three-body (W–W–W) energies, used to train MB-pol, was 0.12 kcal/mol. The accuracy of the proposed classical model demonstrates that the three-body term for aqueous ionic systems can be accurately modeled classically. This approach provides a fast, efficient, and as-accurate path toward modeling the three-body term in aqueous ionic systems that is fully transferable across systems with different ions without the need to fit to tens of thousands of ab initio calculations for each ion to extend existing many-body force fields to interactions between water and ions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Learnability Transitions in Monitored Quantum Dynamics via Eavesdropper’s Classical Shadows

Monitored quantum dynamics—unitary evolution interspersed with measurements—has recently emerged as a rich domain for phase structure in quantum many-body systems away from equilibrium. Here we study monitored dynamics from the point of view of an eavesdropper who has access to the classical measurement outcomes, but not to the quantum many-body system. We show that a measure of information flow from the quantum system to the classical measurement record—the —undergoes a phase transition in correspondence with the measurement-induced phase transition (MIPT). This transition determines the eavesdropper’s (in)ability to learn properties of an unknown initial quantum state of the system, given a complete classical description of the monitored dynamics and arbitrary classical computational resources. We make this learnability transition concrete by defining classical shadow protocols that the eavesdropper may apply to this problem, and show that the MIPT manifests as a transition in the sample complexity of various shadow-estimation tasks, which become harder in the low-measurement phase. We focus on three applications of interest: Pauli expectation values (where we find the MIPT appears as a point of optimal learnability for typical Pauli operators), many-body fidelity, and global charge in U ( 1 ) -symmetric dynamics. Our work unifies different manifestations of the MIPT under the umbrella of and gives this notion a general operational meaning via classical shadows. Published by the American Physical Society 2024

Physics↗

Observation of quantum Darwinism and the origin of classicality with superconducting circuits

The transition from quantum to classical behavior is a central question in modern physics. How can we rationalize everyday classical observations from an inherently quantum world? Quantum Darwinism offers a compelling framework to explain this by proposing that the environment redundantly encodes information about a quantum system, leading to the objective reality. Here, by leveraging cutting-edge superconducting quantum circuits, we observe the highly structured branching quantum states that support classicality and the saturation of quantum mutual information, establishing a robust verification of quantum Darwinism and the underlying geometric structure of quantum states. Additionally, we propose a particular class of observables that can be used as a computationally and experimentally inexpensive quantifier to probe quantum-to-classical transitions. Our investigation delves into how the quantum effects are inaccessible to observers, allowing only classical properties to be detected. It experimentally demonstrates the physical framework through which everyday classical observations emerge from underlying quantum principles and paves the way to settling the measurement problem.

Science & Technology - Other Topics↗

Classical eikonal from Magnus expansion

In a classical scattering problem, the classical eikonal is defined as the generator of the canonical transformation that maps in-states to out-states. It can be regarded as the classical limit of the log of the quantum S-matrix. In a classical analog of the Born approximation in quantum mechanics, the classical eikonal admits an expansion in oriented tree graphs, where oriented edges denote retarded/advanced worldline propagators. The Magnus expansion, which takes the log of a time-ordered exponential integral, offers an efficient method to compute the coefficients of the tree graphs to all orders. We exploit a Hopf algebra structure behind the Magnus expansion to develop a fast algorithm which can compute the tree coefficients up to the 12th order (over half a million trees) in less than an hour. In a relativistic setting, our methods can be applied to the post-Minkowskian (PM) expansion for gravitational binaries in the worldline formalism. We demonstrate the methods by computing the 3PM eikonal and find agreement with previous results based on amplitude methods. Importantly, the Magnus expansion yields a finite eikonal, while the naïve eikonal based on the time-symmetric propagator is infrared-divergent from 3PM on.

Black Holes↗

Koopman–von Neumann approach to quantum simulation of nonlinear classical dynamics

Quantum computers can be used to simulate nonlinear non-Hamiltonian classical dynamics on phase space by using the generalized Koopman–von Neumann formulation of classical mechanics. The Koopman–von Neumann formulation implies that the conservation of the probability distribution function on phase space, as expressed by the Liouville equation, can be recast as an equivalent Schrödinger equation on Hilbert space with a Hermitian Hamiltonian operator and a unitary propagator. This Schrödinger equation is linear in the momenta because it derives from a constrained Hamiltonian system with twice the classical phase-space dimension. A quantum computer with finite resources can be used to simulate a finite-dimensional approximation of this unitary evolution operator. Quantum simulation of classical dynamics is exponentially more efficient than a deterministic Eulerian discretization of the Liouville equation if the Koopman–von Neumann Hamiltonian is sparse. Utilizing quantum walk techniques for state preparation and amplitude estimation for the calculation of observables leads to a quadratic improvement over classical probabilistic Monte Carlo algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Diverging Quantum Speed Limits: A Herald of Classicality

When is the quantum speed limit (QSL) really quantum? While vanishing QSL times often indicate emergent classical behavior, it is still not entirely understood what precise aspects of classicality are at the origin of this dynamical feature. Here, we show that vanishing QSL times (or, equivalently, diverging quantum speeds) can be traced back to reduced uncertainty in quantum observables and can thus be understood as a consequence of emerging classicality for these particular observables. We illustrate this mechanism by developing a QSL formalism for continuous-variable quantum systems undergoing general Gaussian dynamics. For these systems, we show that three typical scenarios leading to vanishing QSL times, namely large squeezing, small effective Planck’s constant, and large particle number, can be fundamentally connected to each other. In contrast, by studying the dynamics of open quantum systems and mixed states, we show that the classicality that emerges due to incoherent mixing of states from the addition of classical noise typically increases the QSL time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Emulation of quantum correlations by classical dynamics in a spin-$\frac{1}{2}$ Heisenberg chain

We simulate the dynamical spin structure factor (DSSF) 𝒮⁡(𝑞,𝜔) of the spin-1/2 Heisenberg antiferromagnetic chain using classical simulations. By employing Landau-Lifshitz Dynamics, we emulate quantum correlations through temperature-dependent corrections, including rescaling of magnetic dipoles and renormalization of exchange interactions. Here, our results closely match Quantum Monte-Carlo calculations for 𝑘 B⁢ 𝑇/𝐽≳1, extending the applicability of classical dynamics to the challenging case of gapless excitations. At higher temperatures, our simulations comply with general predictions for uncorrelated paramagnetic fluctuations in the infinite temperature limit. Entanglement witnesses derived from the quantum-equivalent DSSF act as sensitive diagnostics for the quantum-to-classical crossover. Their reliability stems from their dependence on spectral features alone, enabling classical dynamics to emulate quantum thresholds without genuine entanglement. This framework also reproduces transverse spin correlations in finite magnetic fields, in agreement with quantum simulations. Together, our results establish quantum-corrected classical dynamics as a scalable and predictive tool for interpreting scattering experiments and exploring quantum correlations in strongly correlated spin systems.

Inelastic neutron scattering↗

Hybrid quantum-classical algorithms for approximate graph coloring

We show how to apply the recursive quantum approximate optimization algorithm (RQAOA) to MAX- k -CUT, the problem of finding an approximate k -vertex coloring of a graph. We compare this proposal to the best known classical and hybrid classical-quantum algorithms. First, we show that the standard (non-recursive) QAOA fails to solve this optimization problem for most regular bipartite graphs at any constant level p : the approximation ratio achieved by QAOA is hardly better than assigning colors to vertices at random. Second, we construct an efficient classical simulation algorithm which simulates level- 1 QAOA and level- 1 RQAOA for arbitrary graphs. In particular, these hybrid algorithms give rise to efficient classical algorithms, and no benefit arising from the use of quantum mechanics is to be expected. Nevertheless, they provide a suitable testbed for assessing the potential benefit of hybrid algorithm: We use the simulation algorithm to perform large-scale simulation of level- 1 QAOA and RQAOA with up to 300 qutrits applied to ensembles of randomly generated 3 -colorable constant-degree graphs. We find that level- 1 RQAOA is surprisingly competitive: for the ensembles considered, its approximation ratios are often higher than those achieved by the best known generic classical algorithm based on rounding an SDP relaxation. This suggests the intriguing possibility that higher-level RQAOA may be a potentially useful algorithm for NISQ devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗