相关论文: The complexity of the fermionant, and immanants of…

The fermionant can be seen as a generalization of both the permanent (for $k=-1$) and the determinant. We demonstrate that it is VNP-complete for most cases. Furthermore it is #P-complete for the cases. The immanant is also a generalization…

Immanants are polynomial functions of n by n matrices attached to irreducible characters of the symmetric group S_n, or equivalently to Young diagrams of size n. Immanants include determinants and permanents as extreme cases. Valiant proved…

We discuss the numerical implementation of two related representations of fermionic density matrices which have been introduced in Annals of Physics 370, 12 (2016). In both of them, the density matrix is expanded in a basis of Bargmann…

This paper is the first in the series devoted to evaluation of the partition function in statistical models on graphs with loops in terms of the Berezin/fermion integrals. The paper focuses on a representation of the determinant of a square…

We introduce a new mathematical object, the "fermionant" ${\mathrm{Ferm}}_N(G)$, of type $N$ of an $n \times n$ matrix $G$. It represents certain $n$-point functions involving $N$ species of free fermions. When N=1, the fermionant reduces…

We present a fermion model characterized by an anticommuting-parameter shift symmetry. The Hamiltonian formulation exhibits a combination of first-class and second-class constraints. We derive the well-known Dirac equation by fixing the…

In contrast to the determinant, no algorithm is known for the exact determination of the permanent of a square matrix that runs in time polynomial in its dimension. Consequently, non interacting fermions are classically efficiently…

Given an integer $n\geq 1$ and an irreducible character $\chi_{\lambda}$ of $S_{n}$ for some partition $\lambda$ of $n$, the immanant $\mathrm{imm}_{\lambda}:\mathbb{C}^{n\times n}\to\mathbb{C}$ maps matrices $A\in\mathbb{C}^{n\times n}$ to…

We establish the $\#P$-hardness of computing a broad class of immanants, even when restricted to specific categories of matrices. Concretely, we prove that computing $\lambda$-immanants of $0$-$1$ matrices is $\#P$-hard whenever the…

We study the particle spectrum M_n(h) in the two-dimensional ferromagnetic Ising field theory in a weak external magnetic field h. According to Wu and McCoy scenario of the weak confinement, pairs of fermions (domain walls) are coupled into…

Fermionic neural network (FermiNet) is a recently proposed wavefunction Ansatz, which is used in variational Monte Carlo (VMC) methods to solve the many-electron Schr\"{o}dinger equation. FermiNet proposes permutation-equivariant…

Fermions are coupled to the Einstein-Cartan system in the canonical formulation, including the cosmological, the Barbero-Immirzi, and the non-minimal coupling constants. The resulting ten first-class constraints generate gauge…

By using a framework where the object of noncommutativity $\theta^{\mu\nu}$ represents independent degrees of freedom, we study the symmetry properties of an extended $x+\theta$ space-time, given by the group $P$', which has the…

This thesis addresses a fundamental problem in deformation quantization: the difficulty of calculating the star-exponential, the symbol of the evolution operator, due to convergence issues. Inspired by the formalism that connects the…

We obtain the fermionic formulas for the characters of (k, r)-admissible configurations in the case of r=2 and r=3. This combinatorial object appears as a label of a basis of certain subspace $W(\Lambda)$ of level-$k$ integrable highest…

Two graphs $G$ and $H$ are homomorphism indistinguishable over a family of graphs $\mathcal{F}$ if for all graphs $F \in \mathcal{F}$ the number of homomorphisms from $F$ to $G$ is equal to the number of homomorphism from $F$ to $H$. Many…

Denote by $p(k)$ the limit, as $n \rightarrow \infty$, of the probability that a random permutation on a set of size $n$ has an invariant set of size $k$. We give an asymptotic formula for $p(k)$, showing that it is asymptotically…

The Independent Set is a well known NP-hard optimization problem. In this work, we define a fermionic generalization of the Independent Set problem and prove that the optimization problem is QMA-hard in a $k$-particle subspace using…

The operator algebra of fermionic modes is isomorphic to that of qubits, the difference between them is twofold: the embedding of subalgebras corresponding to mode subsets and multiqubit subsystems on the one hand, and the parity…

We propose a general framework for finding the ground state of many-body fermionic systems by using feed-forward neural networks. The anticommutation relation for fermions is usually implemented to a variational wave function by the Slater…