Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 415 records · Page 23

Quantum information, oscillations and the psyche

In this paper, taking the theory of quantum information as a model, we consider the human unconscious, pre-consciousness and consciousness as sets of quantum bits (qubits). We view how there can be communication between these various qubit sets. In doing this we are inspired by the theory of nuclear magnetic resonance. In this way we build a model of handling a mental qubit with the help of pulses of a mental field. Starting with an elementary interaction between two qubits we build two-qubit quantum logic gates that allow information to be transferred from one qubit to the other. In this manner we build a quantum process that permits consciousness to “read” the unconscious and vice versa. The elementary interaction, e.g. between a pre-consciousness qubit and a consciousness one, allows us to predict the time evolution of the pre-consciousness + consciousness system in which pre-consciousness and consciousness are quantum entangled. This time evolution exhibits Rabi oscillations that we name mental Rabi oscillations. This time evolution shows how for example the unconscious can influence consciousness. In a process like mourning the influence of the unconscious on consciousness, as the influence of consciousness on the unconscious, are in agreement with what is observed in psychiatry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Application of Quantum Machine Learning to High Energy Physics Analysis at LHC Using Quantum Computer Simulators and Quantum Computer Hardware

Machine learning enjoys widespread success in High Energy Physics (HEP) analyses at LHC. However the ambitious HL-LHC program will require much more computing resources in the next two decades. Quantum computing may offer speed-up for HEP physics analyses at HL-LHC, and can be a new computational paradigm for big data analyses in High Energy Physics.We have successfully employed three methods (1) Variational Quantum Classifier (VQC) method, (2) Quantum Support Vector Machine Kernel (QSVM-kernel) method and (3) Quantum Neural Network (QNN) method for two LHC flagship analyses: ttH (Higgs production in association with two top quarks) and H->mumu (Higgs decay to two muons, the second generation fermions). We shall address the progressive improvements in performance from method (1) to method (3).We will present our experiences and results of a study on LHC High Energy Physics data analyses with IBM Quantum Simulator and Quantum Hardware (using IBM Qiskit framework), Google Quantum Simulator (using Google Cirq framework), and Amazon Quantum Simulator (using Amazon Braket cloud service). The work is in the context of a Qubit platform (a gate-model quantum computer). Taking into account the present limitation of hardware access, different quantum machine learning methods are studied on simulators and the results are compared with classical machine learning methods (BDT, classical Support Vector Machine and classical Neural Network). Furthermore, we do apply quantum machine learning on IBM quantum hardware to compare performance between quantum simulator and quantum hardware. The work is performed by an international and interdisciplinary collaboration with the Department of Physics and Department of Computer Sciences of University of Wisconsin, CERN Quantum Technology Initiative, IBM Research Zurich, IBM T.J. Watson Research Center, Fermilab Quantum Institute, BNL Computational Science Initiative, State University of New York at Stony Brook, and Quantum Computing and AI Research of Amazon Web Services. This work pioneers a close collaboration of academic institutions with industrial corporations in the High Energy Physics analyses effort. Though the size of event samples in future HL-LHC physics and the limited number of qubits pose some challenges to the Quantum Machine learning studies for High Energy Physics, more advanced quantum computers with larger number of qubits, reduced noise and improved running time (as envisioned by IBM and Google) may outperform classical machine learning in both classification power and in speed.Although the era of efficient quantum computing may still be years away, we have made promising progress and obtained preliminary results in applying quantum machine learning to High Energy Physics. A PROOF OF PRINCIPLE.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

White Box Access to Quantum Testbeds for Co-Design

At Lawrence Livermore National Laboratory (LLNL), we operate and maintain the Quantum Device and Integration Testbed (QuDIT) facility, a small quantum testbed that supports about 10 active research teams (including our own) and over 50 internal and external collaborators. This testbed is designed to give remote white box access to users for research, training, and outreach. A guiding principle behind the development of our testbed infrastructure, software and user interfaces is to empower users to perform experiments at the cutting edge of quantum information science at any level of abstraction, from materials studies, device physics and control and characterization techniques to algorithm development and quantum operating system design. Our testbed targets a multilevel quantum system (qudit) to expand the accessible Hilbert space of a simple-to-manufacture quantum device and focuses on quantum simulation, typically implemented through custom gates designed with quantum optimal control methods, rather than on a universal computing framework with a fixed gate set. We leverage the Lab’s high-performance computing (HPC) program and related expertise to simulate quantum systems, develop hybrid algorithms, and generate gates optimized for given simulations. Additionally, we have adopted a co-design philosophy from the HPC community in designing new hardware, so that the systems we develop are optimized for the specific physics simulations we plan to use them for.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Benchmarking and Fidelity Response Theory of High-Fidelity Rydberg Entangling Gates

The fidelity of entangling operations is a key figure of merit in quantum information processing, especially in the context of quantum error correction. High-fidelity entangling gates in neutral atoms have seen remarkable advancement recently. A full understanding of error sources and their respective contributions to gate infidelity will enable the prediction of fundamental limits on quantum gates in neutral atom platforms with realistic experimental constraints. In this work, we implement the time-optimal Rydberg controlled-Z (CZ) gate, design a circuit to benchmark its fidelity, and achieve a fidelity, averaged over symmetric input states, of 0.9971 ( 5 ) , downward corrected for leakage error, which together with our recent work [Nature 634, 321–327 (2024)] forms a new state of the art for neutral atoms. The remaining infidelity is explained by an error model, consistent with our experimental results over a range of gate speeds, with varying contributions from different error sources. Further, we develop a fidelity response theory to efficiently predict infidelity from laser noise with nontrivial power spectral densities and derive scaling laws of infidelity with gate speed. Besides its capability of predicting gate fidelity, we also utilize the fidelity response theory to compare and optimize gate protocols, to learn laser frequency noise, and to study the noise response for quantum simulation tasks. Finally, we predict that a CZ gate fidelity of ≳ 0.999 is feasible with realistic experimental upgrades. Published by the American Physical Society 2025

Tsai, Richard Bing-Shiun (ORCID:0000000286758677)↗

Atom–by–Atom Fabrication of Single and Few Dopant Quantum Devices

Atomically precise fabrication has an important role to play in developing atom-based electronic devices for use in quantum information processing, quantum materials research, and quantum sensing. Atom-by-atom fabrication has the potential to enable precise control over tunnel coupling, exchange coupling, on-site charging energies, and other key properties of basic devices needed for solid-state quantum computing and analog quantum simulation. Using hydrogen-based scanning probe lithography, individual dopant atoms are deterministically placed relative to atomically aligned contacts and gates to build single electron transistors, single atom transistors, and gate-controlled quantum sensing devices. Here, the key steps required to fabricate and demonstrate the essential building blocks needed for spin selective initialization/readout and coherent quantum manipulation are described.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Application of Quantum Machine Learning to High Energy Physics Analysis at LHC using IBM Quantum Computer Simulators and IBM Quantum Computer Hardware

One of the major objectives of the experimental programs at the LHC is the discovery of new physics. This requires the identification of rare signals in immense backgrounds. Using machine learning algorithms greatly enhances our ability to achieve this objective. With the progress of quantum technologies, quantum machine learning could become a powerful tool for data analysis in high energy physics. In this study, using IBM gate-model quantum computing systems, we employ the quantum variational classifier method and the quantum kernel estimator method in two recent LHC flagship physics analyses: $t\bar{t}H$ (Higgs boson production in association with a top quark pair) and $H\rightarrow\mu\mu$ (Higgs boson decays to two muons). We have obtained early results with 10 qubits on the IBM quantum simulator and the IBM quantum hardware. On the quantum simulator, the quantum machine learning methods perform similarly to classical algorithms such as SVM (support vector machine) and BDT (boosted decision tree), which are often employed in LHC physics analyses. On the quantum hardware, the quantum machine learning methods have shown promising discrimination power, comparable to that on the quantum simulator. This study demonstrates that quantum machine learning has the ability to differentiate between signal and background in realistic physics datasets.

Chan, Jay↗

Polarization-dependent atomic dipole traps behind a circular aperture for neutral-atom quantum computing

The neutral-atom quantum computing community has successfully implemented almost all necessary steps for constructing a neutral-atom quantum computer. We present computational results of a study aimed at solving the remaining problem of creating a quantum memory with individually addressable sites for quantum computing. The basis of this quantum memory is the diffraction pattern formed by laser light incident on a circular aperture. Very close to the aperture, the diffraction pattern has localized bright and dark spots that can serve as red-detuned or blue-detuned atomic dipole traps. These traps are suitable for quantum computing even for moderate laser powers. In particular, for moderate laser intensities ({approx}100 W/cm{sup 2}) and comparatively small detunings ({approx}1000-10 000 linewidths), trap depths of {approx}1 mK and trap frequencies of several to tens of kilohertz are achieved. Our results indicate that these dipole traps can be moved by tilting the incident laser beams without significantly changing the trap properties. We also explored the polarization dependence of these dipole traps. We developed a code that calculates the trapping potential energy for any magnetic substate of any hyperfine ground state of any alkali-metal atom for any laser detuning much smaller than the fine-structure splitting for any given electric field distribution. We describe details of our calculations and include a summary of different notations and conventions for the reduced matrix element and how to convert it to SI units. We applied this code to these traps and found a method for bringing two traps together and apart controllably without expelling the atoms from the trap and without significant tunneling probability between the traps. This approach can be scaled up to a two-dimensional array of many pinholes, forming a quantum memory with single-site addressability, in which pairs of atoms can be brought together and apart for two-qubit gates for quantum computing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Valley splittings in Si/SiGe quantum dots with a germanium spike in the silicon well

Silicon-germanium heterostructures have successfully hosted quantum dot qubits, but the intrinsic near-degeneracy of the two lowest valley states poses an obstacle to high-fidelity quantum computing. Here we present a modification to the Si/SiGe heterostructure by the inclusion of a spike in germanium concentration within the quantum well in order to increase the valley splitting. The heterostructure is grown by chemical vapor deposition and magnetospectroscopy is performed on gate-defined quantum dots to measure the excited state spectrum. We demonstrate a large and widely tunable valley splitting as a function of applied vertical electric field and lateral dot confinement. We further investigate the role of the germanium spike by means of tight-binding simulations in single-electron dots and show a robust doubling of the valley splitting when the spike is present, as compared to a standard (spike-free) heterostructure. This doubling effect is nearly independent of the electric field, germanium content of the spike, and spike location. This experimental evidence of a stable, tunable quantum dot, despite a drastic change to the heterostructure, provides a foundation for future heterostructure modifications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Short-Depth QAOA circuits and Quantum Annealing on Higher-Order Ising Models (Rev.2)

The Quantum Alternating Operator Ansatz (QAOA) and Quantum Annealing (QA) are quantum algorithms that are both based on the adiabatic theorem and both have the goal of sampling the optimal solution(s) of combinatorial optimization problems. Quantum annealing has been physically instantiated on D-Wave devices using superconducting flux qubits, and QAOA can be programmed on digital gate-model quantum computers such as the programmable superconducting transmon qubits devices of the IBMQ series, for instance ibm washington. QAOA and QA address the same types of problems, but it is unclear how they will scale to large problem sizes and to larger and higher-fidelity quantum computers. In this article, we present a direct comparison between QAOA, one and two rounds, run on all 127 qubits of ibm washington and QA run on D-Wave Advantage system4.1 and Advantage system6.1. The problems which allow for this comparison are random Ising model problems whose connectivity matches the heavy hexagonal lattice topology of ibm washington and the Pegasus graph connectivity of the two D-Wave devices. We create two classes of problem instances for this comparison: one with higher order terms (ZZZ variable interactions), linear terms, and quadratic terms, and a separate problem type with only linear and quadratic terms. Our QAOA circuits are novel and extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of ibm washington’s heavy hexagonal lattice and can be applied to future heavy-hex chips. We also test the effectiveness of the error suppression technique digital dynamical decoupling on the QAOA circuits. The QAOA circuits compiled to ibm washington are composed of several thousand circuit instructions, approximately 3, 000 depending on the details of the circuit, making these some the largest quantum circuits ever executed on a digital quantum processor. QAOA and QA are compared against the classical heuristic algorithm of simulated annealing and all problem instances are exactly solved using CPLEX in order to evaluate which samplers, if any, correctly found the ground state solution(s) of the problem instances. We find that (i) QA outperforms QAOA on all problem instances, (ii) QAOA samples the problems better than random sampling, and (iii) QAOA angle computation exhibits clear parameter concentration across the ensemble of Ising models.

127 Qubits↗

Ambipolar nonvolatile memory based on a quantum-dot transistor with a nanoscale floating gate

Using only solution processing methods, we developed ambipolar quantum-dot (QD) transistor floating-gate memory (FGM) that uses Au nanoparticles as a floating gate. Because of the bipolarity of the active channel of PbSe QDs, the memory could easily trap holes or electrons in the floating gate by programming/erasing (P/E) operations, which could shift the threshold voltage both up and down. As a result, the memory exhibited good programmable memory characteristics: a large memory window (ΔV{sub th} ∼ 15 V) and a long retention time (>10{sup 5 }s). The magnitude of ΔV{sub th} depended on both P/E voltages and the bias voltage (V{sub DS}): ΔV{sub th} was a cubic function to V{sub P/E} and linearly depended on V{sub DS}. Therefore, this FGM based on a QD transistor is a promising alternative to its inorganic counterparts owing to its advantages of bipolarity, high mobility, low cost, and large-area production.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Short-depth QAOA circuits and quantum annealing on higher-order ising models

Abstract We present a direct comparison between QAOA (Quantum Alternating Operator Ansatz), and QA (Quantum Annealing) on 127 qubit problem instances. QAOA with p = 1, 2 rounds is executed on the 127 qubit heavy-hex graph gate-model quantum computer ibm_washington, using on-device grid-searches for angle finding, and QA is executed on two Pegasus-chip D-Wave quantum annealers. The problems are random Ising models whose connectivity matches heavy-hex graphs and the Pegasus graph connectivity, and optionally include hardware-compatible cubic terms ( Z Z Z terms). The QAOA circuits are heavily optimized and of extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of the heavy-hex lattice. QAOA and QA are both compared against simulated annealing and the optimal solutions are computed exactly using CPLEX. The noiseless mean QAOA expectation values for p = 1, 2 are computed using classical light-cone based simulations. We find QA outperforms QAOA on the evaluated devices.

127 qubits↗

Single-electron-occupation metal-oxide-semiconductor quantum dots formed from efficient poly-silicon gate layout

We introduce a silicon metal-oxide-semiconductor quantum dot structure that achieves dot-reservoir tunnel coupling control without a dedicated barrier gate. The elementary structure consists of two accumulation gates separated spatially by a gap, one gate accumulating a reservoir and the other a quantum dot. Control of the tunnel rate between the dot and the reservoir across the gap is demonstrated in the single electron regime by varying the reservoir accumulation gate voltage while compensating with the dot accumulation gate voltage. The method is then applied to a quantum dot connected in series to source and drain reservoirs, enabling transport down to the single electron regime. Finally, tuning of the valley splitting with the dot accumulation gate voltage is observed. This split accumulation gate structure creates silicon quantum dots of similar characteristics to other realizations but with less electrodes, in a single gate stack subtractive fabrication process that is fully compatible with silicon foundry manufacturing.

Carroll, Malcolm S.↗

A Digital Twin of Scalable Quantum Clouds

Quantum computing has emerged as a transformative technology capable of solving complex problems beyond the limit of classical systems. The rapid development of quantum processors has led to the proliferation of cloud-based quantum computing services offered by platforms such as IBM, Google, and Amazon. These platforms introduce unique challenges in resource allocation, job scheduling, and multi-device orchestration as quantum workloads become increasingly complex. In this work, we present a digital twin of quantum cloud infrastructures: a framework designed to model and simulate the behavior of real quantum cloud systems. Developed in Python using the SimPy discrete-event simulation library, the framework replicates key aspects of quantum cloud environments, including detailed quantum device modeling, job lifecycle management, and job fidelity. It incorporates noise-aware fidelity estimation, making it the first of its kind to simulate superconducting gate-based quantum cloud systems at an administrative level with job fidelity. We present use cases as proof of concept, demonstrating that our quantum cloud simulation framework can act as a digital twin of a quantum cloud and support the modeling and implementation of practical systems.

Luo, Waylon [Kent State University]↗

Fast and robust quantum computation with ionic Wigner crystals

We present a detailed analysis of the modulated-carrier quantum phase gate implemented with Wigner crystals of ions confined in Penning traps. We elaborate on a recent scheme, proposed by two of the authors, to engineer two-body interactions between ions in such crystals. We analyze the situation in which the cyclotron ({omega}{sub c}) and the crystal rotation ({omega}{sub r}) frequencies do not fulfill the condition {omega}{sub c}=2{omega}{sub r}. It is shown that even in the presence of the magnetic field in the rotating frame the many-body (classical) Hamiltonian describing small oscillations from the ion equilibrium positions can be recast in canonical form. As a consequence, we are able to demonstrate that fast and robust two-qubit gates are achievable within the current experimental limitations. Moreover, we describe a realization of the state-dependent sign-changing dipole forces needed to realize the investigated quantum computing scheme.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Strong entanglement causes low gate fidelity in inaccurate one-way quantum computation

We study how entanglement among the register qubits affects the gate fidelity in the one-way quantum computation if a measurement is inaccurate. We derive an inequality that shows that the mean gate fidelity is upper bounded by a decreasing function of the magnitude of the error of the measurement and the amount of the entanglement between the measured qubit and other register qubits. The consequence of this inequality is that, for a given amount of entanglement, which is theoretically calculated once the algorithm is fixed, we can estimate from this inequality how small the magnitude of the error should be in order not to make the gate fidelity below a threshold, which is specified by a technical requirement in a particular experimental setup or by the threshold theorem of the fault-tolerant quantum computation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Entanglement of Atomic Qubits Using an Optical Frequency Comb

We demonstrate the use of an optical frequency comb to coherently control and entangle atomic qubits. A train of off-resonant ultrafast laser pulses is used to efficiently and coherently transfer population between electronic and vibrational states of trapped atomic ions and implement an entangling quantum logic gate with high fidelity. This technique can be extended to the high field regime where operations can be performed faster than the trap frequency. This general approach can be applied to more complex quantum systems, such as large collections of interacting atoms or molecules.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Millisecond lifetimes and coherence times in 2D transmon qubits

Materials improvement is a powerful approach to reducing loss and decoherence in superconducting qubits, because such improvements can be readily translated to large-scale processors. Recent work improved transmon coherence by using tantalum as a base layer and sapphire as a substrate. The losses in these devices are dominated by two-level systems with comparable contributions from both the surface and bulk dielectrics, indicating that both must be tackled to achieve substantial improvements in the state of the art. Here we show that replacing the substrate with high-resistivity silicon markedly decreases the bulk substrate loss, enabling 2D transmons with time-averaged quality factors (Q avg ) of 9.7 × 10 6 across 45 qubits. For our best qubit, we achieve a Q avg of 1.5 × 10 7 , reaching a maximum Q of 2.5 × 10 7 , corresponding to a lifetime (T 1 ) up to 1.68 ms. This low loss also allows us to observe decoherence effects related to the Josephson junction, and we use an improved, low-contamination junction deposition to achieve Hahn echo coherence times (T 2E ) exceeding T 1 . We achieve these materials improvements without any modifications to the qubit architecture, allowing us to readily incorporate standard quantum control gates. Here, we demonstrate single-qubit gates with 99.994% fidelity. The tantalum-on-silicon platform comprises a simple material stack that can potentially be fabricated at the wafer scale and therefore can be readily translated to large-scale quantum processors.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Universal programmable quantum circuit schemes to emulate an operator

Unlike fixed designs, programmable circuit designs support an infinite number of operators. The functionality of a programmable circuit can be altered by simply changing the angle values of the rotation gates in the circuit. Here, we present a new quantum circuit design technique resulting in two general programmable circuit schemes. The circuit schemes can be used to simulate any given operator by setting the angle values in the circuit. This provides a fixed circuit design whose angles are determined from the elements of the given matrix-which can be non-unitary-in an efficient way. We also give both the classical and quantum complexity analysis for these circuits and show that the circuits require a few classical computations. For the electronic structure simulation on a quantum computer, one has to perform the following steps: prepare the initial wave function of the system; present the evolution operator U=e{sup -iHt} for a given atomic and molecular Hamiltonian H in terms of quantum gates array and apply the phase estimation algorithm to find the energy eigenvalues. Thus, in the circuit model of quantum computing for quantum chemistry, a crucial step is presenting the evolution operator for the atomic and molecular Hamiltonians in terms of quantum gate arrays. Since the presented circuit designs are independent from the matrix decomposition techniques and the global optimization processes used to find quantum circuits for a given operator, high accuracy simulations can be done for the unitary propagators of molecular Hamiltonians on quantum computers. As an example, we show how to build the circuit design for the hydrogen molecule.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗