Related papers: Finite-Function-Encoding Quantum States
Partial differential equations (PDEs) underlie our understanding and prediction of natural phenomena across numerous fields, including physics, engineering, and finance. However, solving parametric PDEs is a complex task that necessitates…
Accurate band gap prediction in semiconductors is crucial for materials science and semiconductor technology advancements. This paper extends the Perdew-Burke-Ernzerhof (PBE) functional for a wide range of semiconductors, tackling the…
The representation of numbers by tensor product states of composite quantum systems is examined. Consideration is limited to k-ary representations of length L and arithmetic modulo k^{L}. An abstract representation on an L fold tensor…
Symmetries are of fundamental interest in many areas of science. In quantum information theory, if a quantum state is invariant under permutations of its subsystems, it is a well-known and widely used result that its marginal can be…
Homomorphic encryption (HE) is a promising privacy-preserving technique for cross-silo federated learning (FL), where organizations perform collaborative model training on decentralized data. Despite the strong privacy guarantee, general HE…
We introduce new polynomial invariants of a finite-dimensional semisimple and cosemisimple Hopf algebra A over a field by using the braiding structures of A. We investigate basic properties of the polynomial invariants including stability…
Finite-state complexity is a variant of algorithmic information theory obtained by replacing Turing machines with finite transducers. We consider the state-size of transducers needed for minimal descriptions of arbitrary strings and, as our…
We present a Trefftz-type finite element method on meshes consisting of curvilinear polygons. Local basis functions are computed using integral equation techniques that allow for the efficient and accurate evaluation of quantities needed in…
The class of entangled $N$-qubit states known as graph states, and the corresponding stabilizer groups of $N$-qubit Pauli observables, have found a wide range of applications in quantum information processing and the foundations of quantum…
We classify localising subcategories of the stable module category of a finite group that are closed under tensor product with simple (or, equivalently all) modules. One application is a proof of the telescope conjecture in this context.…
While stabilizer tableaus have proven exceptionally useful as a descriptive tool for additive quantum codes, they offer little guidance for concrete constructions or coding algorithm analysis. We introduce a representation of stabilizer…
In this work we study the encoding of smooth, differentiable multivariate functions in quantum registers, using quantum computers or tensor-network representations. We show that a large family of distributions can be encoded as…
Finite hypergeometric functions are complex valued functions on finite fields which are the analogue of the classical analytic hypergeometric functions. From the work of N.M.Katz it follows that their values are traces of Frobenius on…
Hypergraph states are multiqubit states whose combinatorial description and entanglement properties generalize the well-studied class of graph states. Graph states are important in applications such as measurement-based quantum computation…
In quantum information theory, maximally entangled states, specifically locally maximally entangled (LME) states, are essential for quantum protocols. While many focus on bipartite entanglement, applications such as quantum error correction…
A transform between functions in R and functions in Zd is used to define the analogue of number and coherent states in the context of finite d-dimensional quantum systems. The coherent states are used to define an analytic representation in…
$F$-polynomials are integer coefficient polynomials encoding the mutations of cluster variables inside a cluster algebra. In this article, we study the $F$-polynomials associated with the action of Donaldson-Thomas transformations on…
Tiered graph autoencoders provide the architecture and mechanisms for learning tiered latent representations and latent spaces for molecular graphs that explicitly represent and utilize groups (e.g., functional groups). This enables the…
The migration of computation to the cloud has raised concerns regarding the security and privacy of sensitive data, as their need to be decrypted before processing, renders them susceptible to potential breaches. Fully Homomorphic…
We present a mathematical model: dynamical systems over finite sets (DSF), and we show that Boolean and discrete genetic models are special cases of DFS. In this paper, we prove that a function defined over finite sets with different number…