Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum computation”

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 505 records · Page 28

Efficient Floating-Point Arithmetic on Fault-Tolerant Quantum Computers

We propose a novel floating-point encoding scheme that builds on prior work involving fixed-point encodings. We encode floating-point numbers using Two's Complement fixed-point mantissas and Two's Complement integral exponents. We used our proposed approach to develop quantum algorithms for fundamental arithmetic operations, such as bit-shifting, reciprocation, multiplication, and addition. We prototyped and investigated the performance of the floating-point encoding scheme on quantum computer simulations by performing reciprocation on randomly drawn inputs and by solving first-order ordinary differential equations, while varying the number of qubits in the encoding. We observed rapid convergence to the exact solutions as we increased the number of qubits and a significant reduction in the number of ancilla qubits required for reciprocation when compared with similar approaches.

Serrallés, José Cruz [Weill Cornell Med. Coll.]↗

Quantum Theory, Quantum Materials, Quantum Computing

The Sanibel Symposium series is renowned amongst materials theorists, quantum chemists, and condensed matter physicists as meetings driving progress on theory, mod eling, and simulation of materials and their molecular and nano-scale constituents. The Symposia are highly unusual (perhaps unique) in their priority emphasis on theory and computation, in having no parallel sessions, in cultivating well-attended Hot-Topic contributed oral sessions, and accessible poster sessions. These provide highly visible, influential platforms for cross-fertilization among specialist investigators, hence are strong contributors to the advance of quantum information sciences (QIS) research of strategic importance to the Office of Basic Energy Sciences (BES). As part of a five-year plan to highlight QIS challenges and opportunities and foster progress on them, each of the pre ceding three Sanibel Symposia had a thematic focus, Quantum Theory, Quantum Materi als, Quantum Computing, as a major program component. Emphasis was on quantum materials and their molecular constituents. The award for 2024 was for year four of that sustained thematic focus.

36 MATERIALS SCIENCE↗

Simulations of Probabilities for Quantum Computing

It has been demonstrated that classical probabilities, and in particular, probabilistic Turing machine, can be simulated by combining chaos and non-LIpschitz dynamics, without utilization of any man-made devices (such as random number generators). Self-organizing properties of systems coupling simulated and calculated probabilities and their link to quantum computations are discussed.

Turing machines↗

State Preparation of Antisymmetrized Geminal Power on a Quantum Computer without Number Projection

The antisymmetrized geminal power (AGP) is equivalent to the number projected Bardeen–Cooper–Schrieffer (PBCS) wave function. It is also an elementary symmetric polynomial (ESP) state. We generalize previous research on deterministically implementing the Dicke state to a state preparation algorithm for an ESP state, or equivalently AGP, on a quantum computer. Our method is deterministic and has polynomial cost, and it does not rely on number symmetry breaking and restoration. We also show that our circuit is equivalent to a disentangled unitary paired coupled cluster operator and a layer of unitary Jastrow operator acting on a single Slater determinant. Here, the method presented herein highlights the ability of disentangled unitary coupled cluster to capture nontrivial entanglement properties that are hardly accessible with traditional Hartree–Fock based electronic structure methods.

97 MATHEMATICS AND COMPUTING↗

Simulation of Silicon Nanodevices at Cryogenic Temperatures for Quantum Computing

Cryogenic nanoscale semiconductor devices are crucial for a wide variety of applications. The accurate design of such devices involve solving their electrostatics from fundamental semiconductor equations at low temperatures. We employ COMSOL to model a prototype cryogenic nanostructure, that can be used to readout the spin of a single electron in silicon, for quantum computing applications. By achieving convergence down to 15 Kelvin (K), we provide a guideline of techniques that aid to enhance convergence at cryogenic temperatures. We further compare the device electrostatics at different temperatures, which aids us to estimate the accuracy with temperature.

Mohiyaddin, Fahd A.↗

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↗

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↗

Computing with a single qubit faster than the computation quantum speed limit

Here, the possibility to save and process information in fundamentally indistinguishable states is the quantum mechanical resource that is not encountered in classical computing. I demonstrate that, if energy constraints are imposed, this resource can be used to accelerate information-processing without relying on entanglement or any other type of quantum correlations. In fact, there are computational problems that can be solved much faster, in comparison to currently used classical schemes, by saving intermediate information in nonorthogonal states of just a single qubit. There are also error correction strategies that protect such computations.

97 MATHEMATICS AND COMPUTING↗

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↗