Quantum-mechanical communication theory
Quantum mechanical communication theory of optimal receivers, using statistical detection and estimation theory
Gordon, J. P.↗
SEARCH · Search NASA
Results for “quantum optimization”
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.
Architecture for Quantum-in-the Loop Real-Time Simulations for Designing Resilient Smart Grids
With the power grid growing more complex every day with the inclusion of new sensors and regulatory approvals that enable end-users and small local developers to participate in the grid, it is becoming challenging for conventional smart grid simulation, emulation, and testing technologies to keep up. In this work, we propose that quantum-encoded real-time simulations can be helpful under the new paradigm and operational circumstances to solve optimization problems for power grids. By leveraging the principles of quantum mechanics, the proposed quantum-in-loop (QIL) framework will enable better and faster optimization solutions based on real-world, real-time data streams, facilitating the real-time planning and operations of electrical grids that rely on millions of distributed sensors and controllers. Furthermore, QIL will allow researchers and engineers to assist utilities in designing, developing, and de-risking algorithms to optimize power grid operation and resilience by considering inputs from millions of grid-connected devices. QIL framework is being developed to have a self-limiting triage mechanism, which will help engineers and practitioners identify fundamental physical limits on quantum processors, revealing what quantum algorithms can and cannot do in utility-specific use cases and must continue to count on classical high-performance computing infrastructure.
digital real-time simulation↗
Adaptive Circuit Learning for Quantum Metrology
Quantum sensing is an important application of emerging quantum technologies. We explore whether a hybrid system of quantum sensors and quantum circuits can surpass the classical limit of sensing. In particular, we use optimization techniques to search for encoder and decoder circuits that scalably improve sensitivity under given application and noise characteristics. Furthermore, our approach uses a variational algorithm that can learn a quantum sensing circuit based on platform-specific control capacity, noise, and signal distribution. The quantum circuit is composed of an encoder which prepares the optimal sensing state and a decoder which gives an output distribution containing information of the signal. We optimize the full circuit to maximize the Signal-to-Noise Ratio (SNR). Furthermore, this learning algorithm can be run on real hardware scalably by using the "parameter-shift" rule which enables gradient evaluation on noisy quantum circuits, avoiding the exponential cost of quantum system simulation. We demonstrate up to 13.12x SNR improvement over existing fixed protocol (GHZ), and 3.19x Classical Fisher Information (CFI) improvement over the classical limit on 15 qubits using IBM quantum computer. More notably, our algorithm overcomes the decreasing performance of existing entanglement-based protocols with increased system sizes.
42 ENGINEERING↗
Tucker-1 Boolean Tensor Factorization with Quantum Annealers
Quantum annealers are an emerging computational architecture that have the potential to address some challenging computational issues that will be left unresolved as we approach the end of the Moore's Law era of computing. D-Wave quantum annealers are designed to solve a challenging set of problems - quadratic unconstrained binary optimization problems. This makes them a natural fit for solving problems with binary or Boolean variables. Here, we explore the use of a quantum annealer to solve Boolean tensor factorization. The goal of Boolean tensor factorization is to represent a high-dimensional tensor filled with Boolean values as a product of Boolean matrices and a Boolean core tensor. We show that a particular Boolean tensor factorization problem (called Tucker-1 factorization) can be decomposed into a sequence of quadratic unconstrained binary optimization problems that can be solved with a D-Wave 2000Q quantum annealer. While quantum annealers specifically and quantum computers in general are at a fairly early stage in their development, they are currently capable of solving these Boolean tensor factorization problems. Importantly, our results show that for fairly small tensors, we are frequently able to obtain an accurate (sometimes exact) factorization using quantum annealing.
97 MATHEMATICS AND COMPUTING↗
Learning to Predict Arbitrary Quantum Processes
We present an efficient machine-learning (ML) algorithm for predicting any unknown quantum process ℰ over 𝑛 qubits. For a wide range of distributions 𝒟 on arbitrary 𝑛-qubit states, we show that this ML algorithm can learn to predict any local property of the output from the unknown process ℰ, with a small average error over input states drawn from 𝒟. The ML algorithm is computationally efficient even when the unknown process is a quantum circuit with exponentially many gates. Our algorithm combines efficient procedures for learning properties of an unknown state and for learning a low-degree approximation to an unknown observable. The analysis hinges on proving new norm inequalities, including a quantum analogue of the classical Bohnenblust-Hille inequality, which we derive by giving an improved algorithm for optimizing local Hamiltonians. Numerical experiments on predicting quantum dynamics with evolution time up to 10 6 and system size up to 50 qubits corroborate our proof. Overall, our results highlight the potential for ML models to predict the output of complex quantum dynamics much faster than the time needed to run the process itself.
quantum computation↗
A Study of Complex Deep Learning Networks on High Performance, Neuromorphic, and Quantum Computers
Current Deep Learning models use highly optimized convolutional neural networks (CNN) trained on large graphical processing units (GPU)-based computers with a fairly simple layered network topology, i.e., highly connected layers, without intra-layer connections. Complex topologies have been proposed, but are intractable to train on current systems. Building the topologies of the deep learning network requires hand tuning, and implementing the network in hardware is expensive in both cost and power.In this paper, we evaluate deep learning models using three different computing architectures to address these problems: quantum computing to train complex topologies, high performance computing (HPC) to automatically determine network topology, and neuromorphic computing for a low-power hardware implementation. Due to input size limitations of current quantum computers we use the MNIST dataset for our evaluation.The results show the possibility of using the three architectures in tandem to explore complex deep learning networks that are untrainable using a von Neumann architecture. We show that a quantum computer can find high quality values of intra-layer connections and weights, while yielding a tractable time result as the complexity of the network increases; a high performance computer can find optimal layer-based topologies; and a neuromorphic computer can represent the complex topology and weights derived from the other architectures in low power memristive hardware.This represents a new capability that is not feasible with current von Neumann architecture. It potentially enables the ability to solve very complicated problems unsolvable with current computing technologies.
97 MATHEMATICS AND COMPUTING↗
A Study of Complex Deep Learning Networks on High Performance, Neuromorphic, and Quantum Computers
Current Deep Learning models use highly optimized convolutional neural networks (CNN) trained on large graphical processing units (GPU)-based computers with a fairly simple layered network topology, i.e., highly connected layers, without intra-layer connections. Complex topologies have been proposed, but are intractable to train on current systems. Building the topologies of the deep learning network requires hand tuning, and implementing the network in hardware is expensive in both cost and power. In this paper, we evaluate deep learning models using three different computing architectures to address these problems: quantum computing to train complex topologies, high performance computing (HPC) to automatically determine network topology, and neuromorphic computing for a low-power hardware implementation. Due to input size limitations of current quantum computers we use the MNIST dataset for our evaluation. The results show the possibility of using the three architectures in tandem to explore complex deep learning networks that are untrainable using a von Neumann architecture. We show that a quantum computer can find high quality values of intra-layer connections and weights, while yielding a tractable time result as the complexity of the network increases; a high performance computer can find optimal layer-based topologies; and a neuromorphic computer can represent the complex topology and weights derived from the other architectures in low power memristive hardware. This represents a new capability that is not feasible with current von Neumann architecture. It potentially enables the ability to solve very complicated problems unsolvable with current computing technologies.
Potok, Thomas E↗
Coherent phase control of internal conversion in pyrazine
Shaped ultrafast laser pulses were used to study and control the ionization dynamics of electronically excited pyrazine in a pump and probe experiment. For pump pulses created without feedback from the product signal, the ion growth curve (the parent ion signal as a function of pump/probe delay) was described quantitatively by the classical rate equations for internal conversion of the S{sub 2} and S{sub 1} states. Very different, non-classical behavior was observed when a genetic algorithm (GA) employing phase-only modulation was used to minimize the ion signal at some pre-determined target time, T. Two qualitatively different control mechanisms were identified for early (T < 1.5 ps) and late (T > 1.5 ps) target times. In the former case, the ion signal was largely suppressed for t < T, while for t ≫ T, the ion signal produced by the GA-optimized pulse and a transform limited (TL) pulse coalesced. In contrast, for T > 1.5 ps, the ion growth curve followed the classical rate equations for t < T, while for t ≫ T, the quantum yield for the GA-optimized pulse was much smaller than for a TL pulse. We interpret the first type of behavior as an indication that the wave packet produced by the pump laser is localized in a region of the S{sub 2} potential energy surface where the vertical ionization energy exceeds the probe photon energy, whereas the second type of behavior may be described by a reduced absorption cross section for S{sub 0} → S{sub 2} followed by incoherent decay of the excited molecules. Amplitude modulation observed in the spectrum of the shaped pulse may have contributed to the control mechanism, although this possibility is mitigated by the very small focal volume of the probe laser.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
High power, 1060-nm diode laser with an asymmetric hetero-waveguide
By introducing an asymmetric hetero-waveguide into the epitaxial structure of a diode laser, a 6.21-W output is achieved at a wavelength of 1060 nm. A different design in p- and n-confinement, based on optimisation of energy bands, is used to reduce voltage loss and meet the requirement of high power and high wall-plug efficiency. A 1060-nm diode laser with a single quantum well and asymmetric hetero-structure waveguide is fabricated and analysed. Measurement results show that the asymmetric hetero-structure waveguide can be efficiently used for reducing voltage loss and improving the confinement of injection carriers and wall-plug efficiency. (lasers)
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Quantum-enhanced plasmonic sensing
Quantum resources can enhance the sensitivity of a device beyond the classical shot noise limit and, as a result, revolutionize the field of metrology through the development of quantum-enhanced sensors. In particular, plasmonic sensors, which are widely used in biological and chemical sensing applications, offer a unique opportunity to bring such an enhancement to real-life devices. Here, we use bright entangled twin beams to enhance the sensitivity of a plasmonic sensor used to measure local changes in the refractive index. We demonstrate a 56% quantum enhancement in the sensitivity of a state-of-the-art plasmonic sensor when compared with the corresponding classical configuration and a 24% quantum enhancement when compared to an optimal single-beam classical configuration. We measure sensitivities on the order of 10 –10 RIU / √Hz, nearly 5 orders of magnitude better than previous proof-of-principle implementations of quantum-enhanced plasmonic sensors. Furthermore, these results promise significant enhancements in ultratrace label-free plasmonic sensing and will find their way into areas ranging from biomedical applications to chemical detection.
47 OTHER INSTRUMENTATION↗
Quantum Solver of Contracted Eigenvalue Equations for Scalable Molecular Simulations on Quantum Computing Devices
The accurate computation of ground and excited states of many-fermion quantum systems is one of the most consequential, contemporary challenges in the physical and computational sciences whose solution stands to benefit significantly from the advent of quantum computing devices. Existing methodologies using phase estimation or variational algorithms have potential drawbacks such as deep circuits requiring substantial error correction or non-trivial high-dimensional classical optimization. In this work, we introduce a quantum solver of contracted eigenvalue equations, the quantum analogue of classical methods for the energies and reduced density matrices of ground and excited states. The solver does not require deep circuits or difficult classical optimization and achieves an exponential speed-up over its classical counterpart. We demonstrate the algorithm though computations on both a quantum simulator and two IBM quantum processing units.
97 MATHEMATICS AND COMPUTING↗
Experimental investigation of spin-orbit coupling in n-type PbTe quantum wells
The spin-orbit coupling is studied experimentally in two PbTe quantum wells by means of weak antilocalization effect. Using the Hikami-Larkin-Nagaoka model through a computational global optimization procedure, we extracted the spin-orbit and inelastic scattering times and estimated the strength of the zero field spin-splitting energy Δ{sub so}. The values of Δ{sub so} are linearly dependent on the Fermi wave vector (k{sub F}) confirming theoretical predictions of the existence of large spin-orbit coupling in IV-VI quantum wells originated from pure Rashba effect.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
Variational hybrid quantum-classical algorithms (VHQCAs) have the potential to be useful in the era of near-term quantum computing. However, recently there has been concern regarding the number of measurements needed for convergence of VHQCAs. Here, we address this concern by investigating the classical optimizer in VHQCAs. We introduce a novel optimizer called individual Coupled Adaptive Number of Shots (iCANS). This adaptive optimizer frugally selects the number of measurements (i.e., number of shots) both for a given iteration and for a given partial derivative in a stochastic gradient descent. We numerically simulate the performance of iCANS for the variational quantum eigensolver and for variational quantum compiling, with and without noise. In all cases, and especially in the noisy case, iCANS tends to out-perform state-of-the-art optimizers for VHQCAs. We therefore believe this adaptive optimizer will be useful for realistic VHQCA implementations, where the number of measurements is limited.
97 MATHEMATICS AND COMPUTING↗
Quantum simulations in effective model spaces: Hamiltonian-learning variational quantum eigensolver using digital quantum computers and application to the Lipkin-Meshkov-Glick model
Quantum simulations offer the potential to predict the structure and dynamics of nuclear many-body systems that are beyond the capabilities of classical computing. Generally, preparing the ground state of strongly-interacting many-body systems relevant to nuclear physics is however inefficient, even using ideal quantum computers. In addition, currently available NISQ-era quantum devices possess modest numbers of qubits, limiting the size of quantum many-body systems that can be simulated. In this context, a reformulation of the quantum many-body problems using truncated model spaces and Hamiltonians is desirable to make them more amenable to near-term quantum computers. The importance of symmetries in low-energy theories, including effective field theories (EFTs), lattice quantum chromodynamics (QCD), and effective model spaces for nuclear systems, in particular their interplay with the reduction of active Hilbert spaces, is well known. Lesser known is the fact that the non-commutivity of some symmetries and truncations of the model space can be profitably combined with variational calculations to rearrange the entanglement into localized structures and enable more efficient simulations. Here, the goal of the present study is to explore and utilize the non-commutivity of symmetries and model-space truncations of quantum many-body systems important to nuclear physics, particularly in combination with variational algorithms for quantum simulations and effective Hamiltonian learning. We introduce an iterative hybrid classical-quantum algorithm, Hamiltonian learning variational quantum eigensolver (HL-VQE), that simultaneously optimizes an effective Hamiltonian, thereby rearranging entanglement into the effective model space, and the associated ground-state wavefunction. Quantum simulations, using classical computers and IBM's superconducting-qubit quantum computers, are performed to demonstrate the HL-VQE algorithm, in the context of the Lipkin-Meshkov-Glick (LMG) model of interacting fermions, where the Hamiltonian transformation corresponds to an orbital rotation. We use a mapping where the number of qubits scales with the $\log$ of the size of the effective model space, rather than the particle number. HL-VQE is found to provide an exponential improvement in LMG-model calculations of the ground-state energy and wavefunction, compared to naive truncations without Hamiltonian learning, throughout a significant fraction of the Hilbert space. In the context of EFT, this corresponds to counterterms scaling exponentially with the cut-off as opposed to power law. Implementations on IBM's QExperience quantum computers and simulators for 1- and 2-qubit effective model spaces are shown to provide accurate and precise results, reproducing classical predictions. For a range of parameters defining the LMG model, the HL-VQE algorithm is found to have better scaling of quantum resources requirements than previously explored algorithms. In particular, the HL-VQE scales efficiently over a large fraction of the model space, in contrast to VQE alone. This work constitutes a step in the development of entanglement-driven quantum algorithms for descriptions of nuclear many-body systems. This, in part, leverages the potential of noisy intermediate-scale quantum (NISQ) devices. The exponential scaling of counterterms observed in this study suggests the possibility of more general applicability to other non-perturbative EFTs.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Gauge-fixing quantum density operators at scale
We provide a theory, algorithms, and simulations of nonequilibrium quantum systems using a one-dimensional (1D) completely positive (CP), matrix-product (MP) density-operator (𝜌) representation. By generalizing the matrix product state's orthogonality center, to additionally store positive classical mixture correlations, the MP𝜌 factorization naturally emerges. In this setting, we analytically and numerically examine the virtual gauge freedoms associated with the representation of quantum density operators. Based on this perspective, we simplify algorithms in certain limits to speed up the integration of the canonical-form master-equation dynamics. This enables us to quickly evolve under the dynamics of two-body quantum channels without resorting to optimization-based methods. In addition to this technical advance, we also scale up numerical examples and discuss implications for accurately modeling hardware architectures and predicting their performance in the near term. This includes an example of the quantum to classical transition of informationally leaky, i.e., decohering, qubits. In this setting, because of loss from environmental interactions, nonlocal complex coherence correlations are converted into global incoherent classical statistical mixture correlations. Lastly, the representation of both global and local correlations is discussed. We expect this work to have applications in additional nonequilibrium settings, beyond qubit engineering.
Gangapuram, Amit Jamadagni [Oak Ridge National Lab↗
A Reference Implementation for a Quantum Message Passing Interface
Practical applications of quantum computing are currently limited by the number of qubits that can be set with reasonable fidelities for each system. Therefore, a distributed quantum computing system with multiple quantum computers coherently connected is highly demanding. To realize the internode communication of quantum information, the software interface, Quantum Message Passing Interface (QMPI), leveraging the framework built for classical MPI but taking advantage of quantum teleportation to communicate between different quantum nodes was proposed. In this project, we develop the QMPI with point-to-point and collective operations in Qiskit and characterize its performance by demonstrating the application implementations. Moreover, we developed a new technique for optimizing collective communication of the distributed quantum programs with Multi-Controlled Toffoli gates. This technique beats the state-of-the-art in terms of fidelity and the number of remote EPR pairs consumed in both simulations and experiments.
Shi, Yue↗
Platinum-like HER onset in a GNR/MoS 2 quantum dot heterostructure through curvature-dependent electron density reconfiguration
Tailoring the curvature-directed lattice strain in GNRs along with optimal surface anchoring of molybdenum disulfide (MoS 2 ) quantum dots (QDs) can lead to a unique heterostructure with Pt-like HER activity (onset potential –60 mV). The curvature-induced electronic charge redistribution at the curved region in the graphene nanoribbons allows a facile GNR-MoS 2 interfacial charge transfer in the heterostructure, making the interfacial sulfur (S) more active towards the HER. Finally, the density functional theory (DFT) calculations confirmed electronically activated interfacial S-based catalytic centers in the curved GNR-based heterostructure leading to Pt-like HER activity.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Embedding Learning in Hybrid Quantum-Classical Neural Networks
Quantum embedding learning is an important step in the application of quantum machine learning to classical data. In this paper we propose a quantum few-shot embedding learning paradigm, which learns embeddings useful for training downstream quantum machine learning tasks. Crucially, we identify the circuit bypass problem in hybrid neural networks, where learned classical parameters are optimized to represent the dataset without the quantum kernel. We observe that the few-shot learning embeddings generalize to unseen classes, and suffer less from the circuit bypass problem in terms of better occupation of the parameter space compared with embeddings learned from regression and classification.
Liu, Minzhao↗