SEARCH · Engineering Papers

Results for “circuit complexity”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 109 records · Page 6

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Quantum limits of superconducting-photonic links and their extension to millimeter waves

Photonic addressing of superconducting circuits has been proposed to overcome wiring complexity and heat-load challenges. However, such superconducting-photonic links suffer from an efficiency-noise trade-off that limits scalability. This trade-off arises because increasing power conversion efficiency entails reducing optical power, which makes the converted signal susceptible to shot noise. We analyze this trade-off and find that the laser-driven qubit gate infidelity scales inversely with the number of photons used. While methods such as nonlinear detection or squeezed light could mitigate this effect, we consider generating higher-frequency electrical signals, such as millimeter waves (100 GHz), using laser light. At these higher frequencies, circuits have higher operating temperatures and cooling power budgets and alleviate constraints posed by the trade-off. Therefore, we demonstrate an optically driven cryogenic millimeter-wave source with a maximum power efficiency of 8 ×10 −5 that can generate a maximum of 0.7 μ⁢W of 80 GHz power, with a 1200-thermal-photon equivalent of added noise at 4K. Using this source, we perform frequency-domain spectroscopy of superconducting NbTiN resonators at 80–90 GHz. Our results show a promising approach to lessen the efficiency-noise constraints on superconducting-photonic links, while leveraging the benefits of photonic signal delivery. Further optimization of power efficiency and noise at high frequencies could make scalable photonic control of superconducting qubits viable at temperatures exceeding 1K.

Optoelectronics↗

DOE OSTI2025

Dynamic, symmetry-preserving, and hardware-adaptable circuits for quantum computing many-body states and correlators of the Anderson impurity model

We present a hardware-reconfigurable ansatz on N q -qubits for the variational preparation of many-body states of the Anderson impurity model (AIM) with N imp + N bath = N q /2 sites, which conserves total charge and spin z component within each variational search subspace. The many-body ground state of the AIM is determined as the minimum over all minima of O(N$^2_ q$) distinct charge-spin sectors. Hamiltonian expectation values are shown to require ω(N q ) < N meas. $\leqslant$ O(N imp N bath ) symmetry-preserving, parallelizable measurement circuits, each amenable to postselection. To obtain the one-particle impurity Green’s function we show how initial Krylov vectors can be computed via midcircuit measurement and how Lanczos iterations can be computed using the symmetry-preserving ansatz. For a single-impurity Anderson model with a number of bath sites increasing from one to seven, we show using numerical emulation that the ease of variational ground-state preparation is suggestive of linear scaling in circuit depth and subquartic scaling in optimizer complexity. We therefore expect that, combined with time-dependent methods for Green’s function computation, our ansatz provides a useful tool to account for electronic correlations on early fault-tolerant processors. Finally, with a view towards computing real materials properties of interest like magnetic susceptibilities and electron-hole propagators, we provide a straightforward method to compute many-body, time-dependent correlation functions using a combination of time evolution, midcircuit measurement-conditioned operations, and the Hadamard test.

36 MATERIALS SCIENCE↗

DOE OSTI2025

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↗

DOE OSTI2026

Advancements in NbTiN based circuits for Superconducting Digital Logic

Superconducting (SC) electronics have emerged as a promising platform for high-speed, energy-efficient computing and quantum information processing. This work, centered on NbTiN, presents recent advances in material science and fabrication methods leading to significant improvements in performance, scalability and vertical integration. We specifically report on fabrication and characterization of key components, including Josephson junctions (JJs), flux trapping structures and SC interconnects. Together, these efforts represent critical steps towards realizing practical, complex, dense and large-scale SC integrated circuits.

Pokhrel, A. [Imec,Heverlee,Belgium]↗

DOE OSTI2023

Visualizing heterogeneous dipole fields by terahertz light coupling in individual nano-junctions

The challenge underlying superconducting quantum computing is to remove materials bottleneck for highly coherent quantum devices. The nonuniformity and complex structural components in the underlying quantum circuits often lead to local electric field concentration, charge scattering, dissipation and ultimately decoherence. Here we visualize interface dipole heterogeneous distribution of individual Al/AlO$_{x}$/Al junctions employed in transmon qubits by broadband terahertz scanning near-field microscopy that enables the non-destructive and contactless identification of defective boundaries in nano-junctions at an extremely precise nanoscale level. Our THz nano-imaging tool reveals an asymmetry across the junction in electromagnetic wave-junction coupling response that manifests as hot (high intensity) vs cold (low intensity) spots in the spatial electrical field structures and correlates with defected boundaries from the multi-angle deposition processes in Josephson junction fabrication inside qubit devices. The demonstrated local electromagnetic scattering method offers high sensitivity, allowing for reliable device defect detection in the pursuit of improved quantum circuit fabrication for ultimately optimizing coherence times.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2022

Fast-forwarding quantum simulation with real-time quantum Krylov subspace algorithms

Quantum subspace diagonalization (QSD) algorithms have emerged as a competitive family of algorithms that avoid many of the optimization pitfalls associated with parameterized quantum circuit algorithms. While the vast majority of the QSD algorithms have focused on solving the eigenpair problem for ground, excited-state, and thermal observable estimation, there has been a lot less work in considering QSD algorithms for the problem of quantum dynamical simulation. In this work, we propose several quantum Krylov fast-forwarding (QKFF) algorithms capable of predicting long-time dynamics well beyond the coherence time of current quantum hardware. Our algorithms use real-time evolved Krylov basis states prepared on the quantum computer and a multi-reference subspace method to ensure convergence towards high-fidelity, long-time dynamics. In particular, we show that the proposed multi-reference methodology provides a systematic way of trading off circuit depth with classical post-processing complexity. Further, we also demonstrate the efficacy of our approach through numerical implementations for several quantum chemistry problems including the calculation of the auto-correlation and dipole moment correlation functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2021

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↗

DOE OSTI2024

Optimal Twirling Depth for Classical Shadows in the Presence of Noise

The classical shadows protocol is an efficient strategy for estimating properties of an unknown state p using a small number of state copies and measurements. In its original form, it involves twirling the state with unitaries from some ensemble and measuring the twirled state in a fixed basis. It was recently shown that for computing local properties, optimal sample complexity (copies of the state required) is remarkably achieved for unitaries drawn from shallow depth circuits composed of local entangling gates, as opposed to purely local (zero depth) or global twirling (infinite depth) ensembles. Here, we consider the sample complexity as a function of the depth of the circuit, in the presence of noise. We find that this noise has important implications for determining the optimal twirling ensemble. Under fairly general conditions, we (i) show that any single-site noise can be accounted for using a depolarizing noise channel with an appropriate damping parameter f, (ii) compute thresholds f th at which optimal twirling reduces to local twirling for Pauli operators, (iii) nth order Renyi entropies (n ≥2), and (iv) provide a meaningful upper bound t max on the optimal circuit depth for any finite noise strength f, which applies to observables and entanglement entropy measurements. In conclusion, these thresholds strongly constrain the search for optimal strategies to implement shadow tomography and are easily tailored to the experimental system at hand.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

A Scalable Parallel Hypergraph Generator (HyGen)

Graphs are extensively used to model real-world complex systems. An edge in a graph can model pairwise relationships. However, multiway relationships (connections between three or more vertices) are common in many complex systems such as cellular process, image segmentation, and circuit design. A graph edge cannot model multiway relationships. A hypergraph, which can connect more than two vertices, is thus a better option to model multiway relationships. A large-scale hypergraph analysis has the potential to find useful insights from a complex system and assist in knowledge discovery. Currently a limited number of hypergraphs exists that are representative of real-world datasets. Moreover, real-world hypergraph datasets are small in size and inadequate to incorporate future needs. A graph generator that can produce large-scale synthetic hypergraphs can solve the above mentioned problems. In this paper, we present a scalable parallel hypergraph generator (HyGen) based on the Message Passing Interface (MPI) standard. To generate hypergraphs, HyGen takes the following parameter values as inputs: i) number of vertices, ii) number of hyperedges, iii) number of clusters, iv) vertex distribution, v) hyperedge distribution, vi) local cluster cardinality, and vii) global cluster cardinality. We have demonstrated that HyGen can generate hypergraphs of various sizes in a scalable fashion. HyGen takes approximately four minutes to generate a hypergraph with 4.8 million vertices, 1.6 million hyperedges, and 800 clusters using 1,024 processes on a leadership class computing platform. Our strong and weak scaling experiments on supercomputers demonstrate that HyGen can quickly create large-scale hypergraphs in a parallel manner, thus providing a useful capability for hypergraph analysis.

Hasan, S M Shamimul↗

DOE OSTI2021

Mismatch losses in a PV system due to shortened strings

Numerous events may require intentional removal of one or more photovoltaic modules from a string, shortening the length of the string relative to others within the array, resulting in a string length mismatch. The impact of such a mismatch is not well understood either in measurable operational effects (voltage, current, power) or in the potential effects on long-term module health. It is impractical to solely approach this problem experimentally due to the size and complexity of arrays that may experience string length shortening. Here this work presents simulations, validated through limited field experiments on a two string array, providing a basis from which more complex arrays and scenarios may be explored. Refinement of the simulation achieves an overall error in IMPP for the nominal (S 1 ) and test strings (S 2 ) between the simulation and experimental values, through all test conditions, of +0.35 ± 1.46% and -0.36 ± 1.58% respectively. Shortening one of two strings by one module results in a power loss greater than the power contribution of the module alone (1.29 module equivalents); the impact increases through the maximum test case of a six module mismatch with a power loss equivalent to more than 11 modules. The impact of using string-end blocking diodes is presented with an emphasis at the array maximum power point and at open circuit. Implications are discussed for arrays of higher complexity.

14 SOLAR ENERGY↗

DOE OSTI2025

Hardware-Efficient Quantum Phase Estimation via Local Control

Quantum phase estimation plays a central role in quantum simulation as it enables the study of spectral properties of many-body quantum systems. Most variants of the phase estimation algorithm require the application of the global unitary evolution conditioned on the state of one or more auxiliary qubits, posing a significant challenge for current quantum devices. In this work, we present an approach to quantum phase estimation that uses only locally controlled operations, resulting in a significantly reduced circuit depth. At the heart of our approach are efficient routines to measure the complex phase of the expectation value of the time-evolution operator, the so-called Loschmidt echo, for both circuit dynamics and Hamiltonian dynamics. By tracking changes in the phase during the dynamics, the routines trade circuit depth for increased sampling cost and classical postprocessing. Our approach does not rely on reference states and is applicable to any efficiently preparable state, regardless of its correlations. We provide a comprehensive analysis of the sample complexity and illustrate the results with numerical simulations. Our methods offer a practical pathway for measuring spectral properties in large many-body quantum systems using current quantum devices.

Schiffer, Benjamin F. [Max Planck Institute of Qua↗

DOE OSTI2021

Size and momentum of an infalling particle in the black hole interior

The future interior of black holes in AdS/CFT can be described in terms of a quantum circuit. We investigate boundary quantities detecting properties of this quantum circuit. We discuss relations between operator size, quantum complexity, and the momentum of an infalling particle in the black hole interior. We argue that the trajectory of the infalling particle in the interior close to the horizon is related to the growth of operator size. The notion of size here differs slightly from the size which has previously been related to momentum of exterior particles and provides an interesting generalization. The fact that both exterior and interior momentum are related to operator size growth is a manifestation of complementarity.

2D Gravity↗

DOE OSTI2022

Methods for estimating X-ray machine output through measurement and simulation

We report ball grid arrays are increasingly being applied in the electronics industry and may require X-ray inspection to ensure the integrity and correct placement of solder pins. However, as the architecture of integrated circuits continues to narrow while simultaneously growing more complex, the risk of electronic failure due to radiation damage increases. While medical X-ray devices have been held to high standards and are repeatedly shown to be well characterized, devices used for electronic inspection are often lacking detailed characterization. This study presents unique methods to solve for important properties in X-ray inspection devices such as source to object distance and energy spectrum. This information can then be applied to Monte Carlo models to achieve better overall dose estimates to electronics, which will lead to superior manufactured products. Since X-ray devices can vary greatly in source characteristics, this work investigates spectral measurement and Monte Carlo representation of three X-ray devices. For a Philips SRO 33 100 medical diagnostic device, the spectral output followed expected trends given by the prediction software SpekCalc and Spektr. For the Dage XD7500NT, direct measurement showed a spectral artifact that through the use of Gafchromic films, was shown to be a contributing effect in the dose output. For the Rad Source RS1800, a high powered irradiation device, direct spectral measurement was not achieved. However, a Monte Carlo model using an assumed spectra was found to match ion chamber measurements to a high degree.

47 OTHER INSTRUMENTATION↗

DOE OSTI2021

Accurate prediction of protein structures and interactions using a three-track neural network

DeepMind presented notably accurate predictions at the recent 14th Critical Assessment of Structure Prediction (CASP14) conference. We explored network architectures that incorporate related ideas and obtained the best performance with a three-track network in which information at the one-dimensional (1D) sequence level, the 2D distance map level, and the 3D coordinate level is successively transformed and integrated. The three-track network produces structure predictions with accuracies approaching those of DeepMind in CASP14, enables the rapid solution of challenging x-ray crystallography and cryo–electron microscopy structure modeling problems, and provides insights into the functions of proteins of currently unknown structure. The network also enables rapid generation of accurate protein-protein complex models from sequence information alone, short-circuiting traditional approaches that require modeling of individual subunits followed by docking. Here, we make the method available to the scientific community to speed biological research.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2025

Benchmarking a Tunable Quantum Neural Network on Trapped-Ion and Superconducting Hardware

We implement a quantum generalization of a neural network on trapped-ion and IBM superconducting quantum computers to classify MNIST images, a common benchmark in computer vision. The network feedforward involves qubit rotations whose angles depend on the results of measurements in the previous layer. The network is trained via simulation, but inference is performed experimentally on quantum hardware. The classical-to-quantum correspondence is controlled by an interpolation parameter, $a$, which is zero in the classical limit. Increasing $a$ introduces quantum uncertainty into the measurements, which is shown to improve network performance at moderate values of the interpolation parameter. We then focus on particular images that fail to be classified by a classical neural network but are detected correctly in the quantum network. For such borderline cases, we observe strong deviations from the simulated behavior. We attribute this to physical noise, which causes the output to fluctuate between nearby minima of the classification energy landscape. Such strong sensitivity to physical noise is absent for clear images. We further benchmark physical noise by inserting additional single-qubit and two-qubit gate pairs into the neural network circuits. Our work provides a springboard toward more complex quantum neural networks on current devices: while the approach is rooted in standard classical machine learning, scaling up such networks may prove classically non-simulable and could offer a route to near-term quantum advantage.

FOS: Physical sciences↗

DOE OSTI2026

Quantum Time-Space Tradeoffs for Matrix Problems

We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices 𝐴, including the discrete Fourier transform matrix, we prove that quantum circuits with at most 𝑇 input queries and 𝑆 qubits of memory require 𝑇 = Ω⁢(𝑛 2 /𝑆) to compute matrix-vector product 𝐴⁢𝑥 for 𝑥 ∈{0,1 𝑛 . We similarly prove that matrix multiplication for 𝑛 ×𝑛 binary matrices requires 𝑇 = Ω⁢(𝑛 3 /$\sqrt{𝑆}$). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for 𝑛 × 𝑛 Boolean matrix multiplication to 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/4 ) from 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/2 ). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.

lower bounds↗

DOE OSTI2024

Embedded Fluidic Sensing and Control with Soft Open‐Cell Foams

Abstract The synthesis of soft matter intelligence with circuit‐driven logic has enabled a new class of robots that perform complex tasks or conform to specialized form factors in unique ways that cannot be realized through conventional designs. Translating this hybrid approach to fluidic systems, the present work addresses the need for sheet‐based circuit materials by leveraging the innate porosity of foam—a soft material—to develop pneumatic components that support digital logic, mixed‐signal control, and analog force sensing in wearables and soft robots. Analytical tools and experimental techniques developed in this work serve to elucidate compressible gas flow through porous sheets, and to inform the design of centimeter‐sized foam resistors with fluidic resistances on the order of 10 9 Pa s m −3 . When embedded inside soft robots and wearables, these resistors facilitate diverse functionalities spanning both sensing and control domains, including digital logic using textile logic gates, digital‐to‐analog signal conversion using ladder networks, and analog sensing of forces up to 40 N via compression‐induced changes in resistance. By combining features of both circuit‐based and materials‐based approaches, foam‐enabled fluidic circuits serve as a useful paradigm for future hybrid robotic architectures that fully embody the sensing and computing capabilities of soft fluidic materials.

Rajappan, Anoop↗

DOE OSTI2024

Learning Quantum States and Unitaries of Bounded Gate Complexity

While quantum state tomography is notoriously hard, most states hold little interest to practically minded tomographers. Given that states and unitaries appearing in nature are of bounded gate complexity, it is natural to ask if efficient learning becomes possible. In this work, we prove that to learn a state generated by a quantum circuit with G two-qubit gates to a small trace distance, a sample complexity scaling linearly in G is necessary and sufficient. We also prove that the optimal query complexity to learn a unitary generated by G gates to a small average-case error scales linearly in G . While sample-efficient learning can be achieved, we show that under reasonable cryptographic conjectures, the computational complexity for learning states and unitaries of gate complexity G must scale exponentially in G . We illustrate how these results establish fundamental limitations on the expressivity of quantum machine-learning models and provide new perspectives on no-free-lunch theorems in unitary learning. Together, our results answer how the complexity of learning quantum states and unitaries relate to the complexity of creating these states and unitaries. Published by the American Physical Society 2024

Zhao, Haimeng (ORCID:0000000166751489)↗