Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum mathematics”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Lieb-Robinson Light Cone for Power-Law Interactions

The Lieb-Robinson theorem states that information propagates with a finite velocity in quantum systems on a lattice with nearest-neighbor interactions. What are the speed limits on information propagation in quantum systems with power-law interactions, which decay as 1 / r α at distance r ? Here, we present a definitive answer to this question for all exponents α > 2 d and all spatial dimensions d . Schematically, information takes time at least r min { 1 , α - 2 d } to propagate a distance r . As recent state transfer protocols saturate this bound, our work closes a decades-long hunt for optimal Lieb-Robinson bounds on quantum information dynamics with power-law interactions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Correspondence between open bosonic systems and stochastic differential equations

Bosonic mean-field theories can approximate the dynamics of systems of $n$ bosons provided that $n \gg 1$. Here, we show that there can also be an exact correspondence at finite $n$ when the bosonic system is generalized to include interactions with the environment and the mean-field theory is replaced by a stochastic differential equation. When the $n \to \infty$ limit is taken, the stochastic terms in this differential equation vanish, and a mean-field theory is recovered. Besides providing insight into the differences between the behavior of finite quantum systems and their classical limits given by $n \to \infty$, the developed mathematics can provide a basis for quantum algorithms that solve some stochastic nonlinear differential equations. We discuss conditions on the efficiency of these quantum algorithms, with a focus on the possibility for the complexity to be polynomial in the log of the stochastic system size. A particular system with the form of a stochastic discrete nonlinear Schrödinger equation is analyzed in more detail.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Limitations of Hartree–Fock with quantum resources

The Hartree–Fock problem provides the conceptual and mathematical underpinning of a large portion of quantum chemistry. As efforts in quantum technology aim to enhance computational chemistry algorithms, the Hartree–Fock method, central to many other numerical approaches, is a natural target for quantum enhanced algorithms. While quantum computers and quantum simulation offer many prospects for the future of modern chemistry, the non-deterministic polynomial-complete Hartree–Fock problem is not a likely candidate. Here, we highlight this fact from a number of perspectives including computational complexity, practical examples, and the full characterization of energy landscapes for simple systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2026

Learning thermodynamic master equations for open quantum systems

The characterization of Hamiltonians and other components of open quantum dynamical systems plays a crucial role in quantum computing and other applications. Scientific machine learning techniques have been applied to this problem in a variety of ways, including by modeling with deep neural networks. However, the majority of mathematical models describing open quantum systems are linear, and the natural nonlinearities in learnable models have not been incorporated using physical principles. We present a data-driven model for open quantum systems that includes learnable, thermodynamically consistent terms. The trained model is interpretable, as it directly estimates the system Hamiltonian and linear components of coupling to the environment. We validate the model on synthetic two and three-level data, as well as experimental two-level data collected from a quantum device at Lawrence Livermore National Laboratory.

Mathematics and Computing↗
NASA NTRS1996

Controlled Quantum Packets

We look at time evolution of a physical system from the point of view of dynamical control theory. Normally we solve motion equation with a given external potential and we obtain time evolution. Standard examples are the trajectories in classical mechanics or the wave functions in Quantum Mechanics. In the control theory, we have the configurational variables of a physical system, we choose a velocity field and with a suited strategy we force the physical system to have a well defined evolution. The evolution of the system is the 'premium' that the controller receives if he has adopted the right strategy. The strategy is given by well suited laboratory devices. The control mechanisms are in many cases non linear; it is necessary, namely, a feedback mechanism to retain in time the selected evolution. Our aim is to introduce a scheme to obtain Quantum wave packets by control theory. The program is to choose the characteristics of a packet, that is, the equation of evolution for its centre and a controlled dispersion, and to give a building scheme from some initial state (for example a solution of stationary Schroedinger equation). It seems natural in this view to use stochastic approach to Quantum Mechanics, that is, Stochastic Mechanics [S.M.]. It is a quantization scheme different from ordinary ones only formally. This approach introduces in quantum theory the whole mathematical apparatus of stochastic control theory. Stochastic Mechanics, in our view, is more intuitive when we want to study all the classical-like problems. We apply our scheme to build two classes of quantum packets both derived generalizing some properties of coherent states.

DeMartino, Salvatore↗
DOE OSTI2021

Reducing the complexity of finite-temperature auxiliary-field quantum Monte Carlo

The auxiliary-field quantum Monte Carlo (AFMC) method is a powerful and widely used technique for ground-state and finite-temperature simulations of quantum many-body systems. Here we introduce several algorithmic improvements for finite-temperature AFMC calculations of dilute fermionic systems that reduce the computational complexity of most parts of the algorithm. This is principally achieved by reducing the number of single-particle states that contribute at each configuration of the auxiliary fields to a number that is of the order of the number of fermions. Our methods are applicable for both the canonical and grand-canonical ensembles. We demonstrate the reduced computational complexity of the methods for the homogeneous unitary Fermi gas.

67.85.Lm↗
DOE OSTI2023

Sampling frequency thresholds for the quantum advantage of the quantum approximate optimization algorithm

We compare the performance of the Quantum Approximate Optimization Algorithm (QAOA) with state-of-the-art classical solvers Gurobi and MQLib to solve the MaxCut problem on 3-regular graphs. We identify the minimum noiseless sampling frequency and depth p required for a quantum device to outperform classical algorithms. There is potential for quantum advantage on hundreds of qubits and moderate depth with a sampling frequency of 10 kHz. We observe, however, that classical heuristic solvers are capable of producing high-quality approximate solutions in linear time complexity. In order to match this quality for large graph sizes N, a quantum device must support depth p > 11. Additionally, multi-shot QAOA is not efficient on large graphs, indicating that QAOA p ≤ 11 does not scale with N. These results limit achieving quantum advantage for QAOA MaxCut on 3-regular graphs. Other problems, such as different graphs, weighted MaxCut, and 3-SAT, may be better suited for achieving quantum advantage on near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Universal control of a six-qubit quantum processor in silicon

Future quantum computers capable of solving relevant problems will require a large number of qubits that can be operated reliably. However, the requirements of having a large qubit count and operating with high fidelity are typically conflicting. Spins in semiconductor quantum dots show long-term promise but demonstrations so far use between one and four qubits and typically optimize the fidelity of either single- or two-qubit operations, or initialization and readout. Here, we increase the number of qubits and simultaneously achieve respectable fidelities for universal operation, state preparation and measurement. We design, fabricate and operate a six-qubit processor with a focus on careful Hamiltonian engineering, on a high level of abstraction to program the quantum circuits, and on efficient background calibration, all of which are essential to achieve high fidelities on this extended system. State preparation combines initialization by measurement and real-time feedback with quantum-non-demolition measurements. These advances will enable testing of increasingly meaningful quantum protocols and constitute a major stepping stone towards large-scale quantum computers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Degree of Quantumness in Quantum Synchronization

We introduce the concept of degree of quantumness in quantum synchronization, a measure of the quantum nature of synchronization in quantum systems. Following techniques from quantum information, we propose the number of non-commuting observables that synchronize as a measure of quantumness. This fgure of merit is compatible with already existing synchronization measurements, and it captures diferent physical properties. We illustrate it in a quantum system consisting of two weakly interacting cavity-qubit systems, which are coupled via the exchange of bosonic excitations between the cavities. Moreover, we study the synchronization of the expectation values of the Pauli operators and we propose a feasible superconducting circuit setup. Finally, we discuss the degree of quantumness in the synchronization between two quantum van der Pol oscillators.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Quantum error mitigation by layerwise Richardson extrapolation

A widely used method for mitigating errors in noisy quantum computers is Richardson extrapolation, a technique in which the overall effect of noise on the estimation of quantum expectation values is captured by a single parameter that, after being scaled to larger values, is eventually extrapolated to the zero-noise limit. We generalize this approach by introducing layerwise Richardson extrapolation (LRE), an error mitigation protocol in which the noise of different individual layers (or larger chunks of the circuit) is amplified and the associated expectation values are linearly combined to estimate the zero-noise limit. The coefficients of the linear combination are analytically obtained from the theory of multivariate Lagrange interpolation. LRE leverages the flexible configurational space of layerwise unitary folding, allowing for a more nuanced mitigation of errors by treating the noise level of each layer of the quantum circuit as an independent variable. Furthermore, we provide numerical simulations demonstrating scenarios where LRE achieves superior performance compared to traditional (single-variable) Richardson extrapolation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Rodeo Algorithm for Quantum Computing

We present a stochastic quantum computing algorithm that can prepare any eigenvector of a quantum Hamiltonian within a selected energy interval $\ [E-\epsilon, E+\epsilon]$. In order to reduce the spectral weight of all other eigenvectors by a suppression factor δ, the required computational effort scales as $\ O[|\log \delta|/(p \epsilon)]$, where p s the squared overlap of the initial state with the target eigenvector. The method, which we call the rodeo algorithm, uses auxiliary qubits to control the time evolution of the Hamiltonian minus some tunable parameter E . In this manner, we converge to the target eigenvector with exponential accuracy in the number of measurements. In addition to preparing eigenvectors, the method can also compute the full spectrum of the Hamiltonian. We illustrate the performance with several examples. For energy eigenvalue determination with error $\epsilon$, the computational scaling is $\ O[(\log \epsilon)^2/(p \epsilon)]$. For eigenstate preparation, the computational scaling is $\ O(\log \Delta/p)$, where $\Delta$ is the magnitude of the orthogonal component of the residual vector. The speed for eigenstate preparation is exponentially faster than that for phase estimation or adiabatic evolution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Denoising and Extension of Response Functions in the Time Domain

Response functions of quantum systems, such as electron Green’s functions, magnetic, or charge susceptibilities, describe the response of a system to an external perturbation. They are the central objects of interest in field theories and quantum computing and measured directly in experiment. Further, response functions are intrinsically causal. In equilibrium and steady-state systems, they correspond to a positive spectral function in the frequency domain. Since response functions define an inner product on a Hilbert space and thereby induce a positive definite function, the properties of this function can be used to reduce noise in measured data and, in equilibrium and steady state, to construct positive definite extensions for data known on finite time intervals, which are then guaranteed to correspond to positive spectra.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Feasibility of Hybrid Electro- and Acousto-Dynamical Systems for Quantum Optical Networks

We present results on an exploratory research program that aims to study the feasibility of novel, sustained, dense, and efficient quantum information generation, storage, retrieval, relay and distribution devices and systems towards future advanced quantum networking architectures. The pathfinder program is anchored on original ideas and device conceptual designs that turn the phononic-sourced challenges into an opportunity towards optimized transduction chains over a broad range of length and energy/temperature scales. The proposal involves conceptual design and feasibility towards integration, commissioning and benchmarking of challenging transduction devices in a scaled quantum network setup.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗