Even More Efficient Quantum Computations of Chemistry Through Tensor Hypercontraction
Not Available
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
SEARCH · Search NASA
Results for “Quantum computing”
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.
Quantum computation of phase transition in the massive Schwinger model
Abstract As pointed out by Coleman, physical quantities in the Schwinger model depend on a parameter θ that determines the background electric field. There is a phase transition for θ = π only. We develop a momentum space formalism on a lattice and use it to perform a quantum computation of the critical point of this phase transition on the NISQ device IMB Q Lima. After error mitigation, our results give strong indication of the existence of a critical point at m / e ≃ 0.32, where m is the bare fermion mass and e is the coupling strength, in good agreement with the classical numerical result m / e ≃ 0.3335.
Physics↗
Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms
Not Available
74 ATOMIC AND MOLECULAR PHYSICS↗
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↗
Superconducting Radio Frequency Resonators for Quantum Computing: A Short Review
Superconducting radiofrequency (SRF) technology is being used not only in discovery science programs and basic research but also for several applications that benefit society more directly. The advantage of superconducting resonators over those made of normal-conducting metal is their ability to store electromagnetic energy with much lower dissipation. The high-quality factor and longer dissipation time provided by these superconducting resonators can deliver superior performance. Currently, the quantum processing architecture uses resonators and interconnecting circuits operating in the microwave regime with superconducting strip-line technology and low noise electronic devices for switching and communication. The performance of these devices can be enhanced by embedding them in 3D SRF cavity resonators to prolong the coherence time, which improves the utility of the device by reducing error rates and allowing more manipulations (calculations) before the quantum state decays. Here, we present a short review of current microwave technology used in quantum computers and progress towards the 3D resonators to enhance thecoherence time.
Dhakal, Pashupati↗
Classical and quantum computing of shear viscosity for ( 2 + 1 ) D SU(2) gauge theory
We perform a nonperturbative calculation of the shear viscosity for ( 2 + 1 )-dimensional SU(2) gauge theory by using the lattice Hamiltonian formulation. The retarded Green’s function of the stress-energy tensor is calculated from real time evolution via exact diagonalization of the lattice Hamiltonian with a local Hilbert space truncation, and the shear viscosity is obtained via the Kubo formula. When taking the continuum limit, we account for the renormalization group flow of the coupling but no additional operator renormalization. We find the ratio of the shear viscosity and the entropy density η s is consistent with a well-known holographic result 1 4 π at several temperatures on a 4 × 4 honeycomb lattice with the local electric representation truncated at j max = 1 2 . We also find the ratio of the spectral function and frequency ρ x y ( ω ) ω exhibits a peak structure when the frequency is small. Both the exact diagonalization method and simple matrix product state classical simulation method beyond j max = 1 2 on bigger lattices require exponentially growing resources. So we develop a quantum computing method to calculate the retarded Green’s function and analyze various systematics of the calculation including j max truncation and finite size effects, Trotter errors and the thermal state preparation efficiency. Our thermal state preparation method still requires resources that grow exponentially with the lattice size, but with a very small prefactor at high temperature. We test our quantum circuit on both the Quantinuum emulator and the IBM simulator for a small lattice and obtain results consistent with the classical computing ones. Published by the American Physical Society 2024
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
Arrow of time and its reversal on the IBM quantum computer
Uncovering the origin of the “arrow of time” remains a fundamental scientific challenge. Within the framework of statistical physics, this problem was inextricably associated with the second Law of thermodynamics, which declares that entropy growth proceeds from the system’s entanglement with the environment. this poses a question of whether it is possible to develop protocols for circumventing the irreversibility of time and if so to practically implement these protocols. Here we show that, while in nature the complex conjugation needed for time reversal may appear exponentially improbable, one can design a quantum algorithm that includes complex conjugation and thus reverses a given quantum state. Using this algorithm on an IBM quantum computer enables us to experimentally demonstrate a backward time dynamics for an electron scattered on a two-level impurity.
97 MATHEMATICS AND COMPUTING↗
Quantum Computing with Majorana Kramers Pairs
Here, we propose a universal gate set acting on a qubit formed by the degenerate ground states of a Coulomb-blockaded time-reversal invariant topological superconductor island with spatially separated Majorana Kramers pairs: the “Majorana Kramers qubit.” All gate operations are implemented by coupling the Majorana Kramers pairs to conventional superconducting leads. Interestingly, in such an all-superconducting device, the energy gap of the leads provides another layer of protection from quasiparticle poisoning independent of the island charging energy. Moreover, the absence of strong magnetic fields—which typically reduce the superconducting gap size of the island—suggests a unique robustness of our qubit to quasiparticle poisoning due to thermal excitations. Consequently, the Majorana Kramers qubit should benefit from prolonged coherence times and may provide an alternative route to a Majorana-based quantum computer.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
Quantum Computing – Real-Time Data Processing from a Dilution Refrigerator
This poster presents a real-time data visualization system for monitoring and displaying data from a Bluefors control unit connected to a dilution refrigerator. The goal is to provide an aesthetically pleasing and user-friendly web-based interface that continuously updates and displays critical data such as temperature and flow rates at various points within the refrigerator. Leveraging WebSocket technology, the system establishes multiple connections to the dilution refrigerators, enabling simultaneous monitoring of several units. The interactive webpage dynamically updates the data, providing researchers and operators with instant insights into the system's performance. The system's ability to stream and visualize data in real-time enhances the understanding of the dilution refrigerator's behavior, aiding in optimizing its operation and ensuring efficient scientific experiments. The application's web-based nature makes it easily accessible from any device with internet connectivity, promoting seamless collaboration and remote monitoring capabilities. Overall, this poster offers a comprehensive solution for real-time data visualization and analysis of dilution refrigerators, catering to the needs of researchers and scientists working in low-temperature physics and quantum computing fields.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
Quantum computation of nanosheets in a background magnetic field for external control of nanosystems
We ran quantum simulations on lattices of interacting fermions in a background magnetic field [1]. We created discretized Hamiltonian matrices for each system and pre-processed them so that they could be read by the quantum simulator implemented in IBM's Qiskit package [2]. The simulator uses the variational quantum eigensolver (VQE) algorithm [3] to approximate the ground state energy of the input Hamiltonian, which is then compared to the classically-calculated exact value. This classical evaluation is possible because the systems studied are still within the grasp of classical computers. We also investigated ways to simplify the system before the pre-processing step. We found that in almost all cases these simplifications made our quantum calculations converge to better answers using simpler starting conditions. We are exploring other ways to interface with IBM's quantum computing software so that we no longer need to explicitly define the Hamiltonian matrices for our systems, a problem which will itself soon become intractable.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Quantum Computing at Los Alamos
Explore the source record for details and available documents.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Adaptive basis sets for practical quantum computing
Electronic structure calculations on small systems such as H 2 , H 2 O, LiH, and BeH 2 with chemical accuracy are still a challenge for the current generation of noisy intermediate-scale quantum (NISQ) devices. One of the reasons is that due to the device limitations, only minimal basis sets are commonly applied in quantum chemical calculations, which allows one to keep the number of qubits employed in the calculations at a minimum. However, the use of minimal basis sets leads to very large errors in the computed molecular energies as well as potential energy surface shapes. One way to increase the accuracy of electronic structure calculations is through the development of small basis sets better suited for quantum computing. In this work, we show that the use of adaptive basis sets, in which exponents and contraction coefficients depend on molecular structure, provides an easy way to dramatically improve the accuracy of quantum chemical calculations without the need to increase the basis set size and thus the number of qubits utilized in quantum circuits. As a proof of principle, we optimize an adaptive minimal basis set for quantum computing calculations on an H 2 molecule, in which exponents and contraction coefficients depend on the H—H distance, and apply it to the generation of H 2 potential energy surface on IBM-Q quantum devices. The adaptive minimal basis set reaches the accuracy of the double-zeta basis sets, thus allowing one to perform double-zeta quality calculations on quantum devices without the need to utilize twice as many qubits in simulations. This approach can be extended to other molecular systems and larger basis sets in a straightforward manner.
97 MATHEMATICS AND COMPUTING↗
Toward quantum computing for high-energy excited states in molecular systems: quantum phase estimations of core-level states
This paper explores the utility of the quantum phase estimation (QPE) in calculating high-energy excited states characterized by promotions of electrons occupying inner energy shells. These states have been intensively studied over the last few decades especially in supporting the experimental effort at light sources. Results obtained with the QPE are compared with various high-accuracy many-body techniques developed to describe core-level states. The feasibility of the quantum phase estimator in identifying classes of challenging shake-up states characterized by the presence of higher-order excitation effects is also discussed.
Bauman, Nicholas P.↗
Information Flows in Reversible Computing Out of Equilibrium with Applications to Models of Topological Quantum Computing.
Abstract not provided.
Shukla, Karpur↗
Singlet fission for quantum information and quantum computing: the parallel JDE model
Abstract Singlet fission is a photoconversion process that generates a doubly excited, maximally spin entangled pair state. This state has applications to quantum information and computing that are only beginning to be realized. In this article, we construct and analyze a spin-exciton hamiltonian to describe the dynamics of the two-triplet state. We find the selection rules that connect the doubly excited, spin-singlet state to the manifold of quintet states and comment on the mechanism and conditions for the transition into formally independent triplets. For adjacent dimers that are oriented and immobilized in an inert host, singlet fission can be strongly state-selective. We make predictions for electron paramagnetic resonance experiments and analyze experimental data from recent literature. Our results give conditions for which magnetic resonance pulses can drive transitions between optically polarized magnetic sublevels of the two-exciton states, making it possible to realize quantum gates at room temperature in these systems.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Efficient Berry phase calculation via adaptive variational quantum computing approach
We present an adaptive variational quantum algorithm to estimate the Berry phase accumulated by a nondegenerate ground state under cyclic, adiabatic evolution of a time-dependent Hamiltonian. Our method leverages cyclic adiabatic evolution of the Hamiltonian and employs adaptive variational quantum algorithms for state preparation and evolution, optimizing circuit efficiency while maintaining high accuracy. We benchmark our approach on dimerized Fermi–Hubbard chains with four sites, demonstrating precise Berry phase simulations in both noninteracting and interacting regimes. Our results show that circuit depths reach up to 106 layers for noninteracting systems and increase to 279 layers for interacting systems due to added complexity. In addition, we demonstrate the robustness of our scheme across a wide range of parameters governing adiabatic evolution and variational algorithms. These findings highlight the potential of adaptive variational quantum algorithms for advancing quantum simulations of topological materials and computing geometric phases in strongly correlated systems.
Mootz, Martin [Ames Laboratory (AMES), Ames, IA (U↗
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↗
Quantum Markov chain Monte Carlo with digital dissipative dynamics on quantum computers
Modeling the dynamics of a quantum system connected to the environment is critical for advancing our understanding of complex quantum processes, as most quantum processes in nature are affected by an environment. Modeling a macroscopic environment on a quantum simulator may be achieved by coupling independent ancilla qubits that facilitate energy exchange in an appropriate manner with the system and mimic an environment. This approach requires a large, and possibly exponential number of ancillary degrees of freedom which is impractical. In contrast, we develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. By combining periodic modulation of the ancilla energies, or spectral combing, with periodic reset operations, we are able to mimic interaction with a large environment and generate thermal states of interacting many-body systems. We evaluate the algorithm by simulating preparation of thermal states of the transverse Ising model. Our algorithm can also be viewed as a quantum Markov chain Monte Carlo process that allows sampling of the Gibbs distribution of a multivariate model. To illustrate this we evaluate the accuracy of sampling Gibbs distributions of simple probabilistic graphical models using the algorithm.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗