Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum circuits”

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 523 records · Page 29

QuCLEAR

SF-25-008 This software optimizes quantum circuits using a two-step process. The first step, Clifford Extraction, moves the Clifford gates to the end of the circuit and includes circuit optimizations. The second step, Clifford Absorption, then addresses these extracted gates on a classical computer. By reducing the number of gates that need to run on the quantum device, the software achieves a significantly lower gate count.

LIU, JI [Argonne National Laboratory (ANL), Argonn↗

On-chip beamsplitter operation on single photons from quasi-resonantly excited quantum dots embedded in GaAs rib waveguides

We present an on-chip beamsplitter operating on a single-photon level by means of a quasi-resonantly driven InGaAs/GaAs quantum dot. The single photons are guided by rib waveguides and split into two arms by an evanescent field coupler. Although the waveguides themselves support the fundamental TE and TM modes, the measured degree of polarization (∼90%) reveals the main excitation and propagation of the TE mode. We observe the preserved single-photon nature of a quasi-resonantly excited quantum dot by performing a cross-correlation measurement on the two output arms of the beamsplitter. Additionally, the same quantum dot is investigated under resonant excitation, where the same splitting ratio is observed. An autocorrelation measurement with an off-chip beamsplitter on a single output arm reveal the single-photon nature after evanescent coupling inside the on-chip splitter. Due to their robustness, adjustable splitting ratio, and their easy implementation, rib waveguide beamsplitters with embedded quantum dots provide a promising step towards fully integrated quantum circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Zero-noise extrapolation for quantum-gate error mitigation with identity insertions

Quantum-gate errors are a significant challenge for achieving precision measurements on noisy intermediate-scale quantum (NISQ) computers. Here, this paper focuses on zero-noise extrapolation (ZNE), a technique that can be implemented on existing hardware, studying it in detail and proposing modifications to existing approaches. In particular, we consider identity insertion methods for amplifying noise because they are hardware agnostic. We build a mathematical formalism for studying existing ZNE techniques and show how higher order polynomial extrapolations can be used to systematically reduce depolarizing errors. Furthermore, we introduce a method for amplifying noise that uses far fewer gates than traditional methods. This approach is compared with existing methods for simulated quantum circuits. Comparable or smaller errors are possible with fewer gates, which illustrates the potential for empowering an entirely new class of moderate-depth circuits on near term hardware.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Autonomous stabilizer for incompressible photon fluids and solids

In this work, we suggest a simple approach to populate photonic quantum materials at nonzero chemical potential and near-zero temperature. Taking inspiration from forced evaporation in cold-atom experiments, the essential ingredients for our low-entropy thermal reservoir are (a) interparticle interactions and (b) energy-dependent loss. The resulting thermal reservoir may then be coupled to a broad class of Hamiltonian systems to produce low-entropy quantum phases. We present an idealized picture of such a reservoir, deriving the scaling of reservoir entropy with system parameters, and then propose several practical implementations using only standard circuit quantum electrodynamics tools, and extract the fundamental performance limits. Finally, we explore, both analytically and numerically, the coupling of such a thermalizer to the paradigmatic Bose-Hubbard chain, where we employ it to stabilize an n=1 Mott phase. In this case, the performance is limited by the interplay of dynamically arrested thermalization of the Mott insulator and finite heat capacity of the thermalizer, characterized by its repumping rate. This work explores an approach to preparation of quantum phases of strongly interacting photons, and provides a potential route to topologically protected phases that are difficult to reach through adiabatic evolution.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Optimal calibration of gates in trapped-ion quantum computers

Abstract To harness the power of quantum computing, it is essential that a quantum computer provide maximal possible fidelity for a quantum circuit. To this end, much work has been done in the context of qubit routing or embedding, i.e., mapping circuit qubits to physical qubits based on gate performance metrics to optimize the fidelity of execution. Here, we take an alternative approach that leverages a unique capability of a trapped-ion quantum computer, i.e., the all-to-all qubit connectivity. We develop a method to determine a fixed number (budget) of quantum gates that, when calibrated, will maximize the fidelity of a batch of input quantum programs. This dynamic allocation of calibration resources on randomly accessible gates, determined using our heuristics, increases, for a wide range of calibration budget, the average fidelity from 70% or lower to 90% or higher for a typical batch of jobs on an 11-qubit device, in which the fidelity of calibrated and uncalibrated gates are taken to be 99% and 90%, respectively. Our heuristics are scalable, more than 2.5 orders of magnitude faster than a randomized method for synthetic benchmark circuits generated based on real-world use cases.

Maksymov, Andrii (ORCID:0000000282442851)↗

Silicon enhancement mode nanostructures for quantum computing.

Development of silicon, enhancement mode nanostructures for solid-state quantum computing will be described. A primary motivation of this research is the recent unprecedented manipulation of single electron spins in GaAs quantum dots, which has been used to demonstrate a quantum bit. Long spin decoherence times are predicted possible in silicon qubits. This talk will focus on silicon enhancement mode quantum dot structures that emulate the GaAs lateral quantum dot qubit but use an enhancement mode field effect transistor (FET) structure. One critical concern for silicon quantum dots that use oxides as insulators in the FET structure is that defects in the metal oxide semiconductor (MOS) stack can produce both detrimental electrostatic and paramagnetic effects on the qubit. Understanding the implications of defects in the Si MOS system is also relevant for other qubit architectures that have nearby dielectric passivated surfaces. Stable, lithographically defined, single-period Coulomb-blockade and single-electron charge sensing in a quantum dot nanostructure using a MOS stack will be presented. A combination of characterization of defects, modeling and consideration of modified approaches that incorporate SiGe or donors provides guidance about the enhancement mode MOS approach for future qubits and quantum circuit micro-architecture.

36 MATERIALS SCIENCE↗

Efficiently improving the performance of noisy quantum computers

Using near-term quantum computers to achieve a quantum advantage requires efficient strategies to improve the performance of the noisy quantum devices presently available. We develop and experimentally validate two efficient error mitigation protocols named "Noiseless Output Extrapolation" and "Pauli Error Cancellation" that can drastically enhance the performance of quantum circuits composed of noisy cycles of gates. By combining popular mitigation strategies such as probabilistic error cancellation and noise amplification with efficient noise reconstruction methods, our protocols can mitigate a wide range of noise processes that do not satisfy the assumptions underlying existing mitigation protocols, including non-local and gate-dependent processes. We test our protocols on a four-qubit superconducting processor at the Advanced Quantum Testbed. We observe significant improvements in the performance of both structured and random circuits, with up to 86 % improvement in variation distance over the unmitigated outputs. Our experiments demonstrate the effectiveness of our protocols, as well as their practicality for current hardware platforms.

97 MATHEMATICS AND COMPUTING↗

Quantum error mitigation by hidden inverses protocol in superconducting quantum devices

We present a method to improve the convergence of variational algorithms based on hidden inverses (HIs) to mitigate coherent errors. In the context of error mitigation, this means replacing the hardware implementation of certain Hermitian gates with their inverses. Doing so results in noise cancellation and a more resilient quantum circuit. This approach improves performance in a variety of two-qubit error models where the noise operator also inverts with the gate inversion. We apply the mitigation scheme on superconducting quantum processors running the variational quantum eigensolver (VQE) algorithm to find the H 2 ground-state energy. When implemented on superconducting hardware we find that the mitigation scheme effectively reduces the energy fluctuations in the parameter learning path in VQE, reducing the number of iterations for a converged value. We also provide a detailed numerical simulation of VQE performance under different noise models and explore how HIs and randomized compiling affect the underlying loss landscape of the learning problem. These simulations help explain our experimental hardware outcomes, helping to connect lower-level gate performance to application-specific behavior in contrast to metrics like fidelity which often do not provide an intuitive insight into observed high level performance.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum Sensing using Geometrical Phase in Qubit-Oscillator Systems

We present a quantum sensing protocol for coupled qubit-oscillator systems that surpasses the standard quantum limit (SQL) by exploiting a geometrical phase. The signal is encoded in the geometrical phase that is proportional to the area enclosed in oscillator phase space. This area is amplified through squeezing, enabling sensitivities beyond the SQL. Our method is independent of oscillator's initial state, amenable to sensing with high-temperature or logical error-corrected states. The protocol shows robustness to qubit Markovian noise and preserves its state-independence, underscoring its practicality for next-generation quantum metrology. We demonstrate application to force sensing beyond the SQL in longitudinally coupled systems, and to high-precision measurements of couplings and pulse calibration surpassing SQL in dispersively coupled circuit quantum electrodynamics (cQED) architectures.

Suri, Nishchay [LBNL, Berkeley]↗

Universal control of a six-qubit quantum processor in silicon

Future quantum computers capable of solving relevant problems will require a large number of qubits that can be operated reliably. However, the requirements of having a large qubit count and operating with high fidelity are typically conflicting. Spins in semiconductor quantum dots show long-term promise but demonstrations so far use between one and four qubits and typically optimize the fidelity of either single- or two-qubit operations, or initialization and readout. Here, we increase the number of qubits and simultaneously achieve respectable fidelities for universal operation, state preparation and measurement. We design, fabricate and operate a six-qubit processor with a focus on careful Hamiltonian engineering, on a high level of abstraction to program the quantum circuits, and on efficient background calibration, all of which are essential to achieve high fidelities on this extended system. State preparation combines initialization by measurement and real-time feedback with quantum-non-demolition measurements. These advances will enable testing of increasingly meaningful quantum protocols and constitute a major stepping stone towards large-scale quantum computers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm

The trading of fidelity for scale enables approximate classical simulators such as matrix product states (MPSs) to run quantum circuits beyond exact methods. A control parameter, the so-called bond dimension $\mathcal{χ}$ for MPSs, governs the allocated computational resources and the output fidelity. Here, we characterize the fidelity for the quantum approximate optimization algorithm by the expectation value of the cost function that it seeks to minimize and find that it follows a scaling law $\mathscr{F}$(ln $\mathcal{χ}$/N), where N is the number of qubits. With ln $\mathcal{χ}$ amounting to the entanglement that a MPS can encode, we show that the relevant variable for investigating the fidelity is the entanglement per qubit. Importantly, our results calibrate the classical computational power required to achieve the desired fidelity and benchmark the performance of quantum hardware in a realistic setup. For instance, we quantify the hardness of performing better classically than a noisy superconducting quantum processor by readily matching its output to the scaling function. Moreover, we relate the global fidelity to that of individual operations and establish its relationship with $\mathcal{χ}$ and N. We sharpen the requirements for noisy quantum computers to outperform classical techniques at running a quantum optimization algorithm in speed, size, and fidelity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Trapped-ion quantum simulation of collective neutrino oscillations

It is well known that the neutrino flavor in extreme astrophysical environments changes under the effect of three contributions: the vacuum oscillation, the interaction with the surrounding matter, and the collective oscillations due to interactions between different neutrinos. The latter adds a nonlinear contribution to the equations of motion, making the description of their dynamics complex. In this work we study various strategies to simulate the coherent collective oscillations of a system of N neutrinos in the two-flavor approximation using quantum computation. This was achieved by using a pair-neutrino decomposition designed to account for the fact that the flavor Hamiltonian, in the presence of the neutrino-neutrino term, presents an all-to-all interaction that makes the implementation of the evolution dependent on the qubit topology. We analyze the Trotter error caused by the decomposition demonstrating that the complexity of the implementation of time evolution scales polynomially with the number of neutrinos and that the noise from near-term quantum device simulation can be reduced by optimizing the quantum circuit decomposition and exploiting a full-qubit connectivity. We find that the gate complexity using second order Trotter-Suzuki formulas scales better with system size than with other decomposition methods such as quantum signal processing. In conclusion, we finally present the application and the results of our algorithm on a real quantum device based on trapped-ion qubits.

79 ASTRONOMY AND ASTROPHYSICS↗

Collective neutrino oscillations in three flavors on qubit and qutrit processors

Collective neutrino flavor oscillations are of primary importance in understanding the dynamic evolution of core-collapse supernovae and subsequent terrestrial detection, but also among the most challenging aspects of numerical simulations. This situation is complicated by the quantum many-body nature of the problem due to neutrino-neutrino interactions, which demands a quantum treatment. An additional complication is the presence of three flavors, which often is approximated by the electron flavor and a heavy lepton flavor. In this work, we provide both qubit and qutrit encodings for all three flavors, and develop optimized quantum circuits for the time evolution and analyze the Trotter error. We conclude our study with a hardware experiment of a system of two neutrinos with superconducting hardware: the IBM Torino device for qubits and Advanced Quantum Testbed device at the Lawrence Berkeley National Laboratory for qutrits. We find that error mitigation greatly helps in obtaining a signal consistent with simulations. Finally, while hardware results are comparable at this stage, we expect the qutrit setup to be more convenient for large-scale simulations since it does not suffer from probability leakage into nonphysical qubit space, unlike the qubit setup.

Neutrino oscillations↗

Variational quantum state preparation for quantum-enhanced metrology in noisy systems

Here, we investigate optimized quantum state preparation for quantum metrology applications in noisy environments. Using the QFI-OPT package, we simulate a low-depth variational quantum circuit (VQC) composed of a sequence of global rotations and entangling operations applied to a chain of qubits that are subject to dephasing noise. The parameters controlling the VQC are numerically optimized to maximize the quantum Fisher information, which characterizes the ultimate metrological sensitivity of a quantum state with respect to a global rotation. We find that, regardless of the details of the entangling operation implemented in the VQC, the optimal quantum states can be broadly classified into a trio of qualitative regimes, i.e., catlike, squeezed like, and product states, associated with different dephasing rates. Our findings are relevant for designing optimal state-preparation strategies for next-generation quantum sensors exploiting entanglement, such as time and frequency standards and magnetometers, aimed at achieving state-of-the-art performance in the presence of noise and decoherence.

quantum Fisher information↗

Implementing two-qubit gates at the quantum speed limit

The speed of elementary quantum gates, particularly two-qubit gates, ultimately sets the limit on the speed at which quantum circuits can operate. In this work, we experimentally demonstrate commonly used two-qubit gates at nearly the fastest possible speed allowed by the physical interaction strength between two superconducting transmon qubits. We achieve this quantum speed limit by implementing experimental gates designed using a machine-learning-inspired optimal control method. Importantly, our method only requires the single-qubit drive strength to be moderately larger than the interaction strength to achieve an arbitrary two-qubit gate close to its analytical speed limit with high fidelity. Thus the method is applicable to a variety of platforms, including those with comparable single-qubit and two-qubit gate speeds, or those with always-on interactions. We expect our method to offer significant speedups for non-native two-qubit gates that are typically achieved with a long sequence of single-qubit and native two-qubit gates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Attention to quantum complexity

The imminent era of error-corrected quantum computing demands robust methods to characterize quantum state complexity from limited, noisy measurements. We introduce the Quantum Attention Network (QuAN), a classical artificial intelligence (AI) framework leveraging attention mechanisms tailored for learning quantum complexity. Inspired by large language models, QuAN treats measurement snapshots as tokens while respecting permutation invariance. Combined with our parameter-efficient miniset self-attention block, this enables QuAN to access high-order moments of bit-string distributions and preferentially attend to less noisy snapshots. We test QuAN across three quantum simulation settings: driven hard-core Bose-Hubbard model, random quantum circuits, and toric code under coherent and incoherent noise. QuAN directly learns entanglement and state complexity growth from experimental computational basis measurements, including complexity growth in random circuits from noisy data. In regimes inaccessible to existing theory, QuAN unveils the complete phase diagram for noisy toric code data as a function of both noise types, highlighting AI’s transformative potential for assisting quantum hardware.

Kim, Hyejin [Cornell Univ., Ithaca, NY (United Sta↗

Optimal ancilla-free Pauli+V circuits for axial rotations

We address the problem of optimal representation of single-qubit rotations in a certain unitary basis consisting of the so-called V gates and Pauli matrices. The V matrices were proposed by Lubotsky, Philips, and Sarnak [Commun. Pure Appl. Math. 40, 401–420 (1987)] as a purely geometric construct in 1987 and recently found applications in quantum computation. They allow for exceptionally simple quantum circuit synthesis algorithms based on quaternionic factorization. We adapt the deterministic-search technique initially proposed by Ross and Selinger to synthesize approximating Pauli+V circuits of optimal depth for single-qubit axial rotations. Our synthesis procedure based on simple SL{sub 2}(ℤ) geometry is almost elementary.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Learning to Predict Arbitrary Quantum Processes

We present an efficient machine-learning (ML) algorithm for predicting any unknown quantum process ℰ over 𝑛 qubits. For a wide range of distributions 𝒟 on arbitrary 𝑛-qubit states, we show that this ML algorithm can learn to predict any local property of the output from the unknown process ℰ, with a small average error over input states drawn from 𝒟. The ML algorithm is computationally efficient even when the unknown process is a quantum circuit with exponentially many gates. Our algorithm combines efficient procedures for learning properties of an unknown state and for learning a low-degree approximation to an unknown observable. The analysis hinges on proving new norm inequalities, including a quantum analogue of the classical Bohnenblust-Hille inequality, which we derive by giving an improved algorithm for optimizing local Hamiltonians. Numerical experiments on predicting quantum dynamics with evolution time up to 10 6 and system size up to 50 qubits corroborate our proof. Overall, our results highlight the potential for ML models to predict the output of complex quantum dynamics much faster than the time needed to run the process itself.

quantum computation↗