相关论文: wickop: Lattice Cubic Rotation Operator Generator

The stabilized biconjugate gradient algorithm BiCGStab recently presented by van der Vorst is applied to the inversion of the lattice fermion operator in the Wilson formulation of lattice Quantum Chromodynamics. Its computational efficiency…

Lattice calculations could boost our understanding of Deep Inelastic Scattering by evaluating moments of the Nucleon Structure Functions. To this end we study the product of electromagnetic currents between quark states. The Operator…

QCD evolution equations in minimal subtraction schemes have a hidden symmetry: One can construct three operators that commute with the evolution kernel and form an $SL(2)$ algebra, i.e. they satisfy (exactly) the $SL(2)$ commutation…

It can be shown that it is possible to find a representation of Hecke algebras within Clifford algebras of multivectors. These Clifford algebras possess a unique gradation and a possibly non-symmetric bilinear form. Hecke algebra…

Many exponential speedups that have been achieved in quantum computing are obtained via hidden subgroup problems (HSPs). We show that the HSP over Weyl-Heisenberg groups can be solved efficiently on a quantum computer. These groups are…

In this paper we continue the study of $Q$-operators in the six-vertex model and its higher spin generalizations. In [1] we derived a new expression for the higher spin $R$-matrix associated with the affine quantum algebra…

We develop theoretical methods for the implementation of creation and destruction operators in separate registers of a quantum computer, allowing for a transparent and dynamical creation and destruction of particle modes in second…

This paper introduces a novel abstraction for programming quantum operations, specifically projective Cliffords, as functions over the qudit Pauli group. Generalizing the idea behind Pauli tableaux, we introduce a type system and lambda…

Based on the revealed hidden supergroup structure, we develop a new approach to the Hubbard model. We reveal a relation of even Hubbard operators to the spinor representation of the generators of the rotation group of four-dimensional…

Using Kuperberg's $B_2/C_2$ webs, and following Elias and Libedinsky, we describe a "light leaves" algorithm to construct a basis of morphisms between arbitrary tensor products of fundamental representations for $\mathfrak{so}_5\cong…

The toric code can be constructed as a gauge theory of finite groups on oriented two dimensional lattices. Here we construct analogous models with the gauge fields belonging to groupoids, which are categories where every morphism has an…

We introduce HyCOP, a modular framework that learns parametric PDE solution operators by composing simple modules (advection, diffusion, learned closures, boundary handling) in a query-conditioned way. Rather than learning a monolithic map,…

In this chapter of the book entitled, "Extending the Theory of Composites to Other Areas of Science" [edited by Graeme W. Milton, 2016] we give a rigorous derivation of the field equation recursion method in the abstract theory of…

The authors continue a series of articles studying certain unitary representations of the Richard Thompson groups $F,T,V$ called Pythagorean. They all extend to the Cuntz algebra $\mathcal{O}$ and conversely all representations of…

We develop quantum information processing primitives for the planar rotor, the state space of a particle on a circle. By interpreting rotor wavefunctions as periodically identified wavefunctions of a harmonic oscillator, we determine the…

In this contribution, we summarize the results from an NLO computation of the production of ttbb in hadronic collisions. The results are obtained by combining two programs: Helac-1Loop, based on the OPP method and the reduction code…

In this paper, we study dilation of cyclic polytopes with the vertices defined by a generator of the simplest cubic fields. In particular, for a specific range of values, we give a precise number of the contained lattice points.

String diagrams turn algebraic equations into topological moves that have recurring shapes, involving the sliding of one diagram past another. We individuate, at the root of this fact, the dual nature of polygraphs as presentations of…

Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for translation of bigger unitary gates into elementary quantum operations,…

The construction of the topologically protected code space of Kitaev's model for fault-tolerant quantum computation is extended from complex semisimple to arbitrary finite-dimensional Hopf algebras admitting pairs in involution. One input…