Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum computer”

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 379 records · Page 21

Lattice holography on a quantum computer

We explore the potential application of quantum computers to the examination of lattice holography, which extends to the strongly coupled bulk theory regime. With adiabatic evolution, we compute the ground state of a spin system on a ( 2 + 1 )-dimensional hyperbolic lattice, and measure the spin-spin correlation function on the boundary. Notably, we observe that with achievable resources for coming quantum devices, the correlation function demonstrates an approximate scale-invariant behavior, aligning with the pivotal theoretical predictions of the anti–de Sitter/conformal field theory correspondence. Published by the American Physical Society 2024

97 MATHEMATICS AND COMPUTING↗

Readout rebalancing for near-term quantum computers

Readout errors are a significant source of noise for near-term intermediate-scale quantum computers. Mismeasuring a qubit as |1) when it should be |0) occurs much less often than mismeasuring a qubit as |0) when it should have been |1). We make the simple observation that one can improve the readout fidelity of quantum computers by applying targeted X gates prior to performing a measurement. These X gates are placed so that the expected number of qubits in the |1) state is minimized. Classical postprocessing can undo the effect of the X gates so that the expectation value of any observable is unchanged. This protocol is designed to have no effect when readout errors are symmetric. We show that the statistical uncertainty following readout error corrections is smaller when using readout rebalancing. The statistical advantage is circuit and computer dependent and is demonstrated for the W state, a Grover search, and for a Gaussian state. The benefit in statistical precision is most pronounced (and nearly a factor of 2 in some cases) when states with many qubits in the excited state have high probability.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Universal linear Bogoliubov transformations through one-way quantum computation

We show explicitly how to realize an arbitrary linear unitary Bogoliubov (LUBO) transformation on a multimode quantum state through homodyne-based one-way quantum computation. Any LUBO transformation can be approximated by means of a fixed, finite-sized, sufficiently squeezed Gaussian cluster state that allows for the implementation of beam splitters (in form of three-mode connection gates) and general one-mode LUBO transformations. In particular, we demonstrate that a linear four-mode cluster state is a sufficient resource for an arbitrary one-mode LUBO transformation. Arbitrary-input quantum states including non-Gaussian states could be efficiently attached to the cluster through quantum teleportation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Block encodings of discrete subgroups on a quantum computer

We introduce a block encoding method for mapping discrete subgroups to qubits on a quantum computer. This method is applicable to general discrete groups, including crystal-like subgroups such as BI of S U ( 2 ) and V of S U ( 3 ) . We detail the construction of primitive gates—the inversion gate, the group multiplication gate, the trace gate, and the group Fourier gate—utilizing this encoding method for BT and for the first time BI group. We also provide resource estimations to extract the gluon viscosity. The inversion gates for BT and BI are benchmarked on the quantum computer with estimated fidelities of 40 − 4 + 5 % and 4 − 3 + 5 % , respectively. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Generalized Unitary Coupled Cluster Wave functions for Quantum Computation

We introduce a unitary coupled-cluster (UCC) ansatz termed k-UpCCGSD that is based on a family of sparse generalized doubles operators, which provides an affordable and systematically improvable unitary coupled-cluster wave function suitable for implementation on a near-term quantum computer. k-UpCCGSD employs k products of the exponential of pair coupled-cluster double excitation operators (pCCD), together with generalized single excitation operators. We compare its performance in both efficiency of implementation and accuracy with that of the generalized UCC ansatz employing the full generalized single and double excitation operators (UCCGSD), as well as with the standard ansatz employing only single and double excitations (UCCSD). k-UpCCGSD is found to show the best scaling for quantum computing applications, requiring a circuit depth of O(kN) , compared with O(N 3 ) for UCCGSD, and O((N-η) 2 η) for UCCSD, where N is the number of spin orbitals and η is the number of electrons. We analyzed the accuracy of these three ansätze by making classical benchmark calculations on the ground state and the first excited state of H 4 (STO-3G, 6-31G), H 2 O (STO-3G), and N 2 (STO-3G), making additional comparisons to conventional coupled cluster methods. The results for ground states show that k-UpCCGSD offers a good trade-off between accuracy and cost, achieving chemical accuracy for lower cost of implementation on quantum computers than both UCCGSD and UCCSD. UCCGSD is also found to be more accurate than UCCSD but at a greater cost for implementation. Excited states are calculated with an orthogonally constrained variational quantum eigensolver approach. This is seen to generally yield less accurate energies than for the corresponding ground states. Lastly, we demonstrate that using a specialized multideterminantal reference state constructed from classical linear response calculations allows these excited state energetics to be improved.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The basics of quantum computing for chemists

The rapid and successful strides in quantum chemistry in the past decades can be largely credited to a conspicuous synergy between theoretical and computational advancements. However, the architectural computer archetype that enabled such a progress is approaching a state of more stagnant development. One of the most promising technological avenues for the continuing progress of quantum chemistry is the emerging quantum computing paradigm. This revolutionary proposal comes with several challenges, which span a wide array of disciplines. In chemistry, it implies, among other things, a need to reformulate some of its long established cornerstones in order to adjust to the operational demands and constraints of quantum computers. Due to its relatively recent emergence, much of quantum computing may still seem fairly nebulous and largely unknown to most chemists. It is in this context that here we review and illustrate the basic aspects of quantum information and their relation to quantum computing insofar as enabling simulations of quantum chemistry. As a result, we consider some of the most relevant developments in light of these aspects and discuss the current landscape when of relevance to quantum chemical simulations in quantum computers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Simulation of classical thermal states on a quantum computer: A transfer-matrix approach

We present a hybrid quantum-classical algorithm to simulate thermal states of classical Hamiltonians on a quantum computer. Our scheme employs a sequence of locally controlled rotations, building up the desired state by adding qubits one at a time. We identified a class of classical models for which our method is efficient and avoids potential exponential overheads encountered by Grover-like or quantum Metropolis schemes. Our algorithm also gives an exponential advantage for two-dimensional Ising models with magnetic field on a square lattice, compared with the previously known Zalka's algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Implementation and analysis of quantum computing application to Higgs boson reconstruction at the large Hadron Collider

With the advent of the High-Luminosity Large Hadron Collider (HL-LHC) era, high energy physics (HEP) event selection will require new approaches to rapidly and accurately analyze vast databases. The current study addresses the enormity of HEP databases in an unprecedented manner—a quantum search using Grover’s Algorithm (GA) on an unsorted database, ATLAS Open Data, from the ATLAS detector. A novel method to identify rare events at 13 TeV in CERN’s LHC using quantum computing (QC) is presented. As indicated by the Higgs boson decay channel H→ZZ*→4l , the detection of four leptons in one event may be used to reconstruct the Higgs boson and, more importantly, evince Higgs boson decay to some new phenomena, such as H→ZZ d →4l . Searching the dataset for collisions resulting in detection of four leptons using a Jupyter Notebook, a classical simulation of GA, and several quantum computers with multiple qubits, the current application was found to make the proper selection in the unsorted dataset. Quantum search efficacy was analyzed for the incoming HL-LHC by implementing the QC method on multiple classical simulators and IBM’s quantum computers with the IBM Qiskit Open Source Software. The current QC application provides a novel, high-efficiency alternative to classical database searches, demonstrating its potential utility as a rapid and increasingly accurate search method in HEP.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Quantum Computing and Simulations for Energy Applications

While quantum computing (QC) is considered as a paradigm shift in our basic understanding of physical computation, effective implementation of QC in energy applications also depends on progress and development in the dimensions of both QC hardware and algorithms. To fully address the status and future challenges of QC applied within the energy sector, in this presentation, we firstly summarize recent advancements on the applications of QC to energy infrastructure and materials, complex energy system processes, advanced manufacturing, and energy system security. Then, we will demonstrate the results of QC performed both on a simulator and a quantum device targeting on energy-related applications.

Paudel, Hari P.↗

Two-dimensional color-code quantum computation

We describe in detail how to perform universal fault-tolerant quantum computation on a two-dimensional color code, making use of only nearest neighbor interactions. Three defects (holes) in the code are used to represent logical qubits. Triple-defect logical qubits are deformed into isolated triangular sections of color code to enable transversal implementation of all single logical qubit Clifford group gates. Controlled-NOT (CNOT) is implemented between pairs of triple-defect logical qubits via braiding.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Report for the ASCR Workshop on Basic Research Needs in Quantum Computing and Networking - 2023

Employing quantum mechanical resources in computing and networking opens the door to new computation and communication models and potential disruptive advantages over classical counterparts. However, quantifying and realizing such advantages face extensive scientific and engineering challenges. Investments by the Department of Energy (DOE) have driven progress toward addressing such challenges. Quantum algorithms have been recently developed, in some cases offering asymptotic exponential advantages in speed or accuracy, for fundamental scientific problems such as simulating physical systems, solving systems of linear equations, or solving differential equations. Empirical demonstrations on nascent quantum hardware suggest better performance than classical analogs on specialized computational tasks favorable to the quantum computing systems. However, demonstration of an end-to-end, substantial and rigorously quantifiable quantum performance advantage over classical analogs remains a grand challenge, especially for problems of practical value. The definition of requirements for quantum technologies to exhibit scalable, rigorous, and transformative performance advantages for practical applications also remains an outstanding open question, namely, what will be required to ultimately demonstrate practical quantum advantage?

97 MATHEMATICS AND COMPUTING↗

Report for the ASCR Workshop on Basic Research Needs in Quantum Computing and Networking - 2023

Employing quantum mechanical resources in computing and networking opens the door to new computation and communication models and potential disruptive advantages over classical counterparts. However, quantifying and realizing such advantages face extensive scientific and engineering challenges. Investments by the Department of Energy (DOE) have driven progress toward addressing such challenges. Quantum algorithms have been recently developed, in some cases offering asymptotic exponential advantages in speed or accuracy, for fundamental scientific problems such as simulating physical systems, solving systems of linear equations, or solving differential equations. Empirical demonstrations on nascent quantum hardware suggest better performance than classical analogs on specialized computational tasks favorable to the quantum computing systems. However, demonstration of an end-to-end, substantial and rigorously quantifiable quantum performance advantage over classical analogs remains a grand challenge, especially for problems of practical value. The definition of requirements for quantum technologies to exhibit scalable, rigorous, and transformative performance advantages for practical applications also remains an outstanding open question, namely, what will be required to ultimately demonstrate practical quantum advantage?

97 MATHEMATICS AND COMPUTING↗

Digitization of scalar fields for quantum computing

Qubit, operator, and gate resources required for the digitization of lattice λΦ 4 scalar field theories onto quantum computers are considered, building upon the foundational work by Jordan et al. [Quantum Inf. Comput. 14, 1014 (2014); Science 336, 1130 (2012)], with a focus towards noisy intermediate-scale quantum devices. The Nyquist-Shannon sampling theorem, introduced in this context by Macridin et al. [Phys. Rev. A 98, 042312 (2018)] building on the work of Somma [Quantum Inf. Comput. 16, 1125 (2016)], provides a guide with which to evaluate the efficacy of two field-space bases, the eigenstates of the field operator, as used by Jordan et al., and eigenstates of a harmonic oscillator, to describe ( 0 + 1 )- and ( d + 1 )-dimensional scalar field theory. We show how techniques associated with improved actions, which are heavily utilized in lattice QCD calculations to systematically reduce lattice-spacing artifacts, can be used to reduce the impact of the field digitization in λΦ 4 , but are found to be inferior to a complete digitization improvement of the Hamiltonian using a quantum Fourier transform. When the Nyquist-Shannon sampling theorem is satisfied, digitization errors scale as | log | log | ε dig | | | ~ n Q (number of qubits describing the field at a given spatial site) for the low-lying states, leaving the familiar power-law lattice-spacing and finite-volume effects that scale as | log | ε latt | | ~ N Q (total number of qubits in the simulation). For localized (delocalized) field-space wave functions, it is found that n Q ~ 4 ( 7 ) qubits per spatial lattice site are sufficient to reduce theoretical digitization errors below error contributions associated with approximation of the time-evolution operator and noisy implementation on near-term quantum devices. Only classical computing resources have been used to obtain the results presented in this work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spin-transparent storage rings for quantum computing

Spin-transparent storage rings, where any spin direction repeats after one full turn, can be used in conjunction with ion traps as a new quantum computing platform [1]. Advantages of spin-transparent rings for quantum computing include: large numbers of stored qubits; long quantum coherence times of up to several hours; long storage lifetimes; and room temperature operation. These exceptional qualities mean rings could provide a scalable way to implement algorithms with deep complexity requiring many quantum operations while simultaneously providing a large number of qubits. This new platform where the qubit has long quantum coherence time can also be used as a quantum sensor or a part of a quantum memory.

Accelerator Physics↗

Kitaev model on a quantum computer using VQE with Majorana fermions

We study the simulation of the Kitaev spin model on quantum computers. In particular we focus on the models defined on the honeycomb, and square-octagon lattices. Using a fermionic language to describe these models reveals a region of the parameter space that is exactly solvable. We explore an ansatz that is capable of expressing the ground state in the exactly solvable region of the parameter space and extend it outside this region with good accuracy. Doing the calculation using fermions, while requiring the introduction of a non-local map from the fermionic Hilbert space to that of qubits, offers the potentially interesting application of realizing non-abelian anyons on quantum computers, and can also lead to a reduction in the number of qubits required by half.

Jahin, Ammar↗

Fermion determinants on a quantum computer

We present a quantum algorithm to compute the logarithm of the determinant of the fermion matrix, assuming access to a classical lattice gauge field configuration. The algorithm uses the quantum eigenvalue transform, and quantum mean estimation, giving a query complexity that scales like O ( V log ( V ) ) in the matrix dimension V . Published by the American Physical Society 2025

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Variational Simulation of the Lipkin-Meshkov-Glick Model on a Neutral Atom Quantum Computer

We simulate the Lipkin-Meshkov-Glick model using the variational-quantum-eigensolver algorithm on a neutral atom quantum computer. We test the ground-state energy of spin systems with up to 15 spins. Two different encoding schemes are used: an individual spin encoding where each spin is represented by one qubit, and an efficient Gray code encoding scheme that only requires a number of qubits that scales with the logarithm of the number of spins. This more efficient encoding, together with zero-noise extrapolation techniques, is shown to improve the fidelity of the simulated energies with respect to exact solutions.

97 MATHEMATICS AND COMPUTING↗

QPatLib: A community repository of measurement-based quantum computing patterns

QPatLib is a community repository of measurement‑based quantum computing (MBQC) patterns and associated metadata, intended to support reuse, benchmarking, and reproducible comparison of MBQC constructions across platforms and compilers. Patterns in QPatLib are expressed in a standardized, human‑readable measurement calculus representation. Details can be found here: https://doi.org/10.48550/arXiv.2605.12502

graph states↗