Related papers: Quantum Pfaffians and Hyper-Pfaffians
Quantum machine learning aims to release the prowess of quantum computing to improve machine learning methods. By combining quantum computing methods with classical neural network techniques we aim to foster an increase of performance in…
We prove a highest weight theorem classifying irerducible finite--dimensional representations of quantum affine algebras and survey what is currently known about the structure of these representations.
The quantum $\alpha$-determinant is defined as a parametric deformation of the quantum determinant. We investigate the cyclic $\mathcal{U}_q(\mathfrak{sl}_2)$-submodules of the quantum matrix algebra $\mathcal{A}_q(\mathrm{Mat}_2)$…
The meaning of quantum group transformation properties is discussed in some detail by comparing the (co)actions of the quantum group with those of the corresponding Lie group, both of which have the same algebraic (matrix) form of the…
The quantum integrable systems associated with the quantum loop algebras $\mathrm U_q(\mathcal L(\mathfrak{sl}_{\, l + 1}))$ are considered. The factorized form of the transfer operators related to the infinite dimensional evaluation…
According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…
$q$-Yangians can be viewed both as quantum deformations of the loop algebras of upper triangular Lie algebras and deformations of the Yangian algebras. In this paper, we study the quantum affine algebra as a product of two copies of the…
Quantum Fourier transformation is important in many quantum algorithms. In this paper, we generalize quantum Fourier transformation over the Abelian group $\mathbb{Z}_N$ from two different points to get more efficient unitary…
We consider a finite universe U (more exactly - a family U of them) and second order quantifiers Q_K, where for each U this means quantifying over a family of n(K)-place relations closed under permuting U. We define some natural orders and…
Higher-order quantum theory is an extension of quantum theory where one introduces transformations whose input and output are transformations, thus generalizing the notion of channels and quantum operations. The generalization then goes…
The quantum Fourier transform (QFT) is a fundamental primitive in quantum computation and quantum information. In this work, we generalize the QFT for finite groups to a QFT for finite-dimensional semisimple algebras, and give efficient…
Generalizing our earlier work, we introduce the homogeneous quantum $Z$-algebras for all quantum affine algebras $\alg$ of type one. With the new algebras we unite previously scattered realizations of quantum affine algebras in various…
Weaver has recently defined the notion of a quantum relation on a von Neumann algebra. We demonstrate that the corresponding notion of a quantum function between two von Neumann algebras coincides with that of a normal unital…
Determinant quantum Monte Carlo (DQMC), formulated in complex-fermion representation, has played a key role in studying strongly-correlated fermion systems. However, its applicability is limited due to the requirement of particle-number…
The Quantum Fourier Transform (QFT) is a fundamental component of many quantum computing algorithms. In this paper, we present an alternative method for factoring this transformation. Inspired by this approach, we introduce a new quantum…
We introduce quantum hypergraphs, in analogy with the theory of quantum graphs developed over the last 15 years by many authors. We emphasize some problems that arise when one tries to define a Laplacian on a hypergraph.
We study the quantum symmetric spaces for quantum general linear groups modulo symplectic groups. We first determine the structure of the quotient quantum group and completely determine the quantum invariants. We then derive the…
Based on ideas of quantum theory of open systems we propose the consistent approach to the formulation of logic of plausible propositions. To this end we associate with every plausible proposition diagonal matrix of its likelihood and…
We elaborate on the connection between Gel'fand-Kapranov-Zelevinsky systems, de Rham theory for twisted cohomology groups, and Pfaffian equations for Feynman integrals. We propose a novel, more efficient algorithm to compute Macaulay…
We theoretically and experimentally investigate conditional enhancement of overall coherence of quantum states by probabilistic quantum operations that apply to the input state a quantum filter diagonal in the basis of incoherent states. We…