相关论文: Subtraction-free complexity, cluster transformatio…
We develop analytical methods for computing the structure constant for three heavy operators, starting from the recently proposed hexagon approach. Such a structure constant is a semiclassical object, with the scale set by the inverse…
The quantum Fourier transform (QFT) brings efficiency in many respects, especially usage of resource, for most operations on quantum computers. In this study, the existing QFT-based and non-QFT-based quantum arithmetic operations are…
We describe an efficient quantum algorithm for the quantum Schur transform. The Schur transform is an operation on a quantum computer that maps the standard computational basis to a basis composed of irreducible representations of the…
Motivated by the problem of routing reliably and scalably in a graph, we introduce the notion of a splicer, the union of spanning trees of a graph. We prove that for any bounded-degree n-vertex graph, the union of two random spanning trees…
Representations of Spin groups and Clifford algebras derived from the structure of qubit trees are introduced in this work. For ternary trees the construction is more general and reduction to binary trees is formally defined by deletion of…
In this paper, we give subordination functions for free additive and free multiplicative deconvolutions in some domain of the complex half-plane, under the condition that the distributions admit moments, respectively, of second order for…
Many quantum algorithms can be represented in a form of a classical circuit positioned between quantum Fourier transformations. Motivated by the search for new quantum algorithms, we turn to circuits where the latter transformation is…
We propose a model-based clustering algorithm for a general class of functional data for which the components could be curves or images. The random functional data realizations could be measured with error at discrete, and possibly random,…
We present a super-high-efficiency approximate computing scheme for series sum and discrete Fourier transform. The summation of a series sum or a discrete Fourier transform is approximated by summing over part of the terms multiplied by…
We herein introduce a new method of interpretable clustering that uses unsupervised binary trees. It is a three-stage procedure, the first stage of which entails a series of recursive binary splits to reduce the heterogeneity of the data…
The quantum Schur transform is a fundamental building block that maps the computational basis to a coupled basis consisting of irreducible representations of the unitary and symmetric groups. Equivalently, it may be regarded as a change of…
We prove several results about the relationship between the word complexity function of a subshift and the set of Turing degrees of points of the subshift, which we call the Turing spectrum. Among other results, we show that a Turing…
Decision trees are popular classification models, providing high accuracy and intuitive explanations. However, as the tree size grows the model interpretability deteriorates. Traditional tree-induction algorithms, such as C4.5 and CART,…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
In this paper, new schemes for a squarer, multiplier and divider of complex numbers are proposed. Traditional structural solutions for each of these operations require the presence some number of general-purpose binary multipliers. The…
The construction of cut trees (also known as Gomory-Hu trees) for a given graph enables the minimum-cut size of the original graph to be obtained for any pair of vertices. Cut trees are a powerful back-end for graph management and mining,…
For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components. A vertex separator $S$ is minimal if it contains no other separator as a strict subset and a minimum vertex separator is a minimal…
After deriving inequalities on coefficients arising in the expansion of a Schur $P$-function in terms of Schur functions we give criteria for when such expansions are multiplicity free. From here we study the multiplicity of an irreducible…
We classify and construct all multiplicity-free plethystic products of Schur functions. We also compute many new (infinite) families of plethysm coefficients, with particular emphasis on those near maximal in the dominance ordering and…
For a density $f$ on ${\mathbb R}^d$, a {\it high-density cluster} is any connected component of $\{x: f(x) \geq \lambda\}$, for some $\lambda > 0$. The set of all high-density clusters forms a hierarchy called the {\it cluster tree} of…