Block Diagonal Form Research Articles

The Terwilliger algebras of Odd graphs and Doubled Odd graphs

For an integer m≥1, let S={1,2,…,2m+1}. Denote by 2.Om+1 the Doubled Odd graph on S with vertex set X:=(Sm)∪(Sm+1). By folding this graph, one can obtain a new graph called Odd graph Om+1 with vertex set X:=(Sm). In this paper, we shall study the Terwilliger algebras of 2.Om+1 and Om+1. We first consider the case of Om+1. With respect to any fixed vertex x0∈X, let A:=A(x0) denote the centralizer algebra of the stabilizer of x0 in the automorphism group of Om+1, and T:=T(x0) the Terwilliger algebra of Om+1. For the algebras A and T: (i) we construct a basis of A by the stabilizer of x0 acting on X×X, compute its dimension and show that A=T; (ii) for m≥3, we give all the isomorphism classes of irreducible T-modules and display the decomposition of T in a block-diagonal form (up to isomorphism). These results together with the relations between 2.Om+1 and Om+1 allow us to further study the corresponding centralizer algebra and Terwilliger algebra for 2.Om+1. Consequently, the results in the above (i), (ii) for Om+1 can be similarly generalized to the case of 2.Om+1; moreover, we define three subalgebras of the Terwilliger algebra of 2.Om+1 such that their direct sum is just this algebra.

ПАКЕТ GAP ДЛЯ РОЗЩЕПЛЕННЯ ЛІНІЙНИХ СИСТЕМ

There are a number of problems, the solution of which requires the breakdown of the initial system of equations using algebraic decoupling methods. This means reducing the matrix of coefficients to block-diagonal (or block-triangular) form by means of substitution of variables. The main computational tasks when using such methods are finding the centralizer of several matrices or compiling the algebra generated by these matrices. For calculations, it is convenient to use the GAP computer algebra system because the system itself is designed for discrete algebra calculations. The problem is that the GAP program does not support calculations with real numbers. For practical problems you can try to replace them (with some accuracy) by rational numbers. At the same time, the decision may turn out to be excessively cumbersome. On the other hand, the advantage of GAP is the complete absence of rounding errors.

Quantum dynamics of a fully blockaded Rydberg atom ensemble

Classical simulation of quantum systems plays an important role in the study of many-body phenomena and in the benchmarking and verification of quantum technologies. Exact simulation is often limited to small systems because the dimension of the Hilbert space increases exponentially with the size of the system. For systems that possess a high degree of symmetry, however, classical simulation can reach much larger sizes. Here we consider an ensemble of strongly interacting atoms with permutation symmetry, enabling the computation of certain collective observables for hundreds of atoms at arbitrarily long evolution times. The system is realized by an ensemble of three-level atoms, where one of the levels corresponds to a highly excited Rydberg state. In the limit of all-to-all Rydberg blockade, the Hamiltonian is invariant under permutation of the atoms. Using techniques from representation theory, we construct a block-diagonal form of the Hamiltonian, where the size of the largest block increases only linearly with the system size. We apply this formalism to derive efficient pulse sequences to prepare arbitrary permutation-invariant quantum states. Moreover, we study the quantum dynamics following a quench, uncovering a parameter regime in which the system thermalizes slowly and exhibits pronounced revivals. Our results create opportunities for the experimental and theoretical study of large interacting and nonintegrable quantum systems. Published by the American Physical Society 2024

КОМП'ЮТЕРНИЙ РОЗВ'ЯЗОК МАТРИЧНИХ ЗАДАЧ

A feature of the computer solution of matrix problems is that often there is a problem of accumulation of rounding errors. This may lead to an incorrect result. J.H. Wilkinson developed efficient methods for finding eigenvalues and eigenvectors of matrices based on the well-known Francis-Kublanovska’s QR-algorithm. Now there are new problems of algebra, the methods of solution of which require further improvement. There is a problem of reducing a few initial matrices into a block-diagonal or block-triangular form. This requires the development of a new approaches to solving the problems of finding the centralizer of matrices and constructing an algebra with a unit generated by these matrices. For the first of these problems, it was possible to create an effective method. The next problem is to create an efficient algorithm for constructing the algebra generated by matrices

Low-complexity GFDM transmission scheme for low earth orbit satellite communications

As a promising multi-carrier modulation scheme, Generalized Frequency Division Multiplexing (GFDM) has certain advantages in low earth orbit satellite communications. However, the cost of GFDM to obtain these advantages is the self-interference caused by non-orthogonality and the increase of computational complexity. This paper proposes two low-complexity transceiver schemes for GFDM based on matrix sparsity. Firstly, the paper summarizes two GFDM modulation structures, referred to as structure types I and II, based on modulation data. Next, the modulation matrix in both structures is divided into sub-matrices, and the modulation sub-matrix is made sparse by leveraging the properties of the Fourier transform, so as to reduce the complexity of the transmitter. Similarly, by performing sparse processing on the received matrix and converting it into a block diagonal matrix form, the complexity of the receiver can be effectively reduced. The computational costs of our proposed schemes are analyzed in detail and compared with the existing solutions that are known to have the lowest complexity. The simulation results demonstrate that the two proposed schemes can provide satisfactory low-complexity performance depending on the time–frequency structure.

Dual symplectic classical circuits: An exactly solvable model of many-body chaos

We propose a general exact method of calculating dynamical correlation functions in dual symplectic brick-wall circuits in one dimension. These are deterministic classical many-body dynamical systems which can be interpreted in terms of symplectic dynamics in two orthogonal (time and space) directions. In close analogy with quantum dual-unitary circuits, we prove that two-point dynamical correlation functions are non-vanishing only along the edges of the light cones. The dynamical correlations are exactly computable in terms of a one-site Markov transfer operator, which is generally of infinite dimensionality. We test our theory in a specific family of dual-symplectic circuits, describing the dynamics of a classical Floquet spin chain. Remarkably, expressing these models in the form of a composition of rotations leads to a transfer operator with a block diagonal form in the basis of spherical harmonics. This allows us to obtain analytical predictions for simple local observables. We demonstrate the validity of our theory by comparison with Monte Carlo simulations, displaying excellent agreement with the latter for a choice of observables.

Quantum Dynamics of Oblique Vibrational States in the Hénon-Heiles System.

In this paper, we study the quantum time evolution of oblique nonstationary vibrational states in a Hénon-Heiles oscillator system with two dissociation channels, which models the stretching vibrational motions of triatomic molecules. The oblique nonstationary states we are interested in are the eigenfunctions of the anharmonic zero-order Hamiltonian operator resulting from the transformation to oblique coordinates, which are defined as those coming from nonorthogonal coordinate rotations that express the matrix representation of the second-order Hamiltonian in a block diagonal form characterized by the polyadic quantum number n = n1 + n2. The survival probabilities calculated show that the oblique nonstationary states evolve within their polyadic group with a high degree of coherence up to the dissociation limits on the short time scale. The degree of coherence is certainly much higher than that exhibited by the local nonstationary states extracted from the conventional orthogonal rotation of the original normal coordinates. We also show that energy exchange between the oblique vibrational modes occurs in a much more regular way than the exchange between the local modes.

Empirical probability and machine learning analysis of m, n = 2, 1 tearing mode onset parameter dependence in DIII-D H-mode scenarios

m, n = 2, 1 tearing mode onset empirical probability and machine learning analyses of a multiscenario DIII-D database of over 14 000 H-mode discharges show that the normalized plasma beta, the rotation profile, and the magnetic equilibrium shape have the strongest impact on the 2,1 tearing mode stability, in qualitative agreement with neoclassical tearing modes (m and n are the poloidal and toroidal mode numbers, respectively). In addition, 2,1 tearing modes are most likely to destabilize when n > 1 tearing modes are already present in the core plasma. The covariance matrix of tearing sensitive plasma parameters takes a nearly block-diagonal form, with the blocks incorporating thermodynamic, current and safety factor profile, separatrix shape, and plasma flow parameters, respectively. This suggests a number of paths to improved stability at fixed pressure and edge safety factor primarily by preserving a minimum of 1 kHz differential rotation, increasing the minimum safety factor above unity, using upper single null magnetic configuration, and reducing the core impurity radiation. In addition, lower triangularity, lower elongation, and lower pedestal pressure may also help to improve stability. The electron and ion temperature, collisionality, resistivity, internal inductance, and the parallel current gradient appear to only weakly correlate with the 2,1 tearing mode onsets in this database.

Block perturbation of symplectic matrices in Williamson’s theorem

AbstractWilliamson’s theorem states that for any $2n \times 2n$ real positive definite matrix A, there exists a $2n \times 2n$ real symplectic matrix S such that $S^TAS=D \oplus D$ , where D is an $n\times n$ diagonal matrix with positive diagonal entries known as the symplectic eigenvalues of A. Let H be any $2n \times 2n$ real symmetric matrix such that the perturbed matrix $A+H$ is also positive definite. In this paper, we show that any symplectic matrix $\tilde {S}$ diagonalizing $A+H$ in Williamson’s theorem is of the form $\tilde {S}=S Q+\mathcal {O}(\|H\|)$ , where Q is a $2n \times 2n$ real symplectic as well as orthogonal matrix. Moreover, Q is in symplectic block diagonal form with the block sizes given by twice the multiplicities of the symplectic eigenvalues of A. Consequently, we show that $\tilde {S}$ and S can be chosen so that $\|\tilde {S}-S\|=\mathcal {O}(\|H\|)$ . Our results hold even if A has repeated symplectic eigenvalues. This generalizes the stability result of symplectic matrices for non-repeated symplectic eigenvalues given by Idel, Gaona, and Wolf [Linear Algebra Appl., 525:45–58, 2017].

Generalizations and challenges for the spacetime block-diagonalization

Discovery that gravitational field equations may coerce the spacetime metric with isometries to attain a block-diagonal form compatible with these isometries, was one of the gems built into the corpus of black hole uniqueness theorems. We revisit the geometric background of a block-diagonal metric with isometries, foliation defined by Killing vector fields and the corresponding Godbillon–Vey characteristic class. Furthermore, we analyse sufficient conditions for various matter sources, including scalar, nonlinear electromagnetic and Proca fields, that imply the isometry-compatible block-diagonal form of the metric. Finally, we generalize the theorem on the absence of null electromagnetic fields in static spacetimes to an arbitrary number of spacetime dimensions, wide class of gravitational field equations and nonlinear electromagnetic fields.

Finding community structure using the ordered random graph model.

Visualization of the adjacency matrix enables us to capture macroscopic features of a network when the matrix elements are aligned properly. Community structure, a network consisting of several densely connected components, is a particularly important feature and the structure can be identified through the adjacency matrix when it is close to a block-diagonal form. However, classical ordering algorithms for matrices fail to align matrix elements such that the community structure is visible. In this study, we propose an ordering algorithm based on the maximum-likelihood estimate of the ordered random graph model. We show that the proposed method allows us to more clearly identify community structures than the existing ordering algorithms.

Quasi-periodic solutions for a class of wave equation system

In this paper, we establish an abstract infinite dimensional KAM theorem. As an application, we use the theorem to study the 1D wave equation system { u 1 tt − u 1 xx + σ u 1 + u 1 u 2 2 = 0 u 2 tt − u 2 xx + μ u 2 + u 1 2 u 2 = 0 under Dirichlet boundary conditions, where 0 < σ ∈ [ σ 1 , σ 2 ] ⊂ [ 0 , 1 ] , 0 < μ ∈ [ μ 1 , μ 2 ] ⊂ [ 0 , 1 ] are real parameters. By establishing a block-diagonal normal form, we obtain the existence of a Whitney smooth family of small amplitude quasi-periodic solutions corresponding to finite dimensional invariant tori of an associated infinite dimensional dynamic system.

Mean-Field Control for Stochastic Delay Systems via Static Output Feedback Strategy

In this paper, we consider mean-field control based on the static output feedback (SOF) strategy for stochastic delay systems. First, we define a stabilization problem via SOF gains in block-diagonal forms for systems with a single player, and then solve the problem of minimizing the upper bound of the cost function by cost-guaranteed cost control theory. For this problem, the necessary conditions for the sub-optimality are established using stochastic large-scale matrix equations. The obtained preliminary results are then used to study Pareto optimal strategies in cooperative games, for mean-field stochastic systems involving a large number of players. The primary contribution of this study is the derivation of a design method for decentralized strategies. Furthermore, a new low-order computational algorithm based on Newton's method is developed to obtain the decentralized strategy set. The cost degradation of the proposed decentralized SOF strategy set is then estimated. Finally, a simple numerical example is presented to demonstrate the usefulness and effectiveness of the proposed method. As a result, it is determined that the decentralized SOF strategy works well even when the number of players goes to infinity.

Algorithms for simultaneous block triangularization and block diagonalization of sets of matrices

&lt;abstract&gt;&lt;p&gt;In a recent paper, a new method was proposed to find the common invariant subspaces of a set of matrices. This paper investigates the more general problem of putting a set of matrices into block triangular or block-diagonal form simultaneously. Based on common invariant subspaces, two algorithms for simultaneous block triangularization and block diagonalization of sets of matrices are presented. As an alternate approach for simultaneous block diagonalization of sets of matrices by an invertible matrix, a new algorithm is developed based on the generalized eigenvectors of a commuting matrix. Moreover, a new characterization for the simultaneous block diagonalization by an invertible matrix is provided. The algorithms are applied to concrete examples using the symbolic manipulation system Maple.&lt;/p&gt;&lt;/abstract&gt;

Invariant Tori for a Two-Dimensional Completely Resonant Beam Equation with a Quintic Nonlinear Term

This paper focuses on a two-dimensional completely resonant beam equation with a quintic nonlinear term. This means studying u t t + Δ 2 u + ε f u = 0 , x ∈ T 2 , t ∈ ℝ , under periodic boundary conditions, where ε is a small positive parameter and f u is a real analytic odd function of the form f u = f 5 u 5 + ∑ i ^ ≥ 3 f 2 i ^ + 1 u 2 i ∧ + 1 , f 5 ≠ 0 . It is proved that the equation admits small-amplitude, Whitney smooth, linearly stable quasiperiodic solutions on the phase-flow invariant subspace ℤ † 2 = r = r 1 , r 2 , r 1 ∈ 4 ℤ − 1 , r 2 ∈ 4 ℤ . Firstly, the corresponding Hamiltonian system of the equation is transformed into an angle-dependent block-diagonal normal form by using symplectic transformation, which can be achieved by selecting the appropriate tangential position. Finally, the existence of a class of invariant tori is proved, which implies the existence of quasiperiodic solutions for most values of frequency vector by an abstract KAM (Kolmogorov-Arnold-Moser) theorem for infinite dimensional Hamiltonian systems.

Fundamentals of fractional revival in graphs

We develop a general spectral framework to analyze quantum fractional revival in quantum spin networks. In particular, we determine when the adjacency algebra of a graph contains a matrix of a block diagonal form required for fractional revival, and introduce generalizations of the notions of cospectral and strongly cospectral vertices to arbitrary subsets of vertices. We give several constructions of graphs admitting fractional revival. This work resolves two open questions of Chan et al. (2019) [6].

Variational Adiabatic Gauge Transformation on Real Quantum Hardware for Effective Low-Energy Hamiltonians and Accurate Diagonalization

Effective low-energy theories represent powerful theoretical tools to reduce the complexity in modeling interacting quantum many-particle systems. However, common theoretical methods rely on perturbation theory, which limits their applicability to weak interactions. Here we introduce the Variational Adiabatic Gauge Transformation (VAGT), a nonperturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit that brings the Hamiltonian to either its block-diagonal or full-diagonal form. If a Hamiltonian can be diagonalized via a shallow quantum circuit, then VAGT can learn the optimal parameters using a polynomial number of runs. The accuracy of VAGT is tested through numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.

Clustering, multicollinearity, and singular vectors

Let A be a matrix with its Moore-Penrose pseudo-inverse A†. It is proved that, after re-ordering the columns of A, the projector P=I−A†A has a block-diagonal form, that is there is a permutation matrix Π such that ΠPΠT=diag(S1,S2,…,Sk). It is further proved that each block Si corresponds to a cluster of columns of A that are linearly dependent with each other. A clustering algorithm is provided that allows to partition the columns of A into clusters where columns in a cluster correlate only with columns within the same cluster. Some applications in supervised and unsupervised learning, specially feature selection, clustering, and sensitivity of solutions of least squares solutions are discussed.

Flow-equation approach to quantum systems driven by an amplitude-modulated time-periodic force

We apply the method of flow equations to describe quantum systems subject to a time-periodic drive with a time-dependent envelope. The driven Hamiltonian is expressed in terms of its constituent Fourier harmonics with amplitudes that may vary as a function of time. The time evolution of the system is described in terms of the phase-independent effective Hamiltonian and the complementary micromotion operator that are generated by deriving and solving the flow equations. These equations implement the evolution with respect to an auxiliary flow variable and facilitate a gradual transformation of the quasienergy matrix (the Kamiltonian) into a block diagonal form in the extended space. We construct a flow generator that prevents the appearance of additional Fourier harmonics during the flow, thus enabling implementation of the flow in a computer algebra system. Automated generation of otherwise cumbersome high-frequency expansions (for both the effective Hamiltonian and the micromotion) to an arbitrary order thus becomes straightforward for driven Hamiltonians expressible in terms of a finite algebra of Hermitian operators. We give several specific examples and discuss the possibility to extend the treatment to cover rapid modulation of the envelope.

Fast-forwarding quantum evolution

We investigate the problem of fast-forwarding quantum evolution, whereby the dynamics of certain quantum systems can be simulated with gate complexity that is sublinear in the evolution time. We provide a definition of fast-forwarding that considers the model of quantum computation, the Hamiltonians that induce the evolution, and the properties of the initial states. Our definition accounts for any asymptotic complexity improvement of the general case and we use it to demonstrate fast-forwarding in several quantum systems. In particular, we show that some local spin systems whose Hamiltonians can be taken into block diagonal form using an efficient quantum circuit, such as those that are permutation-invariant, can be exponentially fast-forwarded. We also show that certain classes of positive semidefinite local spin systems, also known as frustration-free, can be polynomially fast-forwarded, provided the initial state is supported on a subspace of sufficiently low energies. Last, we show that all quadratic fermionic systems and number-conserving quadratic bosonic systems can be exponentially fast-forwarded in a model where quantum gates are exponentials of specific fermionic or bosonic operators, respectively. Our results extend the classes of physical Hamiltonians that were previously known to be fast-forwarded, while not necessarily requiring methods that diagonalize the Hamiltonians efficiently. We further develop a connection between fast-forwarding and precise energy measurements that also accounts for polynomial improvements.