Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum gates”

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

Advances in SRF cavity architectures for quantum computing

Superconducting radio frequency (SRF) cavities offer an excellent platform for storing and processing quantum information due to their exceptionally long lifetimes and large accessible Hilbert spaces. A common strategy to manipulate the quantum states is to use a nonlinear element like a transmon. Nevertheless, constructing a 3D SRF architecture with sustained cavity lifetimes presents several challenges. In this talk, we present our successful integration of transmons with single-cell Nb SRF cavities, enabling the preparation of several non-classical states. Preliminary results reveal the potential of this platform to build a qudit-based quantum computer, departing from traditional qubit-based architectures. We discuss strategies to enhance coherence times, develop high-fidelity gate schemes, and expand the system for constructing a multi-qudit quantum processor. Furthermore, we explore how this architecture can bolster dark matter detection efficiency through multi-photon quantum state preparation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Typology of Quantum-Classical Faults

This paper introduces an extended taxonomy of faults specific to hybrid quantum-classical systems, addressing the unique challenges that arise from integrating quantum accelerators into high-performance computing (HPC) infrastructures. Building on the foundational fault classification by Avizienis et al., we incorporate fault types unique to quantum computing-such as qubit decoherence, spontaneous gate errors, and photon loss-alongside traditional and human-induced faults including development errors, operational mistakes, and malicious attacks. Our taxonomy classifies faults by their origin (natural vs. human-made), intent (accidental, deliberate non-malicious, or malicious), system boundaries (internal vs. external), and persistence (transient to permanent). We also explore how different architectural integration patterns-ranging from tight coupling to loose on-premise and cloud-based configurations-shape the manifestation and propagation of faults. These scenarios are analyzed in terms of timing mismatches, interface inconsistencies, and security threats such as data tampering and denial-of-service attacks. Through this fault-centric lens, we aim to support the co-design of dependable quantum-classical systems and highlight the critical role that integration strategies play in ensuring reproducibility, resilience, and security across hybrid computing platforms.

Giusto, Edorado [University of Naples Federico II,↗

Efficient sparse state preparation via quantum walks

Continuous-time quantum walks (CTQWs) on dynamic graphs, referred to as dynamic CTQWs, are a recently introduced universal model of computation that offers a new paradigm in which to envision quantum algorithms. In this work, we develop an algorithm that converts single-edge and self-loop dynamic CTQWs to the gate model of computation. We use this mapping to introduce an efficient sparse quantum state preparation framework based on dynamic CTQWs. Our approach utilizes combinatorics techniques such as minimal hitting sets, minimum spanning trees, and shortest Hamiltonian paths to reduce the number of controlled gates required to prepare sparse states. We show that our framework encompasses the current state of the art ancilla-free sparse state preparation method by reformulating this method as a CTQW. This CTQW-based framework offers an alternative to the uniformly controlled rotation method used by Qiskit by requiring fewer CX gates when the target state has a polynomial number of non-zero amplitudes.

dynamic continuous time quantum walks↗

Sampling on NISQ Devices: "Who’s the Fairest One of All?"

Modern NISQ devices are subject to a variety of biases and sources of noise that degrade the solution quality of computations carried out on these devices. A natural question that arises in the NISQ era, is how fairly do these devices sample ground state solutions. To this end, we run five fair sampling problems (each with at least three ground state solutions) that are based both on quantum annealing and, on the Grover Mixer, -QAOA algorithm for gate-based NISQ hardware. In particular, we use seven IBM Q devices, the Aspen-9 Rigetti device, the IonQ device, and three D-Wave quantum annealers. For each of the fair sampling problems, we measure the ground state probability, the relative fairness of the frequency of each ground state solution with respect to the other ground state solutions, and the aggregate error as given by each hardware provider. Overall, our results show that NISQ devices do not achieve fair sampling yet. Furthermore, we also observe differences in the software stack with a particular focus on compilation techniques that illustrate what work will still need to be done to achieve a seamless integration of frontend (i.e., quantum circuit description) and backend compilation.

Computer Science↗

First-principles calculation of gate-tunable ferromagnetism in magic-angle twisted bilayer graphene under pressure

Magic-angle twisted bilayer graphene (MATBG) is notable as a highly tunable platform for investigating strongly correlated phenomena such as unconventional superconductivity and quantum spin liquids, due to easy control of doping level through gating and sensitive dependence of the magic angle on hydrostatic pressure. Experimental observations of correlated insulating states, unconventional superconductivity and ferromagnetism in MATBG indicate that this system exhibits rich exotic phases. In this work, using density functional theory calculations in conjunction with the effective screening medium method, we find the MATBG under pressure at a twisting angle of 2.88 °and simulate how its electronic states evolve when doping level and electric field perpendicular to plane are tuned by gating. Our calculations show that, at doping levels between two electrons and four holes per moiré unit cell, a ferromagnetic (FM) solution with spin density localized at AA stacking sites is lower in energy than the nonmagnetic solution. The magnetic moment of this FM state decreases with both electron and hole doping and vanishes at four electrons/holes doped per moiré unit cell. Hybridization between the flat bands at the Fermi level and the surrounding dispersive bands can take place at finite doping. On increasing the out-of-plane electric field at zero doping, a transition from the FM state to the nonmagnetic one is seen. An investigation of impurity effects shows that both absorption of O 2 molecules and occurrence of Stone–Wales impurities suppress the FM state, and the mechanisms are understood from our calculations. We also analyze the interlayer bonding character due to flat bands via Wannier functions. Finally, we report trivial band topology of the flat bands in the FM state at a certain doping level.

Physics↗

Identifying Decoherence Mechanisms in Superconducting Qubits through Advanced Materials Characterization

Although superconducting qubits have emerged as a leading technology platform for quantum computing through large improvements in device coherence times and gate fidelity in recent years, the presence of defects and impurities at the interfaces and surfaces in the constituent materials continue to limit performance and serve as a critical barrier in achieving scalable quantum systems. Understanding and eliminating these sources of quantum decoherence in superconducting qubit devices requires dedicated studies aimed at establishing robust structure-property relationships that will enable researchers to target and eliminate defects strategically. As part of the Superconducting Materials and Systems (SQMS) center, we have extensively employed state-of-the-art materials characterization techniques, including scanning/transmission electron microscopy, secondary ion mass spectrometry, atom probe tomography, x-ray diffraction, and x-ray photoelectron spectroscopy in conjunction with device measurements to elucidate such relationships. In this talk, I will discuss some of our recent findings, including linking atomic defects to microwave loss in surface oxides, linking impurities in the Josephson Junction to qubit parameters, and linking low temperature precipitates to device performance. By applying these insights, we have been able to strategically develop and implement mitigation strategies for reliable fabrication of high coherence superconducting qubits.

Murthy, A. [Fermilab] (ORCID:0000000176776866)↗

Identifying Decoherence Mechanisms in Superconducting Qubits through Advanced Materials Characterization

Although superconducting qubits have emerged as a leading technology platform for quantum computing through large improvements in device coherence times and gate fidelity in recent years, the presence of defects and impurities at the interfaces and surfaces in the constituent materials continue to limit performance and serve as a critical barrier in achieving scalable quantum systems. Understanding and eliminating these sources of quantum decoherence in superconducting qubit devices requires dedicated studies aimed at establishing robust structure-property relationships that will enable researchers to target and eliminate defects strategically. As part of the Superconducting Materials and Systems (SQMS) center, we have extensively employed state-of-the-art materials characterization techniques, including scanning/transmission electron microscopy, secondary ion mass spectrometry, atom probe tomography, x-ray diffraction, and x-ray photoelectron spectroscopy in conjunction with device measurements to elucidate such relationships. In this talk, I will discuss some of our recent findings, including linking atomic defects to microwave loss in surface oxides, linking impurities in the Josephson Junction to qubit parameters, and linking low temperature precipitates to device performance. By applying these insights, we have been able to strategically develop and implement mitigation strategies for reliable fabrication of high coherence superconducting qubits.

Murthy, A. [Fermilab] (ORCID:0000000176776866)↗

Tunable Inductive Coupler for High-Fidelity Gates Between Fluxonium Qubits

The fluxonium qubit is a promising candidate for quantum computation due to its long coherence times and large anharmonicity. We present a tunable coupler that realizes strong inductive coupling between two heavy-fluxonium qubits, each with approximately 50-MHz frequencies and approximately 5-GHz anharmonicities. The coupler enables the qubits to have a large tuning range of 𝑋⁢𝑋 coupling strengths (−35 to 75 MHz). The 𝑍⁢𝑍 coupling strength is <3 kHz across the entire coupler bias range and <100 Hz at the coupler off position. These qualities lead to fast high-fidelity single- and two-qubit gates. By driving at the difference frequency of the two qubits, we realize a $\sqrt{i\textrm{SWAP}}$ gate in 258 ns with fidelity 99.72%, and by driving at the sum frequency of the two qubits, we achieve a $\sqrt{𝑏⁢\textrm{SWAP}}$ gate in 102 ns with fidelity 99.91%. This latter gate is only five qubit Larmor periods in length. We run cross-entropy benchmarking for over 20 consecutive hours and measure stable gate fidelities, with $\sqrt{𝑏⁢\textrm{SWAP}}$ drift (2⁢𝜎) <0.02% and $\sqrt{i\textrm{SWAP}}$ drift <0.08%.

Zhang, Helin↗

Preparation of excited states for nuclear dynamics on a quantum computer

We study two different methods to prepare excited states on a quantum computer, a key initial step to study dynamics within linear response theory. The first method uses unitary evolution for a short time T = O(√1 - F) to approximate the action of an excitation operator Ô with fidelity F and success probability P ≈ 1 – F. The second method probabilistically applies the excitation operator using the Linear Combination of Unitaries (LCU) algorithm. We benchmark these techniques on emulated and real quantum devices, using a toy model for thermal neutron-proton capture. Despite its larger memory footprint, the LCU-based method is efficient even on current generation noisy devices and can be implemented at a lower gate cost than a naive analysis would suggest. Here, these findings show that quantum techniques designed to achieve good asymptotic scaling on fault tolerant quantum devices might also provide practical benefits on devices with limited connectivity and gate fidelity.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Quantum cluster algorithm for data classification

Abstract We present a quantum algorithm for data classification based on the nearest-neighbor learning algorithm. The classification algorithm is divided into two steps: Firstly, data in the same class is divided into smaller groups with sublabels assisting building boundaries between data with different labels. Secondly we construct a quantum circuit for classification that contains multi control gates. The algorithm is easy to implement and efficient in predicting the labels of test data. To illustrate the power and efficiency of this approach, we construct the phase transition diagram for the metal-insulator transition of VO 2 , using limited trained experimental data, where VO 2 is a typical strongly correlated electron materials, and the metallic-insulating phase transition has drawn much attention in condensed matter physics. Moreover, we demonstrate our algorithm on the classification of randomly generated data and the classification of entanglement for various Werner states, where the training sets can not be divided by a single curve, instead, more than one curves are required to separate them apart perfectly. Our preliminary result shows considerable potential for various classification problems, particularly for constructing different phases in materials.

97 MATHEMATICS AND COMPUTING↗

HamPerf: A Hamiltonian-Oriented Approach to Quantum Benchmarking

Quantum computing technologies are undergoing rapid development. The different qubit modalities being considered for quantum computing each have their strengths and weaknesses, making it challenging to compare their performance relative to each other and the state-of-the-art in classical high-performance computing. To better understand the utility of a given quantum processor and to assess when and how it will be able to advance the frontiers of computational science, researchers need a robust approach to quantum benchmarking. A variety of approaches have been proposed, many of which characterize the presence of noise in current quantum devices. These efforts include component-level performance metrics, such as randomized benchmarking and gate set tomography; high-level application-dependent metrics; and devicelevel metrics, such as the Quantum Volume. However, it remains unclear how low-level metrics, such as fidelities and decoherence times, and global device metrics, such as Quantum Volume, relate to the computational utility and practical limitations of quantum processors to solve useful problems. In this paper, we describe our Hamiltonian-oriented approach to quantum benchmarking called HamPerf. Where previous application-dependent approaches specify a suite of benchmarking circuits inspired by applications, we place the problem Hamiltonian at the center. Our strategy allows us to probe the computational performance of a quantum processor on standardized and relevant problem sets, agnostic of the algorithms and hardware used to solve them; it also provides fundamental insights into how device characteristics correlate with computational utility.

Butko, Anastasiia↗

A quantum hamiltonian simulation benchmark

Hamiltonian simulation is one of the most important problems in quantum computation, and quantum singular value transformation (QSVT) is an efficient way to simulate a general class of Hamiltonians. However, the QSVT circuit typically involves multiple ancilla qubits and multi-qubit control gates. In order to simulate a certain class of n-qubit random Hamiltonians, we propose a drastically simplified quantum circuit that we refer to as the minimal QSVT circuit, which uses only one ancilla qubit and no multi-qubit controlled gates. We formulate a simple metric called the quantum unitary evolution score (QUES), which is a scalable quantum benchmark and can be verified without any need for classical computation. Under the globally depolarized noise model, we demonstrate that QUES is directly related to the circuit fidelity, and the potential classical hardness of an associated quantum circuit sampling problem. Under the same assumption, theoretical analysis suggests there exists an ‘optimal’ simulation time t opt ≈ 4.81, at which even a noisy quantum device may be sufficient to demonstrate the potential classical hardness.

97 MATHEMATICS AND COMPUTING↗

Crosstalk-robust quantum control in multimode bosonic systems

High-coherence superconducting cavities offer a hardware-efficient platform for quantum information processing. To achieve universal operations of these bosonic modes, the requisite nonlinearity is realized by coupling them to a transmon ancilla. However, this configuration is susceptible to crosstalk errors in the dispersive regime, where the ancilla frequency is Stark shifted by the state of each coupled bosonic mode. This leads to a frequency mismatch of the ancilla drive, lowering the gate fidelities. To mitigate such coherent errors, we employ quantum optimal control to engineer ancilla pulses that are robust to the frequency shifts. These optimized pulses are subsequently integrated into a recently developed echoed conditional displacement protocol for executing single- and two-mode operations. Through numerical simulations, we examine two representative scenarios: the preparation of single-mode Fock states in the presence of spectator modes and the generation of two-mode entangled Bell-cat states. Our approach markedly suppresses crosstalk errors, outperforming conventional ancilla control methods by orders of magnitude. These results provide guidance for experimentally achieving high-fidelity multimode operations and pave the way for developing high-performance bosonic quantum information processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dangling Bonds as Possible Contributors to Charge Noise in Silicon and Silicon–Germanium Quantum Dot Qubits

Spin qubits based on Si and Si 1–x Ge x quantum dot architectures exhibit among the best coherence times of competing quantum computing technologies, yet they still suffer from charge noise that limit their qubit gate fidelities. Identifying the origins of these charge fluctuations is therefore a critical step toward improving Si quantum-dot-based qubits. Here, we use hybrid functional calculations to investigate possible atomistic sources of charge noise, focusing on charge trapping at Si and Ge dangling bonds (DBs). We evaluate the role of global and local environment in the defect levels associated with DBs in Si, Ge, and Si 1–x Ge x alloys, and consider their trapping and excitation energies within the framework of configuration coordinate diagrams. We additionally consider the influence of strain and oxidation in charge-trapping energetics by analyzing Si and GeSi DBs in SiO 2 and strained Si layers in typical Si 1–x Ge x quantum dot heterostructures. Our results identify that Ge dangling bonds are more problematic charge-trapping centers both in typical Si 1–x Ge x alloys and associated oxidation layers, and they may be exacerbated by compositional inhomogeneities. In conclusion, these results suggest the importance of alloy homogeneity and possible passivation schemes for DBs in Si-based quantum dot qubits and are of general relevance to mitigating possible trap levels in other Si, Ge, and Si 1–x Ge x -based metal-oxide-semiconductor stacks and related devices.

36 MATERIALS SCIENCE↗

Quantum Divide and Compute: Exploring the Effect of Different Noise Sources

Abstract Our recent work (Ayral et al. in Proceedings of IEEE computer society annual symposium on VLSI, ISVLSI, pp 138–140, 2020. 10.1109/ISVLSI49217.2020.00034 ) showed the first implementation of the Quantum Divide and Compute (QDC) method, which allows to break quantum circuits into smaller fragments with fewer qubits and shallower depth. This accommodates the limited number of qubits and short coherence times of quantum processors. This article investigates the impact of different noise sources—readout error, gate error and decoherence—on the success probability of the QDC procedure. We perform detailed noise modeling on the Atos Quantum Learning Machine, allowing us to understand tradeoffs and formulate recommendations about which hardware noise sources should be preferentially optimized. We also describe in detail the noise models we used to reproduce experimental runs on IBM’s Johannesburg processor. This article also includes a detailed derivation of the equations used in the QDC procedure to compute the output distribution of the original quantum circuit from the output distribution of its fragments. Finally, we analyze the computational complexity of the QDC method for the circuit under study via tensor-network considerations, and elaborate on the relation the QDC method with tensor-network simulation methods.

97 MATHEMATICS AND COMPUTING↗

Scheme for Quantum Computing Immune to Decoherence

A constructive scheme has been devised to enable mapping of any quantum computation into a spintronic circuit in which the computation is encoded in a basis that is, in principle, immune to quantum decoherence. The scheme is implemented by an algorithm that utilizes multiple physical spins to encode each logical bit in such a way that collective errors affecting all the physical spins do not disturb the logical bit. The scheme is expected to be of use to experimenters working on spintronic implementations of quantum logic. Spintronic computing devices use quantum-mechanical spins (typically, electron spins) to encode logical bits. Bits thus encoded (denoted qubits) are potentially susceptible to errors caused by noise and decoherence. The traditional model of quantum computation is based partly on the assumption that each qubit is implemented by use of a single two-state quantum system, such as an electron or other spin-1.2 particle. It can be surprisingly difficult to achieve certain gate operations . most notably, those of arbitrary 1-qubit gates . in spintronic hardware according to this model. However, ironically, certain 2-qubit interactions (in particular, spin-spin exchange interactions) can be achieved relatively easily in spintronic hardware. Therefore, it would be fortunate if it were possible to implement any 1-qubit gate by use of a spin-spin exchange interaction. While such a direct representation is not possible, it is possible to achieve an arbitrary 1-qubit gate indirectly by means of a sequence of four spin-spin exchange interactions, which could be implemented by use of four exchange gates. Accordingly, the present scheme provides for mapping any 1-qubit gate in the logical basis into an equivalent sequence of at most four spin-spin exchange interactions in the physical (encoded) basis. The complexity of the mathematical derivation of the scheme from basic quantum principles precludes a description within this article; it must suffice to report that the derivation provides explicit constructions for finding the exchange couplings in the physical basis needed to implement any arbitrary 1-qubit gate. These constructions lead to spintronic encodings of quantum logic that are more efficient than those of a previously published scheme that utilizes a universal but fixed set of gates.

Williams, Colin↗

The QICK (Quantum Instrumentation Control Kit): Readout and control for qubits and detectors

We introduce a Xilinx RF System-on-Chip (RFSoC)-based qubit controller (called the Quantum Instrumentation Control Kit, or QICK for short), which supports the direct synthesis of control pulses with carrier frequencies of up to 6 GHz. The QICK can control multiple qubits or other quantum devices. The QICK consists of a digital board hosting an RFSoC field-programmable gate array, custom firmware, and software and an optional companion custom-designed analog front-end board. We characterize the analog performance of the system as well as its digital latency, important for quantum error correction and feedback protocols. We benchmark the controller by performing standard characterizations of a transmon qubit. We achieve an average gate fidelity of ℱ avg =99.93%. All of the schematics, firmware, and software are open-source.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗