Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum system”

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 1,333 records · Page 74

Euclidean formulation of relativistic quantum mechanics of N particles

A Euclidean formulation of relativistic quantum mechanics for systems of a finite number of degrees of freedom is discussed. Relativistic treatments of quantum theory are needed to study hadronic systems at subhadronic distance scales. While direct interaction approaches to relativistic quantum mechanics have proved to be useful, they have two disadvantages. One is that cluster properties are difficult to realize for systems of more than two particles. The second is that the relation to quantum field theories is indirect. Euclidean formulations of relativistic quantum mechanics provide an alternative representation that does not have these difficulties. More surprising, the theory can be formulated entirely in the Euclidean representation without the need for analytic continuation. In this work a Euclidean representation of a relativistic N-particle system is discussed. Kernels for systems of N free particles of any spin are given and shown to be reflection positive. Explicit formulas for generators of the Poincaré group for any spin are constructed and shown to be self-adjoint on the Euclidean representation of the Hilbert space. The structure of correlations that preserve both the Euclidean covariance and reflection positivity is discussed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Simulating Large PEPs Tensor Networks on Small Quantum Devices

We systematically map low bond dimension PEPs tensor networks to quantum circuits. By measuring and reusing qubits, we are in principle able to simulate an N×M square lattice PEPs network (for arbitrary M) of bond dimension 2 using N+ 2 qubits. We then seek to determine if this mapping can yield useful values for long-range loop observables in the presence of quantum device noise in the topological Wen plaquette model by mapping a 3×3 PEPs tensor network to a 5-qubit quantum circuit and executing it on the Honeywell System Model H1-1 trapped-ion device. We find that, for this system size, the noisy observable values are indeed sufficient for diagnosing topological vs. trivial order as the Wen model is perturbed by a magnetic field term in the Hamiltonian. We provide an overview of the experimental procedure and its results. We then explain in greater detail our method for mapping 2D tensor networks to quantum circuits and its scaling properties. This serves as a proof-of-concept of the utilty of the measure-and-reuse approach for simulating large 2D quantum systems on small quantum devices.

MacCormack, Ian↗

Diagnosing and Destroying Non-Markovian Noise

Nearly every protocol used to analyze the performance of quantum information processors is based on an assumption that the errors experienced by the device during logical operations are constant in time and are insensitive to external contexts. This assumption is pervasive, rarely stated, and almost always wrong. Quantum devices that do behave this way are termed "Markovian:' but nearly every system we have ever probed has displayed drift or crosstalk or memory effects they are all non-Markovian. Strong non-Markovianity introduces spurious effects in characterization protocols and violates assumptions of the fault-tolerance threshold theorems. This SAND report details a three year laboratory-directed research and development (LDRD) project entitled, "Diagnosing and Destroying non-Markovian Noise in Quantum Information Processors." This program was initiated to build tools to study non-Markovian dynamics and quantum systems and develop robust methodologies for eliminating it. The program achieved a number of notable successes, including the first statistically rigorous protocol for identifying and characterizing drift in quantum systems, a formalism for modeling memory effects in quantum devices, and the successful suppression of drift in a Sandia trapped-ion quantum processor.

97 MATHEMATICS AND COMPUTING↗

Qudit-based quantum computing with SRF cavities at Fermilab

Superconducting radio frequency (SRF) cavities provide an excellent platform for storing quantum information as quantum $d$-level systems (qudits) due to their exceptionally long lifetimes and large accessible Hilbert spaces. A common strategy to manipulate the states is to use a nonlinear element like a transmon. There are, however, several challenges to building a 3D SRF architecture while maintaining a long cavity lifetime. We demonstrate our successful integration of transmons with single-cell Nb SRF cavities and the ability to prepare several non-classical states. Finally, we discuss our strategies to improve the coherence times, gate schemes, and extend the system for building a multi-qudit quantum processor.

Roy, Tanay↗

Reversibility and stability of information processing systems

Classical and quantum models of dynamically reversible computers are considered. Instabilities in the evolution of the classical 'billiard ball computer' are analyzed and shown to result in a one-bit increase of entropy per step of computation. 'Quantum spin computers', on the other hand, are not only microscopically, but also operationally reversible. Readoff of the output of quantum computation is shown not to interfere with this reversibility. Dissipation, while avoidable in principle, can be used in practice along with redundancy to prevent errors.

Zurek, W. H.↗

Orbital Chern Insulator and Quantum Phase Diagram of a Kagome Electron System with Half-Filled Flat Bands

In this work, we study the quantum phase diagram of electrons on kagome lattice with half-filled lowest flat bands by considering the antiferromagnetic Heisenberg interaction J, and short-range Coulomb interaction V. In the weak J regime, we identify a fully spin-polarized phase. The presence of finite V drives a spontaneous chiral current, which makes the system an orbital Chern insulator by contributing an orbital magnetization. Such an out-of-plane orbital magnetization allows the presence of a Chern insulating phase independent of the spin orientation in contrast to the spin-orbit coupling induced Chern insulator that disappears with inplane ferromagnetism constrained by symmetry. Such a symmetry difference provides a criterion to distinguish the physical origin of topological responses in kagome systems. The orbital Chern insulator is robust against small coupling J. By further increasing J, we find that the ferromagnetic topological phase is suppressed, which first becomes partially polarized and then enters a nonmagnetic phase with spin and charge nematicity. The frustrated flat band allows the spin and Coulomb interaction to play an essential role in determining the quantum phases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Active Learning for Metamaterial Optimization on HPC and QC Integrated Systems

Active learning algorithms, integrating machine learning, quantum computing and optics simulation in an iterative loop, offer a promising approach to optimizing metamaterials. However, these algorithms can face difficulties in optimizing highly complex structures due to computational limitations. High-performance computing (HPC) and quantum computing (QC) integrated systems can address these issues by enabling parallel computing. In this study, we develop an active learning algorithm working on HPC-QC integrated systems. We evaluate the performance of optimization processes within active learning (i.e., training a machine learning model, problem-solving with quantum computing, and evaluating optical properties through wave-optics simulation) for highly complex metamaterial cases. Our results showcase that utilizing multiple cores on the integrated system can significantly reduce computational time, thereby enhancing the efficiency of optimization processes. Therefore, we expect that leveraging HPC-QC integrated systems helps effectively tackle large-scale optimization challenges in general.

Kim, Seongmin↗

Noise-Resilient Quantum Machine Learning for Stability Assessment of Power Systems

Transient stability assessment (TSA) is a cornerstone for resilient operations of todays interconnected power grids. This paper is a confluence of quantum computing, data science and machine learning to potentially address the power system TSA issue. Here, we devise a quantum TSA (QTSA) method to enable scalable and efficient data-driven transient stability prediction for bulk power systems, which is the first attempt to tackle the TSA issue with quantum computing. Our contributions are three-fold: 1) A high expressibility, low-depth (HELD) quantum circuit is designed for accurate and noise-resilient TSA; 2) A quantum natural gradient descent algorithm is developed for efficient HELD circuit training; 3) A systematical analysis on QTSAs performance under various quantum factors is per-formed. QTSA underpins a foundation of quantum-enabled and data-driven power grid stability analytics. It renders the intractable TSA straightforward and effortless in the Hilbert space, and therefore provides stability information for power system operations. Extensive experiments on quantum simulators and real quantum computers verify the accuracy, noise-resilience, scalability and universality of QTSA.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

InterQnet: A Heterogeneous Full-Stack Approach to Co-Designing Scalable Quantum Networks

Quantum communications have progressed significantly, moving from a theoretical concept to small-scale experiments to recent metropolitan-scale demonstrations. As the technology matures, it is expected to revolutionize quantum computing in much the same way that classical networks revolutionized classical computing. Quantum communications will also enable breakthroughs in quantum sensing, metrology, and other areas. However, scalability has emerged as a major challenge, particularly in terms of the number and heterogeneity of nodes, the distances between nodes, the diversity of applications, and the scale of user demand. This article describes InterQnet, a multidisciplinary project that advances scalable quantum communications through a comprehensive approach that improves devices, error handling, and network architecture. InterQnet has a two-pronged strategy to address scalability challenges: InterQnet-Achieve focuses on practical realizations of heterogeneous quantum networks by building and then integrating first-generation quantum repeaters with error mitigation schemes and centralized automated network control systems. The resulting system will enable quantum communications between two heterogeneous quantum platforms through a third type of platform operating as a repeater node. InterQnet-Scale focuses on a systems study of architectural choices for scalable quantum networks by developing forward-looking models of quantum network devices, advanced error correction schemes, and entanglement protocols. Here, we report our current progress toward achieving our scalability goals.

Chung, Joaquin [Argonne] (ORCID:0000000173833810)↗

System and method for scalable optical interconnect for quantum computing

The present disclosure relates to an interconnect system for interfacing an electronic subsystem to a qubit package, wherein the qubit package has a plurality of independent qubits. The system makes use of an optical fiber cable having a plurality of optical fibers, which is interfaced to the electronic subsystem. A 3D optical structure is used which has a plurality of internal waveguides, and which is configured to interface the optical fiber cable to the qubit package. The 3D optical structure further has at least one subsystem for using the plurality of waveguides to receive signals of a first type from at least one of the qubits package or the optical fiber cable, to convert the signals from the first type to a second type, and to transmit the signals in the second type to the other one of the fiber optic cable or the qubit package.

Patra, Susant K.↗

Enabling Scalable VQE Simulation on Leading HPC Systems

Large-scale simulations of quantum circuits pose significant challenges, especially in the context of quantum chemistry, due to the number of qubits, circuit depth, and the number of circuits needed per problem. High-performance computing (HPC) systems offer massive computational capabilities that could help overcome these obstacles. We developed a high-performance quantum circuit simulator, called NWQ-Sim, and demonstrate its capability to simulate large quantum chemistry problems on NERSC's Perlmutter supercomputer. Integrating NWQ-Sim with XACC, we have executed QPE and VQE algorithms for downfolded quantum chemistry systems at unprecedented scales. Our work demonstrates the potential of leveraging HPC resources to advance quantum chemistry and other applications of near-term quantum devices.

Wang, Meng↗

Quantum Phases of Transition Metal Dichalcogenide Moiré Systems

Moiré systems provide a rich platform for studies of strong correlation physics. Recent experiments on heterobilayer transition metal dichalcogenide Moiré systems are exciting in that they manifest a relatively simple model system of an extended Hubbard model on a triangular lattice. Inspired by the prospect of the hetero-transition metal dichalcogenide Moiré system’s potential as a solid-state-based quantum simulator, we explore the extended Hubbard model on the triangular lattice using the density matrix renormalization group. Specifically, we explore the two-dimensional phase space spanned by the key tuning parameters in the extended Hubbard model, namely, the kinetic energy strength and the further-range Coulomb interaction strengths. We find competition between Fermi fluid, chiral spin liquid, spin density wave, and charge order. In particular, our finding of the optimal further-range interaction for the chiral correlation presents a tantalizing possibility.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Designing an exciton-condensate Josephson junction in quantum Hall heterostructures

The exciton condensate, a counterpart of superconductors realized in two-dimensional quantum Hall bilayer systems, has yet to demonstrate definitive experimental evidence of phase coherence such as the Josephson effect. This work introduces a gate-defined Josephson junction designed to exhibit the in-plane Josephson effect in van der Waals heterostructures. Unlike superconducting S-I-S junctions, the proposed device leverages a nearly layer-polarized gated region to mediate Josephson coupling via layer pseudospin variation. This coupling mechanism is tunable through gate voltages and magnetic fields, offering a high degree of experimental control. We demonstrate the feasibility of the design using realistic parameters, paving the way for direct observation of excitonic phase coherence in clean quantum Hall systems.

Wang, Tianle↗

Quantum tensor network algorithms for evaluation of spectral functions on quantum computers

We investigate quantum algorithms derived from tensor networks to simulate the static and dynamic properties of quantum many-body systems. Using a sequentially prepared quantum circuit representation of a matrix product state (MPS) that we call a quantum tensor network (QTN), we demonstrate algorithms to prepare ground and excited states on a quantum computer and apply them to molecular nanomagnets (MNMs) as a paradigmatic example. In this setting, we develop two approaches for extracting the spectral correlation functions measured in neutron-scattering experiments: (a) a generalization of the SWAP test for computing wave function overlaps and, (b) a generalization of the notion of matrix product operators to the QTN setting which generates a linear combination of unitaries. The latter method is discussed in detail for translationally invariant spin-half systems, where it is shown to reduce the qubit resource requirements compared with the SWAP method and may be generalized to other systems. We demonstrate the versatility of our approaches by simulating spin-1/2 and spin-3/2 MNMs, with the latter being an experimentally relevant model of a Cr$^{3+}_{8}$ ring. Here, our approach has qubit requirements that are independent of the number of constituents of the many-body system and scale only logarithmically with the bond dimension of the MPS representation, making them appealing for implementation on near-term quantum hardware with mid-circuit measurement and reset.

Neutron scattering↗

Engineering Dynamically Decoupled Quantum Simulations with Trapped Ions

An external drive can improve the coherence of a quantum many-body system by averaging out noise sources. It can also be used to realize models that are inaccessible in the static limit, through Floquet Hamiltonian engineering. The full possibilities for combining these tools remain unexplored. We develop the requirements needed for a pulse sequence to decouple a quantum many-body system from an external field without altering the intended dynamics. Demonstrating this technique experimentally in an ion-trap platform, we show that it can provide a large improvement to coherence in real-world applications. Finally, we engineer an approximate quantum simulation of the Haldane-Shastry model, an exactly solvable paradigm for long-range interacting spins. Our results expand and unify the quantum simulation toolbox.

97 MATHEMATICS AND COMPUTING↗

A Digital Twin of Scalable Quantum Clouds

Quantum computing has emerged as a transformative technology capable of solving complex problems beyond the limit of classical systems. The rapid development of quantum processors has led to the proliferation of cloud-based quantum computing services offered by platforms such as IBM, Google, and Amazon. These platforms introduce unique challenges in resource allocation, job scheduling, and multi-device orchestration as quantum workloads become increasingly complex. In this work, we present a digital twin of quantum cloud infrastructures: a framework designed to model and simulate the behavior of real quantum cloud systems. Developed in Python using the SimPy discrete-event simulation library, the framework replicates key aspects of quantum cloud environments, including detailed quantum device modeling, job lifecycle management, and job fidelity. It incorporates noise-aware fidelity estimation, making it the first of its kind to simulate superconducting gate-based quantum cloud systems at an administrative level with job fidelity. We present use cases as proof of concept, demonstrating that our quantum cloud simulation framework can act as a digital twin of a quantum cloud and support the modeling and implementation of practical systems.

Luo, Waylon [Kent State University]↗

Reduced-order modeling on a near-term quantum computer

Quantum computing is an advancing area of research in which computer hardware and algorithms are developed to take advantage of quantum mechanical phenomena. In recent studies, quantum algorithms have shown promise in solving linear systems of equations as well as systems of linear ordinary differential equations (ODEs) and partial differential equations (PDEs). Reducedorder modeling (ROM) algorithms for studying fluid dynamics have shown success in identifying linear operators that can describe flowfields, where dynamic mode decomposition (DMD) is a particularly useful method in which a linear operator is identified from data. In this work, DMD is reformulated as an optimization problem to propagate the state of the linearized dynamical system on a quantum computer. This reformulation was chosen as a means of facilitating implementation on a near-term quantum computer. Quadratic unconstrained binary optimization (QUBO), a technique for optimizing quadratic polynomials in binary variables, allows for quantum annealing algorithms to be applied. A quantum circuit model (quantum approximation optimization algorithm, QAOA) is utilized to obtain predictions of the state trajectories. Results are shown for the quantum-ROM predictions for flow over a 2D cylinder at Re = 220 and flow over a NACA0009 airfoil at Re = 500 and α = 15°. The quantum-ROM predictions are found to depend on the number of bits utilized for a fixed point representation and the truncation level of the DMD model. Comparisons with DMD predictions from a classical computer algorithm are made, as well as an analysis of the computational complexity and prospects for future, more fault-tolerant quantum computers.

97 MATHEMATICS AND COMPUTING↗

Clifford Circuit-Based Heuristic Optimization of Fermion-To-Qubit Mappings

Simulation of interacting Fermionic Hamiltonians is one of the most promising applications of quantum computers. However, the feasibility of analyzing Fermionic systems with a quantum computer hinges on the efficiency of Fermion-to-qubit mappings that encode nonlocal Fermionic degrees of freedom in local qubit degrees of freedom. While recent studies have highlighted the importance of designing Fermion-to-qubit mappings that are tailored to specific problem Hamiltonians, the methods proposed so far either are restricted to a narrow class of mappings or they use computationally expensive and unscalable brute-force search algorithms. Here, in this work, we address this challenge by designing a heuristic numerical optimization framework for Fermion-to-qubit mappings. To this end, we first translate the Fermion-to-qubit mapping problem to a Clifford circuit optimization problem and then use simulated annealing to optimize the average Pauli weight of the problem Hamiltonian. For all Fermionic Hamiltonians we have considered, the numerically optimized mappings outperform their conventional counterparts, including ternary-tree-based mappings that are known to be optimal for single creation and annihilation operators. We find that our optimized mappings yield between 15% and 40% improvements on the average Pauli weight when the simulation Hamiltonian has an intermediate level of complexity. Most remarkably, the optimized mappings improve the average Pauli weight for 6 × 6 nearest-neighbor hopping and Hubbard models by more than 40% and 20%, respectively. Surprisingly, we also find specific interaction Hamiltonians for which the optimized mapping outperforms any ternary-tree-based mapping. Our results establish heuristic numerical optimization as an effective method for obtaining mappings tailored for specific Fermionic Hamiltonian.

Hamiltonians↗