Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum device”

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 289 records · Page 16

A fault-tolerant neutral-atom architecture for universal quantum computation

Quantum error correction (QEC) is essential for the realization of large-scale quantum computers. However, owing to the complexity of operating on the encoded ‘logical’ qubits, understanding the physical principles for building fault-tolerant quantum devices and combining them into efficient architectures is an outstanding scientific challenge. Here we use reconfigurable arrays of up to 448 neutral atoms to implement the key elements of a universal, fault-tolerant quantum processing architecture and experimentally explore their underlying working mechanisms. We first use surface codes to study how repeated QEC suppresses errors, demonstrating 2.14(13)x below-threshold performance in a four-round characterization circuit by leveraging atom loss detection and machine learning decoding. We then investigate logical entanglement using transversal gates and lattice surgery and extend it to universal logic through transversal teleportation with three-dimensional [[15,1,3]] codes, enabling arbitrary-angle synthesis with polylogarithmic overhead. Finally, we develop mid-circuit qubit reuse16, increasing experimental cycle rates by two orders of magnitude and enabling deep-circuit protocols with dozens of logical qubits and hundreds of logical teleportations with [[7,1,3]] and high-rate [[16,6,4]] codes while maintaining constant internal entropy. Our experiments show key principles for efficient architecture design, involving the interplay between quantum logic and entropy removal, judiciously using physical entanglement in logic gates and magic state generation, and leveraging teleportations for universality and physical qubit reset. These results establish foundations for scalable, universal error-corrected processing and its practical implementation in neutral atom systems.

atomic and molecular physics↗

Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most often-used NP-hard problems in computer science to study the effectiveness of computing models and hardware platforms. In this regard, it is also heavily used as a vehicle to study the feasibility of the quantum computing paradigm for this class of problems. In this paper, we tackle the TSP using the quantum approximate optimization algorithm (QAOA) approach by formulating it as an optimization problem. By adopting an improved qubit encoding strategy and a layer-wise learning optimization protocol, we present numerical results obtained from the gate-based digital quantum simulator, specifically targeting TSP instances with 3, 4, and 5 cities. We focus on the evaluations of three distinctive QAOA mixer designs, considering their performances in terms of numerical accuracy and optimization cost. Notably, we find that a well-balanced QAOA mixer design exhibits more promising potential for gate-based simulators and realistic quantum devices in the long run, an observation further supported by our noise model simulations. Furthermore, we investigate the sensitivity of the simulations to the TSP graph. Overall, our simulation results show that the digital quantum simulation of problem-inspired ansatz is a successful candidate for finding optimal TSP solutions.

97 MATHEMATICS AND COMPUTING↗

Solving complex eigenvalue problems on a quantum annealer with applications to quantum scattering resonances

Quantum computing is a new and rapidly evolving paradigm for solving chemistry problems. In previous work, we developed the Quantum Annealer Eigensolver (QAE) and applied it to the calculation of the vibrational spectrum of a molecule on the D-Wave quantum annealer. However, the original QAE methodology was applicable to real symmetric matrices only. For many physics and chemistry problems, the diagonalization of complex matrices is required. For example, the calculation of quantum scattering resonances can be formulated as a complex eigenvalue problem where the real part of the eigenvalue is the resonance energy and the imaginary part is proportional to the resonance width. In the present work, we generalize the QAE to treat complex matrices: first complex Hermitian matrices and then complex symmetric matrices. These generalizations are then used to compute a quantum scattering resonance state in a 1D model potential for O + O collisions. These calculations are performed using both a software (classical) annealer and hardware annealer (the D-Wave 2000Q). The results of the complex QAE are also benchmarked against a standard linear algebra library (LAPACK). Furthermore, this work presents the first numerical solution of a complex eigenvalue problem of any kind on a quantum annealer, and it is the first treatment of a quantum scattering resonance on any quantum device.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The phase diagram of quantum chromodynamics in one dimension on a quantum computer

The quantum chromodynamics (QCD) phase diagram, which reveals the state of strongly interacting matter at different temperatures and densities, is key to answering open questions in physics, ranging from the behaviour of particles in neutron stars to the conditions of the early universe. However, classical simulations of QCD face significant computational barriers, such as the sign problem at finite matter densities. Quantum computing offers a promising solution to overcome these challenges. Here, we take an important step toward exploring the QCD phase diagram with quantum devices by preparing thermal states in one-dimensional non-Abelian gauge theories. We experimentally simulate the thermal states of SU(2) and SU(3) gauge theories at finite densities on a trapped-ion quantum computer using a variational method. This is achieved by introducing two features: Firstly, we add motional ancillae to the existing qubit register to efficiently prepare thermal probability distributions. Secondly, we introduce charge-singlet measurements to enforce colour-neutrality constraints. This work pioneers the quantum simulation of QCD at finite density and temperature for two and three colours, laying the foundation to explore QCD phenomena on quantum platforms.

Quantum information↗

Quantum model learning agent: characterisation of quantum systems through machine learning

Accurate models of real quantum systems are important for investigating their behaviour, yet are difficult to distil empirically. Here, we report an algorithm—the quantum model learning agent (QMLA)—to reverse engineer Hamiltonian descriptions of a target system. We test the performance of QMLA on a number of simulated experiments, demonstrating several mechanisms for the design of candidate Hamiltonian models and simultaneously entertaining numerous hypotheses about the nature of the physical interactions governing the system under study. QMLA is shown to identify the true model in the majority of instances, when provided with limited a priori information, and control of the experimental setup. Our protocol can explore Ising, Heisenberg and Hubbard families of models in parallel, reliably identifying the family which best describes the system dynamics. We demonstrate QMLA operating on large model spaces by incorporating a genetic algorithm to formulate new hypothetical models. The selection of models whose features propagate to the next generation is based upon an objective function inspired by the Elo rating scheme, typically used to rate competitors in games such as chess and football. In all instances, our protocol finds models that exhibit F 1 score ≥ 0.88 when compared with the true model, and it precisely identifies the true model in 72% of cases, whilst exploring a space of over 250 000 potential models. By testing which interactions actually occur in the target system, QMLA is a viable tool for both the exploration of fundamental physics and the characterisation and calibration of quantum devices.

97 MATHEMATICS AND COMPUTING↗

Practical Scalability of LuGo: Benchmarking the HHL Algorithm Using an Enhanced QPE Algorithm

The HHL algorithm is a prominent quantum algorithm that offers exponential speedup over its classical counterparts for solving a system of linear equations. However, synthesizing and executing HHL circuits demand significant computational resources from both classical and quantum systems. In this paper, we benchmark the HHL algorithm using the optimized Quantum Phase Estimation (QPE) generation algorithm, LuGo \cite{lu2025lugo}, to enhance its scalability and efficiency. We leverage the National Energy Research Scientific Computing Center's (NERSC) Perlmutter supercomputer to evaluate the scalability of generating HHL circuits and to measure the time to simulate the generated circuits. Additionally, we provide a comprehensive analysis of the algorithm's performance on various state-of-the-art superconducting and trapped-ion quantum devices, including studies on qubit connectivity, fidelity comparisons, and hardware compatibility and robustness. Our results offer preliminary insights into potential practical applications of the HHL algorithm enabled by LuGo and the performance of various types of quantum hardware.

Lu, Chao [ORNL] (ORCID:0000000179346933)↗

Collective neutrino oscillations on a quantum computer with hybrid quantum-classical algorithm

We simulate the time evolution of collective neutrino oscillations in two-flavor settings on a quantum computer. We explore the generalization of Trotter-Suzuki approximation to time-dependent Hamiltonian dynamics. The trotterization steps are further optimized using the Cartan decomposition of two-qubit unitary gates U ϵ SU(4) in the minimum number of controlled-NOT (CNOT) gates making the algorithm more resilient to the hardware noise. As a result, a more efficient hybrid quantum-classical algorithm is also explored to solve the problem on noisy intermediate-scale quantum devices.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Relaxation of stationary states on a quantum computer yields a unique spectroscopic fingerprint of the computer’s noise

Abstract Quantum computing has the potential to revolutionize computing, but its significant sensitivity to noise requires sophisticated error correction and mitigation. Traditionally, noise on the quantum device is characterized directly through qubit and gate measurements, but this approach has drawbacks in that it does not adequately capture the effect of noise on realistic multi-qubit applications. In this paper, we simulate the relaxation of stationary quantum states on a quantum computer to obtain a unique spectroscopic fingerprint of the computer’s noise. In contrast to traditional approaches, we obtain the frequency profile of the noise as it is experienced by the simulated stationary quantum states. Data from multiple superconducting-qubit IBM processors show that noise generates a bath within the simulation that exhibits both colored noise and non-Markovian behavior. Our results provide a direction for noise mitigation but also suggest how to use noise for quantum simulations of open systems.

97 MATHEMATICS AND COMPUTING↗

Exploring Quantum State Preparation Using Tensor Networks and Sparse Wavefunction Simulations

The variational quantum eigenvalue solver is a powerful hybrid quantum-classical approach that has been suggested as a candidate method to run on near-term quantum hardware for computing ground state electronic energies of molecular systems. However, even for small molecules, the number of variational parameters and qubits required to minimize the electronic energy is beyond the reach of current quantum computers except for small basis sets. We explore a new paradigm for state preparation where we test how much of the optimization can be approximately prepared with classical computers to reduce the number of optimization steps performed using a quantum device. By adapting a recent algorithm for the factorized form of the UCC ansatz, we can study molecular electronic structure problems with up to 64 qubits. In addition, we also test a related approach of using tensor networks to optimize quantum circuits in order to benchmark various lattice models. We present results using these approaches and discuss strategies for incorporating these ideas into variational algorithms involving near-term quantum computers. Our results help demonstrate the strength of the UCC ansatz and address pressing questions about optimal initial parameterizations and circuit construction.

quantum computing↗

Constant-Depth Preparation of Matrix Product States with Adaptive Quantum Circuits

Adaptive quantum circuits, which combine local unitary gates, midcircuit measurements, and feedforward operations, have recently emerged as a promising avenue for efficient state preparation, particularly on near-term quantum devices limited to shallow-depth circuits. Matrix product states (MPS) comprise a significant class of many-body entangled states, efficiently describing the ground states of one-dimensional gapped local Hamiltonians and finding applications in a number of recent quantum algorithms. Recently, it has been shown that the Affleck-Kennedy-Lieb-Tasaki state—a paradigmatic example of an MPS—can be exactly prepared with an adaptive quantum circuit of constant depth, an impossible feat with local unitary gates alone due to its nonzero correlation length [Smith , PRX Quantum 4, 020315 (2023)]. In this work, we broaden the scope of this approach and demonstrate that a diverse class of MPS can be exactly prepared using constant-depth adaptive quantum circuits, outperforming theoretically optimal preparation with unitary circuits. We show that this class includes short- and long-ranged entangled MPS, symmetry-protected topological (SPT) and symmetry-broken states, MPS with finite Abelian, non-Abelian, and continuous symmetries, resource states for MBQC, and families of states with tunable correlation length. Moreover, we illustrate the utility of our framework for designing constant-depth sampling protocols, such as for random MPS or for generating MPS in a particular SPT phase. We present sufficient conditions for particular MPS to be preparable in constant time, with global on-site symmetry playing a pivotal role. Altogether, this work demonstrates the immense promise of adaptive quantum circuits for efficiently preparing many-body entangled states and provides explicit algorithms that outperform known protocols to prepare an essential class of states. Published by the American Physical Society 2024

Smith, Kevin C. (ORCID:0000000223971518)↗

Quantum Circuits for the Preparation of Spin Eigenfunctions on Quantum Computers

The application of quantum algorithms to the study of many-particle quantum systems requires the ability to prepare wave functions that are relevant in the behavior of the system under study. Hamiltonian symmetries are important instruments used to classify relevant many-particle wave functions and to improve the efficiency of numerical simulations. In this work, quantum circuits for the exact and approximate preparation of total spin eigenfunctions on quantum computers are presented. Two different strategies are discussed and compared: exact recursive construction of total spin eigenfunctions based on the addition theorem of angular momentum, and heuristic approximation of total spin eigenfunctions based on the variational optimization of a suitable cost function. The construction of these quantum circuits is illustrated in detail, and the preparation of total spin eigenfunctions is demonstrated on IBM quantum devices, focusing on three- and five-spin systems on graphs with triangle connectivity.

97 MATHEMATICS AND COMPUTING↗

Adaptive pruning-based optimization of parameterized quantum circuits

Abstract Variational hybrid quantum–classical algorithms are powerful tools to maximize the use of noisy intermediate-scale quantum devices. While past studies have developed powerful and expressive ansatze, their near-term applications have been limited by the difficulty of optimizing in the vast parameter space. In this work, we propose a heuristic optimization strategy for such ansatze used in variational quantum algorithms, which we call ‘parameter-efficient circuit training (PECT)’. Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms, in which each iteration of the algorithm activates and optimizes a subset of the total parameter set. To update the parameter subset between iterations, we adapt the Dynamic Sparse Reparameterization scheme which was originally proposed for training deep convolutional neural networks. We demonstrate PECT for the Variational Quantum Eigensolver, in which we benchmark unitary coupled-cluster ansatze including UCCSD and k -UpCCGSD, as well as the Low-Depth Circuit Ansatz (LDCA), to estimate ground state energies of molecular systems. We additionally use a layerwise variant of PECT to optimize a hardware-efficient circuit for the Sycamore processor to estimate the ground state energy densities of the one-dimensional Fermi-Hubbard model. From our numerical data, we find that PECT can enable optimizations of certain ansatze that were previously difficult to converge and more generally can improve the performance of variational algorithms by reducing the optimization runtime and/or the depth of circuits that encode the solution candidate(s).

Physics↗

A density-functional theory study of the Al/AlOx/Al tunnel junction

The aluminum oxide tunnel junction is a key component of the majority of superconducting quantum devices. For high-quality, reproducible, and scalably manufacturable qubits, the ability to fabricate Josephson junctions (JJs) with a targeted critical current and high uniformity is essential. In this study, we use first-principles modeling to assess fundamental aspects of the atomic structure of both amorphous and crystalline aluminum oxide tunnel junctions and relate the structure to predicted performance metrics. We use modified ab initio molecular dynamics to develop realistic models of the tunnel junction, from which interface roughness and local thickness fluctuations are analyzed in an unbiased manner by training a neural network to identify the boundary between metal and oxide. We show that the effective thickness of the insulating part of the junction can be different from the apparent physical thickness. We calculate the rate of Cooper pair tunneling for the atomically resolved electrostatic potential using direct numerical solution in 3D, which shows a channeling effect that impacts the junction critical current. The predicted critical current is a useful JJ design parameter that can be accessed from the ab initio calculations without fitting parameters. To assess the limits of uniformity and fabrication choices (e.g., oxidation vs epitaxy), we compare the amorphous junctions to crystalline models, which show order of magnitude more efficient tunneling compared to the amorphous case, underlining the connection between atomistic structure and Cooper pair tunneling efficiency. Further, this work provides a foundation for ab initio materials design and evaluation to help accelerate future development of improved tunnel junctions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Readout optimization of multi-amplifier sensing charge-coupled devices for single-quantum measurement

The non-destructive readout capability of the Skipper Charge Coupled Device (CCD) has been demonstrated to reduce the noise limitation of conventional silicon devices to levels that allow single-photon or single-electron counting. The noise reduction is achieved by taking multiple measurements of the charge in each pixel. These multiple measurements come at the cost of extra readout time, which has been a limitation for the broader adoption of this technology in particle physics, quantum imaging, and astronomy applications. This work presents recent results of a novel sensor architecture that uses multiple non-destructive floating-gate amplifiers in series to achieve sub-electron readout noise in a thick, fully-depleted silicon detector to overcome the readout time overhead of the Skipper-CCD. This sensor is called the Multiple-Amplifier Sensing Charge-Coupled Device (MAS-CCD) can perform multiple independent charge measurements with each amplifier, and the measurements from multiple amplifiers can be combined to further reduce the readout noise. We will show results obtained for sensors with 8 and 16 amplifiers per readout stage in new readout operations modes to optimize its readout speed. The noise reduction capability of the new techniques will be demonstrated in terms of its ability to reduce the noise by combining the information from the different amplifiers, and to resolve signals in the order of a single photon per pixel. The first readout operation explored here avoids the extra readout time needed in the MAS-CCD to read a line of the sensor associated with the extra extent of the serial register. The second technique explore the capability of the MAS-CCD device to perform a region of interest readout increasing the number of multiple samples per amplifier in a targeted region of the active area of the device.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Computing real time correlation functions on a hybrid classical/quantum computer

Quantum devices may overcome limitations of classical computers in studies of nuclear structure functions and parton Wigner distributions of protons and nuclei. In this talk, we discuss a worldline approach to compute nuclear structure functions in the high energy Regge limit of QCD using a hybrid quantum computer, by expressing the fermion determinant in the QCD path integral as a quantum mechanical path integral over 0 + 1-dimensional fermionic and bosonic world-lines in background gauge fields. Our simplest example of computing the well-known dipole model result for the structure function F 2 in the high energy Regge limit is feasible with NISQ era technology using few qubits and shallow circuits. We note this example can be scaled up in complexity and extended in scope to compute structure functions, scattering amplitudes and other real-time correlation functions in QCD, relevant for example to describe non-equilibrium transport of quarks and gluons in a Quark-Gluon-Plasma.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

"Genetically Engineered" Nanoelectronics

The Nanoelectronic Modeling Tool (NEMO) is a general-purpose quantum device design and analysis tool based on a fundamental non-equilibrium electron transport theory.

genetics↗

Efficient Implementation for Unitary Coupled Cluster State Preparation for Near-Term Quantum Computers

Unitary coupled cluster theory (UCC) is a common wave function ansatz for quantum simulation of molecular electronic structure using the variational quantum eigenvalue solver (VQE). Even for small molecules using a double-ζ basis, the number of variational parameters required to minimize the electronic energy (i.e., optimize the circuit) is large and beyond the reach of current quantum computers. For example, a circuit simulating C2 using the UCCSD ansatz and the cc-pVDZ basis set with frozen-core will require over 10,000 variational parameters and a Hilbert space of over 10^8 determinants. To make progress on simulating such molecular systems on near-term quantum computers, we explore how much of the optimization can be approximately prepared with classical simulation while reducing the number of optimization steps performed on a quantum device. Recently, Chen, Cheng, and Freericks [J. Chem. Theory Comput. 2021, 17, 841-847] presented an algorithm for the factorized form of the UCC ansatz that allows for efficient UCC optimizations on classical hardware. We flip the algorithm around and use it to prepare approximate quantum circuits for systems that require a large number of qubits to represent. We will present results from our implementation and discuss strategies for incorporating this implementation for algorithms involving near-term quantum computers.

J Wayne Mullinax↗

Efficient Implementation for Unitary Coupled Cluster State Preparation for Near-Term Quantum Computers

Unitary coupled cluster theory (UCC) is a common wave function ansatz for quantum simulation of molecular electronic structure using the variational quantum eigenvalue solver (VQE). Even for small molecules using a double-ζ basis, the number of variational parameters required to minimize the electronic energy (i.e., optimize the circuit) is large and beyond the reach of current quantum computers. For example, a circuit simulating C2 using the UCCSD ansatz and the cc-pVDZ basis set with frozen-core will require over 10,000 variational parameters and a Hilbert space of over 10^(8) determinants. To make progress on simulating such molecular systems on near-term quantum computers, we explore how much of the optimization can be approximately prepared with classical simulation while reducing the number of optimization steps performed on a quantum device. Recently, Chen, Cheng, and Freericks [J. Chem. Theory Comput. 2021, 17, 841-847] presented an algorithm for the factorized form of the UCC ansatz that allows for efficient UCC optimizations on classical hardware. We flip the algorithm around and use it to prepare approximate quantum circuits for systems that require a large number of qubits to represent. We will present results from our implementation and discuss strategies for incorporating this implementation for algorithms involving near-term quantum computers.

Quantum Computing↗