Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum Networks”

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 973 records · Page 54

Kolmogorov-Arnold wavefunctions

Here, this work investigates Kolmogorov-Arnold network-based (KAN) wave-function Ansätz as viable representations for quantum Monte Carlo simulations. Through systematic analysis of one-dimensional model systems, we evaluate their computational efficiency and representational power against established methods. Our numerical experiments suggest some efficient training methods and we explore how the computational cost scales with desired precision, particle number, and system parameters. Roughly speaking, KANs seem to be 10 times cheaper computationally than other neural-network-based Ansätz . We also introduce a novel approach for handling strong short-range potentials—a persistent challenge for many numerical techniques—which generalizes efficiently to higher-dimensional, physically relevant systems with short-ranged strong potentials common in atomic and nuclear physics.

1-dimensional systems↗

Tensor network formulation of two-dimensional gravity

We show how to formulate a lattice gauge theory whose naive continuum limit corresponds to two-dimensional (Euclidean) quantum gravity including a positive cosmological constant. More precisely the resultant continuum theory corresponds to gravity in a first-order formalism in which the local frame and spin connection are treated as independent fields. Recasting this lattice theory as a tensor network allows us to study the theory at strong coupling without encountering a sign problem. In two dimensions this tensor network is exactly soluble and we show that the system has a series of critical points that occur for pure imaginary coupling and are associated with first order phase transitions. We then augment the action with a Yang-Mills term which allows us to control the lattice spacing and show how to apply the tensor renormalization group to compute the free energy and look for critical behavior. Finally we perform an analytic continuation in the gravity coupling in this extended model and show that its critical behavior in a certain scaling limit depends only on the topology of the underlying lattice. We also show how the lattice gauge theory can be naturally generalized to generate the Polyakov or Liouville action for two dimensional quantum gravity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Propagation of nonclassical correlations across a quantum spin chain

We study the transport of quantum correlations across a chain of interacting spin-1/2 particles. As a quantitative figure of merit, we choose a symmetric version of quantum discord and compare it with the transported entanglement, addressing various operating regimes of the spin medium. Discord turns out to be better transported for a wide range of working points and initial conditions of the system. We relate this behavior to the efficiency of propagation of a single excitation across the spin chain. Moreover, we point out the role played by a magnetic field in the dynamics of discord in the effective channel embodied by the chain. Our analysis can be interestingly extended to transport processes in more complex networks and the study of nonclassical correlations under general quantum channels.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance

A recent quantum simulation of observables of the kicked Ising model on 127 qubits implemented circuits that exceed the capabilities of exact classical simulation. We show that several approximate classical methods, based on sparse Pauli dynamics and tensor network algorithms, can simulate these observables orders of magnitude faster than the quantum experiment and can also be systematically converged beyond the experimental accuracy. Our most accurate technique combines a mixed Schrödinger and Heisenberg tensor network representation with the Bethe free entropy relation of belief propagation to compute expectation values with an effective wave function–operator sandwich bond dimension >16,000,000, achieving an absolute accuracy, without extrapolation, in the observables of <0.01, which is converged for many practical purposes. We thereby identify inaccuracies in the experimental extrapolations and suggest how future experiments can be implemented to increase the classical hardness.

Science & Technology - Other Topics↗

Smart quantum statistical imaging beyond the Abbe-Rayleigh criterion

The wave nature of light imposes limits on the resolution of optical imaging systems. For over a century, the Abbe-Rayleigh criterion has been utilized to assess the spatial resolution limits of imaging instruments. Recently, there has been interest in using spatial projective measurements to enhance the resolution of imaging systems. Unfortunately, these schemes require a priori information regarding the coherence properties of “unknown” light beams and impose stringent alignment conditions. Here, we introduce a smart quantum camera for superresolving imaging that exploits the self-learning features of artificial intelligence to identify the statistical fluctuations of unknown mixtures of light sources at each pixel. This is achieved through a universal quantum model that enables the design of artificial neural networks for the identification of photon fluctuations. Our protocol overcomes limitations of existing superresolution schemes based on spatial mode projections, and consequently provides alternative methods for microscopy, remote sensing, and astronomy.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Enabling complete multichannel nonadiabatic dynamics: A global representation of the two-channel coupled, 1,2 1 A and 1 3 A states of NH 3 using neural networks

Global coupled three-state two-channel potential energy and property/interaction (dipole and spin–orbit coupling) surfaces for the dissociation of NH 3 (Ã) into NH + H 2 and NH 2 + H are reported. The permutational invariant polynomial-neural network approach is used to simultaneously fit and diabatize the electronic Hamiltonian by fitting the energies, energy gradients, and derivative couplings of the two coupled lowest-lying singlet states as well as fitting the energy and energy gradients of the lowest-lying triplet state. The key issue in fitting property matrix elements in the diabatic basis is that the diabatic surfaces must be smooth, that is, the diabatization must remove spikes in the original adiabatic property surfaces attributable to the switch of electronic wavefunctions at the conical intersection seam. Here, we employ the fit potential energy matrix to transform properties in the adiabatic representation to a quasi-diabatic representation and remove the discontinuity near the conical intersection seam. The property matrix elements can then be fit with smooth neural network functions. The coupled potential energy surfaces along with the dipole and spin–orbit coupling surfaces will enable more accurate and complete treatment of optical transitions, as well as nonadiabatic internal conversion and intersystem crossing.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Trustworthiness of detectors in quantum key distribution with untrusted detectors

Measurement-device-independent quantum key distribution (MDI-QKD) protocol has been demonstrated as a viable solution to detector side-channel attacks. One of the main advantages of MDI-QKD is that the security can be proved without making any assumptions about how the measurement device works. The price to pay is the relatively low secure key rate comparing with conventional quantum key distribution (QKD), such as the decoy-state BB84 protocol. Recently a new QKD protocol, aiming at bridging the strong security of MDI-QKD with the high e ciency of conventional QKD, has been proposed. In this protocol, the legitimate receiver employs a trusted linear optics network to encode information on photons received from an insecure quantum channel, and then performs a Bell state measurement (BSM) using untrusted detectors. One crucial assumption made in most of these studies is that the untrusted BSM located inside the receiver's laboratory cannot send any unwanted information to the outside. Here in this paper, we show that if the BSM is completely untrusted, a simple scheme would allow the BSM to send information to the outside. Combined with Trojan horse attacks, this scheme could allow Eve to gain information of the quantum key without being detected. Ultimately, to prevent the above attack, either countermeasures to Trojan horse attacks or some trustworthiness to the "untrusted" BSM device is required.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

RAM as a Network Managed Resource

This paper describes an architecture for and several application examples of using a dynamically allocable RAM pool over the network as part of a deep memory hierarchy. We present four different use cases, including in situ analysis, machine learning, quantum chemistry simulations, and virtualization. In each use case, we modified or implemented software to use a network RAM pool, and then evaluated the performance. The cases of in situ analysis, machine learning, and virtualization demonstrated good performance. While the quantum chemistry experiments exhibited an average slowdown of 53% for all runs, including those where resources were clearly oversubscribed, the scalability results showed promise.

Allcock, William↗

Isometric Tensor Network States in Two Dimensions

Tensor-network states (TNS) are a promising but numerically challenging tool for simulating two-dimensional (2D) quantum many-body problems. We introduce an isometric restriction of the TNS ansatz that allows for highly efficient contraction of the network. Here we consider two concrete applications using this ansatz. First, we show that a matrix-product state representation of a 2D quantum state can be iteratively transformed into an isometric 2D TNS. Second, we introduce a 2D version of the time-evolving block decimation algorithm for approximating of the ground state of a Hamiltonian as an isometric TNS-which we demonstrate for the 2D transverse field Ising model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Neural-network model for force prediction in multi-principal-element alloys

Atomistic simulations can provide useful insights into the physical properties of multi-principal-element alloys. However, classical potentials mostly fail to capture key quantum (electronic-structure) effects. Here we present a deep 3D convolutional neural network (3D CNN) based framework combined with a voxelization technique to design interatomic potentials for chemically complex alloys. We highlight the performance of the 3D CNN model and its efficacy in computing potentials using the medium-entropy alloy TaNbMo. In order to provide insights into the effect of voxel resolution, we implemented two approaches based on the inner and outer bounding boxes. An efficient 3D CNN model, which is as accurate as the density-functional theory (DFT) approach, for calculating potentials will provide a promising schema for accurate atomistic simulations of structure and dynamics of general multi-principle element alloys.

36 MATERIALS SCIENCE↗

Estimating the randomness of quantum circuit ensembles up to 50 qubits

Random quantum circuits have been utilized in the contexts of quantum supremacy demonstrations, variational quantum algorithms for chemistry and machine learning, and blackhole information. The ability of random circuits to approximate any random unitaries has consequences on their complexity, expressibility, and trainability. To study this property of random circuits, we develop numerical protocols for estimating the frame potential, the distance between a given ensemble and the exact randomness. Our tensor-network-based algorithm has polynomial complexity for shallow circuits and is high-performing using CPU and GPU parallelism. We study 1. local and parallel random circuits to verify the linear growth in complexity as stated by the Brown–Susskind conjecture, and; 2. hardware-efficient ansätze to shed light on its expressibility and the barren plateau problem in the context of variational algorithms. Our work shows that large-scale tensor network simulations could provide important hints toward open problems in quantum information science.

97 MATHEMATICS AND COMPUTING↗

Reconfigurable plasma-dielectric hybrid photonic crystal as a platform for electromagnetic wave manipulation and computing

The introduction of 3D printing has enabled fabrication of photonic crystal devices with complex crystal structures that would be challenging to construct using other fabrication methods. In this paper, we construct and characterize a photonic crystal consisting of two 4 x 8 x 8 cubic lattices composed of spherical silicon nitride elements straddling a layer of 8 plasma discharge tubes, creating a 3D hybrid plasma photonic crystal device. Integrating under-dense gaseous plasma elements provides a unique coupling dynamic between the dielectric spheres and the cylindrical plasma discharges, creating a monolithic hybrid photonic crystal with solid state and reconfigurable elements. The device has resonant modes that have attenuation peaks that are either switchable, tunable in amplitude, or tunable in frequency with variations in plasma density. The response of these bands seen with varying plasma density is confirmed through simulations when effects due to the heating of the photonic crystal from the gaseous plasma elements are accounted for in the experiments. We discuss how this reconfigurable device may be used and expanded upon for applications in photonic artificial neural networks and optical computing systems.

3D printing↗

Computing single step operators of logic programming in radial basis function neural networks

Logic programming is the process that leads from an original formulation of a computing problem to executable programs. A normal logic program consists of a finite set of clauses. A valuation I of logic programming is a mapping from ground atoms to false or true. The single step operator of any logic programming is defined as a function (T{sub p}:I→I). Logic programming is well-suited to building the artificial intelligence systems. In this study, we established a new technique to compute the single step operators of logic programming in the radial basis function neural networks. To do that, we proposed a new technique to generate the training data sets of single step operators. The training data sets are used to build the neural networks. We used the recurrent radial basis function neural networks to get to the steady state (the fixed point of the operators). To improve the performance of the neural networks, we used the particle swarm optimization algorithm to train the networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multi-objective goal-directed optimization of de novo stable organic radicals for aqueous redox flow batteries

Abstract Advances in the field of goal-directed molecular optimization offer the promise of finding feasible candidates for even the most challenging molecular design applications. One example of a fundamental design challenge is the search for novel stable radical scaffolds for an aqueous redox flow battery that simultaneously satisfy redox requirements at the anode and cathode, as relatively few stable organic radicals are known to exist. To meet this challenge, we develop a new open-source molecular optimization framework based on AlphaZero coupled with a fast, machine-learning-derived surrogate objective trained with nearly 100,000 quantum chemistry simulations. The objective function comprises two graph neural networks: one that predicts adiabatic oxidation and reduction potentials and a second that predicts electron density and local three-dimensional environment, previously shown to be correlated with radical persistence and stability. With no hard-coded knowledge of organic chemistry, the reinforcement learning agent finds molecule candidates that satisfy a precise combination of redox, stability and synthesizability requirements defined at the quantum chemistry level, many of which have reasonable predicted retrosynthetic pathways. The optimized molecules show that alternative stable radical scaffolds may offer a unique profile of stability and redox potentials to enable low-cost symmetric aqueous redox flow batteries.

25 ENERGY STORAGE↗

Entanglement negativity and replica symmetry breaking in general holographic states

The entanglement negativity $\mathcal{E}$(A : B) is a useful measure of quantum entanglement in bipartite mixed states. In random tensor networks (RTNs), which are related to fixed-area states, it was found in ref. [1] that the dominant saddles computing the even Rényi negativity $\mathcal{E}$ (2k) generically break the ℤ 2k replica symmetry. This calls into question previous calculations of holographic negativity using 2D CFT techniques that assumed ℤ 2k replica symmetry and proposed that the negativity was related to the entanglement wedge cross section. In this paper, we resolve this issue by showing that in general holographic states, the saddles computing $\mathcal{E}$ (2k) indeed break the ℤ 2k replica symmetry.

AdS-CFT Correspondence↗

Equivalence between classical and quantum dynamics. Neutral kaons and electric circuits

An equivalence between the Schroedinger dynamics of a quantum system with a finite number of basis states and a classical dynamics is presented. The equivalence is an isomorphism that connects in univocal way both dynamical systems. We treat the particular case of neutral kaons and found a class of electric networks uniquely related to the kaon system finding the complete map between the matrix elements of the effective Hamiltonian of kaons and those elements of the classical dynamics of the networks. As a consequence, the relevant {epsilon} parameter that measures CP violation in the kaon system is completely determined in terms of network parameters. - Highlights: > We provide a formal equivalence between classical and quantum dynamics. > We make use of the decomplexification concept. > Neutral kaon systems can be represented by electric circuits. > CP symmetry violation can be taken into account by non-reciprocity. > Non-reciprocity is represented by gyrators.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Entanglement perspective on the quantum approximate optimization algorithm

Many quantum algorithms seek to output a specific bitstring solving the problem of interest—or a few if the solution is degenerate. It is the case for the quantum approximate optimization algorithm (QAOA) in the limit of large circuit depth, which aims to solve quadratic unconstrained binary optimization problems. Hence, the expected final state for these algorithms is either a product state or a low-entangled superposition involving a few bitstrings. What happens in between the initial N -qubit product state | 0 〉 ⊗ N and the final one regarding entanglement? Here, we consider the QAOA algorithm for solving the paradigmatic MaxCut problem on different types of graphs. We study the entanglement growth and spread resulting from randomized and optimized QAOA circuits and find that there is a volume-law entanglement barrier between the initial and final states. We also investigate the entanglement spectrum in connection with random matrix theory. In addition, we compare the entanglement production with a quantum annealing protocol aiming to solve the same MaxCut problems. Finally, we discuss the implications of our results for the simulation of QAOA circuits with tensor network-based methods relying on low-entanglement for efficiency, such as matrix product states.

Dupont, Maxime↗