Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum stochastic processes”

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 37 records · Page 2

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↗

Effective description of ajar systems with a 𝑈⁡(1) symmetry

We introduce the concept of “ajar systems” as an intermediate case between closed and open systems, where the time scale for charge exchange with the environment is parametrically larger than all other characteristic time scales. The Schwinger-Keldysh effective action for such finite-temperature systems exhibits a symmetry group G 1 × G 2 weakly broken to its diagonal subgroup G diag , which we systematically describe using spurion techniques. For G = U(1), we calculate leading-order corrections to correlation functions in both diffusive and spontaneously broken phases. Unlike systems with approximate symmetries where both real and imaginary parts of dispersion relations receive corrections, ajar systems modify only the imaginary part—preserving gapless modes while adding finite damping.

Effective field theory↗

Classical shadows for quantum process tomography on near-term quantum computers

Quantum process tomography is a powerful tool for understanding quantum channels and characterizing the properties of quantum devices. Inspired by recent advances using classical shadows in quantum state tomography [H.-Y. Huang, R. Kueng, and J. Preskill, .], we have developed ShadowQPT, a classical shadow method for quantum process tomography. We introduce two related formulations with and without ancilla qubits. ShadowQPT stochastically reconstructs the Choi matrix of the device allowing for an classical evaluation of the device on arbitrary inputs with respect to arbitrary outputs. Using shadows, we then show how to compute overlaps, generate all k -weight reduced processes, and perform reconstruction via Hamiltonian learning. These latter two tasks are efficient for large systems as the number of quantum measurements needed scales only logarithmically with the number of qubits. A number of additional approximations and improvements are developed, including the use of a pair-factorized Clifford shadow and a series of postprocessing techniques that significantly enhance the accuracy for recovering the quantum channel. We have implemented ShadowQPT using both Pauli and Clifford measurements on the IonQ trapped ion quantum computer for quantum processes up to n = 4 qubits, and we achieved good performance. Published by the American Physical Society 2024

Levy, Ryan (ORCID:0000000349527156)↗

Experimental quantum Bernoulli factories via Bell-basis measurements

Randomness processing in the Bernoulli factory framework provides a concrete setting in which quantum resources can outperform classical ones. We experimentally demonstrate quantum randomness processing based on Bell-basis measurements of two identical input quoins prepared on IBM superconducting hardware. Using only the measurement outcomes (and no external classical randomness source), we realize the classically inconstructible Bernoulli doubling primitive f(p)=2p, and, as intermediate outputs from the same Bell-measurement statistics, an exact fair coin f(p)=1/2 and the classically inconstructible function f(p)=4p(1−p). We benchmark the measured output biases against ideal predictions and discuss the impact of device noise. Our results establish a simple resource-efficient experimental primitive for quantum-to-classical randomness processing and support the viability of quantum Bernoulli factories for quantum-enhanced stochastic simulation and sampling tasks.

Roy, Tanay [Fermilab] (ORCID:000000019442862X)↗

Two-Stage Estimation and Variance Modeling for Latency-Constrained Variational Quantum Algorithms

The quantum approximate optimization algorithm (QAOA) has enjoyed increasing attention in noisy, intermediate-scale quantum computing with its application to combinatorial optimization problems. QAOA has the potential to demonstrate a quantum advantage for NP-hard combinatorial optimization problems. As a hybrid quantum-classical algorithm, the classical component of QAOA resembles a simulation optimization problem in which the simulation outcomes are attainable only through a quantum computer. The simulation that derives from QAOA exhibits two unique features that can have a substantial impact on the optimization process: (i) the variance of the stochastic objective values typically decreases in proportion to the optimality gap, and (ii) querying samples from a quantum computer introduces an additional latency overhead. In this paper, we introduce a novel stochastic trust-region method derived from a derivative-free, adaptive sampling trust-region optimization method intended to efficiently solve the classical optimization problem in QAOA by explicitly taking into account the two mentioned characteristics. The key idea behind the proposed algorithm involves constructing two separate local models in each iteration: a model of the objective function and a model of the variance of the objective function. Exploiting the variance model allows us to restrict the number of communications with the quantum computer and also helps navigate the nonconvex objective landscapes typical in QAOA optimization problems. In conclusion, we numerically demonstrate the superiority of our proposed algorithm using the SimOpt library and Qiskit when we consider a metric of computational burden that explicitly accounts for communication costs.

Derivative-free Optimization↗

Nonadiabatic transition paths from quantum jump trajectories

We present a means of studying rare reactive pathways in open quantum systems using transition path theory and ensembles of quantum jump trajectories. This approach allows for the elucidation of reactive paths for dissipative, nonadiabatic dynamics when the system is embedded in a Markovian environment. Here, we detail the dominant pathways and rates of thermally activated processes and the relaxation pathways and photoyields following vertical excitation in a minimal model of a conical intersection. We find that the geometry of the conical intersection affects the electronic character of the transition state as defined through a generalization of a committor function for a thermal barrier crossing event. Similarly, the geometry changes the mechanism of relaxation following a vertical excitation. Relaxation in models resulting from small diabatic coupling proceeds through pathways dominated by pure dephasing, while those with large diabatic coupling proceed through pathways limited by dissipation. The perspective introduced here for the nonadiabatic dynamics of open quantum systems generalizes classical notions of reactive paths to fundamentally quantum mechanical processes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

TOF-SIMS analysis of decoherence sources in superconducting qubits

Superconducting qubits have emerged as a potentially foundational platform technology for addressing complex computational problems deemed intractable with classical computing. Despite recent advances enabling multiqubit designs that exhibit coherence lifetimes on the order of hundreds of μs, material quality and interfacial structures continue to curb device performance. Two-level system defects in the thin superconducting film and adjacent dielectric regions introduce stochastic noise and dissipate electromagnetic energy at the cryogenic operating temperatures. In this study, we utilize time-of-flight secondary ion mass spectrometry to understand the role specific fabrication procedures play in introducing such dissipation mechanisms in these complex systems. We interrogated Nb thin films and transmon qubit structures fabricated through slight modifications in the processing and vacuum conditions. We find that when the Nb film is sputtered onto the Si substrate, oxide and silicide regions are generated at various interfaces. We also observe that impurity species, such as niobium hydrides and carbides, are incorporated within the niobium layer during the subsequent lithographic patterning steps. The formation of these resistive compounds likely impacts the superconducting properties of the Nb thin film. Additionally, we observe the presence of halogen species distributed throughout the patterned thin films. We conclude by hypothesizing the source of such impurities in these structures in an effort to intelligently fabricate superconducting qubits and extend coherence times moving forward.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Reshaping the Quantum Arrow of Time

While the microscopic laws of physics are often symmetric under time reversal, most natural processes that we observe are not. The emergent asymmetry between typical and time-reversed processes is referred to as the arrow of time. In quantum physics, an arrow of time emerges when a sequence of measurements is performed on a system. We introduce quantum control tools that can yield dynamics more consistent with time flowing backward than forward. The control tools are based on the explicit construction of a Hamiltonian that can replicate the stochastic trajectories of a monitored quantum system. Such a Hamiltonian can reverse the effect of monitoring and, via a feedback process, generate trajectories consistent with a reversed arrow of time. It can also be used to simulate the backward-in-time dynamics of an open quantum system. Finally, we design a feedback-driven continuous measurement engine powered by the energy pumped into the system by the monitoring process. We show that the engine can operate under experimentally realizable conditions with feedback delay and finite-efficiency measurements.

Entropy production↗

Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale

The numerical simulation of quantum circuits is an indispensable tool for development, verification, and validation of hybrid quantum-classical algorithms intended for near-term quantum co-processors. The emergence of exascale high-performance computing (HPC) platforms presents new opportunities for pushing the boundaries of quantum circuit simulation. Here, we present a modernized version of the Tensor Network Quantum Virtual Machine (TNQVM) that serves as the quantum circuit simulation backend in the eXtreme-scale ACCelerator (XACC) framework. The new version is based on the scalable tensor network processing library ExaTN (Exascale Tensor Networks). It provides multiple configurable quantum circuit simulators that perform either an exact quantum circuit simulation via the full tensor network contraction or an approximate simulation via a suitably chosen tensor factorization scheme. Upon necessity, stochastic noise modeling from real quantum processors is incorporated into the simulations by modeling quantum channels with Kraus tensors. By combining the portable XACC quantum programming frontend and the scalable ExaTN numerical processing backend, we introduce an end-to-end virtual quantum development environment that can scale from laptops to future exascale platforms. We report initial benchmarks of our framework, which include a demonstration of the distributed execution, incorporation of quantum decoherence models, and simulation of the random quantum circuits used for the certification of quantum supremacy on Google’s Sycamore superconducting architecture.

Nguyen, Thien↗

Microscopic Theory of Fluctuating Hydrodynamics in Nonlinear Lattices

The theory of fluctuating hydrodynamics has been an important tool for analyzing macroscopic behavior in nonlinear lattices. However, despite its practical success, its microscopic derivation is still incomplete. In this work, we provide the microscopic derivation of fluctuating hydrodynamics, using the coarse-graining and projection technique; the equivalence of ensembles turns out to be critical. The Green-Kubo (GK)-like formula for the bare transport coefficients are presented in a numerically computable form. Our numerical simulations show that the bare transport coefficients exist for a sufficiently large but finite coarse-graining length in the infinite lattice within the framework of the GK-like formula. Finally, this demonstrates that the bare transport coefficients uniquely exist for each physical system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Realistic simulations of spin squeezing and cooperative coupling effects in large ensembles of interacting two-level systems

We describe an efficient numerical method for simulating the dynamics of interacting spin ensembles in the presence of dephasing and decay. The method builds on the discrete truncated Wigner approximation for isolated systems, which combines the mean-field dynamics of a spin ensemble with a Monte Carlo sampling of discrete initial spin values to account for quantum correlations. Here we show how this approach can be generalized for dissipative spin systems by replacing the deterministic mean-field evolution by a stochastic process, which describes the decay of coherences and populations while preserving the length of each spin. We demonstrate the application of this technique for simulating nonclassical spin-squeezing effects or the dynamics and steady states of cavity QED models with 10 5 interacting two-level systems. This opens up the possibility to perform accurate real-scale simulations of a diverse range of experiments in quantum optics or with solid-state spin ensembles under realistic laboratory conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spin-squeezed Gottesman-Kitaev-Preskill codes for quantum error correction in atomic ensembles

Gottesman-Kitaev-Preskill (GKP) codes encode a qubit in displaced phase-space combs of a continuous-variable (CV) quantum system and are useful for correcting a variety of high-weight photonic errors. Here we propose atomic ensemble analogs of the single-mode CV GKP code by using the quantum central limit theorem to pull back the phase-space structure of a CV system to the compact phase space of a quantum spin system. We study the optimal recovery performance of these codes under error channels described by stochastic relaxation and isotropic ballistic dephasing processes using the diversity combining approach for calculating channel fidelity. Additionally, we find that the spin GKP codes outperform other spin system codes such as cat codes or binomial codes. Our spin GKP codes based on the two-axis countertwisting interaction and superpositions of SU(2) coherent states are direct spin analogs of the finite-energy CV GKP codes, whereas our codes based on one-axis twisting do not yet have well-studied CV analogs. A state preparation scheme for the spin GKP codes is proposed which uses the linear-combination-of-unitaries method, applicable to both the CV and spin GKP settings. Finally, we discuss a fault-tolerant approximate gate set for quantum computing with spin-GKP-encoded qubits, obtained by translating gates from the CV GKP setting using the quantum central limit theorem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Full Counting Statistics of Charge in Chaotic Many-Body Quantum Systems

We investigate the full counting statistics of charge transport in U(1)-symmetric random unitary circuits. We consider an initial mixed state prepared with a chemical potential imbalance between the left and right halves of the system and study the fluctuations of the charge transferred across the central bond in typical circuits. Using an effective replica statistical mechanics model and a mapping onto an emergent classical stochastic process valid at large on-site Hilbert space dimension, we show that charge transfer fluctuations approach those of the symmetric exclusion process at long times, with subleading t –1/2 quantum corrections. Here, we discuss our results in the context of fluctuating hydrodynamics and macroscopic fluctuation theory of classical nonequilibrium systems and check our predictions against direct matrix-product state calculations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Towards provably efficient quantum algorithms for large-scale machine-learning models

Large machine learning models are revolutionary technologies of artificial intelligence whose bottlenecks include huge computational expenses, power, and time used both in the pre-training and fine-tuning process. In this work, we show that fault-tolerant quantum computing could possibly provide provably efficient resolutions for generic (stochastic) gradient descent algorithms, scaling as $\mathcal{O}$(T 2 x polylog($n$)), where n is the size of the models and T is the number of iterations in the training, as long as the models are both sufficiently dissipative and sparse, with small learning rates. Based on earlier efficient quantum algorithms for dissipative differential equations, we find and prove that similar algorithms work for (stochastic) gradient descent, the primary algorithm for machine learning. In practice, we benchmark instances of large machine learning models from 7 million to 103 million parameters. We find that, in the context of sparse training, a quantum enhancement is possible at the early stage of learning after model pruning, motivating a sparse parameter download and re-upload scheme. Our work shows solidly that fault-tolerant quantum algorithms could potentially contribute to most state-of-the-art, large-scale machine-learning problems.

97 MATHEMATICS AND COMPUTING↗

Reaction dynamics and in-medium nucleon-nucleon cross section with 12 C+ 1 H at 95 MeV/nucleon

Reaction dynamics and effective in-medium nucleon-nucleon (NN) cross section are studied, using the antisymmetrized molecular dynamics (AMD) model with one of the simplest heavy ion collisions, 12 C+ ⁢1 H. The roles of different stochastic processes are studied, which are installed in the original AMD. One is the diffusion process as a part of the quantum fluctuation originated from the Fermi motion during the time evolution of the wave packets in the mean field (AMD/D). The second is a coalescence treatment for light clusters with A ≤ 8 (AMD/D-COALS). The third is the collision process, installed in AMD with different form of the in-medium NN cross sections. These different processes are examined, using the experimental angular distributions and energy spectra of light charged particles and intermediate mass fragments. The effective in-medium NN cross sections are evaluated from the simulated AMD events and compared with the experimentally extracted values. A good agreement is obtained between the AMD values from the 12 C + 1 H reaction at 95 MeV/nucleon and the experimental results for nuclear matter.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Electronic specific heat capacities and entropies from density matrix quantum Monte Carlo using Gaussian process regression to find gradients of noisy data

In this work, we present a machine learning approach to calculating electronic specific heat capacities for a variety of benchmark molecular systems. Our models are based on data from density matrix quantum Monte Carlo, which is a stochastic method that can calculate the electronic energy at finite temperature. As these energies typically have noise, numerical derivatives of the energy can be challenging to find reliably. In order to circumvent this problem, we use Gaussian process regression to model the energy and use analytical derivatives to produce the specific heat capacity. From there, we also calculate the entropy by numerical integration. We compare our results to cubic splines and finite differences in a variety of molecules in which Hamiltonians can be diagonalized exactly with full configuration interaction. We finally apply this method to look at larger molecules where exact diagonalization is not possible and make comparisons with more approximate ways to calculate the specific heat capacity and entropy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗