Onset of synchronization in networks of second-order Kuramoto oscillators with delayed coupling: Exact results and application to phase-locked loops
Not Available
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
SEARCH · Search NASA
Results for “Quantum chaos”
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.
Confined and deconfined chaos in classical spin systems
Weakly perturbed integrable many-body systems are typically chaotic, and thermal at late times. However, there are distinct relationships between the timescales for thermalization and chaos. The typical relationship is confined chaos: when trajectories are still confined to regions in phase space with constant conserved quantities (actions), the conjugate angle variables are already unstable. Chaotic instabilities thus far precede thermalization. In a different relationship, which we term deconfined chaos, chaotic instabilities and thermalization occur on the same timescale. We investigate these two qualitatively distinct scenarios through numerical and analytical studies of two perturbed integrable classical spin models: the Ishimori spin chain (confined chaos), and the central spin model with XX interactions (deconfined chaos). We analytically establish (super)-integrability in the latter model in a microcanonical shell. Deconfined chaos emerges through the separation of phase space into large quasi-integrable regions and a thin chaotic manifold. The latter leads to chaos and thermalization on the fastest possible timescale, which is proportional to the inverse perturbation strength. This behavior is reminiscent of the quantum SYK models and strange metals.
Chaotic Dynamics (nlin.CD)↗
Chaos in inhomogeneous neutrino fast flavor instability
In dense neutrino gases, the neutrino-neutrino coherent forward scattering gives rise to a complex flavor oscillation phenomenon not fully incorporated in simulations of neutron star mergers (NSM) and core collapse supernovae (CCSNe). Moreover, it has been proposed to be chaotic, potentially limiting our ability to predict neutrino flavor transformations in simulations. To address this issue, we explore how small flavor perturbations evolve in the nonlinear regime of the neutrino quantum kinetic equation within a narrow centimeter-scale region inside a NSM and a toy neutrino distribution. Our findings reveal that paths in the flavor state space of solutions with similar initial conditions diverge exponentially, exhibiting chaos. This inherent chaos makes the microscopic scales of neutrino flavor transformations unpredictable. However, the domain-averaged neutrino density matrix remains relatively stable, with chaos minimally affecting it. This particular property suggests that domain-averaged quantities remain reliable despite the exponential amplification of errors. Published by the American Physical Society 2024
Astronomy & Astrophysics↗
Quantum Fourier transform revisited
Summary The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a particular matrix decomposition of the discrete Fourier transform (DFT) matrix. In this paper, we show that the quantum Fourier transform (QFT) can be derived by further decomposing the diagonal factors of the FFT matrix decomposition into products of matrices with Kronecker product structure. We analyze the implication of this Kronecker product structure on the discrete Fourier transform of rank‐1 tensors on a classical computer. We also explain why such a structure can take advantage of an important quantum computer feature that enables the QFT algorithm to attain an exponential speedup on a quantum computer over the FFT algorithm on a classical computer. Further, the connection between the matrix decomposition of the DFT matrix and a quantum circuit is made. We also discuss a natural extension of a radix‐2 QFT decomposition to a radix‐ d QFT decomposition. No prior knowledge of quantum computing is required to understand what is presented in this paper. Yet, we believe this paper may help readers to gain some rudimentary understanding of the nature of quantum computing from a matrix computation point of view.
Camps, Daan↗
Crosstalk Suppression in Individually Addressed Two-Qubit Gates in a Trapped-Ion Quantum Computer
Crosstalk between target and neighboring spectator qubits due to spillover of control signals represents a major error source limiting the fidelity of two-qubit entangling gates in quantum computers. We show that in our laser-driven trapped-ion system coherent crosstalk error can be modeled as residual $X\hat{σ}_{\phi}$ interaction and can be actively canceled by single-qubit echoing pulses. We propose and demonstrate a crosstalk suppression scheme that eliminates all first-order crosstalk utilizing only local control of target qubits, as opposed to an existing scheme which requires control over all neighboring qubits. We report a two-qubit Bell state fidelity of 99.52(6)% with the echoing pulses applied after collective gates and 99.37(5)% with the echoing pulses applied to each gate in a five-ion chain. Finally, this scheme is widely applicable to other platforms with analogous interaction Hamiltonians.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Digital quantum simulation of Floquet symmetry-protected topological phases
Quantum many-body systems away from equilibrium host a rich variety of exotic phenomena that are forbidden by equilibrium thermodynamics. A prominent example is that of discrete time crystals, in which time-translational symmetry is spontaneously broken in periodically driven systems. Pioneering experiments have observed signatures of time crystalline phases with trapped ions, solid-state spin systems, ultracold atoms and superconducting qubits. Here we report the observation of a distinct type of non-equilibrium state of matter, Floquet symmetry-protected topological phases, which are implemented through digital quantum simulation with an array of programmable superconducting qubits. We observe robust long-lived temporal correlations and subharmonic temporal response for the edge spins over up to 40 driving cycles using a circuit of depth exceeding 240 and acting on 26 qubits. We demonstrate that the subharmonic response is independent of the initial state, and experimentally map out a phase boundary between the Floquet symmetry-protected topological and thermal phases. Our results establish a versatile digital simulation approach to exploring exotic non-equilibrium phases of matter with current noisy intermediate-scale quantum processors.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Structured ground states of randomly interacting bosons
Bosonic degrees of freedom and their emergence as part of complex quantum many-body dynamics, symmetries, collective behavior, clustering, and phase transitions play an important role in modern studies of quantum systems. In this paper, we present a systematic study of many-boson systems governed by random interactions. Our findings show that ground states of randomly interacting bosons are not random, being dominated by a few collective configurations containing condensates of clusters.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Quantum Chemical Density Matrix Renormalization Group Method Boosted by Machine Learning
The use of machine learning (ML) to refine low-level theoretical calculations to achieve higher accuracy is a promising and actively evolving approach known as Δ-ML. The density matrix renormalization group (DMRG) is a powerful variational approach widely used for studying strongly correlated quantum systems. High computational efficiency can be achieved without compromising accuracy. Here, we demonstrate the potential of a simple ML model to significantly enhance the performance of the quantum chemical DMRG method.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Piezoelectricity and topological quantum phase transitions in two-dimensional spin-orbit coupled crystals with time-reversal symmetry
Abstract Finding new physical responses that signal topological quantum phase transitions is of both theoretical and experimental importance. Here, we demonstrate that the piezoelectric response can change discontinuously across a topological quantum phase transition in two-dimensional time-reversal invariant systems with spin-orbit coupling, thus serving as a direct probe of the transition. We study all gap closing cases for all 7 plane groups that allow non-vanishing piezoelectricity, and find that any gap closing with 1 fine-tuning parameter between two gapped states changes either the Z 2 invariant or the locally stable valley Chern number. The jump of the piezoelectric response is found to exist for all these transitions, and we propose the HgTe/CdTe quantum well and BaMnSb 2 as two potential experimental platforms. Our work provides a general theoretical framework to classify topological quantum phase transitions, and reveals their ubiquitous relation to the piezoelectric response.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Structure of a chaotic tangle of quantum vortices in turbulent superfluid liquids and in a Bose – Einstein condensate
Based on the theory of the thermodynamic equilibrium in a system of quantum vortices in superfluid liquids and in a Bose – Einstein condensate in the presence of a counterflow of normal and superfluid components, we investigate the structure of a chaotic tangle of quantum vortices in turbulent superfluid liquids. Using the characteristic functional method, the properties of hydrodynamic vortex filaments are examined. It is shown that the average curvature of the vortex lines is on the order of the intervortex distance, with the proportionality coefficient being independent of the counterflow velocity. It is found that the degree of anisotropy of the vortex loops does not depend on the applied counterflow velocity. The obtained results explain the origin of the anisotropy as well as the relationship between the curvature of the lines and the intervortex space and their dependence on the parameters of the problem. (paper)
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Multiple-Event, Single-Photon Counting Imaging Sensor
The single-photon counting imaging sensor is typically an array of silicon Geiger-mode avalanche photodiodes that are monolithically integrated with CMOS (complementary metal oxide semiconductor) readout, signal processing, and addressing circuits located in each pixel and the peripheral area of the chip. The major problem is its single-event method for photon count number registration. A single-event single-photon counting imaging array only allows registration of up to one photon count in each of its pixels during a frame time, i.e., the interval between two successive pixel reset operations. Since the frame time can t be too short, this will lead to very low dynamic range and make the sensor merely useful for very low flux environments. The second problem of the prior technique is a limited fill factor resulting from consumption of chip area by the monolithically integrated CMOS readout in pixels. The resulting low photon collection efficiency will substantially ruin any benefit gained from the very sensitive single-photon counting detection. The single-photon counting imaging sensor developed in this work has a novel multiple-event architecture, which allows each of its pixels to register as more than one million (or more) photon-counting events during a frame time. Because of a consequently boosted dynamic range, the imaging array of the invention is capable of performing single-photon counting under ultra-low light through high-flux environments. On the other hand, since the multiple-event architecture is implemented in a hybrid structure, back-illumination and close-to-unity fill factor can be realized, and maximized quantum efficiency can also be achieved in the detector array.
Zheng, Xinyu↗
Enhancing scalability of a matrix-free eigensolver for studying many-body localization
We propose several techniques to enhance the parallel scalability of a matrix-free eigensolver designed for studying many-body localization (MBL) of quantum spin chain models with nearest-neighbor interactions and on-site disorder. This type of problem is computationally challenging because the dimension of the associated Hamiltonian matrix grows exponentially with respect to the number of spins L, and we need to average over different realizations of the random disorder to obtain relevant statistical behavior. For each disorder realization, we need to compute eigenvalues from different regions of the spectrum and their corresponding eigenvectors. In previous work, the interior eigenstates for a single eigenvalue problem are computed via the shift-and-invert Lanczos algorithm. Due to the extremely high memory footprint of the LU factorizations, this technique is not well suited for large L’s. For example, we need thousands of compute nodes on modern high performance computing infrastructures to go beyond L = 24. The matrix-free approach does not suffer from this memory bottleneck, however, its scalability is limited by a computation and communication load imbalance. To reduce this imbalance and to significantly enhance the scalability of the matrix-free eigensolver, we reorder the matrix and leverage the consistent space runtime, CSPACER. We also show its efficiency in managing irregular communication patterns at scale compared to optimized MPI non-blocking two-sided and one-sided RMA implementation variants. This effort enables us to study MBL for spin chains with a larger number of spins. The efficiency and effectiveness of the proposed algorithm is demonstrated by computing eigenstates on a massively parallel many-core high performance computer.
METIS↗
Low-Density Parity-Check Codes as Stable Phases of Quantum Matter
Phases of matter with robust ground-state degeneracy, such as the quantum toric code, are known to be capable of robust quantum information storage. Here, we address the converse question: given a quantum error-correcting code, when does it define a stable gapped quantum phase of matter, whose ground-state degeneracy is robust against perturbations in the thermodynamic limit? We prove that a low-density parity-check (LDPC) code defines such a phase, robust against all few-body perturbations, if its code distance grows at least logarithmically in the number of degrees of freedom, and it exhibits “check soundness.” Many constant-rate quantum LDPC expander codes have such properties, and define stable phases of matter with a constant zero-temperature entropy density, violating the third law of thermodynamics. Our results also show that quantum toric-code phases are robust to spatially nonlocal few-body perturbations. Similarly, phases of matter defined by classical codes are stable against symmetric perturbations. In the classical setting, we present improved locality bounds on the quasiadiabatic evolution operator between two nearby states in the same code phase.
quantum error correction↗
Using dynamic mode decomposition to predict the dynamics of a two-time non-equilibrium Green’s function
Computing the numerical solution of the Kadanoff–Baym equations, a set of nonlinear integral differential equations satisfied by the two-time Green's functions derived from many-body perturbation theory for a quantum many-body system away from equilibrium, is a challenging task. Recently, we have successfully applied dynamic mode decomposition (DMD) to construct a data driven reduced order model that can be used to extrapolate the time-diagonal of a two-time Green's function from numerical solutions of the KBE within a small time window. In this paper, we extend the previous work and use DMD to predict off-diagonal elements of the two-time Green's function. We partition the two-time Green's function into a number of one-time functions along the diagonal and subdiagonals of the two-time window as well as in horizontal and vertical directions. We use DMD to construct separate reduced order models to predict the dynamics of these one-time functions in a two-step procedure. We extrapolate along diagonal and several subdiagonals within a subdiagonal band of a two-time window in the first step. In the second step, we use DMD to extrapolate the Green's function outside of the sub-diagonal band. In conclusion, we demonstrate the efficiency and accuracy of this approach by applying it to a two-band Hubbard model problem.
97 MATHEMATICS AND COMPUTING↗
Reinforcement Learning Configuration Interaction
Selected configuration interaction (sCI) methods exploit the sparsity of the full configuration interaction (FCI) wave function, yielding significant computational savings and wave function compression without sacrificing the accuracy. Despite recent advances in sCI methods, the selection of important determinants remains an open problem. Furthermore, we explore the possibility of utilizing reinforcement learning approaches to solve the sCI problem. By mapping the configuration interaction problem onto a sequential decision-making process, the agent learns on-the-fly which determinants to include and which to ignore, yielding a compressed wave function at near-FCI accuracy. This method, which we call reinforcement-learned configuration interaction, adds another weapon to the sCI arsenal and highlights how reinforcement learning approaches can potentially help solve challenging problems in electronic structure theory.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Superconducting proximity effect in a transparent van der Waals superconductor-metal junction
Here, we report on Andreev reflections at clean NbSe 2 -bilayer graphene junctions. The high transparency of the junction, which manifests as a large conductance enhancement of up to 1.8, enables us to see clear evidence of a proximity-induced superconducting gap in bilayer graphene and two Andreev reflections through a vertical NbSe 2 -graphene and a lateral graphene-graphene junction, respectively. Quantum transport simulations capture the complexity of the experimental data and illuminate the impact of various microscopic parameters on the transmission of the junction. Our work establishes the practice and understanding of an all-van-der-Waals, high-performance superconducting junction. The realization of a highly transparent proximized graphene-graphene junction opens up possibilities to engineer emergent quantum phenomena.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
Quantum communications work at SQMS
The Superconducting Quantum Materials and Systems (SQMS) Center is focused on advancing low-loss interconnectivity between quantum processing units (QPUs) to enable scalable quantum computing. In the short term, our goals include the development and optimization of 2D and 3D platforms with remotely entangled modules, refinement in microwave design and control schemes, and the achievement of high-fidelity quantum state transfer between superconducting quantum modules. Looking ahead, we aim to realize modular quantum computing with low-loss interconnects, maximize remote entanglement fidelity and implement robust quantum operations with error correction. We will leverage advanced microwave engineering and material science to optimize the performance of quantum interconnects and the coupling interfaces between the interconnects and the QPUs.
Vallières, André↗
Hidden Inverses: Coherent Error Cancellation at the Circuit Level
Not Available
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗