Related papers: Finite-Function-Encoding Quantum States
We use F-theory to classify possibly all six-dimensional superconformal field theories (SCFTs). This involves a two step process: We first classify all possible tensor branches allowed in F-theory (which correspond to allowed collections of…
We introduce an extension of fixed-point logic ($\mathsf{FP}$) with a group-order operator ($\mathsf{ord}$), that computes the size of a group generated by a definable set of permutations. This operation is a generalization of the rank…
In this study, a subclass of an univalent function with negative coefficients which is defined by a new general Linear operator have been introduced. The sharp results for coefficients estimators, distortion and closure bounds, Hadamard…
Stabilizer states and graph states find application in quantum error correction, measurement-based quantum computation and various other concepts in quantum information theory. In this work, we study party-local Clifford (PLC)…
We discuss the fundamental role of entanglement as the essential nonclassical feature providing the computational speed-up in the known quantum algorithms. We review the construction of the Fourier transform on an Abelian group and the…
We introduce and study holomorphically finitely generated (HFG) Fr\'echet algebras, which are analytic counterparts of affine (i.e., finitely generated) $\mathbb C$-algebras. Using a theorem of O. Forster, we prove that the category of…
In this paper, a secure Convolutional Neural Network classifier is proposed using Fully Homomorphic Encryption (FHE). The secure classifier provides a user with the ability to out-source the computations to a powerful cloud server and/or…
We investigate the entanglement properties of pure quantum states describing $n$ qubits. We characterize all multipartite states which can be maximally entangled to local auxiliary systems using controlled operations. A state has this…
We have recently proposed that Force-Free Electrodynamics (FFE) does not apply to pulsars -- pulsars should be described by the high-conductivity limit of Strong-Field Electrodynamics (SFE), which predicts an order-unity damping of the…
Let $q = p^m$, where $p$ is an odd prime number and $m$ is a positive integer. In this paper, we examine the finite field $\mathbb{F}_{q^2}$, which consists of $q^2$ elements. We first present an alternative method to determine the…
The commutative semiring $\mathbf{D}$ of finite, discrete-time dynamical systems was introduced in order to study their (de)composition from an algebraic point of view. However, many decision problems related to solving polynomial equations…
We study non-parametric frequency-domain system identification from a finite-sample perspective. We assume an open loop scenario where the excitation input is periodic and consider the Empirical Transfer Function Estimate (ETFE), where the…
We report on a recent implementation of Giesbrecht's algorithm for factoring polynomials in a skew-polynomial ring. We also discuss the equivalence between factoring polynomials in a skew-polynomial ring and decomposing $p^s$-polynomials…
We develop new approximation algorithms and data structures for representing and computing with multivariate functions using the functional tensor-train (FT), a continuous extension of the tensor-train (TT) decomposition. The FT represents…
Consider a symmetric quantum state on an n-fold product space, that is, the state is invariant under permutations of the n subsystems. We show that, conditioned on the outcomes of an informationally complete measurement applied to a number…
We introduce a finite-range pseudopotential built as an expansion in derivatives up to next-to-next-to-next-to-leading order (N$^3$LO) and we calculate the corresponding nonlocal energy density functional (EDF). The coupling constants of…
Frameproof codes are a class of secure codes introduced by Boneh and Shaw in the context of digital fingerprinting, and have been widely studied from a combinatorial point of view. In this paper, we study a quantitative extension of…
This paper is a brief review of recent results on the concept of ``generalized $\tau$-function'', defined as a generating function of all the matrix elements in a given highest-weight representation of a universal enveloping algebra ${\cal…
Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and…
There is a connection between classical codes, highly entangled pure states (called k-uniform or absolutely maximally entangled (AME) states), and quantum error correcting codes (QECCs). This leads to a systematic method to construct…