Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum Numbers”

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 1,693 records · Page 94

Imaginary Time Propagation on a Quantum Chip

We report evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems, and the heart of a number of numerical methods that have been used with great success in quantum chemistry, condensed matter, and nuclear physics. We propose an algorithm to implement imaginary time propagation on a quantum computer. Our algorithm is devised in the context of an efficient encoding into an optimized gate, drawing on the underlying characteristics of the quantum device of a unitary operation in an extended Hilbert space. However, we prove that for simple problems it can also be successfully applied to standard digital quantum machines. This work paves the way for porting quantum many-body methods based on imaginary-time propagation to near-term quantum devices, enabling the future quantum simulation of the ground states of a broad class of microscopic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Probing Postmeasurement Entanglement without Postselection

We study the problem of observing quantum collective phenomena emerging from large numbers of measurements. These phenomena are difficult to observe in conventional experiments because, in order to distinguish the effects of measurement from dephasing, it is necessary to postselect on sets of measurement outcomes with Born probabilities that are exponentially small in the number of measurements performed. An unconventional approach, which avoids this exponential “postselection problem”, is to construct cross-correlations between experimental data and the results of simulations on classical computers. However, these cross-correlations generally have no definite relation to physical quantities. We first show how to incorporate classical shadows into this framework, thereby allowing for the construction of quantum information-theoretic cross-correlations. We then identify cross-correlations that both upper and lower bound the measurement-averaged von Neumann entanglement entropy, as well as cross-correlations that lower bound the measurement-averaged purity and entanglement negativity. These bounds show that experiments can be performed to constrain postmeasurement entanglement without the need for postselection. To illustrate our technique, we consider how it could be used to observe the measurement-induced entanglement transition in Haar-random quantum circuits. We use exact numerical calculations as proxies for quantum simulations and, to highlight the fundamental limitations of classical memory, we construct cross-correlations with tensor-network calculations at finite bond dimension. Our results reveal a signature of measurement-induced criticality that can be observed using a quantum simulator in polynomial time and with polynomial classical memory. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High harmonic generation governed by edge states in triangular graphene quantum dots

Here, we study theoretically interaction of short optical pulses with triangular graphene quantum dots. If such quantum dots have zigzag edges then there are in-gap degenerate edge states, the number of which depends on the size of the system. We show that the nonlinear optical response, such as high harmonic generation, of triangular quantum dots is sensitive to the initial electron population of their edge states. In general, the emission spectra of quantum dots have weak dependence on the number of occupied edge states, but if half of the edge states are initially occupied, which can be realized only in the quantum dots with even number of edge states, then the even high harmonics are strongly suppressed. The suppression is the strongest when the frequency of the pulse is well below the band gap and it is weak when the pulse frequency becomes comparable to the band gap of the system.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Collection of fluorescence from an ion using trap-integrated photonics

Spontaneously emitted photons are entangled with the electronic and nuclear degrees of freedom of the emitting atom, so interference and measurement of these photons can entangle separate matter-based quantum systems as a resource for quantum information processing. Since confinement in a single-mode facilitates the photon interference needed for generating entanglement, the dipole emission patterns relevant in spontaneous emission present a mode-matching challenge. Current demonstrations rely on bulk photon-collection and manipulation optics that suffer from large component size and system-to-system variability—factors that impede scaling to the large numbers of entangled pairs needed for quantum information processing. To address these limitations, we demonstrate a collection method that enables passive phase stability, straightforward photonic manipulation, and intrinsic reproducibility. Specifically, we engineer a waveguide-integrated grating to couple photons emitted from a trapped ion into a single optical mode within a microfabricated ion-trap chip. Using the integrated collection optic, we characterize the collection efficiency, image the ion, and detect the ion’s quantum state. The integrated optic covers 2.18% of the solid angle and collects 1.97 ± 0.3% of the spontaneously emitted light incident on the grating for a total collection efficiency of 0.043% into a single-mode waveguide. This proof-of-principle demonstration lays the foundation for leveraging the inherent stability and reproducibility of integrated photonics to create, manipulate, and measure multipartite quantum states in arrays of quantum emitters.

Optical physics↗

Monotonically increasing functions of any quantum correlation can make all multiparty states monogamous

Monogamy of quantum correlation measures puts restrictions on the sharability of quantum correlations in multiparty quantum states. Multiparty quantum states can satisfy or violate monogamy relations with respect to given quantum correlations. We show that all multiparty quantum states can be made monogamous with respect to all measures. More precisely, given any quantum correlation measure that is non-monogamic for a multiparty quantum state, it is always possible to find a monotonically increasing function of the measure that is monogamous for the same state. The statement holds for all quantum states, whether pure or mixed, in all finite dimensions and for an arbitrary number of parties. The monotonically increasing function of the quantum correlation measure satisfies all the properties that are expected for quantum correlations to follow. We illustrate the concepts by considering a thermodynamic measure of quantum correlation, called the quantum work deficit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Higher-order photon correlations in pulsed photonic crystal nanolasers

We report on the higher-order photon correlations of a high-{beta} nanolaser under pulsed excitation at room temperature. Using a multiplexed four-element superconducting single-photon detector we measured g{sup (n)}(0-vector) with n=2,3,4. All orders of correlation display partially chaotic statistics, even at four times the threshold excitation power. We show that this departure from coherence and Poisson statistics is due to the quantum fluctuations associated with the small number of photons at the lasing threshold.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Laser-Induced Polarization for the Electron-Ion Collider

The use of an intense ultrashort laser pulse to induce electron polarization has been proposed in existing literature. Utilizing the Python programming language, a code has been developed to recreate the local constant crossed field approximation (LCFA) with the aim of determining values for transverse polarization given a nonzero initial polarization. It has been shown that over multiple laser shots, lower values of the quantum efficiency parameter are associated with higher transverse polarization output, yet require a greater number of shots to attain maximal polarization. Moreover, the quantum efficiency parameter has been rede fined as a function of intensity for Ti:sapphire laser necessary to induce polarization in the Electron-Ion Collider.

43 PARTICLE ACCELERATORS↗

Weak entanglement approximation for nuclear structure

The interacting shell model, a configuration-interaction method, is a venerable approach for low-lying nuclear structure calculations, but it is hampered by the exponential growth of its basis dimension as one increases the single-particle space and/or the number of active particles. Recent, quantum-information-inspired work has demonstrated that the proton and neutron sectors of a nuclear wave function are weakly entangled. Furthermore, the entanglement is smaller for nuclides away from N = Z, such as heavy, neutron-rich nuclides. Here, in this study, we implement a weak entanglement approximation to bipartite configuration-interaction wave functions, approximating low-lying levels by coupling a relatively small number of many-proton and many-neutron states. This truncation scheme, which we present in the context of past approaches, reduces the basis dimension by many orders of magnitude while preserving essential features of nuclear spectra.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Quantum Divide and Compute: Hardware Demonstrations and Noisy Simulations

Noisy, intermediate-scale quantum computers come with intrinsic limitations in terms of the number of qubits (circuit "width") and decoherence time (circuit "depth") they can have. Here, for the first time, we demonstrate a recently introduced method that breaks a circuit into smaller subcircuits or fragments, and thus makes it possible to run circuits that are either too wide or too deep for a given quantum processor. We investigate the behavior of the method on one of IBM's 20-qubit superconducting quantum processors with various numbers of qubits and fragments. We build noise models that capture decoherence, readout error, and gate imperfections for this particular processor. We then carry out noisy simulations of the method in order to account for the observed experimental results. We find an agreement within 20% between the experimental and the simulated success probabilities, and we observe that recombining noisy fragments yields overall results that can outperform the results without fragmentation.

Ayral, Thomas↗

Simulating strongly correlated molecules with a superconducting quantum processor

Many of the biggest challenges in expanding the nation’s access to clean and low-cost energy resources are fundamentally chemistry or materials challenges. An important case is the development of new catalysts for the up-conversion of cheap and readily available materials such as methane or water into materials suitable for use as a fuel such as methanol or oxygen. To understand and exploit such processes, computer simulations of chemical reactions provide a natural complement to experimental studies. Unfortunately, most catalytic reactions involve so-called “strongly correlated” molecules which are notoriously difficult to study with simulation algorithms that can be executed on existing (classical) computers. The recent growth in quantum information science offers an alternative potential route for simulating these difficult systems. As a result, an increasing number of computational chemists are becoming interested in quantum computing. At the same time, quantum information scientists have identified chemistry simulation as a possible first demonstration of a quantum computer providing an improvement over a classical computer. The objective of this project is to accurately simulate strongly correlated molecules on a quantum processor. To meet the high challenges of this objective, new hybrid quantum/classical algorithms will be co-designed with advanced quantum gate developments and computed on customized quantum hardware. Some of the developed techniques will be transferable to study other molecular systems, while the project as a whole will help define better strategies for advancing the quantum simulation of matter more generally.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Weak Transitions in Light Nuclei

Nuclei are used for high-precision tests of the Standard Model and for studies of physics beyond the Standard Model. Without a thorough understanding of nuclei, we will not be able to meaningfully interpret the growing body of experimental data nor will we be able to disentangle new physics signals from underlying nuclear effects. This calls for accurate calculations of nuclear structure and reactions. In this work, we focus on electroweak decays in nuclei with mass number A ≤ 10 and report on ab initio Quantum Monte Carlo calculations of reduced matrix elements entering beta decays and electron captures in nuclei with mass number A ≤ 10. The many-body wave functions are calculated using selected Norfolk two- and three-nucleon potential models and associated one- and two-body axial currents at tree-level obtained from a chiral effective field theory with pions, nucleons, and Δ. The agreement with the experimental data is satisfactory except for transitions in A = 8 nuclei. In this specific case, the theory significantly underpredicts the experimental data, which indicates the need of further improvements in the corresponding nuclear wave functions. In this study, emphasis is placed on the contributions of two-body axial currents that are carefully analyzed using two-body transition densities. This allow us to study the spatial distribution and short-range behavior of two-body dynamics. In particular, the transition densities when scaled to peak at 1.0 exhibit universal short-range behavior across the considered nuclei, while they differ in the long-range tails.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Quantum phase estimation with lossy interferometers

We give a detailed discussion of optimal quantum states for optical two-mode interferometry in the presence of photon losses. We derive analytical formulae for the precision of phase estimation obtainable using quantum states of light with a definite photon number and prove that maximization of the precision is a convex optimization problem. The corresponding optimal precision, i.e., the lowest possible uncertainty, is shown to beat the standard quantum limit thus outperforming classical interferometry. Furthermore, we discuss more general inputs: states with indefinite photon number and states with photons distributed between distinguishable time bins. We prove that neither of these is helpful in improving phase estimation precision.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Search Approaches to Sampling-Based Motion Planning

In this paper, we present a novel formulation of traditional sampling-based motion planners as database-oracle structures that can be solved via quantum search algorithms. We consider two complementary scenarios: for simpler sparse environments, we formulate the Quantum Full Path Search Algorithm (q-FPS), which creates a superposition of full random path solutions, manipulates probability amplitudes with Quantum Amplitude Amplification (QAA), and quantum measures a single obstacle free full path solution. For dense unstructured environments, we formulate the Quantum Rapidly Exploring Random Tree algorithm, q-RRT, that creates quantum superpositions of possible parent-child connections, manipulates probability amplitudes with QAA, and quantum measures a single reachable state, which is added to a tree. As performance depends on the number of oracle calls and the probability of measuring good quantum states, we quantify how these errors factor into the probabilistic completeness properties of the algorithm. We then numerically estimate the expected number of database solutions to provide an approximation of the optimal number of oracle calls in the algorithm. We compare the q-RRT algorithm with a classical implementation and verify quadratic run-time speedup in the largest connected component of a 2D dense random lattice. We conclude by evaluating a proposed approach to limit the expected number of database solutions and thus limit the optimal number of oracle calls to a given number.

97 MATHEMATICS AND COMPUTING↗

Out-of-time ordered correlation functions for the localized 𝑓 electrons in the Falicov-Kimball model

We provide an exact evaluation of the out-of-time correlation (OTOC) functions for the localized 𝑓-particle states in the Falicov-Kimball model within dynamical mean-field theory. Different regimes of quantum chaos and quantum scrambling are distinguished by the winding numbers of the block Toeplitz matrices used in the calculation. The similarities of these fermionic OTOCs and their logarithmic derivatives for time evolution with the OTOCs for quantum spin models with disorder are also discussed.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Advancing Comprehension of Quantum Application Outputs: A Visualization Technique

Noise in quantum computers presents a challenge for the users of quantum computing despite the rapid progress we have seen in the past few years in building quantum computers. Existing works have addressed the noise in quantum computers using a variety of mitigation techniques since error correction requires a large number of qubits which is infeasible at present. One of the consequences of quantum computing noise is that users are unable to reproduce similar output from the same quantum computer at different times, let alone from various quantum computers. In this work, we have made initial attempts to visualize quantum basis states for all the circuits that were used in quantum machine learning from various quantum computers and noise-free quantum simulators. We have opened up a pathway for further research into this field where we will be able to isolate noisy states from non-noisy states leading to efficient error mitigation. This is where our work provides an important step in the direction of efficient error mitigation. Our work also provides a ground for quantum noise visualization in the case of large numbers of qubits.

Senapati, Priyabrata↗

Efficient Implementation for Unitary Coupled Cluster State Preparation for Near-Term Quantum Computers

Unitary coupled cluster theory (UCC) is a common wave function ansatz for quantum simulation of molecular electronic structure using the variational quantum eigenvalue solver (VQE). Even for small molecules using a double-ζ basis, the number of variational parameters required to minimize the electronic energy (i.e., optimize the circuit) is large and beyond the reach of current quantum computers. For example, a circuit simulating C2 using the UCCSD ansatz and the cc-pVDZ basis set with frozen-core will require over 10,000 variational parameters and a Hilbert space of over 10^8 determinants. To make progress on simulating such molecular systems on near-term quantum computers, we explore how much of the optimization can be approximately prepared with classical simulation while reducing the number of optimization steps performed on a quantum device. Recently, Chen, Cheng, and Freericks [J. Chem. Theory Comput. 2021, 17, 841-847] presented an algorithm for the factorized form of the UCC ansatz that allows for efficient UCC optimizations on classical hardware. We flip the algorithm around and use it to prepare approximate quantum circuits for systems that require a large number of qubits to represent. We will present results from our implementation and discuss strategies for incorporating this implementation for algorithms involving near-term quantum computers.

J Wayne Mullinax↗

Efficient Implementation for Unitary Coupled Cluster State Preparation for Near-Term Quantum Computers

Unitary coupled cluster theory (UCC) is a common wave function ansatz for quantum simulation of molecular electronic structure using the variational quantum eigenvalue solver (VQE). Even for small molecules using a double-ζ basis, the number of variational parameters required to minimize the electronic energy (i.e., optimize the circuit) is large and beyond the reach of current quantum computers. For example, a circuit simulating C2 using the UCCSD ansatz and the cc-pVDZ basis set with frozen-core will require over 10,000 variational parameters and a Hilbert space of over 10^(8) determinants. To make progress on simulating such molecular systems on near-term quantum computers, we explore how much of the optimization can be approximately prepared with classical simulation while reducing the number of optimization steps performed on a quantum device. Recently, Chen, Cheng, and Freericks [J. Chem. Theory Comput. 2021, 17, 841-847] presented an algorithm for the factorized form of the UCC ansatz that allows for efficient UCC optimizations on classical hardware. We flip the algorithm around and use it to prepare approximate quantum circuits for systems that require a large number of qubits to represent. We will present results from our implementation and discuss strategies for incorporating this implementation for algorithms involving near-term quantum computers.

Quantum Computing↗

Efficient Implementation for Unitary Coupled Cluster State Preparation for Near-Term Quantum Computers

Unitary coupled cluster theory (UCC) is a common wave function ansatz for quantum simulation of molecular electronic structure using the variational quantum eigenvalue solver (VQE). Even for small molecules using a double-ζ basis, the number of variational parameters required to minimize the electronic energy (i.e., optimize the circuit) is large and beyond the reach of current quantum computers. For example, a circuit simulating C2 using the UCCSD ansatz and the cc-pVDZ basis set with frozen-core will require over 10,000 variational parameters and a Hilbert space of over 10^(8) determinants. To make progress on simulating such molecular systems on near-term quantum computers, we explore how much of the optimization can be approximately prepared with classical simulation while reducing the number of optimization steps performed on a quantum device. Recently, Chen, Cheng, and Freericks [J. Chem. Theory Comput. 2021, 17, 841-847] presented an algorithm for the factorized form of the UCC ansatz that allows for efficient UCC optimizations on classical hardware. We flip the algorithm around and use it to prepare approximate quantum circuits for systems that require a large number of qubits to represent. We will present results from our implementation and discuss strategies for incorporating this implementation for algorithms involving near-term quantum computers.

Quantum Computing↗