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

Toward a 2D Local Implementation of Quantum Low-Density Parity-Check Codes

Geometric locality is an important theoretical and practical factor for quantum low-density parity-check (qLDPC) codes that affects code performance and ease of physical realization. For device architectures restricted to two-dimensional (2D) local gates, naively implementing the high-rate codes suitable for low-overhead fault-tolerant quantum computing incurs prohibitive overhead. In this work, we present an error-correction protocol built on a bilayer architecture that aims to reduce operational overheads when restricted to 2D local gates by measuring some generators less frequently than others. We investigate the family of bivariate-bicycle qLDPC codes and show that they are well suited for a parallel syndrome-measurement scheme using fast routing with local operations and classical communication (LOCC). Through circuit-level simulations, we find that in some parameter regimes, bivariate-bicycle codes implemented with this protocol have logical error rates comparable to the surface code while using fewer physical qubits. Published by the American Physical Society 2025

Berthusen, Noah (ORCID:0000000275862786)↗

Computational Power of Random Quantum Circuits in Arbitrary Geometries

Empirical evidence for a gap between the computational powers of classical and quantum computers has been provided by experiments that sample the output distributions of two-dimensional quantum circuits. Many attempts to close this gap have utilized classical simulations based on tensor network techniques, and their limitations shed light on the improvements to quantum hardware required to frustrate classical simulability. In particular, quantum computers having in excess of approximately 50 qubits are primarily vulnerable to classical simulation due to restrictions on their gate fidelity and their connectivity, the latter determining how many gates are required (and, therefore, how much infidelity is suffered) in generating highly entangled states. Here, we describe recent hardware upgrades to Quantinuum’s H2 quantum computer, enabling it to operate on up to 56 qubits with arbitrary connectivity and 99.843(5)% two-qubit gate fidelity. We define a class of circuits with random geometries that become hard to classically simulate in very low depth and implement them utilizing the flexible connectivity of H2. A careful analysis demonstrating the fast saturation of classical simulation complexity with depth indicates that H2 can yield data well beyond the reach of state-of-the art classical simulation methods at unprecedented fidelities. We find that the considerable difficulty of classically simulating H2 is likely limited only by qubit number, demonstrating the promise and scalability of the quantum charge-coupled device architecture as continued progress is made toward building larger machines. Published by the American Physical Society 2025

DeCross, M.↗

A dual-species Rydberg array

Large-scale Rydberg atom arrays are used for highly coherent analogue quantum simulations and for digital quantum computations. However, advanced quantum protocols, such as quantum error correction, require midcircuit qubit operations, including the replenishment, reset and read-out of a subset of qubits. A compelling strategy for unlocking these capabilities is a dual-species architecture in which a second atomic species is controlled independently and entangled with the first through Rydberg interactions. Here, we realize a dual-species Rydberg array consisting of rubidium and caesium atoms and explore regimes of interactions and dynamics not accessible in single-species architectures. We achieve enhanced interspecies interactions by electrically tuning the Rydberg states close to a Förster resonance. In this regime, we demonstrate an interspecies Rydberg blockade and implement a quantum state transfer from one species to another. We then generate a Bell state between Rb and Cs hyperfine qubits through an interspecies controlled-phase gate. Finally, we combine interspecies entanglement with a native midcircuit read-out to achieve quantum non-demolition measurements.

atomic and molecular interactions with photons↗

Gate-Controlled Anyon Generation and Detection in Kitaev Spin Liquids

Reliable manipulation of non-Abelian Ising anyons supported by Kitaev spin liquids may enable intrinsically fault-tolerant quantum computation. Here, we introduce a standalone scheme for both generating and detecting individual Ising anyons using tunable gate voltages in a heterostructure containing a non-Abelian Kitaev spin liquid and a monolayer semiconductor. In this study, the key ingredients of our setup are a Kondo coupling to stabilize an Ising anyon in the spin liquid around each electron in the semiconductor, and a large charging energy to allow control over the electron numbers in distinct gate-defined regions of the semiconductor. In particular, a single Ising anyon can be generated at a disk-shaped region by gate tuning its electron number to one, while it can be interferometrically detected by measuring the electrical conductance of a ring-shaped region around it whose electron number is allowed to fluctuate between zero and one. We provide concrete experimental guidelines for implementing our proposal in promising candidate materials like α-RuCl 3 .

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Single T gate in a Clifford circuit drives transition to universal entanglement spectrum statistics

Clifford circuits are insufficient for universal quantum computation or creating t t -designs with t\ge 4 t ≥ 4 . While the entanglement entropy is not a telltale of this insufficiency, the entanglement spectrum of a time evolved random product state is: the entanglement levels are Poisson-distributed for circuits restricted to the Clifford gate-set, while the levels follow Wigner-Dyson statistics when universal gates are used. In this paper we show, using finite-size scaling analysis of different measures of level spacing statistics, that in the thermodynamic limit, inserting a single T (\pi/8) ( π / 8 ) gate in the middle of a random Clifford circuit is sufficient to alter the entanglement spectrum from a Poisson to a Wigner-Dyson distribution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Unified architecture for quantum lookup tables

Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms, such as machine learning or electronic structure simulation. The feasibility of these applications depends crucially on gate-efficient implementations of these oracles, which are commonly some reversible versions of the Boolean circuit for a classical lookup table. Here, we present a general parametrized architecture for quantum circuits implementing a lookup table that encompasses all prior work in realizing a continuum of optimal trade-offs between qubits, non-Clifford gates, and error resilience, up to logarithmic factors. Our architecture assumes only local 2D connectivity, yet recovers results, with the appropriate parameters, polylogarithmic error scaling. We also identify regimes, such as simultaneous sublinear scaling, in all parameters. These results enable tailoring implementations of the commonly used lookup table primitive to any given quantum device with constrained resources.

quantum circuits↗

Reducing Randomized Quantum Algorithm Cost [Slides]

We derive the optimal sampling strategy for minimizing total resource cost in randomized quantum algorithms. Our framework is completely general, allowing for resources as diverse as gate counts circuit depth, runtime, or even dissipated energy.

97 MATHEMATICS AND COMPUTING↗

Linear Quantum Coupler for Clean Bosonic Control

Quantum computing with superconducting circuits relies on high-fidelity driven nonlinear processes. An ideal quantum nonlinearity would selectively activate desired coherent processes at high strength, without activating parasitic mixing products or introducing additional decoherence. The wide bandwidth of the Josephson nonlinearity makes this difficult, with undesired drive-induced transitions and decoherence limiting qubit readout, gates, couplers, and amplifiers. Significant strides have recently been made into building better “quantum mixers,” with promise being shown by Kerr-free three-wave mixers that suppress driven frequency shifts, and balanced quantum mixers that explicitly forbid a significant fraction of parasitic processes. We propose a novel mixer that combines both these strengths, with engineered selection rules that make it essentially linear (not just Kerr-free) when idle, and activate clean parametric processes even when driven at high strength. Furthermore, its ideal Hamiltonian is simple to analyze analytically, and we show that this ideal behavior is first-order insensitive to dominant experimental imperfections. We expect this mixer to allow significant advances in high-𝑄 control, readout, and amplification.

Quantum circuits↗

Tuning the charge transfer character of the multiexciton state in singlet fission

Intramolecular singlet fission (SF) produces the multiexciton correlated triplet pair state, (T 1 T 1 ), prior to the formation of free triplet excitons. The nature of the multiexciton state is complex, as generation of the (T 1 T 1 ) state may involve a charge transfer (CT) intermediate and has been shown to have both mixed electronic and spin characters. According to transient absorption spectroscopy, a linear terrylene-3,4:11,12-bis(dicarboximide) dimer (TDI 2 ) exhibits solvent-dependent excited-state dynamics. As solvent polarity increases from 1,2,4-trichlorobenzene (ε = 2.2) to chlorobenzene (ε = 5.6) to 1,2-dichlorobenzene (ε = 9.9), the SF rate in TDI2 increases and the multiexciton state, which can be thought of as a linear combination of the 1 (S 1 S 0 ), CT, and (T 1 T 1 ) states, gains more CT character. Eventually, the CT state becomes a trap state as indicated by symmetry-breaking charge separation in TDI2 in pyridine (ε = 12.3). The dielectric environment influences not only the SF rate and the relative contributions of the 1 (S 1 S 0 ), CT, and (T 1 T 1 ) states to the overall multiexciton state but also the rate at which the state mixing evolves, with faster dynamics in higher polarity solvents. More importantly, the tunability and presence of strong CT character in the multiexciton state have implications for SF applications since they often rely on electron transfer from the free triplet excitons. This enhanced CT character in the (T 1 T 1 ) state may assist with two-electron transfer directly from the (T 1 T 1 ) state, allowing for facile extraction of charges in intramolecular SF systems whose (T 1 T 1 ) states do not always efficiently dissociate to two triplet excitons.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Advanced Quantum Poisson Solver in the NISQ era

The Poisson equation has many applications across the broad areas of science and engineering. Most quantum algorithms for the Poisson solver presented so far, either suffer from lack of accuracy and/or are limited to very small sizes of the problem, and thus have no practical usage. Here we present an advanced quantum algorithm for solving the Poisson equation with high accuracy and dynamically tunable problem size. After converting the Poisson equation to the linear systems through the finite difference method, we adopt the Harrow-Hassidim-Lloyd (HHL) algorithm as the basic framework. Particularly, in this work we present an advanced circuit that ensures the accuracy of the solution by implementing non-truncated eigenvalues through eigenvalue amplification as well as by increasing the accuracy of the controlled rotation angular coefficients, which are the critical factors in the HHL algorithm. We show that our algorithm not only increases the accuracy of the solutions, but also composes more practical and scalable circuits by dynamically controlling problem size in the NISQ devices. We present both simulated and experimental results, and discuss the sources of errors. Finally, we conclude that overall results on the quantum hardware are dominated by the error in the CNOT gates.

Robson, Walter↗

OpenQudit v1.0

OpenQudit is a library that packages a quantum circuit representation using a domain-specific language for gates with a highly optimized simulator for very small circuits. No other package is well optimized for small circuits, which is something another DOE-packaged tool, BQSKit, will benefit from.

Younis, Ed↗

Classical Optimizers for Noisy Intermediate-Scale Quantum Devices

We present a collection of optimizers tuned for usage on Noisy Inter-mediate-Scale Quantum (NISQ) devices. Optimizers have a range of applications in quantum computing, including the Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization (QAOA) algorithms. They have further uses in calibration, hyperparameter tuning, machine learning, etc. We employ the VQE algorithm as a case study. VQE is a hybrid algorithm, with a classical minimizer step driving the next evaluation on the quantum processor. While most results to date concentrated on tuning the quantum VQE circuit, our study indicates that in the presence of quantum noise the classical minimizer step is a weak link and a careful choice combined with tuning is required for correct results. We explore state-of-the-art gradient-free optimizers capable of handling noisy, black-box, cost functions and stress-test them using a quantum circuit simulation environment with noise injection capabilities on individual gates. Our results indicate that specifically tuned optimizers are crucial to obtaining valid science results on NISQ hardware, as well as projecting forward on fault tolerant circuits.

Lavrijsen, Wim↗

Advancing quantum simulations of the nuclear shell model with Gray-code–based resource-efficient protocols

Background: Some of the computational limitations in solving the nuclear many-body problem could be overcome by utilizing quantum computers. The nuclear shell-model calculations providing deeper insights into the properties of atomic nuclei are one such case with high demand for resources, as the size of the Hilbert space grows exponentially with the number of particles involved. Quantum algorithms are being developed to overcome these challenges and advance such calculations. Purpose: To develop quantum circuits for the nuclear shell-model, leveraging the capabilities of noisy intermediate-scale quantum (NISQ) devices. Here, we aim to minimize resource requirements (specifically in terms of qubits and gates) and strive to reduce the impact of noise by employing relevant mitigation techniques. Methods: We achieve noise resilience by designing an optimized Ansatz for the variational quantum eigensolver (VQE) based on Givens rotations and incorporating qubit-ADAPT-VQE in combination with variational quantum deflation (VQD) to compute ground and excited states, incorporating the zero-noise extrapolation mitigation technique. Furthermore, the qubit requirements are significantly reduced by mapping the basis states to qubits using Gray-code encoding and generalizing transformations of fermionic operators to efficiently represent many-body states. Results: By employing the resource-efficient protocols, we achieve the ground and excited state energy levels of 38 Ar and 6 Li with better accuracy. These energy levels are presented for noiseless simulations, noisy conditions, and after applying noise mitigation techniques. Results are compared for Jordan-Wigner and Gray-code encoding using VQE, qubit-ADAPT-VQE, and VQD. Conclusions: Our work highlights the potential of resource-efficient protocols to leverage the full potential of NISQ devices in scaling the nuclear shell model calculations, offering a pathway toward more complex quantum simulations in nuclear physics. This approach establishes a framework for studying other nuclear systems with improved quantum resource efficiency, marking a significant advancement in applying quantum computing to realistic nuclear physics applications.

Physics - Nuclear physics and radiation physics↗

Neural network accelerator for quantum control

Efficient quantum control is necessary for practical quantum computing implementations with current technologies. Conventional algorithms for determining optimal control parameters are computationally expensive, largely excluding them from use outside of the simulation. Existing hardware solutions structured as lookup tables are imprecise and costly. By designing a machine learning model to approximate the results of traditional tools, a more efficient method can be produced. Such a model can then be synthesized into a hardware accelerator for use in quantum systems. In this study, we demonstrate a machine learning algorithm for predicting optimal pulse parameters. This algorithm is lightweight enough to fit on a low-resource FPGA and perform inference with a latency of 175 ns and pipeline interval of 5 ns with > 0.99 gate fidelity. In the long term, such an accelerator could be used near quantum computing hardware where traditional computers cannot operate, enabling quantum control at a reasonable cost at low latencies without incurring large data bandwidths outside of the cryogenic environment.

43 PARTICLE ACCELERATORS↗

Qu8its for quantum simulations of lattice quantum chromodynamics

We explore the utility of d = 8 qudits, qu8its, for quantum simulations of the dynamics of 1+1⁢D SU(3) lattice quantum chromodynamics, including a mapping for arbitrary number of flavors and lattice size and a reorganization of the Hamiltonian for efficient time evolution. Recent advances in parallel gate applications, along with the shorter application times of single-qudit operations compared with two-qudit operations, lead to significant projected advantages in quantum simulation fidelities and circuit depths using qu8its rather than qubits. The number of two-qudit entangling gates required for time evolution using qu8its is found to be more than a factor of 5 fewer than for qubits. Here, we anticipate that the developments presented in this work will enable improved quantum simulations to be performed using emerging quantum hardware.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Continuous-variable quantum computation of the O(3) model in 1+1 dimensions

We formulate the $O(3)$ non-linear sigma model in $1+1$ dimensions as a limit of a three-component scalar field theory restricted to the unit sphere in the large squeezing limit. This allows us to describe the model in terms of the continuous variable (CV) approach to quantum computing. Here we construct the ground state and excited states using the coupled cluster ansatz and find excellent agreement with the exact diagonalization results for a small number of lattice sites. We then present the simulation protocol for the time evolution of the model using CV gates, estimate the discretization error, and present numerical results obtained from a photonic quantum simulator. We expect that the methods developed in this work will be useful for exploring interesting dynamics for a wide class of sigma models and gauge theories, as well as for simulating scattering events on quantum hardware in the coming decade.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Radio frequency mixing modules for superconducting qubit room temperature control systems

As the number of qubits in nascent quantum processing units increases, the connectorized RF (radio frequency) analog circuits used in first generation experiments become exceedingly complex. The physical size, cost, and electrical failure rate all become limiting factors in the extensibility of control systems. We have developed a series of compact RF mixing boards to address this challenge by integrating I/Q quadrature mixing, intermediate frequency/LO (local oscillator)/RF power level adjustments, and direct current bias fine tuning on a 40 × 80 mm 2 four-layer printed circuit board with electromagnetic interference shielding. The RF mixing module is designed to work with RF and LO frequencies between 2.5 and 8.5 GHz. The typical image rejection and adjacent channel isolation are measured to be ~27 dBc and ~50 dB. By scanning the drive phase in a loopback test, the module short-term amplitude and phase linearity are typically measured to be 5 ×10 -4 (V pp /V mean ) and 1 ×10 -3 radian (pk-pk). The operation of the RF mixing board was validated by integrating it into the room temperature control system of a superconducting quantum processor and executing randomized benchmarking characterization of single and two qubit gates. We measured a single-qubit process infidelity of 9.3(3) × 10 -4 and a two-qubit process infidelity of 2.7(1) × 10 -2 .

47 OTHER INSTRUMENTATION↗

Fast decay of classification error in variational quantum circuits

Variational quantum circuits (VQCs) have shown great potential in near-term applications. However, the discriminative power of a VQC, in connection to its circuit architecture and depth, is not understood. To unleash the genuine discriminative power of a VQC, we propose a VQC system with the optimal classical post-processing—maximum-likelihood estimation on measuring all VQC output qubits. Via extensive numerical simulations, we find that the error of VQC quantum data classification typically decays exponentially with the circuit depth, when the VQC architecture is extensive—the number of gates does not shrink with the circuit depth. This fast error suppression ends at the saturation towards the ultimate Helstrom limit of quantum state discrimination. On the other hand, non-extensive VQCs such as quantum convolutional neural networks are sub-optimal and fail to achieve the Helstrom limit, demonstrating a trade-off between ansatz complexity and classification performance in general. To achieve the best performance for a given VQC, the optimal classical post-processing is crucial even for a binary classification problem. To simplify VQCs for near-term implementations, we find that utilizing the symmetry of the input properly can improve the performance, while oversimplification can lead to degradation.

Zhang, Bingzhi↗