Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “qubit”

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,495 records · Page 83

Logical error rates for the surface code under a mixed coherent and stochastic circuit-level noise model inspired by trapped ions

With fault-tolerant quantum computing (FTQC) on the horizon, it is critical to understand sources of logical errors in plausible hardware implementations of quantum error-correcting codes. Detailed error modeling of computational instructions on particular FTQC architectures will enable the better prediction of error propagation in FT-encoded quantum circuits while revealing where greater attention is needed in hardware design. In this work, we consider logical error rates for the surface code implemented on a hypothetical grid-based trapped-ion quantum charge-coupled device architecture. Specifically, we construct logical channels for the idling surface code and examine its diamond error under a mixed coherent and stochastic circuit-level noise model inspired by trapped ions. We include the coherent dephasing noise that is known to accumulate during physical qubit idling and transport in these systems, determining idling and transport durations using the time-resolved output of an open-source trapped-ion surface code compiler. To estimate expectation values of logical Pauli observables following hardware circuits containing non-Clifford sources of noise, we utilize a Monte Carlo technique to sample from an underlying quasiprobability distribution of Clifford circuits that we independently simulate in a phase-sensitive fashion. We verify error suppression up to code distance 𝑑 = 11 at coherent dephasing rates near and below those of current-generation trapped-ion quantum computers and find that logical error rates align with those of analogous fully stochastic simulations in this regime. Exploring higher dephasing rates at 𝑑 = 3−5, we find evidence for growing coherent rotations about all three logical Pauli axes, increased diagonal logical error process matrix elements relative to those of stochastic simulations, and a reduced dephasing rate threshold. Overall, our work paves a way toward realistic hardware emulation of small fault-tolerant quantum processes, e.g., members of an FTQC instruction set.

Quantum benchmarking↗

Solovay-Kitaev algorithm and randomized compilation

This paper discusses a technique for randomizing over synthesized one-qubit gate sequences in order to mitigate coherent errors in fault-tolerant circuits. We present simulated and experimental data showing that randomization can reduce the trace distance to the target state.

Widzowski Maupin, Oliver Gabriel [Sandia National ↗

Magnetic Ni-N-Ni Centers in N-substituted NiO

Here, to explore how anion substitution modifies the existing magnetism in strongly correlated oxides, we investigate local electronic states and magnetic ordering in nickel oxide (NiO) induced by substituting oxygen (O) with nitrogen (N). Each N introduces an additional N 2p hole and modifies the magnetic moment of a neighboring nickel (Ni) cation site, as the exchange interaction between this hole and the Ni $e_{g}$ electrons exceeds the Ni-O-Ni superexchange interaction. This leads to the formation of Ni-N-Ni centers consisting of five spins, without perturbing the antiferromagnetic NiO lattice. These centers are studied using density functional theory and confirmed through high-resolution spectroscopy on N-substituted NiO thin films grown by molecular beam epitaxy. This type of magnetic design may enable future advances in quantum technologies based on strongly correlated materials, such as quantum sensors and spin-based qubits.

Godin, Simon [Univ. of British Columbia, Vancouver↗

Precision measurement of lifetime and branching ratios of the 4⁢𝑓 13⁡ 5⁢𝑑⁢6⁢𝑠 1 ⁢[5/2] 5/2 state in Yb + ions

We report spectroscopic and time-resolved experimental observations to characterize the [Xe]⁢4⁢𝑓 13 ⁡( 2 𝐹$^𝑜_{5/2}$)⁢5⁢𝑑⁢6⁢𝑠⁡( 1 𝐷)⁢ 1 ⁢[5/2]$^𝑜_{5/2}$ state in 172 Yb + ions. We access this state from the metastable 4⁢𝑓 14 ⁡5⁢𝑑⁡( 2 𝐷 3/2,5/2 ) manifold and observe an unexpectedly long lifetime of 𝜏 = 37.9⁢(9) ⁢µ⁢s that allows visible Rabi oscillations and resolved-sideband spectroscopy. Using a combination of coherent population dynamics, high-fidelity detection and heralded state preparation, and optical pumping methods, we measure the branching ratios to the 2 𝐷 3/2 , 2 𝐷 5/2 , and 2 𝑆 1/2 states to be 0.359⁢(2), 0.639(2), and 0.0023⁢(16), respectively. The branching ratio to the 4⁢𝑓 13⁡ 6⁢𝑠 2 ⁡( 2 𝐹 7/2 ) is compatible with zero within our experimental resolution. We also report measurements of Landé 𝑔-factor of the 1 ⁢[5/2]$^𝑜_{5/2}$ state. Further, the branching ratio of the 2 𝐷 5/2 to 2 𝑆 1/2 decay in 172 Yb + was measured to be 0.188(3), improving its relative uncertainty by an order of magnitude. Our measurements provide experimental benchmarks for better understanding the atomic structure of Yb + ions, which still lacks accurate numerical descriptions, and the use of high-lying excited states for partial detection and qubit manipulation in the omg architecture.

74 ATOMIC AND MOLECULAR PHYSICS↗

QuGrav: Bringing gravitational waves to light with qumodes

We propose using qumodes, quantum bosonic modes, for detecting high-frequency gravitational waves via the inverse Gertsenshtein effect, where a gravitational wave resonantly converts into a single photon in a magnetized cavity. For an occupation number n of the photon field in a qumode, the conversion probability is enhanced by a factor of n + 1 due to Bose-Einstein statistics. Unlocking this increased sensitivity entails the ability to continuously prepare the qumode and perform nondemolition measurement on the qumode-qubit system within the qumode coherence time. Our results indicate that, at microwave frequencies and with existing technology, the proposed setup can attain sensitivities within 1.7 orders of magnitude of the cosmological bound. With anticipated near-future improvements, it has the potential to surpass this limit and pave the way for the first exploration of high-frequency cosmological gravitational wave backgrounds. At optical frequencies, it can enhance the sensitivity of current detectors by one order of magnitude. That further enhances their potential in reaching the single-graviton level.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Spontaneously Broken Noninvertible Symmetries in Transverse-Field Ising Qudit Chains

Recent developments have revealed that symmetries need not form a group, but instead can be noninvertible. Here we use analytical arguments and numerical evidence to illuminate how spontaneous symmetry breaking of a noninvertible symmetry is similar yet distinct from ordinary, invertible, symmetry breaking. We consider one-dimensional chains of group-valued qudits, whose local Hilbert space is spanned by elements of a finite group 𝐺 (reducing to ordinary qubits when 𝐺=ℤ 2 ). We construct Ising-type transverse-field Hamiltonians with Rep⁡(𝐺) symmetry whose generators multiply according to the tensor product of irreducible representations (irreps) of the group 𝐺 . For non-Abelian 𝐺 , the symmetry is noninvertible. In the symmetry broken phase there is one ground state per irrep on a closed chain. The symmetry breaking can be detected by local order parameters but, unlike the invertible case, different ground states have distinct entanglement patterns. We show that for each irrep of dimension greater than one the corresponding ground state exhibits string order, entanglement spectrum degeneracies, and has gapless edge modes on an open chain—features usually associated with symmetry-protected topological order. Consequently, domain wall excitations behave as one-dimensional non-Abelian anyons with nontrivial internal Hilbert spaces and fusion rules. Our Letter identifies properties of noninvertible symmetry breaking that existing quantum hardware can probe.

1-dimensional spin chains↗

Trajectory-independent speed limits for controlled open quantum systems

Existing quantum speed limits for controlled open quantum systems depend on the specified trajectory. For example, lower bounds on quantum annealing times in the presence of dissipation depend explicitly on the chosen annealing schedule. Recently, schedule-independent speed limits have been derived for annealing in the closed quantum system setting [L. P. García-Pintos et al ., SciPost Phys. 18 , 159 (2025)]. In this work, we generalize these results to open quantum systems, deriving schedule-independent lower bounds for quantum annealing times in systems described by a Lindblad master equation. We analyze the interplay between coherent control and dissipation in single- and two-qubit examples, demonstrating that the derived lower bounds capture key scaling behavior with respect to the strength of the dissipator. Finally, we apply the bound to thermal state preparation and show that the bound matches the expected asymptotic behavior for an Ising model in the high-temperature limit.

open quantum systems & decoherence↗

Quantum algorithms for disordered physics

We show how a quantum computer may efficiently simulate a disordered Hamiltonian, by incorporating a pseudo-random number generator directly into the time evolution circuit. This technique is applied to quantum simulation of few-body disordered systems in the large volume limit; in particular, Anderson localization. The method requires a number of (error corrected) qubits proportional to the logarithm of the volume of the system, and each time evolution step requires a number of gates polylogarithmic in the volume. We simulate the method to observe the metal-insulator transition on a three-dimensional lattice. Additionally, we demonstrate the algorithm on a one-dimensional lattice, using physical quantum processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spectral-density estimation with the Gaussian integral transform

The spectral-density operator $\hat{ρ}(ω) = δ(ω–\hat{H})$ plays a central role in linear response theory as its expectation value, the dynamical response function, can be used to compute scattering cross sections. In this work, we describe a near optimal quantum algorithm providing an approximation to the spectral density with energy resolution $\Delta$ and error $\epsilon$ using $O(\sqrt{\text{log}_2 (1/ε)[\text{log}_2 (1 / Δ) + \text{log}_2 (1/ε)]/ Δ)}$ operations. This is achieved without using expensive approximations to the time-evolution operator, but instead exploiting qubitization to implement an approximate Gaussian integral transform of the spectral density. Finally, we also describe appropriate error metrics to assess the quality of the spectral function approximations more generally.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Error detection on quantum computers improving the accuracy of chemical calculations

The ultimate goal of quantum error correction is to achieve the fault-tolerance threshold beyond which quantum computers can be made arbitrarily accurate. This requires extraordinary resources and engineering efforts. We show that even without achieving full fault-tolerance, quantum error detection is already useful on the current generation of quantum hardware. We demonstrate this by executing an end-to-end chemical calculation for the hydrogen molecule encoded in the [[4, 2, 2]] quantum error-detecting code. The encoded calculation with logical qubits significantly improves the accuracy of the molecular ground-state energy.

97 MATHEMATICS AND COMPUTING↗

Approximate quantum circuit synthesis using block encodings

One of the challenges in quantum computing is the synthesis of unitary operators into quantum circuits with polylogarithmic gate complexity. Exact synthesis of generic unitaries requires an exponential number of gates in general. We propose a novel approximate quantum circuit synthesis technique by relaxing the unitary constraints and interchanging them for ancilla qubits via block encodings. This approach combines smaller block encodings, which are easier to synthesize, into quantum circuits for larger operators. Due to the use of block encodings, our technique is not limited to unitary operators and can be applied for the synthesis of arbitrary operators. Overall, we show that operators which can be approximated by a canonical polyadic expression with a polylogarithmic number of terms can be synthesized with polylogarithmic gate complexity with respect to the matrix dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fixed-point quantum circuits for quantum field theories

Renormalization group ideas and effective operators are introduced to efficiently prepare ground states of massive lattice field theories on digital quantum devices. This is accomplished with a systematic approximation through localized unitaries that removes an exponentially costly barrier in the spatial volume of the quantum simulation. With these methods, classically computed ground states in a spatial volume L, containing a few Compton wavelengths, can be used to determine operators for preparing the ground state toward the thermodynamic limit with a precision improving as e –mL on beyond-classical quantum registers. Here, due to the exponential spatial decay of correlations in massive theories and the double exponential suppression of digitization artifacts in the number of qubits representing the scalar field, the derived fixed-point quantum circuits are expected to be relevant for simulations of quantum field theories throughout the evolution from small-scale near-term quantum devices to large-scale fault-tolerant quantum computers.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Efficient phase-factor evaluation in quantum signal processing

Quantum signal processing (QSP) is a powerful quantum algorithm to exactly implement matrix polynomials on quantum computers. Asymptotic analysis of quantum algorithms based on QSP has shown that asymptotically optimal results can in principle be obtained for a range of tasks, such as Hamiltonian simulation and the quantum linear system problem. A further benefit of QSP is that it uses a minimal number of ancilla qubits, which facilitates its implementation on near-to-intermediate term quantum architectures. However, there is so far no classically stable algorithm allowing computation of the phase factors that are needed to build QSP circuits. Existing methods require the use of variable precision arithmetic and can only be applied to polynomials of a relatively low degree. We present here an optimization-based method that can accurately compute the phase factors using standard double precision arithmetic operations. We demonstrate the performance of this approach with applications to Hamiltonian simulation, eigenvalue filtering, and quantum linear system problems. Furthermore, our numerical results show that the optimization algorithm can find phase factors to accurately approximate polynomials of a degree larger than 10000 with errors below 10 -12 .

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Impacts of noise and structure on quantum information encoded in a quantum memory

As larger, higher-quality quantum devices are built and demonstrated in quantum information applications, such as quantum computation and quantum communication, the need for high-quality quantum memories to store quantum states becomes ever more pressing. Future quantum devices likely will use a variety of physical hardware, some being used primarily for processing of quantum information and others for storage. Here we study the correlation of the structure of quantum information with physical noise models of various possible quantum memory implementations. Through numerical simulation of different noise models and approximate analytical formulas applied to a variety of interesting quantum states, we provide comparisons between quantum hardware with different structure, including both qubit- and qudit-based quantum memories. Our findings point to simple, experimentally relevant formulas for the relative lifetimes of quantum information in different quantum memories and have relevance to the design of hybrid quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum simulation of nuclear inelastic scattering

We present a time-dependent quantum algorithm for nuclear inelastic scattering in the time-dependent basis function on qubits approach. This algorithm aims to quantum simulate a subset of the nuclear inelastic scattering problems that are of physical interest in which the internal degrees of freedom of the reaction system are excited by time-dependent external interactions. We expect that our algorithm will enable an exponential speedup in simulating the dynamics of the subset of the inelastic scattering problems, which would also be advantageous for the applications to more complicated scattering problems. For a demonstration problem, we solve for the Coulomb excitation of the deuteron, where the quantum simulations are performed with IBM Qiskit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Probabilistic simulation of quantum circuits using a deep-learning architecture

The fundamental question of how to best simulate quantum systems using conventional computational resources lies at the forefront of condensed matter and quantum computation. It impacts both our understanding of quantum materials and our ability to emulate quantum circuits. Here we present an exact formulation of quantum dynamics via factorized generalized measurements which maps quantum states to probability distributions with the advantage that local unitary dynamics and quantum channels map to local quasistochastic matrices. This representation provides a general framework for using state-of-the-art probabilistic models in machine learning for the simulation of quantum many-body dynamics. Using this framework, we have developed a practical algorithm to simulate quantum circuits using an attention network based on a powerful neural network ansatz responsible for the most recent breakthroughs in natural language processing. We demonstrate our approach by simulating circuits that build Greenberger-Horne-Zeilinger and linear graph states of up to 60 qubits, as well as a variational quantum eigensolver circuit for preparing the ground state of the transverse field Ising model on several system sizes. Our methodology constitutes a modern machine learning approach to the simulation of quantum physics with applicability both to quantum circuits as well as other quantum many-body systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Toward witnessing molecular exciton entanglement from spectroscopy

Entanglement is a defining feature of quantum mechanics that can be a resource in engineered and natural systems, but measuring entanglement in experiment remains elusive especially for large chemical systems. Most practical approaches require determining and measuring a suitable entanglement witness which provides some level of information about the entanglement structure of the probed state. A fundamental quantity of quantum metrology is the quantum Fisher information (QFI), which is a rigorous witness of multipartite entanglement that can be evaluated from linear response functions for certain states. Here, in this paper, we explore measuring the QFI of molecular exciton states of the first-excitation subspace from spectroscopy. In particular, we utilize the fact that the linear response of a pure state subject to a weak electric field over all possible driving frequencies encodes the variance of the collective dipole moment in the probed state, which is a valid measure for QFI. The systems that are investigated include the molecular dimer, N-site linear aggregate with nearest-neighbor coupling, and N-site circular aggregate, all modeled as a collection of interacting qubits. Our theoretical analysis shows that the variance of the collective dipole moment in the brightest dipole-allowed eigenstate is the maximum QFI. The optical response of a thermally equilibrated state in the first-excitation subspace is also a valid QFI. Theoretical predictions of the measured QFI for realistic linear dye aggregates as a function of temperature and energetic disorder due to static variations of the host matrix show that two- to three-partite entanglement is realizable. This paper lays some groundwork and inspires measurement of multipartite entanglement of molecular excitons with ultrafast pump-probe experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Filtering states with total spin on a quantum computer

Starting from a general wave-function described on a set of spins or qubits, we propose several quantum algorithms to extract the components of this state on eigenstates of total spin S 2 and its z component S z . The method plays the role of total spin projection and gives access to the amplitudes of the initial state on a total spin basis. Here, the different algorithms have various degrees of sophistication depending on the requested tasks. They can either solely project onto the subspace with good total spin or completely uplift the degeneracy in this subspace. In the former case, when the projection on the total spin j is made, we show that the number of operations for the projection can be reduced from a quadratic to a linear dependence in j. After each measurement, the state collapses to one of the spin eigenstates that could be used for postprocessing. For this reason, we call the method total quantum spin filtering.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗