Related papers: Quantum Pfaffians and Hyper-Pfaffians
We present a uniform framework for the treatment of a large class of toy models of quantum theory. Specifically, we will be interested in theories of wavefunctions valued in commutative involutive semirings, and which give rise to some…
The problem of introducing a dependence of elements of quantum group on classical parameters is considered. It is suggested to interpret a homomorphism from the algebra of functions on quantum group to the algebra of sections of a sheaf of…
We reconstruct finite-dimensional quantum theory with superselection rules, which can describe hybrid quantum-classical systems, from four purely operational postulates: symmetric sharpness, complete mixing, filtering, and local equality.…
In this lecture, we survey a number of recent results and developments regarding the representation theory of infinite-dimensional quantum groups (quantum affine algebras and related algebras), as well as their connections with cluster…
This paper explores a quantum deformation of the classical identity Pf(A)^2 = det(A) for 2n by 2n skew-symmetric matrices A, which classically relates the square of the Pfaffian to the determinant. In the quantum setting, we study matrices…
We study the structure and representations of a family of vertex algebras obtained from affine superalgebras by quantum reduction. As an application, we obtain in a unified way free field realizations and determinant formulas for all…
We show that semiclassical formulas such as the Gutzwiller trace formula can be implemented on a quantum computer more efficiently than on a classical device. We give explicit quantum algorithms which yield quantum observables from…
We extend the semiclassical study of the Neumann model down to the deep quantum regime. A detailed study of connection formulae at the turning points allows to get good matching with the exact results for the whole range of parameters.
Quantum affine bundles are quantum principal bundles with affine quantum structure groups. A general theory of quantum affine bundles is presented. In particular, a detailed analysis of differential calculi over these bundles is performed,…
We define transgressions of arbitrary order, with respect to families of unit-vector fields indexed by a polytope, for the Pfaffian of metric connections for semi-Riemannian metrics on vector bundles. We apply this formula to compute the…
Explicit expressions are proven for derivatives of the ratio of a determinant or Pfaffian determinant and a Vandermonde determinant. Such ratios appear for example in general group integrals of Harish-Chandra--Itzykson--Zuber type and in…
We present a number of quantum computing patterns that build on top of fundamental algorithms, that can be applied to solving concrete, NP-hard problems. In particular, we introduce the concept of a quantum dictionary as a summation of…
In the previous paper (J. Combin. Theory Ser. A, 120, 2013, 1263--1284) H. Tagawa and the two authors proposed an algebraic method to compute certain Pfaffians whose form resemble to Hankel determinants associated with moment sequences of…
Quantum computers provide a super-exponential speedup for performing a Fourier transform over the symmetric group, an ability for which practical use cases have remained elusive so far. In this work, we leverage this ability to unlock…
A rigid framework for the Cartan calculus of Lie derivatives, inner derivations, functions, and forms is proposed. The construction employs a semi-direct product of two graded Hopf algebras, the respective super-extensions of the deformed…
We give a simple formula for some determinants, and an analogous formula for pfaffians, both of which are polynomial identities. The second involve some expressions that interpolate between determinants and pfaffians. We give several…
A causal, non-Hermitian, renormalizable, local, unitary and Lorentz convariant formulation of Quantum Theory (QT) (= Quantum Mechanics (QM) and Quantum Field Theory (QFT)) is developed which is free of formalistic problems we face in the…
Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it important to have general techniques for developing fast quantum algorithms for computing unitary transforms. A quantum routine for computing a…
We define generalized bialgebras and Hopf algebras and on this basis we introduce quantum categories and quantum groupoids. The quantization of the category of linear (super)spaces is constructed. We establish a criterion for the classical…
Quantum Fourier Transform (QFT) plays a principal role in the development of efficient quantum algorithms. Since the number of quantum bits that can currently built is limited, while many quantum technologies are inherently three- (or more)…