相关论文: An efficient algorithm for the Riemannian 10j symb…

A classical spin network consists of a ribbon graph (i.e., an abstract graph with a cyclic ordering of the vertices around each edge) and an admissible coloring of its edges by natural numbers. The standard evaluation of a spin network is…

Quantum-mechanical system -- spin 1 particle in external Coulomb field is studied on the base of the matrix Duffin-Kemmer-Petiau formalism with the use of the tetrad technique. Separation of the variables is performed with the help of…

We revisit the definition of the 6j-symbols from the modular double of U_q(sl(2,R)), referred to as b-6j symbols. Our new results are (i) the identification of particularly natural normalization conditions, and (ii) new integral…

A consequent approach is proposed to construct symplectic force-gradient algorithms of arbitrarily high orders in the time step for precise integration of motion in classical and quantum mechanics simulations. Within this approach the basic…

This paper constructs a kinematic basis for spin networks with planar or cylindrical symmetry, by exploiting the fact that the basis elements are representations of an O(3) subgroup of O(4). The action of the volume operator on this basis…

The Bargmann-Wigner (BW) framework describes particles of spin-j in terms of Dirac spinors of rank 2j, obtained as the local direct product of n Dirac spinor copies, with n=2j. Such spinors are reducible, and contain also (j,0)+(0,j)-pure…

This paper presents a method for the accurate and efficient computations on scalar, vector and tensor fields in three-dimensional spherical polar coordinates. The methods uses spin-weighted spherical harmonics in the angular directions and…

A boson of spin-j>1 can be described in one of the possibilities within the Bargmann-Wigner framework by means of one sole differential equation of order twice the spin, which however is known to be inconsistent as it allows for non-local,…

An algorithm to classify a general Hermitian matrix according to its signature (positive semi-definite, negative or indefinite) is presented. It builds on the Quantum Phase Estimation algorithm, which stores the sign of the eigenvalues of a…

We establish the average-case hardness of the algorithmic problem of exact computation of the partition function associated with the Sherrington-Kirkpatrick model of spin glasses with Gaussian couplings and random external field. In…

This paper develops an algorithmic approach for obtaining approximate, numerical estimates of the sizes of subcodes of Reed-Muller (RM) codes, all of the codewords in which satisfy a given constraint. Our algorithm is based on a statistical…

We give a quantum algorithm for evaluating formulas over an extended gate set, including all two- and three-bit binary gates (e.g., NAND, 3-majority). The algorithm is optimal on read-once formulas for which each gate's inputs are balanced…

We perform a quantization of the loop gravity phase space purely in terms of spinorial variables, which have recently been shown to provide a direct link between spin network states and simplicial geometries. The natural Hilbert space to…

We provide a computer algebra package called Random Tensor Network Integrator (RTNI). It allows to compute averages of tensor networks containing multiple Haar-distributed random unitary matrices and deterministic symbolic tensors. Such…

We present two algorithms, one quantum and one classical, for estimating partition functions of quantum spin Hamiltonians. The former is a DQC1 (Deterministic quantum computation with one clean qubit) algorithm, and the first such for…

To find the discrete symmetries of a Hamilton operator $\hat H$ is of central importance in quantum theory. Here we describe and implement a brute force method to determine the discrete symmetries given by permutation matrices for Hamilton…

The Volume Operator plays a crucial role in the definition of the quantum dynamics of Loop Quantum Gravity (LQG). Efficient calculations for dynamical problems of LQG can therefore be performed only if one has sufficient control over the…

We give two algorithms to compute linear determinantal representations of smooth plane curves of any degree over any field. As particular examples, we explicitly give representatives of all equivalence classes of linear determinantal…

The spinors of the group Spin($N$) of rotations in $N$ spacetime dimensions are indexed by a bitcode with [$N$/2] bits. A well-known promising grand unified group that contains the standard-model group is Spin(10). Fermions in the standard…

Batch Normalization (BN) has proven to be an effective algorithm for deep neural network training by normalizing the input to each neuron and reducing the internal covariate shift. The space of weight vectors in the BN layer can be…