Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum gate”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Experimental entropic uncertainty relations in dimensions three to five

We provide experimental validation of tight entropic uncertainty relations for the Shannon entropies of observables with mutually unbiased eigenstates in high dimensions. In particular, we address the cases of dimensions 𝑑 = 3, 4, and 5 and consider from 2 to 𝑑 + 1 mutually unbiased bases. The experiment is based on pulsed frequency bins measured with a multioutput quantum pulse gate, which can perform projective measurements on a complete high-dimensional basis in the time-frequency domain. Our results fit the theoretical predictions: the bound on the sum of the entropies is never violated and is saturated by the states that minimize the uncertainty relations.

Serino, Laura [Paderborn University (Germany)] (OR↗
DOE OSTI2026

Efficient Simulation of Logical Magic State Preparation Protocols

Developing space- and time-efficient logical magic state preparation (MSP) protocols will likely be an essential step toward building a large-scale fault-tolerant quantum computer. Motivated by this need, we introduce a scalable method for simulating logical MSP protocols under the standard circuit-level noise model. When applied to protocols based on code-switching, magic state cultivation, and magic state distillation, our method yields a complexity polynomial in (i) the number of qubits and (ii) the nonstabilizerness, e.g., stabilizer rank or Pauli rank, of the target encoded magic state. The efficiency of our simulation method is rooted in a curious fact: every circuit-level Pauli error in these protocols propagates to a Clifford error at the end. This property is satisfied by a large family of protocols, including those that repeatedly measure a transversal Clifford that squares to a Pauli. We provide a proof-of-principle numerical simulation that prepares a magic state using such logical Clifford measurements. Our work enables practical simulation of logical MSP protocols without resorting to approximations or resource-intensive state-vector simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1998

Characterization of an Ozone DIAL Receiver for Operation on an Unpiloted Atmospheric Vehicle

Laser remote sensing from aircraft has become a very important technique for observing ozone in the environment. NASA Langley has an active aircraft based research program which presently uses Nd:YAG-pumped dye lasers that are then doubled into the UV to probe both the stratosphere and troposphere for ozone using the differential absorption lidar (DIAL) technique. This large system can only fly on large (NASA DC-8, Electra) aircraft and has been deployed on many missions throughout the world. In the future it will be desirable to fly autonomous, lightweight, compact ozone DIAL instruments on unpiloted atmospheric vehicles (UAV) aircraft. Such aircraft could fly at high altitudes for extended times collecting science data without risk to the operator. Cost for such missions may be substantially reduced over present large aircraft based missions. Presently there are no ozone DIAL systems capable of flying on an UAV aircraft. In order to facilitate UAV missions, small more efficient laser transmitters need to be developed that emit approximately 25mJ near 300nm for each of the DIAL 'on' and 'off' line pulses. Also lightweight, compact DIAL receiver systems need to be built and demonstrated. Such receiver systems may incorporate fiber optic coupled telescopes for maximum light gathering capability per unit area, high quantum efficiency gated photomultiplier tubes with reasonable gain and very narrow-band filters for background light rejection with high light throughput. A compact high-performance 16-bit digitizer and a data storage system are also required. A conceptional design of such a UAV DIAL instrument is presented. Here a pulsed UV laser emits pulses into the atmosphere where elastic scattering occurs which results in light being scattered into the receiver telescope. The subject of this paper is the design, construction and testing of a robust, compact ozone DIAL receiver system that would be a prototype for eventual use in a UAV aircraft.

Goldschmidt, Soenke↗
DOE OSTI2024

On the universality of S n -equivariant k -body gates

The importance of symmetries has recently been recognized in quantum machine learning from the simple motto: if a task exhibits a symmetry (given by a group $\mathfrak{G}$), the learning model should respect said symmetry. This can be instantiated via $\mathfrak{G}$-equivariant quantum neural networks (QNNs), i.e. parametrized quantum circuits whose gates are generated by operators commuting with a given representation of $\mathfrak{G}$. In practice, however, there might be additional restrictions to the types of gates one can use, such as being able to act on at most k qubits. In this work we study how the interplay between symmetry and k-bodyness in the QNN generators affect its expressiveness for the special case of $\mathfrak{G}=S_n$, the symmetric group. Our results show that if the QNN is generated by one- and two-body Sn-equivariant gates, the QNN is semi-universal but not universal. That is, the QNN can generate any arbitrary special unitary matrix in the invariant subspaces, but has no control over the relative phases between them. Then, we show that in order to reach universality one needs to include n-body generators (if n is even) or ($n-1$)-body generators (if n is odd). As such, our results brings us a step closer to better understanding the capabilities and limitations of equivariant QNNs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Hybrid quantum simulations with qubits and qumodes on trapped-ion platforms

We explore the feasibility of gate-based hybrid quantum computing using both discrete (qubit) and continuous (qumode) variables on trapped-ion platforms. Trapped-ion systems have demonstrated record one- and two-qubit gate fidelities and long qubit coherence times, while qumodes, which can be represented by the collective vibrational modes of the ion chain, have remained relatively unex- plored for their use in computing. Using numerical simulations, we show that high-fidelity hybrid gates and measurement operations can be achieved for existing trapped-ion quantum platforms. As an exemplary application, we consider quantum simulations of the Jaynes-Cummings-Hubbard model, which is given by a one-dimensional chain of interacting spin and boson degrees of free- dom. Using classical simulations, we study its real-time evolution and develop a suitable variational quantum algorithm for ground state preparation. Furthermore, our results motivate further studies of hybrid quantum computing in this context, which may lead to direct applications in condensed matter and fundamental particle and nuclear physics.

Lower-dimensional field theories↗
DOE OSTI2025

Resilience–runtime tradeoff relations for quantum algorithms

Abstract A leading approach to algorithm design aims to minimize the number of operations in an algorithm’s compilation. One intuitively expects that reducing the number of operations may decrease the chance of errors. This paradigm is particularly prevalent in quantum computing, where gates are hard to implement and noise rapidly decreases a quantum computer’s potential to outperform classical computers. Here, we find that minimizing the number of operations in a quantum algorithm can be counterproductive, leading to a noise sensitivity that induces errors when running the algorithm in non-ideal conditions. To show this, we develop a framework to characterize the resilience of an algorithm to perturbative noises (including coherent errors, dephasing, and depolarizing noise). Some compilations of an algorithm can be resilient against certain noise sources while being unstable against other noises. We condense these results into a tradeoff relation between an algorithm’s number of operations and its noise resilience. We also show how this framework can be leveraged to identify compilations of an algorithm that are better suited to withstand certain noises.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Theory of quantum circuits with Abelian symmetries

Quantum circuits with gates (local unitaries) respecting a global symmetry have broad applications in quantum information science and related fields, such as condensed-matter theory and quantum thermodynamics. However, despite their widespread use, fundamental properties of such circuits are not well understood. Recently, it was found that generic unitaries respecting a global symmetry cannot be realized, even approximately, using gates that respect the same symmetry. This observation raises important open questions: What unitary transformations can be realized with k -local gates that respect a global symmetry? In other words, in the presence of a global symmetry, how does the locality of interactions constrain the possible time evolution of a composite system? In this work, we address these questions for the case of Abelian (commutative) symmetries and develop constructive methods for synthesizing circuits with such symmetries. Remarkably, as a corollary, we find that, while the locality of interactions still imposes additional constraints on realizable unitaries, certain restrictions observed in the case of non-Abelian symmetries do not apply to circuits with Abelian symmetries. For instance, in circuits with a general non-Abelian symmetry such as SU ( d ) , the unitary realized in a subspace with one irreducible representation (charge) of the symmetry dictates the realized unitaries in multiple other sectors with inequivalent representations of the symmetry. Furthermore, in certain sectors, rather than all unitaries respecting the symmetry, the realizable unitaries are the symplectic or orthogonal subgroups of this group. We prove that none of these restrictions appears in the case of Abelian symmetries. This result suggests that global non-Abelian symmetries may affect the thermalization of quantum systems in ways not possible under Abelian symmetries. Published by the American Physical Society 2024

Marvian, Iman↗
DOE OSTI2025

Architecture for fast implementation of quantum low-density parity-check codes with optimized Rydberg gates

Here, we propose an implementation of bivariate bicycle codes [S. Bravyi et al., Nature (London) 627, 778 (2024)] based on long-range Rydberg gates between stationary neutral atom qubits. An optimized layout of data and ancilla qubits reduces the maximum Euclidean communication distance needed for nonlocal parity-check operators. An optimized Rydberg gate pulse design enables 𝖢𝖹 entangling operations with fidelity $\mathscr{F}$ >0.999 at a distance greater than 12 µ⁢m. The combination of optimized layout and gate design leads to a quantum error correction cycle time of ∼1.2⁢8 ms for a [[144,12,12]] code, which is nearly a factor-of-two improvement over previous designs.

Poole, C. [Univ. of Wisconsin, Madison, WI (United↗
DOE OSTI2026

Qudit Designs and Where to Find Them

Unitary t-designs are some of the most versatile tools in quantum information theory. Their applications range from randomized benchmarking and shadow tomography, to more fundamental ones such as emulating quantum chaos and establishing exponential separations between classical and quantum query complexity. While unitary designs originating from a group structure, such as the Clifford group, have proven to be incredibly useful for qubit systems, unfortunately, this is no longer true for qudits. In fact, the classification of finite-group representations rules out the existence of unitary 2-designs for arbitrary qudit dimensions. This severely limits the applicability of standard quantum information primitives when it comes to qudit systems. We overcome these limitations with a three-fold contribution. First, we introduce a general technique to construct families of weighted state t-designs in arbitrary qudit dimensions. These weighted state-designs generalize classical shadow tomography protocol from qubits to qudits. Second, we introduce a Clifford character RB that allows us to benchmark the qudit Clifford group in any dimension, including non-prime-power dimensions. And third, we establish bounds on the quantum circuit complexity of generating approximate unitary-designs from native gates in existing quantum hardware such as high-spin and cavity-QED qudits. Our work further highlights the analogy between spin and optical coherent states by proving that spin-GKP codewords form a state 2-design while spin coherent states do not; in direct analogy with the optical case. This work is structured as a pedagogical and self-contained introduction to unitary designs and their applications to qudit systems.

Anand, Namit [NASA, Ames; Unlisted, US] (ORCID:000↗
NASA NTRS2000

Efficient Multi-Dimensional Simulation of Quantum Confinement Effects in Advanced MOS Devices

We investigate the density-gradient (DG) transport model for efficient multi-dimensional simulation of quantum confinement effects in advanced MOS devices. The formulation of the DG model is described as a quantum correction ot the classical drift-diffusion model. Quantum confinement effects are shown to be significant in sub-100nm MOSFETs. In thin-oxide MOS capacitors, quantum effects may reduce gate capacitance by 25% or more. As a result, the inclusion of quantum effects may reduce gate capacitance by 25% or more. As a result, the inclusion of quantum effects in simulations dramatically improves the match between C-V simulations and measurements for oxide thickness down to 2 nm. Significant quantum corrections also occur in the I-V characteristics of short-channel (30 to 100 nm) n-MOSFETs, with current drive reduced by up to 70%. This effect is shown to result from reduced inversion charge due to quantum confinement of electrons in the channel. Also, subthreshold slope is degraded by 15 to 20 mV/decade with the inclusion of quantum effects via the density-gradient model, and short channel effects (in particular, drain-induced barrier lowering) are noticeably increased.

Biegel, Bryan A.↗
DOE OSTI2024

Geometric representations of braid and Yang–Baxter gates

Brick-wall circuits composed of the Yang–Baxter gates are integrable. It becomes an important tool to study the quantum many-body system out of equilibrium. To put the Yang–Baxter gate on quantum computers, it has to be decomposed into the native gates of quantum computers. It is favorable to apply the least number of native two-qubit gates to construct the Yang–Baxter gate. We study the geometric representations of all X-type braid gates and their corresponding Yang–Baxter gates via the Yang–Baxterization. We find that the braid and Yang–Baxter gates can only exist on certain edges and faces of the two-qubit tetrahedron. We identify the parameters by which the braid and Yang–Baxter gates are the Clifford gate, the matchgate, and the dual-unitary gate. The geometric representations provide the optimal decompositions of the braid and Yang–Baxter gates in terms of other two-qubit gates. We also find that the entangling powers of the Yang–Baxter gates are determined by the spectral parameters. Our results provide the necessary conditions to construct the braid and Yang–Baxter gates on quantum computers.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2005

SCB Quantum Computers Using iSWAP and 1-Qubit Rotations

Units of superconducting circuitry that exploit the concept of the single- Cooper-pair box (SCB) have been built and are undergoing testing as prototypes of logic gates that could, in principle, constitute building blocks of clocked quantum computers. These units utilize quantized charge states as the quantum information-bearing degrees of freedom. An SCB is an artificial two-level quantum system that comprises a nanoscale superconducting electrode connected to a reservoir of Cooper-pair charges via a Josephson junction. The logical quantum states of the device, .0. and .1., are implemented physically as a pair of charge-number states that differ by 2e (where e is the charge of an electron). Typically, some 109 Cooper pairs are involved. Transitions between the logical states are accomplished by tunneling of Cooper pairs through the Josephson junction. Although the two-level system contains a macroscopic number of charges, in the superconducting regime, they behave collectively, as a Bose-Einstein condensate, making possible a coherent superposition of the two logical states. This possibility makes the SCB a candidate for the physical implementation of a qubit. A set of quantum logic operations and the gates that implement them is characterized as universal if, in principle, one can form combinations of the operations in the set to implement any desired quantum computation. To be able to design a practical quantum computer, one must first specify how to decompose any valid quantum computation into a sequence of elementary 1- and 2-qubit quantum gates that are universal and that can be realized in hardware that is feasible to fabricate. Traditionally, the set of universal gates has been taken to be the set of all 1-qubit quantum gates in conjunction with the controlled-NOT (CNOT) gate, which is a 2-qubit gate. Also, it has been known for some time that the SWAP gate, which implements square root of the simple 2-qubit exchange interaction, is as computationally universal as is the CNOT operation.

Williams, Colin↗
DOE OSTI2025

Controlled gate networks: theory and application to eigenvalue estimation

We introduce a new scheme for quantum circuit design called controlled gate networks. Rather than trying to reduce the complexity of individual unitary operations, the new strategy is to toggle between all of the unitary operations needed with the fewest number of gates. We present the general theory of controlled gate networks and show that, under quite general conditions, it can significantly reduce the number of two-qubit gates needed to produce linear combinations of unitary operators. The first example we consider is a variational subspace calculation for a two-qubit system. The second example is estimating the eigenvalues of a two-qubit Hamiltonian via the rodeo algorithm (Choi et al. in Phys Rev Lett 127(4):040505, 2021. https://doi.org/10.1103/PhysRevLett.127.040505) using operators that we call controlled reversal gates. We use the Quantinuum H1-2 and IBM Perth devices to realize the quantum circuits. The third example is the application of controlled gate networks to the controlled time evolution of a free nucleon on a three-dimensional lattice. For all of the examples, we show very substantial reductions in the number of two-qubit gates required. Our work demonstrates that controlled gate networks are a useful tool for reducing gate complexity in quantum algorithms for quantum many-body problems such as those relevant to nuclear physics.

Bee-Lindgren, Max [Georgia Institute of Technology↗
DOE OSTI2025

LuGo: An enhanced quantum phase estimation implementation

Quantum Phase Estimation (QPE) is a cardinal algorithm in quantum computing that plays a crucial role in various applications, including cryptography, molecular simulation, and solving systems of linear equations. However, the standard implementation of QPE faces challenges related to time complexity and circuit depth, which limit its practicality for large-scale computations. We introduce LuGo, a novel framework designed to enhance the performance of QPE by reducing circuit duplication, as well as using parallelization techniques to achieve faster generation of the QPE circuit and gate reduction. We validate the effectiveness of our framework by generating quantum linear solver circuits, which require both QPE and inverse QPE, to solve linear systems of equations. LuGo achieves significant improvements in both computational efficiency and hardware requirements without compromising on accuracy. Compared to a standard QPE implementation, LuGo reduces time consumption to generate a circuit that solves a 2 6 × 2 6 system matrix by a factor of 50.68 and over 31× reduction of quantum gates and circuit depth, with no fidelity loss on an ideal quantum simulator. Furthermore, we demonstrated the versatility and scalability of LuGo enabled HHL algorithm by simulating a canonical Hele-Shaw fluid problem using a quantum simulator. With these advantages, LuGo paves the way for more efficient implementations of QPE, enabling broader applications across several quantum computing domains.

Quantum algorithm↗
NASA NTRS1998

Simulation of Ultra-Small MOSFETs Using a 2-D Quantum-Corrected Drift-Diffusion Model

We describe an electronic transport model and an implementation approach that respond to the challenges of device modeling for gigascale integration. We use the density-gradient (DG) transport model, which adds tunneling and quantum smoothing of carrier density profiles to the drift-diffusion model. We present the current implementation of the DG model in PROPHET, a partial differential equation solver developed by Lucent Technologies. This implementation approach permits rapid development and enhancement of models, as well as run-time modifications and model switching. We show that even in typical bulk transport devices such as P-N diodes and BJTs, DG quantum effects can significantly modify the I-V characteristics. Quantum effects are shown to be even more significant in small, surface transport devices, such as sub-0.1 micron MOSFETs. In thin-oxide MOS capacitors, we find that quantum effects may reduce gate capacitance by 25% or more. The inclusion of quantum effects in simulations dramatically improves the match between C-V simulations and measurements. Significant quantum corrections also occur in the I-V characteristics of short-channel MOSFETs due to the gate capacitance correction.

Biegel, Bryan A.↗
NASA NTRS1998

Simulation of Ultra-Small MOSFETs Using a 2-D Quantum-Corrected Drift-Diffusion Model

The continued down-scaling of electronic devices, in particular the commercially dominant MOSFET, will force a fundamental change in the process of new electronics technology development in the next five to ten years. The cost of developing new technology generations is soaring along with the price of new fabrication facilities, even as competitive pressure intensifies to bring this new technology to market faster than ever before. To reduce cost and time to market, device simulation must become a more fundamental, indeed dominant, part of the technology development cycle. In order to produce these benefits, simulation accuracy must improve markedly. At the same time, device physics will become more complex, with the rapid increase in various small-geometry and quantum effects. This work describes both an approach to device simulator development and a physical model which advance the effort to meet the tremendous electronic device simulation challenge described above. The device simulation approach is to specify the physical model at a high level to a general-purpose (but highly efficient) partial differential equation solver (in this case PROPHET, developed by Lucent Technologies), which then simulates the model in 1-D, 2-D, or 3-D for a specified device and test regime. This approach allows for the rapid investigation of a wide range of device models and effects, which is certainly essential for device simulation to catch up with, and then stay ahead of, electronic device technology of the present and future. The physical device model used in this work is the density-gradient (DG) quantum correction to the drift-diffusion model [Ancona, Phys. Rev. B 35(5), 7959 (1987)]. This model adds tunneling and quantum smoothing of carrier density profiles to the drift-diffusion model. We used the DG model in 1-D and 2-D (for the first time) to simulate both bipolar and unipolar devices. Simulations of heavily-doped, short-base diodes indicated that the DG quantum corrections do not have a large effect on the IN characteristics of electronic devices without heteroj unction s. On the other hand, ultra-small MOSFETs certainly exhibit important quantum effects that the DG model will include: quantum repulsion of the inversion and gate charges from the oxide interfaces, and quantum tunneling through thin gate oxides. We present initial results of 2-D DG simulations of ultra-small MOSFETs. Subtle but important issues involving the specification of the model, boundary conditions, and interface constraints for DG simulation of MOSFETs will also be illuminated.

Biegal, Bryan A.↗
DOE OSTI2024

Fragment-based initialization for quantum subspace methods

Here, we present a novel quantum-classical algorithm called LAS-QKSD for multireference systems, by combining a classical localized active space (LAS) fragment-based multireference algorithm with the quantum Krylov subspace diagonalization (QKSD) method for quantum computers. The algorithm uses wave function information from a LAS self-consistent field (LASSCF) calculation to prepare an initial state with better overlap with the target ground state than the Hartree-Fock state. This is coupled with the use of QKSD to ultimately converge to the exact energy, providing faster convergence than starting from the Hartree-Fock state. Fragmentation has the two-fold benefit of fewer configurations on the classical side of the algorithm as well as fewer state preparation gates on the quantum side. First, we compare the LAS-QKSD method to the classical LASSCF method and to QKSD with a Hartree-Fock initial state. We then examine ways to load the LASSCF wave function using direct initialization and a QKSD-motivated spectral filtering approach. Finally, using a bimetallic complex, we show that the LAS-QKSD method is an efficient alternative to highly expensive complete active space SCF (CASSCF) calculations on strongly correlated systems.

D'Cunha, Ruhee↗