Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum computer”

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,477 records · Page 82

Particle accelerator spin-transparent storage rings for beyond state-of-the-art science

We describe spin-transparent storage rings that exhibit coherence times of many hours and store a large number of particles and their use in novel applications. For example, these rings can be used to directly measure the electric dipole moment of the electron, relevant to CP violation and matter-antimatter asymmetry in the universe, and to search for axion-mediated forces. These rings can also serve as a compelling platform for quantum computing. In particular, we will describe how spin-transparent rings can be used in conjunction with ion traps to enhance scalability and increase quantum-coherence times of ion quantum computing.

Suleiman, R.↗

Microfabricated Ion Traps on Sapphire for Larger Trap Areas and Higher Qubit Count

Surface ion traps are a promising platform for quantum computing due to their potential to store large numbers of ions that can be addressed by electrical and optical control signals in order to implement quantum algorithms. Increasing the power of the quantum computer requires increasing the number of ions, but this poses a significant challenge in that it leads to a non-linear increase in on-chip power dissipation. The primary contributor to this power scaling in current devices is the capacitance between the radio frequency (RF) electrode and the metal plane that shields the silicon substrate from the RF signals applied to it. Silicon has traditionally been chosen for the substrate material for compatibility with the processing required for multi-metal-level traps. In this work, we address these capacitance and fabrication challenges by replacing the commonly used silicon substrate with an insulating sapphire substrate to fabricate a multi-metal-level ion trap, while still employing common semiconductor manufacturing techniques. This change in substrate allows the design to remove the metal shielding from the device design, reducing the capacitance of the RF electrode. The electrical characteristics of these traps were measured, specifically trap impedance, capacitance, and voltage breakdown, and compared to nearly identical silicon trap devices. Finally, we used laser cutting techniques to shape a sapphire wafer into bowtie shapes matching silicon traps previously fabricated at Sandia National Labs to explore solutions for integrating sapphire substrates into non-rectangular ion trap designs.

97 MATHEMATICS AND COMPUTING↗

Particle Accelerator Spin-Transparent Storage Rings for Beyond State-of-the-Art Science

We will describe spin-transparent storage rings that exhibit spin-coherence times of several hours and store a large number of particles and their use in novel applications. For example, these rings can be used to directly measure the electric dipole moment of the electron, relevant to CP violation and matter-antimatter asymmetry in the universe, and to search for dark energy and ultra-light dark matter*. These rings can also serve as a compelling platform for quantum computing. In this presentation, we will describe how spin-transparent rings can be used in conjunction with ion traps to enhance scalability and increase quantum coherence times of ion quantum computing.

Suleiman, R.↗

Quantum-inspired computational imaging

Computational imaging combines measurement and computational methods with the aim of forming images even when the measurement conditions are weak, few in number, or highly indirect. The recent surge in quantum-inspired imaging sensors, together with a new wave of algorithms allowing on-chip, scalable and robust data processing, has induced an increase of activity with notable results in the domain of low-light flux imaging and sensing. We provide an overview of the major challenges encountered in low-illumination (e.g., ultrafast) imaging and how these problems have recently been addressed for imaging applications in extreme conditions. Finally, these methods provide examples of the future imaging solutions to be developed, for which the best results are expected to arise from an efficient codesign of the sensors and data analysis tools.

97 MATHEMATICS AND COMPUTING↗

Data Summarization and Inference at Scale

This is the final report for the DOE ASCR grant SC-0022260, Data Summarization and Inference at Scale, PI: Alex Pothen, Purdue University. The goal of the project was to solve data-intensive and compute-intensive problems in the physical sciences, engineering, information science, data science, etc. by designing and implementing new algorithms that could work with a subset of the data. The four subgoals were: (a) The solution of problems where the data is too large to be stored in the memory of a computer. In this streaming model of computation, the data arrives as a stream of elements to the computer, each element is processed as it arrives, and a decision is made to discard the data or to store it; only a small subset of the data proportional to the size of the output solution is stored, and when all the data has been streamed, a solution to the problem is computed from the stored subset. (b) The use of machine learning methods to compute solutions to data-intensive problems. The use of GPUs is critical to obtain high performance on machine learning tasks, but their memory sizes are smaller relative to that of CPUs. For large-scale problems, the data is sampled many times, and small samples are used with repetition, for robustness, to compute solutions to inference tasks. This sampling reduces the memory required to solve the problem, but attention is needed to avoid slow convergence to the solutions, and reduced accuracy of inference. We propose submodular optimization, Large Language Models, and physics-informed neural networks to enable GPU computations here. (c) Modeling and visualization of high-dimensional data using interpretable features. Clinical proteomic data sets from immunology for the detection of cancer and other diseases are temporal and high-dimensional, and algorithms for visualizing these data sets using clinically interpretable features are lacking. We propose methods that compute distances based on the optimal transportation problem and graph edit distances to address this problem. We also propose the use of optimal transport-based distances, spatial statistics, and network structure to classify image data sets, We apply these algorithms to electron micrographs of the peripheral nervous system in the digestive tract. (d) The design of data-intensive algorithms on emerging architectures, specifically, noisy, intermediate-scale quantum (NISQ) devices. Quantum computers offer the possibility of exploring large solution spaces due to the principle of superposition, but current quantum computers are limited by few qubits, short coherence times due to noise, poor interconections among the qubits, etc. We propose the use of the divide and conquer paradigm to solve large-scale problems, wherein collections of small subproblems are solved on the quantum devices, and the solutions to the subproblems are integrated into a solution for the original problem on a classical computer.

97 MATHEMATICS AND COMPUTING↗

Entanglement generation between two atoms via surface modes

We discuss the coupling of two identical atoms, separated by a metal or metamaterial slab, through surface modes. We show that the coupling through the surface modes can induce entanglement. We discuss how to control the coupling for the metal or metamaterial slab by adjusting the symmetrical and antisymmetrical property of the surface modes. We analyze the dispersion relation of the surface modes and study the parameter ranges that support the surface modes with the same properties. Our results have potential applications in quantum communication and quantum computation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Experimental demonstration of a teleportation-based programmable quantum gate

We experimentally demonstrate a programmable quantum gate that applies a sign flip operation to data qubit in an arbitrary basis fully specified by the quantum state of a two-qubit program register. Our linear-optical implementation is inspired by teleportation-based schemes for quantum computing and relies on multiphoton interference and coincidence detection. We confirm the programmability of the gate and its high-fidelity performance by carrying out full quantum process tomography of the resulting operation on data qubit for several different programs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

LLRF System Analysis for the Fermilab PIP-II LINAC

Developing long-lived quantum processing units (QPUs) capable of supporting high-fidelity quantum operations is a crucial challenge on the path toward fault-tolerant quantum computing. TESLA-shaped superconducting RF (SRF) cavities, known for photon relaxation times on the order of seconds, provide an excellent foundation for 3D QPUs and quantum memory. This talk presents a novel design that leverages TESLA cavity modes coupled to ancillary transmon qubits, optimized to preserve coherence and control. By carefully engineering the package geometry, optimizing Hamiltonian parameters, and minimizing lossy participation ratios, we achieve photon relaxation times of over 16 ms and 20 ms for the two cavity modes, representing a significant improvement over previous multimode quantum memories. Despite the reduced coupling between the qubit and cavity modes, which is necessary to preserve long lifetimes, the platform supports robust and universal control schemes that are not limited by low coupling strength. We will also discuss how this architecture can lead to scalable, modular quantum computing systems.

Varghese, P. [Fermilab]↗

Edge majorana quasiparticles and qubits

Various embodiments described herein provide for a topological quantum computer that uses edge Majorana quasi-particles to form qubits. An inverted Indium Arsenide (InAs) and Gallium Antimonide (GaSb) heterostructure is disclosed that is a quantum spin Hall insulator. A layer of aluminum can be deposited over a nanotube that is placed across the layers of the heterostructure. Once the nanotube is removed, and a gate is formed on the heterostructure and the heterostructure is cooled so that the aluminum becomes superconducting, helical edge states are formed at the junction of the super conducting aluminum, the InAs, and the GaSb which creates a Majorana zero modes (MZMs) at zero magnetic field. The MZMs can be used to construct a topological qubit for fault-resistant topological quantum computation.

Pan, Wei↗

Electronic structure theory with molecular point group symmetries on quantum annealers

Quantum computation has the potential to revolutionize quantum chemistry through major speedups in computation times and an exponential reduction in computational resources. Here, we combine the symmetry-adapted Jordan–Wigner encoding based on the full Boolean symmetry group $\mathbb{Z}$$^{k}_{2}$ with our new implementation of the Xia–Bian–Kais (XBK) method for improving the efficiency of electronic structure theory calculations on quantum annealers, particularly by reducing the number of qubits needed to achieve the same accuracy. By providing a more extensive symmetry-adapted encoding (SAE) than previous work, we are able to simulate molecules larger than those previously reported that have been studied using methods developed for quantum annealers and without using an active space. We calculated the potential energy surfaces of H 2 , LiH, He 2 , H 2 O, O 2 , N 2 , Li 2 , F 2 , CO, BH 3 , NH 3 , and CH 4 , with the largest molecule in the STO-6G basis set requiring 16 qubits with our SAE, and compared them with full configuration interaction results. The application of SAE to the XBK method provides an exponential reduction in the size of the Hilbert space and scales well with the size of the problem. It does not introduce significant additional errors for even or large values of a key variational parameter that determines the number of ancilla qubits used in the XBK method’s Hamiltonian embedding, or for certain molecules such as He 2 and H 2 O. Here, we provide an explanation for this behavior and a recommendation on the usage of our method. In addition, we briefly discuss the potential of extracting electronic excited states from our method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation

Quantum computing is a promising technology that harnesses the peculiarities of quantum mechanics to deliver computational speedups for some problems that are intractable to solve on a classical computer. Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in terms of chip size and error rates. Shallow quantum circuits with uncomplicated topologies are essential for successful applications in the NISQ era. In this work, based on matrix analysis, we derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The depth of the compressed circuits is independent of simulation time and grows linearly with the number of spins. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond O(10 3 ) spins. The resulting quantum circuits have a simple nearest-neighbor topology, which makes them ideally suited for NISQ devices.

Hamiltonian simulation↗

Experimental quantum teleportation and multiphoton entanglement via interfering narrowband photon sources

In this paper, we report a realization of synchronization-free quantum teleportation and narrowband three-photon entanglement through interfering narrowband photon sources. Since both the single-photon and the entangled photon pair utilized are completely autonomous, it removes the requirement of high-demanding synchronization techniques in long-distance quantum communication with pulsed spontaneous parametric down-conversion sources. The frequency linewidth of the three-photon entanglement realized is on the order of several MHz, which matches the requirement of atomic ensemble based quantum memories. Such a narrowband multiphoton source will have applications in some advanced quantum communication protocols and linear optical quantum computation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Towards a real-time computation of timelike hadronic vacuum polarization and light-by-light scattering: Schwinger Model tests

Hadronic vacuum polarization (HVP) and light-by-light scattering (HLBL) are crucial for evaluating the Standard Model predictions concerning the muon’s anomalous magnetic moment. However, direct first-principle lattice gauge theory-based calculations of these observables in the timelike region remain challenging. Discrepancies persist between lattice quantum chromodynamics (QCD) calculations in the spacelike region and dispersive approaches relying on experimental data parametrization from the timelike region. Here, we introduce a methodology employing 1+1-dimensional quantum electrodynamics (QED), i.e. the Schwinger Model, to investigate the HVP and HLBL. To that end, we use both tensor network techniques, specifically matrix product states, and classical emulators of digital quantum computers. Demonstrating feasibility in a simplified model, our approach sets the stage for future endeavors leveraging digital quantum computers.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗

Silicon quantum processor with robust long-distance qubit couplings

Practical quantum computers require a large network of highly coherent qubits, interconnected in a design robust against errors. Donor spins in silicon provide state-of-the-art coherence and quantum gate fidelities, in a platform adapted from industrial semiconductor processing. Here we present a scalable design for a silicon quantum processor that does not require precise donor placement and leaves ample space for the routing of interconnects and readout devices. We introduce the flip-flop qubit, a combination of the electron-nuclear spin states of a phosphorus donor that can be controlled by microwave electric fields. Two-qubit gates exploit a second-order electric dipole-dipole interaction, allowing selective coupling beyond the nearest-neighbor, at separations of hundreds of nanometers, while microwave resonators can extend the entanglement to macroscopic distances. We predict gate fidelities within fault-tolerance thresholds using realistic noise models. This design provides a realizable blueprint for scalable spin-based quantum computers in silicon.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Quantum Simulation of Open Quantum Systems Using a Unitary Decomposition of Operators

Electron transport in realistic physical and chemical systems often involves the nontrivial exchange of energy with a large environment, requiring the definition and treatment of open quantum systems. Because the time evolution of an open quantum system employs a nonunitary operator, the simulation of open quantum systems presents a challenge for universal quantum computers constructed from only unitary operators or gates. Here, we present a general algorithm for implementing the action of any nonunitary operator on an arbitrary state on a quantum device. We show that any quantum operator can be exactly decomposed as a linear combination of at most four unitary operators. We demonstrate this method on a two-level system in both zero and finite temperature amplitude damping channels. Furthermore, the results are in agreement with classical calculations, showing promise in simulating nonunitary operations on intermediate-term and future quantum devices.

74 ATOMIC AND MOLECULAR PHYSICS↗

M + (M=Ca, Ba) Cations Bound to Molecular Cavities: A New Strategy for Incorporating Molecular Quantum States into Quantum Information

This project pursued a novel strategy for incorporating multiple qubits per ion into ion-trap based quantum computing (ITQC) involving Ca + and Ba + . By forming molecular complexes of these cations with molecular-scale cages, we hypothesized that molecular energy levels could be incorporated into quantum computing while retaining key properties of the atomic ions intact. We experimented with a variety of molecular cages and found that Na + , K + , Rb + , Ca 2+ , Sr 2+ , and Ba 2+ could be captured and brought into the gas phase efficiently by imbedding them inside [2.2.2]-benzocryptand. IR and UV spectra of these cage complexes are sensitive to the size and charge state of the ion, reporting on the structures and binding properties of the cage complexes. UV photofragmentation of the Ba 2+ -Acetate -1 -BzCrypt complex produces Ba + -BzCrypt, the complex targeted for exploration in the original hypothesis. Follow-on funding is needed to pursue the spectroscopy of this complex as a target for ITQC.

74 ATOMIC AND MOLECULAR PHYSICS↗

Impact of Ultrathin Pb Films on the Topological Surface and Quantum-Well States of Bi{sub 2}Se{sub 3} and Sb{sub 2}Te{sub 3} Topological Insulators

The effect of an ultrathin Pb film deposited on the surface of Bi{sub 2}Se{sub 3} and Sb{sub 2}Te{sub 3} compounds on the electronic state structure of topological insulators is studied experimentally by the angle-resolved photoemission spectroscopy (ARPES) technique. The following features are revealed: formation of two-dimensional quantum-well states in the near-surface region, an increase in the binding energy of the Dirac cone and the core levels, and a simultaneous electronic states intensity redistribution in the system in photoemission spectra. The results obtained show that topological states may coexist at the interface between studied materials and a superconductor, which seems to be promising for application in quantum computers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗