Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Tensor networks”

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 145 records · Page 8

Estimating the randomness of quantum circuit ensembles up to 50 qubits

Random quantum circuits have been utilized in the contexts of quantum supremacy demonstrations, variational quantum algorithms for chemistry and machine learning, and blackhole information. The ability of random circuits to approximate any random unitaries has consequences on their complexity, expressibility, and trainability. To study this property of random circuits, we develop numerical protocols for estimating the frame potential, the distance between a given ensemble and the exact randomness. Our tensor-network-based algorithm has polynomial complexity for shallow circuits and is high-performing using CPU and GPU parallelism. We study 1. local and parallel random circuits to verify the linear growth in complexity as stated by the Brown–Susskind conjecture, and; 2. hardware-efficient ansätze to shed light on its expressibility and the barren plateau problem in the context of variational algorithms. Our work shows that large-scale tensor network simulations could provide important hints toward open problems in quantum information science.

97 MATHEMATICS AND COMPUTING↗

DNTTD (Distributed Non-Negative Tensor Train Decomposition)

The era of exascale computing opens new venues for innovations and discoveries in many scientific, engineering, and commercial fields. However, with the exa flops also come the extra-large high-dimensional data generated by high performance computing. High-dimensional data is presented as multidimensional arrays, aka tensors. The presence of latent (not directly observable) structures in the tensor allows a unique representation and compression of the data by classical tensor factorization techniques. However, the classical tensor methods are not always stable or they can be exponential in their memory requirements, which makes them not suitable for high-dimensional tensors. Tensor train (TT) is a state-of-the-art tensor network introduced for factorization of high-dimensional tensors. TT transforms the initial high-dimensional tensor in a network of three-dimensional tensors that requires only a linear storage. Many real-world data, such as, density, temperature, population, probability, etc., are non-negative and for an easy interpretation, the algorithms preserving non-negativity are preferred. Here, we introduce a distributed non-negative tensor-train and demonstrate its scalability and the compression on synthetic and real world big datasets.

Bhattarai, Manish↗

QSpace - An open-source tensor library for Abelian and non-Abelian symmetries

This is the documentation for the tensor library QSpace (v4.0), a toolbox to exploit ‘quan tum symmetry spaces’ in tensor network states in the quantum many-body context. QSpace permits arbitrary combinations of symmetries including the abelian symmetries $\mathbb{Z}_n$ and U(1), as well as all non-abelian symmetries based on the semisimple classical Lie algebras: A n , B n , C n , and D n , or respectively, the special unitary group SU(n), the odd orthogonal group SO(2n+1), the symplectic group Sp(2n), and the even orthogonal group SO(2n). The code (C++ embedded via the MEX interface into Matlab) is available open source as of QSpace v4.0 on bitbucket under the Apache 2.0 license. QSpace is designed as a bottom-up approach for non-abelian symmetries. It starts from the defining representation and the respective Lie algebra. By explicitly comput ing and tabulating generalized Clebsch-Gordan coefficient tensors, QSpace is versatile in the type of operations that it can perform across all symmetries. At the level of an ap plication, much of the symmetry-related details are hidden within the QSpace C++ core libraries. Hence when developing tensor network algorithms with QSpace, these can be coded (nearly) as if there are no symmetries at all, despite being able to fully exploit general non-abelian symmetries.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Scalable Programming Workflows for Validation of Quantum Computers

Hybrid quantum-classical workflows have become standard methods for executing variational algorithms and other quantum simulation techniques, which are key applications for noisy intermediate scale quantum (NISQ) computers. Validating these simulations is an important task which helps gauge the progress of quantum computer development, and classical simulation can serve as a tool to this end. Both exact and more scalable approximate methods with quantifiable error bounds can be used in validation tasks where the applicable metrics include the distance from a calculable ground truth, the quality of an error model fit to data, etc. Here we present a library extension that includes methods for validation of quantum simulations based on scalable hybrid workflows executable on high performance computers. We provide examples that use approximate methods based on tensor networks and stabilizer simulators to bound the error of quantum simulations on NISQ hardware.

Nguyen, Thien↗

SPARTAN (Scalable Probabilistic Application Reconfigurable Tensor Autonomous Network)

The technical founder of Ludwig Computing Inc has been competitively selected for support by Cyclotron Road, a U.S. Department of Energy (DOE) Advanced Manufacturing Office (AMO) Lab-Embedded Entrepreneurship Program (LEEP) through an approved merit review process. Ludwig Computing Inc, supported by the U.S. Department of Energy's Advanced Manufacturing Office through the Cyclotron Road program, has investigated the advantages of probabilistic computing for real-world compute-intensive applications. This research adds to the understanding of alternative computing paradigms by exploring a unique hardware-software co-design that integrates quantum computing methods with nature-inspired problem-solving techniques. The project's focus on areas such as combinatorial optimization, graph analytics, and machine learning demonstrates the potential for significant advancements in computational efficiency and performance. By harnessing natural randomness to streamline large circuits into fewer devices, Ludwig's approach enables massive parallelism, potentially offering higher throughput, speed, and energy efficiency compared to conventional hardware solutions. This work benefits the public by paving the way for more efficient computing solutions that could address complex real-world problems while potentially reducing energy consumption in data-intensive industries.

97 MATHEMATICS AND COMPUTING↗

Adaptive variational quantum dynamics simulations with compressed circuits and fewer measurements

The adaptive variational quantum dynamics simulation (AVQDS) method performs real-time evolution of quantum states using automatically generated parametrized quantum circuits that often contain substantially fewer gates than Trotter circuits. Here we report an improved version of the method, which we call AVQDS(T), by porting the tiling efficient trial circuits with rotations implemented simultaneously technique. The algorithm adaptively adds layers of disjoint unitary gates to the ansatz circuit so as to keep the McLachlan distance, a measure of the accuracy of the variational dynamics, below a fixed threshold. Here we perform benchmark noiseless AVQDS(T) simulations of quench dynamics in local spin models and compare with an alternative adaptive variational approach on quantum resource requirement. Quantum dynamical simulations implementing realistic noise channels are also reported. Finally, we propose a way to substantially alleviate the measurement overhead of AVQDS(T) while maintaining high accuracy by synergistically integrating quantum circuit calculations on quantum processing units with classical calculations using, e.g., tensor networks to evaluate the quantum geometric tensor. We showcase that this approach enables AVQDS(T) to deliver more accurate results than simulations using a fixed ansatz of comparable final depth for a significant time duration with fewer quantum resources.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Characterizing Topological Order with Matrix Product Operators

One of the most striking features of gapped quantum phases that exhibit topological order is the presence of long-range entanglement that cannot be detected by any local order parameter. The formalism of projected entangled-pair states is a natural framework for the parameterization of gapped ground state wavefunctions which allows one to characterize topological order in terms of the virtual symmetries of the local tensors that encode the wavefunction. In their most general form, these symmetries are represented by matrix product operators acting on the virtual level, which leads to a set of algebraic rules characterizing states with topological quantum order. This construction generalizes the concepts of $\mathsf G$- and twisted injectivity; the corresponding matrix product operators encode all topological features of the theory and provide a complete picture of the ground state manifold on the torus. We show how the string-net models of Levin and Wen fit within this formalism and in doing so provide a particularly intuitive interpretation of the pentagon equation for F-symbols as the pulling of matrix product operators through the string-net tensor network. Our approach paves the way to finding novel topological phases beyond string nets and elucidates the description of topological phases in terms of entanglement Hamiltonians and edge theories.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Probing celestial energy and charge correlations through real-time quantum simulations: Insights from the Schwinger model

Motivated by recent developments in the application of light-ray operators (LROs) in high energy physics, we propose a new strategy to study correlation functions of LROs through real-time quantum simulations. We argue that quantum simulators provide an ideal laboratory to explore the properties LROs in lower-dimensional quantum field theories. This is exemplified in the 1 + 1 -d Schwinger model, employing tensor network methods, focusing on the calculation of energy and charge correlators. Despite some challenges in extracting the necessary correlation functions from the lattice, the methodology used can be extended to real quantum devices. Published by the American Physical Society 2025

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Spectral gaps of two- and three-dimensional many-body quantum systems in the thermodynamic limit

We present an expression for the spectral gap, opening up new possibilities for performing and accelerating spectral calculations of quantum many-body systems. We develop and demonstrate one such possibility in the context of tensor network simulations. Our approach requires only minor modifications of the widely used simple update method and is computationally lightweight relative to other approaches. We validate it by computing spectral gaps of the 2D and 3D transverse-field Ising models and find strong agreement with previously reported perturbation theory results. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mass gaps of a Z 3 gauge theory with three fermion flavors in 1 + 1 dimensions

We consider a Z 3 gauge theory coupled to three degenerate massive flavors of fermions, which we term Quantum Z(3) Dynamics, QZD. The spectrum can be computed in 1 + 1 dimensions using tensor networks. In weak coupling the spectrum is that of the expected mesons and baryons, although the corrections in weak coupling are nontrivial, analogous to those of nonrelativistic QED in 1 + 1 dimensions. In strong coupling, besides the usual baryon, the singlet meson is a baryon-antibaryon state. For two special values of the coupling constant, the lightest baryon is degenerate with the lightest octet meson, and the lightest singlet meson, respectively. Published by the American Physical Society 2024

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Thermalization at low temperatures via weakly damped multisite baths

We study the thermalization properties of one-dimensional open quantum systems coupled to baths at their boundary. The baths are driven to their thermal states via Lindblad operators, while the system undergoes Hamiltonian dynamics. We specifically consider multisite baths and investigate the extent to which the late-time steady state resembles a Gibbs state at some controllable temperature set by the baths. We study three models: a noninteracting fermion model accessible via free-fermion technology, and two interacting models, the XZ model and the chiral clock model, which are accessible via tensor network methods. We show that, by tuning towards the weak coupling and slow relaxation limits, one can engineer low temperatures in the bulk of the system provided the bath size is big enough. Here, we use this capability to study energy transport in the XZ model at lower temperatures than previously reported. Our work paves the way for future studies of interacting open quantum systems at low temperatures.

1-dimensional spin chains↗

Quantum criticality and topology in non-equilibrium systems

A key goal of condensed matter physics research is to identify new phases of matter, and to understand the universal features of the phase transitions between them. In the past decade, physicists have uncovered a wealth of new phases with interesting surface properties, exemplified by the theoretical prediction and subsequent experimental discovery of topological insulators and superconductors. Traditional condensed matter systems are usually in a thermal equilibrium state and typically at very low temperature. Very recently, experimental advances have sparked interest in the non-equilibrium setting. Non-equilibrium systems can host new phases and phenomena with no equilibrium counterpart, and could also enable robust ways to build quantum memory devices to store and manipulate quantum information in a coherent manner. These phases and phenomena are inherently “dynamical”: they are described not by changes in the arrangement or structure of the constituent particles, but instead marked by sharp distinctions in how the particles move and exchange energy or quantum information. The discovery of robust non-equilibrium phases raises many fundamental questions: Can we develop a systematic theory of states of matter and of dynamical transitions between such states? How can such states be realized and probed experimentally? The main goal of this project was to explore the emergence of topological phases and quantum criticality (two cornerstones of modern condensed matter physics in equilibrium) in such non-equilibrium quantum systems. Specific goals included (1) using tensor networks to efficiently represent non-equilibrium states of matter and their phase transitions; (2) studying and designing new probes for periodically driven systems; and (3) developing analytic and numerical tools to analyze non-equilibrium topological phase transitions. Advances in these directions were achieved using novel techniques appropriate to study the non-equilibrium dynamics in many-body quantum systems combining strong interactions and randomness. Taken together, these results provide a new conceptual framework for understanding the emergence of quantum critical and topological properties in quantum systems far from thermal equilibrium.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Learning to classify quantum phases of matter with a few measurements

We study the identification of quantum phases of matter, at zero temperature, when only part of the phase diagram is known in advance. Following a supervised learning approach, we show how to use our previous knowledge to construct an observable capable of classifying the phase even in the unknown region. By using a combination of classical and quantum techniques, such as tensor networks, kernel methods, generalization bounds, quantum algorithms, and shadow estimators, we show that, in some cases, the certification of new ground states can be obtained with a polynomial number of measurements. An important application of our findings is the classification of the phases of matter obtained in quantum simulators, e.g. cold atom experiments, capable of efficiently preparing ground states of complex many-particle systems and applying simple measurements, e.g. single qubit measurements, but unable to perform a universal set of gates.

quantum machine learning↗

Almost strong zero modes at finite temperature

Interacting fermionic chains exhibit extended regions of topological degeneracy of their ground states as a result of the presence of Majorana or parafermionic zero modes localized at the edges. In the opposite limit of infinite temperature, the corresponding nonintegrable spin chains, obtained via generalized Jordan-Wigner mapping, are known to host so-called almost strong zero modes, which are long-lived with respect to any bulk excitations. Here we study the fairly unexplored territory that bridges these two extreme cases of zero and infinite temperature. We blend two established techniques for states, the Lanczos series expansion and a tensor network ansatz, uplifting them to the level of operator algebra. This allows us to efficiently simulate large system sizes for arbitrarily long timescales and to extract the temperature-dependent decay rates. We observe that for the Kitaev-Hubbard model, the decay rate of the edge mode depends exponentially on the inverse temperature 𝛽, and on an effective energy scale Δ eff that is greater than the thermodynamic gap of the system Δ.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimized Lie–Trotter–Suzuki decompositions for two and three non-commuting terms

Lie–Trotter–Suzuki decompositions are an efficient way to approximate operator exponentials exp ( t H ) when H is a sum of n (non-commuting) terms which, individually, can be exponentiated easily. They are employed in time-evolution algorithms for tensor network states, digital quantum simulation protocols, path integral methods like quantum Monte Carlo, and splitting methods for symplectic integrators in classical Hamiltonian systems. Here, we provide optimized decompositions up to order t 6 . The leading error term is expanded in nested commutators (Hall bases) and we minimize the 1-norm of the coefficients. For n = 2 terms, several of the optima we find are close to those in McLachlan (1995). Generally, our results substantially improve over unoptimized decompositions by Forest, Ruth, Yoshida, and Suzuki. We explain why these decompositions are sufficient to efficiently simulate any one- or two-dimensional lattice model with finite-range interactions. This follows by solving a partitioning problem for the interaction graph.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Comparison between explicit and implicit discretization strategies for a dissipative thermal environment

We investigate strategies for simulating open quantum systems coupled to dissipative baths by comparing explicit wave function-based discretization [via multi-layer multi-configuration time-dependent Hartree (ML-MCTDH)] and the implicit density matrix-based master equation method [via tree tensor network hierarchical equations of motion (TTN-HEOM)]. For dissipative baths characterized by exponentially decaying bath correlation functions, the implicit discretization approach of HEOM—rooted in bath correlation function decompositions—proves significantly more efficient than explicit discretization of the bath into discrete harmonic modes. Explicit methods, like ML-MCTDH, require extensive mode discretization to approximate continuum baths, leading to computational bottlenecks. Case studies for two-level systems and a Fenna–Matthews–Olson complex model highlight TTN-HEOM’s superiority in capturing dissipative dynamics with relaxations with a minimal number of auxiliary modes, while the explicit methods are as exact as the HEOM in pure dephasing regimes. This comparison is enabled by the TENSO package, which has both ML-MCTDH and TTN-HEOM implemented using the same computational structure and propagation strategy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Localization dynamics in a centrally coupled system

In systems in which interactions couple a central degree of freedom and a bath, one would expect signatures of the bath's phase to be reflected in the dynamics of the central degree of freedom. This has been recently explored in connection with many-body localized baths coupled with a central qubit or a single-cavity mode - systems with growing experimental relevance in various platforms. Such models also have an interesting connection with Floquet many-body localization via quantizing the external drive, although this has been relatively unexplored. Here we adapt the multilayer multiconfigurational time-dependent Hartree (ML-MCTDH) method, a well-known tree tensor network algorithm, to numerically simulate the dynamics of a central degree of freedom, represented by a d-level system (qudit), coupled to a disordered interacting one-dimensional spin bath. ML-MCTDH allows us to reach ≈10 2 lattice sites, a far larger system size than what is feasible with exact diagonalization or kernel polynomial methods. From the intermediate time dynamics, we find a well-defined thermodynamic limit for the qudit dynamics upon appropriate rescaling of the system-bath coupling. The spin system shows similar scaling collapse in the Edward-Anderson spin-glass order parameter or entanglement entropy at relatively short times. At longer timescales, we see slow growth of the entanglement, which may arise from dephasing mechanisms in the localized system or long-range interactions mediated by the central degree of freedom. Similar signs of localization are shown to appear as well with unscaled system-bath coupling.

1-dimensional spin chains↗