English
Related papers

Related papers: Prefix Sums via Kronecker Products

200 papers

A Toffoli gate ($C^{n}$-NOT gate) is regarded as an important unitary gate in quantum computation, and is simulated by a quantum circuit composed of $C^{2}$-NOT gates. This paper presents a quantum circuit with a new configuration of…

Quantum Physics · Physics 2007-05-23 Masanari Asano , Chikara Ishii

In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving…

Combinatorics · Mathematics 2010-07-19 Emrah Kilic , Eugen J. Ionascu

Prevailing proposals for the first generation of quantum computers make use of 2-level systems, or qubits, as the fundamental unit of quantum information. However, recent innovations in quantum error correction and magic state distillation…

Quantum Physics · Physics 2019-02-18 Luke E. Heyfron , Earl Campbell

The paper is concerned with the Kontsevich-Zagier formal power series $$ f(q)=\sum_{n=0}^\infty (1-q)... (1-q^n) $$ and its analytic properties. To begin with, we give an explicit formula for the Borel transform of the associated formal…

Geometric Topology · Mathematics 2010-08-10 Ovidiu Costin , Stavros Garoufalidis

Matrix pencils, or pairs of matrices, are used in a variety of applications. By the Kronecker decomposition Theorem, they admit a normal form. This normal form consists of four parts, one part based on the Jordan canonical form, one part…

Category Theory · Mathematics 2017-08-15 Olivier Verdier

Fault-tolerant quantum computation requires minimizing non-Clifford gates, whose implementation via magic state distillation dominates the resource costs. While $T$-count minimization is well-studied, dedicated $CCZ$ factories shift the…

Quantum Physics · Physics 2026-02-18 Kirill Khoruzhii , Patrick Gelß , Sebastian Pokutta

We introduce a new family of strong linearizations of matrix polynomials---which we call "block Kronecker pencils"---and perform a backward stability analysis of complete polynomial eigenproblems. These problems are solved by applying any…

Numerical Analysis · Mathematics 2017-07-18 Froilán M. Dopico , Piers W. Lawrence , Javier Pérez , Paul Van Dooren

Weighted sums of left and right hand Kronecker products of Integer Sequence Doubly Affine (ISDA) as well as Generalized Arithmetic Progression Doubly Affine (GAPDA) arrays are used to generate larger ISDA arrays of multiplicative order…

Combinatorics · Mathematics 2017-12-01 Adam Rogers , Ian Cameron , Peter Loly

Tensor Kronecker products, the natural generalization of the matrix Kronecker product, are independently emerging in multiple research communities. Like their matrix counterpart, the tensor generalization gives structure for implicit…

Social and Information Networks · Computer Science 2022-06-14 Charles Colley , Huda Nassar , David Gleich

We consider the tensor product $\pi_{\alpha}\otimes \pi_{\beta}$ of complementary series representations $\pi_{\alpha}$ and $\pi_{\beta}$ of classical rank one groups $SO_0(n, 1)$, $SU(n, 1)$ and $Sp(n, 1)$. We prove that there is a…

Representation Theory · Mathematics 2017-05-16 Genkai Zhang

State-of-the-art embeddings often capture distinct yet complementary discriminative features: For instance, one image embedding model may excel at distinguishing fine-grained textures, while another focuses on object-level structure.…

Machine Learning · Computer Science 2025-10-31 Youqi Wu , Jingwei Zhang , Farzan Farnia

Multiplication of quantum states is a frequently used function or subroutine in quantum algorithms and applications, making quantum multipliers an essential component of quantum arithmetic. However, quantum multiplier circuits suffer from…

Quantum Physics · Physics 2025-06-24 Bhaskar Gaur , Himanshu Thapliyal

The problem of whether the cohomological support map of a finite dimensional Hopf algebra has the tensor product property has attracted a lot of attention following the earlier developments on representations of finite group schemes. Many…

Category Theory · Mathematics 2021-08-12 Daniel K. Nakano , Kent B. Vashaw , Milen T. Yakimov

We study the units in a tensor product of rings. For example, let k be an algebraically closed field. Let A and B be reduced rings containing k, having connected spectra. Let u \in A tensor_k B be a unit. Then u = a tensor_k b for some…

alg-geom · Mathematics 2008-02-03 David B. Jaffe

Three loop ladder and $V$-topology diagrams contributing to the massive operator matrix element $A_{Qg}$ are calculated. The corresponding objects can all be expressed in terms of nested sums and recurrences depending on the Mellin variable…

High Energy Physics - Phenomenology · Physics 2016-04-20 J. Ablinger , A. Behring , J. Blümlein , A. De Freitas , A. von Manteuffel , C. Schneider

To any triangulated category with tensor product $(K,\otimes)$, we associate a topological space $Spc(K,\otimes)$, by means of thick subcategories of $K$, a la Hopkins-Neeman-Thomason. Moreover, to each open subset $U$ of $Spc(K,\otimes)$,…

Algebraic Geometry · Mathematics 2015-01-13 Paul Balmer

For a root system R, a field K and a "choice of coefficients in K" we define a category of graded spaces with operators and study some of its properties. Then we assume that the coefficients are given by quantum binomials. We use basic…

Representation Theory · Mathematics 2023-11-16 Peter Fiebig

We prove that the border rank of the Kronecker square of the little Coppersmith-Winograd tensor $T_{cw,q}$ is the square of its border rank for $q > 2$ and that the border rank of its Kronecker cube is the cube of its border rank for $q >…

Computational Complexity · Computer Science 2021-12-28 Austin Conner , Fulvio Gesmundo , Joseph M. Landsberg , Emanuele Ventura

It is well known that mutually orthogonal latin squares, or MOLS, admit a (Kronecker) product construction. We show that, under mild conditions, `triple products' of MOLS can result in a gain of one square. In terms of transversal designs,…

Combinatorics · Mathematics 2014-01-08 Peter J. Dukes , Alan C. H. Ling

The "short cycle removal" technique was recently introduced by Abboud, Bringmann, Khoury and Zamir (STOC '22) to prove fine-grained hardness of approximation. Its main technical result is that listing all triangles in an $n^{1/2}$-regular…

Data Structures and Algorithms · Computer Science 2023-10-24 Amir Abboud , Karl Bringmann , Nick Fischer