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 757 records · Page 42
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Fixed Depth Hamiltonian Simulation via Cartan Decomposition

Simulating quantum dynamics on classical computers is challenging for large systems due to the significant memory requirements. Simulation on quantum computers is a promising alternative, but fully optimizing quantum circuits to minimize limited quantum resources remains an open problem. In this study, we tackle this problem by presenting a constructive algorithm, based on Cartan decomposition of the Lie algebra generated by the Hamiltonian, which generates quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one-dimensional transverse field $\mathrm{XY}$ model, where $\mathscr{O}$(n 2 )-gate circuits naturally emerge. Compared to product formulas with significantly larger gate counts, our algorithm drastically improves simulation precision. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Strategies for simulating the time evolution of Hamiltonian lattice field theories

Simulating the time evolution of quantum field theories given some Hamiltonian H requires developing algorithms for implementing the unitary operator e -iHt . A variety of techniques exist that accomplish this task, with the most common technique used so far being Trotterization, which is a special case of the application of a product formula. However, other techniques exist that promise better asymptotic scaling in certain parameters of the theory being simulated, the most efficient of which are based on the concept of block encoding. In this work we study the performance of such algorithms in simulating lattice field theories. We derive and compare the asymptotic gate complexities of several commonly used simulation techniques in application to Hamiltonian lattice field theories. Using the scalar $\hat{φ}$ 4 theory as a test, we also perform numerical studies and compare the gate costs required by product formulas and signal-processing-based techniques to simulate time evolution. For the latter, we use the linear combination of unitaries (LCU) construction augmented with the quantum Fourier transform circuit to switch between the field and momentum eigenbases, which leads to immediate order-of-magnitude improvement in the cost of preparing the block encoding. Further, this paper also includes a pedagogical review of the techniques used, in particular product formulas, LCU, qubitization, quantum signal processing, as well as the technique for simulating geometrically-local Hamiltonians developed by Haah, Hastings, Kothari, and Low.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Majorana-based quantum computing in nanowire devices

The boundary of one-dimensional topological superconductors might lead to the appearance of Majorana zero modes, whose nontrivial exchange statistics can be used for quantum computing. In branched nanowire networks, one can exchange Majorana modes by time dependently tuning topologically nontrivial parameter regions. In this paper, we simulate the exchange of four Majorana modes in T-shaped junctions made out of $\textit{p}$-wave superconducting Rashba wires. Specifically, we derive concrete experimental predictions for (quasi-)adiabatic braiding times and determine geometric conditions for successful Majorana exchange processes. Moreover, we prove that, in the adiabatic limit, the gating time needs to be smaller than the inverse of the squared superconducting order parameter and scales linearly with the gating potential. Furthermore, we show how to circumvent the formation of additional Majorana modes in branched nanowire systems, arising at wire intersection points of narrow junctions. Finally, we propose a multiqubit setup, allowing for universal quantum computing.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Detecting and tracking drift in quantum information processors

Abstract If quantum information processors are to fulfill their potential, the diverse errors that affect them must be understood and suppressed. But errors typically fluctuate over time, and the most widely used tools for characterizing them assume static error modes and rates. This mismatch can cause unheralded failures, misidentified error modes, and wasted experimental effort. Here, we demonstrate a spectral analysis technique for resolving time dependence in quantum processors. Our method is fast, simple, and statistically sound. It can be applied to time-series data from any quantum processor experiment. We use data from simulations and trapped-ion qubit experiments to show how our method can resolve time dependence when applied to popular characterization protocols, including randomized benchmarking, gate set tomography, and Ramsey spectroscopy. In the experiments, we detect instability and localize its source, implement drift control techniques to compensate for this instability, and then demonstrate that the instability has been suppressed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Extending the Frontier of Quantum Computers with Qutrits

Here, we advocate for a fundamentally different way to perform quantum computation by using three-level qutrits instead of qubits. In particular, we substantially reduce the resource requirements of quantum computations by exploiting a third state for temporary variables (ancilla) in quantum circuits. Past work with qutrits has demonstrated only constant factor improvements, owing to the log 2 (3) binary-to-ternary compression factor. We present a novel technique using qutrits to achieve a logarithmic runtime decomposition of the Generalized Toffoli gate using no ancilla - an exponential improvement over the best qubit-only equivalent. Our approach features a 70× improvement in total two-qudit gate count over the qubit-only decomposition. This results in improvements for important algorithms for arithmetic and QRAM. Simulation results under realistic noise models indicate over 90% mean reliability (fidelity) for our circuit, versus under 30% for the qubit-only baseline. These results suggest that qutrits offer a promising path toward extending the frontier of quantum computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A clean ballistic quantum point contact in strontium titanate

The perovskite oxide strontium titanate (SrTiO 3 ) combines electrostatic tunability, superconductivity and spin–orbit coupling, and is of potential use in the development of quantum devices. However, exploring quantum effects in SrTiO 3 nanostructures is challenging because of the presence of disorder. Here, in this work, we report high-mobility, gate-tunable devices in SrTiO 3 that have ballistic constrictions and clean normal-state conductance quantization. Our devices are based on SrTiO 3 two-dimensional electron gas channels that have a thin hafnium oxide barrier layer between the channel and an ionic liquid gate. Conductance plateaus show twofold degeneracy that persists for magnetic fields of at least 5 T. This is above what is expected from the g factors extracted at high fields and could be a signature of electron pairing extending outside the superconducting regime.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Slow thermalization and subdiffusion in $U$(1) conserving Floquet random circuits

Random quantum circuits are paradigmatic models of minimally structured and analytically tractable chaotic dynamics. We study a family of Floquet unitary circuits with Haar random U(1) charge conserving dynamics; the minimal such model has nearest-neighbor gates acting on spin-1/2 qubits, and a single layer of even/odd gates repeated periodically in time. We find that this minimal model is not robustly thermalizing at numerically accessible system sizes, and displays slow subdiffusive dynamics for long times. We map out the thermalization dynamics in a broader parameter space of charge conserving circuits, and understand the origin of the slow dynamics in terms of proximate localized and integrable regimes in parameter space. In contrast, we find that small extensions to the minimal model are sufficient to achieve robust thermalization; these include (i) increasing the interaction range to three-site gates, (ii) increasing the local Hilbert space dimension by appending an additional unconstrained qubit to the conserved charge on each site, or (iii) using a larger Floquet period comprised of two independent layers of gates. Furthermore, our results should inform future studies of charge conserving circuits, which are relevant for a wide range of topical theoretical questions.

1-dimensional spin chains↗
DOE OSTI2020

Destructive Error Interference in Product-Formula Lattice Simulation

Quantum computers can efficiently simulate the dynamics of quantum systems. Here, we study the cost of digitally simulating the dynamics of several physically relevant systems using the first-order product-formula algorithm. We show that the errors from different Trotterization steps in the algorithm can interfere destructively, yielding a much smaller error than previously estimated. In particular, we prove that the total error in simulating a nearest-neighbor interacting system of n sites for time t using the first-order product formula with r time slices is O ( n t / r + n t 3 / r 2 ) when n t 2 / r is less than a small constant. Given an error tolerance ϵ , the error bound yields an estimate of max { O ( n 2 t / ϵ ) , O ( n 2 t 3 / 2 / ϵ 1 / 2 ) } for the total gate count of the simulation. The estimate is tighter than previous bounds and matches the empirical performance observed in Childs et al. [ Proc. Natl. Acad. Sci. U.S.A. 115 , 9456 (2018) ]. We also provide numerical evidence for potential improvements and conjecture an even tighter estimate for the gate count.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Approximate 𝑡-Designs in Generic Circuit Architectures

Unitary 𝑡-designs are distributions on the unitary group whose first 𝑡 moments appear maximally random. Previous work has established several upper bounds on the depths at which certain specific random quantum circuit ensembles approximate 𝑡-designs. Here we show that these bounds can be extended to any fixed architecture of Haar-random two-site gates. This is accomplished by relating the spectral gaps of such architectures to those of one-dimensional brickwork architectures. Our bound depends on the details of the architecture only via the typical number of layers needed for a block of the circuit to form a connected graph over the sites. When this quantity is bounded, the circuit forms an approximate 𝑡-design in at most linear depth. We give numerical evidence for a stronger bound that depends only on the number of connected blocks into which the architecture can be divided. We also give an implicit bound for nondeterministic architectures in terms of properties of the corresponding distribution over fixed architectures.

information scrambling↗
DOE OSTI2021

Imaging local discharge cascades for correlated electrons in WS 2 /WSe 2 moiré superlattices

Transition metal dichalcogenide moiré heterostructures provide an ideal platform to explore the extended Hubbard model, where long-range Coulomb interactions play a critical role in determining strongly correlated electron states. This has led to experimental observations of Mott insulator states at half filling as well as a variety of extended Wigner crystal states at different fractional fillings. However, a microscopic understanding of these emerging quantum phases is still lacking. Here we describe a scanning tunnelling microscopy (STM) technique for the local sensing and manipulation of correlated electrons in a gated WS 2 /WSe 2 moiré superlattice, which enables the experimental extraction of fundamental extended Hubbard model parameters. We demonstrate that the charge state of the local moiré sites can be imaged by their influence on the STM tunnelling current. In addition to imaging, we are also able to manipulate the charge state of correlated electrons. When we ramp the bias on the STM tip, there is a local discharge cascade of correlated electrons in the moiré superlattice, which allows us to estimate the nearest-neighbour Coulomb interaction. Two-dimensional mapping of the moiré electron charge states also enables us to determine the on-site energy fluctuations at different moiré sites. Furthermore, our technique should be broadly applicable to many semiconductor moiré systems, offering a powerful tool for the microscopic characterization and control of strongly correlated states in moiré superlattices.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Magnetic field sensors for detection of trapped flux in superconducting radio frequency cavities

Superconducting radio-frequency (SRF) cavities are fundamental building block of modern particle accelerators. They operate at liquid helium temperatures 2-4 K to achieve very high quality factors 1e10-1e11. Trapping of magnetic flux within the superconductor is a significant contribution to the residual RF losses which limit the achievable quality factor. Suitable diagnostic tools are in high demand to understand the mechanisms of flux trapping in technical superconductors and the fundamental components of such diagnostic tool are magnetic field sensors. We have studied the performance of commercially available Hall probes, anisotropic magnetoresistive sensors and flux-gate magnetometers with respect to their sensitivity and capability to detect localized, low magnetic flux amplitudes, of the order of few tens of magnetic flux quantum at liquid helium temperature. Although Hall probes have the lowest magnetic field sensitivity (~96$ nV$/microT at 2 K), their physical dimensions are such that they have the ability to detect the lowest number of trapped vortices among the three type of sensors. Hall probes and anisotropic magnetoresistive sensors have been selected to be used in a setup to map regions of trapped flux on the surface of a single-cell SRF cavity.

47 OTHER INSTRUMENTATION↗
DOE OSTI2025

Quantum Fourier Transform with Leakage Control

In circuit QED (cQED) systems, one can manipulate the cavity Fock states to use quantum processing unit (QPU). Since the coherence times of the Fock states are long, qudit based computation can be possible. One of the most basic gate that can be engineered in this cQED platform is the displacement gate, $D(\alpha)$. However, accessible number of qudit-levels is finite. The truncated displacement gate on the qudit is the source of theoretical error above the logical states and needs to be addressed. In this work, we monitor and minimize the leakage in qudit systems that involves displacement gate by introducing so-called `bumper' states and a modified cost function.

Kurkcuoglu, D. [Fermilab] (ORCID:0000000311097074)↗
DOE OSTI2024

Quantum surrogate models for uncertainty quantification

Surrogate models are a critical ingredient to computation-based design and validation of many DOE mission-relevant physical systems. When first-principles computation of properties of a physical systems becomes pro hibitive, surrogate models are the only path towards achieving tasks such as uncertainty quantification (UQ), exploration of design space, and validation of design choices. In this project we have developed and demonstrated a new surro gate modeling paradigm for complex models that is data-driven, non-intrusive, and has the potential to be versatile and equipped with performance guaran tees. This combination of features is absent in existing surrogate modeling tools. The framework we have developed in this project exploits a quantum-classical correspondence to establish a quantum system that mimics the dynamics of the classical Hamiltonian system from which data in the form of temporal snapshots is provided. Since quantum dynamics propagates distributions over observables, the framework is naturally suited to propagation of epistemic uncertainties in the form of distributions over initial state and parametric uncertainties. In this project, we take the first step in establishing this novel framework by deriving a quantization and de-quantization procedure, demonstrating the accuracy of the quantum surrogate models these define using two model systems, and defining the next steps in maturing the framework towards a tool applicable to Sandia mission-relevant problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Entanglement types for two-qubit states with real amplitudes

We study the set of two-qubit pure states with real amplitudes and their geometrical representation in the three-dimensional sphere. In this representation, we show that the maximally entangled states—those locally equivalent to the Bell states—form two disjoint circles perpendicular to each other. We also show that taking the natural Riemannian metric on the sphere, the set of states connected by local gates are equidistant to this pair of circles. Moreover, the unentangled or so-called product states are π/4 units away to the maximally entangled states. This is, the unentangled states are the farthest away to the maximally entangled states. In this way, if we define two states to be equivalent if they are connected by local gates, we have that there are as many equivalent classes as points in the interval [0,π/4] with the point 0 corresponding to the maximally entangled states. The point π/4 corresponds to the unentangled states which geometrically are described by a torus. Finally, for every 0<d<π/4 the point d corresponds to a disjoint pair of torus. Finally, we also show how this geometrical interpretation allows to clearly see that any pair of two-qubit states with real amplitudes can be connected with a circuit that only has single-qubit gates and one controlled-Z gate.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Recursive algorithm for constructing antisymmetric fermionic states in first quantization mapping

We devise a deterministic quantum algorithm to produce antisymmetric states of single-particle orbitals in the first quantization mapping. Unlike sorting-based antisymmetrization algorithms, which require ordered input states and high Clifford-gate overhead, our approach initializes the state of each particle independently. For a system of $η$ particles and $N$ single-particle states, our algorithm prepares antisymmetrized states of non-trivial localized (e.g., Hartree-Fock) orbitals using $O(η^2\sqrt{N})$ $T$-gates, outperforming alternative algorithms when $η ≲ \sqrt{N}$. To achieve such scaling, we require $O(\sqrt{N})$ dirty ancilla qubits for intermediate calculations. Knowledge of the single-particle states to be antisymmetrized can be leveraged to further improve the efficiency of the circuit, and a measurement-based variant reduces gate cost by roughly a factor of two. We show example circuits for two- and three-particle systems and discuss the generalization to an arbitrary number of particles. For a specific three-particle example, we decompose the circuit into Clifford $+T$ gates and study the impact of noise on the prepared state.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Quantum time dynamics employing the Yang-Baxter equation for circuit compression

Quantum time dynamics (QTD) is considered a promising problem for quantum supremacy on near-term quantum computers. However, QTD quantum circuits grow with increasing time simulations. This study focuses on simulating the time dynamics of one-dimensional (1D) integrable spin chains with nearest-neighbor interactions. We have proved the existence of a reflection symmetry in the quantum circuit employed for simulating the time evolution of certain classes of 1D Heisenberg model Hamiltonians by virtue of the quantum Yang-Baxter equation, and how this symmetry can be exploited to compress and produce a shallow quantum circuit. With this compression scheme, the depth of the quantum circuit becomes independent of step size and only depends on the number of spins. We show that the depth of the compressed circuit is rigorously a linear function of the system size for the studied Heisenberg model Hamiltonians in the present work. As a consequence, the number of CNOT gates in the compressed circuit only scales quadratically with the system size, which allows for the simulations of time dynamics of very large 1D spin chains. We derive the compressed circuit representations for different special cases of the Heisenberg Hamiltonian. We compare and demonstrate the effectiveness of this approach by performing simulations on quantum computers.

1-dimensional spin chains↗
DOE OSTI2022

Characterizing the Reproducibility of Noisy Quantum Circuits

The ability of a quantum computer to reproduce or replicate the results of a quantum circuit is a key concern for verifying and validating applications of quantum computing. Statistical variations in circuit outcomes that arise from ill-characterized fluctuations in device noise may lead to computational errors and irreproducible results. While device characterization offers a direct assessment of noise, an outstanding concern is how such metrics bound the reproducibility of a given quantum circuit. Here, we first directly assess the reproducibility of a noisy quantum circuit, in terms of the Hellinger distance between the computational results, and then we show that device characterization offers an analytic bound on the observed variability. We validate the method using an ensemble of single qubit test circuits, executed on a superconducting transmon processor with well-characterized readout and gate error rates. The resulting description for circuit reproducibility, in terms of a composite device parameter, is confirmed to define an upper bound on the observed Hellinger distance, across the variable test circuits. This predictive correlation between circuit outcomes and device characterization offers an efficient method for assessing the reproducibility of noisy quantum circuits.

97 MATHEMATICS AND COMPUTING↗