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 343 records · Page 19

Quantum simulations of SO(5) many-fermion systems using qudits

The structure and dynamics of many-body systems are the result of a delicate interplay between underlying interactions. Fermionic pairing, for example, plays a central role in various physical systems, ranging from condensed matter to nuclear systems, where it can lead to collective phenomena such as superconductivity and superfluidity. In atomic nuclei, the interplay between pairing and particle-hole interactions leads to a high degree of complexity and intricate entanglement structures. Despite this apparent complexity, symmetries emerge and manifest themselves in observable regular patterns. These symmetries and their breakings have long been used to determine relevant degrees of freedom and simplify classical descriptions of many-body systems. Here, this work explores the potential utility of quantum computers with arrays of qudits in simulating interacting fermionic systems, when the qudits can naturally map the relevant degrees of freedom determined by an underlying symmetry group. The Agassi model of fermions interacting via particle-hole and pairing interactions is based on an underlying so(5) algebra. Such systems can intuitively be partitioned into pairs of modes with five basis states, which thus naturally map to arrays of d = 5 qudits (qu5its). Classical noiseless simulations of the time evolution of systems with up to twelve qu5its are performed, by implementing quantum circuits that are developed herein, using PYTHON codes invoking Google's CIRQ software. The resource requirements of the qu5it circuits are analyzed and compared with two different mappings to qubit systems: a physics-aware Jordan-Wigner mapping requiring four qubits per mode pair and a state-to-state mapping requiring three qubits per mode pair. While the dimensionality of Hilbert spaces in mappings to qu5it systems are less than those for the corresponding qubit systems, the number of entangling operations, depending on the available hardware, can either be greater or smaller than for the physics-aware Jordan-Wigner mapping. The state-to-state mapping, while having a smaller Hilbert space than Jordan-Wigner mappings, appears to be the least efficient in gate counts. Further, a previously unknown sign problem has been identified from Trotterization errors in time evolving high-energy excitations. There appear to be advantages in employing quantum computers with arrays of qudits to perform simulations of many-body dynamics that exploit the role of underlying symmetries, specifically in lowering the required quantum resources and in reducing anticipated errors that take the simulation out of the physical space. If the necessary entangling gates are not directly supported by the hardware, physics-aware mappings to qubits may, however, be advantageous for other aspects.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

KTaO 3 -Based Supercurrent Diode

The supercurrent diode effect (SDE), characterized by nonreciprocal critical currents, represents a promising building block for future dissipationless electronics and quantum circuits. Realizing SDE requires breaking both time-reversal and inversion symmetry in the device. Here we use conductive atomic force microscope (c-AFM) lithography to pattern reconfigurable superconducting weak links (WLs) at the LaAlO 3 /KTaO 3 (LAO/KTO) interface. By deliberately engineering the WL geometry at the nanoscale, we realize SDE in these devices in the presence of modest out-of-plane magnetic fields. The SDE polarity can be reversed by simply changing the WL position, and the rectification efficiency reaches up to 13% under optimal magnetic field conditions. Time-dependent Ginzburg–Landau simulations reveal that the observed SDE originates from asymmetric vortex motion in the inversion-symmetry-breaking device geometry. This demonstration of SDE in the LAO/KTO system establishes a versatile platform for investigating and engineering vortex dynamics, forming the basis for engineered quantum circuit elements.

C-AFM lithography↗

Electron shelving of a superconducting artificial atom

Interfacing long-lived qubits with propagating photons is a fundamental challenge in quantum technology. Cavity and circuit quantum electrodynamics (cQED) architectures rely on an off-resonant cavity, which blocks the qubit emission and enables a quantum non-demolition (QND) dispersive readout. However, no such buffer mode is necessary for controlling a large class of three-level systems that combine a metastable qubit transition with a bright cycling transition, using the electron shelving effect. Here we demonstrate shelving of a circuit atom, fluxonium, placed inside a microwave waveguide. With no cavity modes in the setup, the qubit coherence time exceeds 50 μs, and the cycling transition’s radiative lifetime is under 100 ns. By detecting a homodyne fluorescence signal from the cycling transition, we implement a QND readout of the qubit and account for readout errors using a minimal optical pumping model. Our result establishes a resource-efficient (cavityless) alternative to cQED for controlling superconducting qubits.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum graph learning and algorithms applied in quantum computer sciences and image classification

Graph and network theory play a fundamental role in quantum computer sciences, including quantum information and computation. Random graphs and complex network theory are pivotal in predicting novel quantum phenomena, where entangled links are represented by edges. Quantum algorithms have been developed to enhance solutions for various network problems, giving rise to quantum graph computing and quantum graph learning (QGL). Here, in this review, we explore graph theory and graph learning methods as powerful tools for quantum computers to generate efficient solutions to problems beyond the reach of classical systems. We delve into the development of quantum complex network theory and its applications in quantum computation, materials discovery, and research. We also discuss quantum machine learning (QML) methodologies for effective image classification using qubits, quantum gates, and quantum circuits. Additionally, the paper addresses the challenges of QGL and algorithms, emphasizing the steps needed to develop flexible QGL solvers. This review presents a comprehensive overview of the fields of QGL and QML, highlights recent advancements, and identifies opportunities for future research.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum cluster algorithm for data classification

Abstract We present a quantum algorithm for data classification based on the nearest-neighbor learning algorithm. The classification algorithm is divided into two steps: Firstly, data in the same class is divided into smaller groups with sublabels assisting building boundaries between data with different labels. Secondly we construct a quantum circuit for classification that contains multi control gates. The algorithm is easy to implement and efficient in predicting the labels of test data. To illustrate the power and efficiency of this approach, we construct the phase transition diagram for the metal-insulator transition of VO 2 , using limited trained experimental data, where VO 2 is a typical strongly correlated electron materials, and the metallic-insulating phase transition has drawn much attention in condensed matter physics. Moreover, we demonstrate our algorithm on the classification of randomly generated data and the classification of entanglement for various Werner states, where the training sets can not be divided by a single curve, instead, more than one curves are required to separate them apart perfectly. Our preliminary result shows considerable potential for various classification problems, particularly for constructing different phases in materials.

97 MATHEMATICS AND COMPUTING↗

Quantum advantage for noisy channel discrimination

Many quantum mechanical experiments can be viewed as multiround interactive protocols between known quantum circuits and an unknown quantum process. Fully quantum “coherent” access to the unknown process is known to provide an advantage in many discrimination tasks compared to when only incoherent access is permitted, but it is unclear if this advantage persists when the process is noisy. Here, we show that a quantum advantage can be maintained when distinguishing between two noisy single-qubit rotation channels. Numerical and analytical calculations reveal a distinct transition between the performance of fully coherent and fully incoherent protocols as a function of noise strength. Moreover, the size of the region of coherent quantum advantage shrinks inverse polynomially in the number of channel uses, and in an intermediate regime an improved strategy is a hybrid of fully coherent and fully incoherent subroutines. The fully coherent protocol is based on quantum signal processing, suggesting a generalizable algorithmic framework for the study of quantum advantage in the presence of realistic noise.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal purification of a generic n-qudit state

We propose a quantum algorithm for the purification of a generic mixed state {rho} of a n-qudit system by using an ancillary n-qudit system. The algorithm is optimal in that (i) the number of ancillary qudits cannot be reduced, (ii) the number of parameters which determine the purification state |{psi}> exactly equals the number of degrees of freedom of {rho}, and (iii) |{psi}> is easily determined from the density matrix {rho}. Moreover, we introduce a quantum circuit in which the quantum gates are unitary transformations acting on a 2n-qudit system. These transformations are determined by parameters that can be tuned to generate, once the ancillary qudits are disregarded, any given mixed n-qudit state.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Benchmarking treewidth as a practical component of tensor network simulations

Tensor networks are powerful factorization techniques which reduce resource requirements for numerically simulating principal quantum many-body systems and algorithms. The computational complexity of a tensor network simulation depends on the tensor ranks and the order in which they are contracted. Unfortunately, computing optimal contraction sequences (orderings) in general is known to be a computationally difficult (NP-complete) task. In 2005, Markov and Shi showed that optimal contraction sequences correspond to optimal (minimum width) tree decompositions of a tensor network’s line graph, relating the contraction sequence problem to a rich literature in structural graph theory. While treewidth-based methods have largely been ignored in favor of dataset-specific algorithms in the prior tensor networks literature, we demonstrate their practical relevance for problems arising from two distinct methods used in quantum simulation: multi-scale entanglement renormalization ansatz (MERA) datasets and quantum circuits generated by the quantum approximate optimization algorithm (QAOA). We exhibit multiple regimes where treewidth-based algorithms outperform domain-specific algorithms, while demonstrating that the optimal choice of algorithm has a complex dependence on the network density, expected contraction complexity, and user run time requirements. We further provide an open source software framework designed with an emphasis on accessibility and extendability, enabling replicable experimental evaluations and future exploration of competing methods by practitioners.

97 MATHEMATICS AND COMPUTING↗

A Circuit-Based Quantum Algorithm Driven by Transverse Fields for Grover's Problem

We designed a quantum search algorithm, giving the same quadratic speedup achieved by Grover's original algorithm; we replace Grover's diffusion operator (hard to implement) with a product diffusion operator generated by transverse fields (easy to implement). In our algorithm, the problem Hamiltonian (oracle) and the transverse fields are applied to the system alternatively. We construct such a sequence that the corresponding unitary generates a closed transition between the initial state (even superposition of all states) and a modified target state, which has a high degree of overlap with the original target state.

quantum computing↗

Simulating Quantum Systems with NWQ-Sim on HPC

NWQ-Sim is a cutting-edge quantum system simulation environment designed to run on classical multi-node, multi-CPU/GPU heterogeneous HPC systems. In this work, we provide a brief overview of NWQ-Sim and its implementation in simulating quantum circuit applications, such as the transverse field Ising model. We also demonstrate how NWQ-Sim can be used to examine the effects of errors that occur on real quantum devices, using a combined device noise model. Moreover, NWQ-Sim is particularly well-suited for implementing variational quantum algorithms where circuits are dynamically generated. Therefore, we also illustrate this with the variational quantum eigensolver (VQE) for the Ising model. In both cases, NWQ-Sim's performance is comparable to or better than alternative simulators. We conclude that NWQ-Sim is a useful and flexible tool for simulating quantum circuits and algorithms, with performance advantages and noise-aware simulation capabilities.

Suh, In-Saeng↗

Characterizing quantum supremacy in near-term devices

A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of supercomputers. Such a demonstration of what is referred to as quantum supremacy requires a reliable evaluation of the resources required to solve tasks with classical approaches. Here, we propose the task of sampling from the output distribution of random quantum circuits as a demonstration of quantum supremacy. We extend previous results in computational complexity to argue that this sampling task must take exponential time in a classical computer. We introduce cross-entropy benchmarking to obtain the experimental fidelity of complex multiqubit dynamics. This can be estimated and extrapolated to give a success metric for a quantum supremacy demonstration. We study the computational cost of relevant classical algorithms and conclude that quantum supremacy can be achieved with circuits in a two-dimensional lattice of 7 × 7 qubits and around 40 clock cycles. This requires an error rate of around 0.5% for two-qubit gates (0.05% for one-qubit gates), and it would demonstrate the basic building blocks for a fault-tolerant quantum computer.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Simulators and Applications on Quantum Framework

Simulating quantum circuits is essential for validating quantum algorithms. However, no single simulator consistently performs best - efficiency depends on circuit structure, entanglement, and depth. In this work, we integrate Qiskit-Aer (state-vector and matrix product state) and QTensor, a tree-tensor-network based simulator, into the Quantum Framework (QFw), a modular platform that supports multiple quantum backends via a unified interface. We also enable distributed quantum approximate optimization algorithm (DQAOA) application compatibility with QFw, allowing sub-problems to be solved in parallel at scale. We then benchmark DQAOA and TFIM (transverse field Ising model) circuits across supported simulators, showing how performance varies significantly with problem type. All simulations are deployed on the Frontier supercomputer using QFw's MPI-based orchestration for distributed, multinode execution. These results underscore the need for simulatoragnostic infrastructure to enable systematic evaluation and highperformance scaling of quantum workloads. QFw provides a practical and extensible path toward reproducible quantum algorithm development across diverse application domains.

Chundury, Srikar [ORNL] (ORCID:0009000183359259)↗

Theory of degenerate three-wave mixing using circuit QED in solid-state circuits

We study the theory of degenerate three-wave mixing and the generation of squeezed microwaves using circuit quantum electrodynamics in solid state circuits. The Hamiltonian for degenerate three-wave mixing, which seemed to be given phenomenologically in quantum optics, is derived by quantum mechanical calculations. The nonlinear medium needed in three-wave mixing is composed of a series of superconducting charge qubits which are located inside two superconducting transmission-line resonators. Here, the multiqubit ensemble is present to enhance the effective coupling constant between the two modes in the transmission-line resonators. In the squeezing process, the qubits are kept in their ground states so that their decoherence does not corrupt the squeezing. The main obstacle preventing a large squeezing efficiency is the decay rate of the transmission-line resonator.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗