相关论文: Implementation of linear maps with circulant matri…

The integrability of 4d $\mathcal{N}=2$ gauge theories has been explored in various contexts, for example the Seiberg-Witten curve and its quantization. Recently, Maulik and Okounkov proposed that an integrable lattice model is associated…

We proved that for any matrix dilation and for any positive integer $n$, there exists a compactly supported tight wavelet frame with approximation order $n$. Explicit methods for construction of dual and tight wavelet frames with a given…

We present a constructive method to create quantum circuits that implement oracles $|x\rangle|y\rangle|0\rangle^k \mapsto |x\rangle|y \oplus f(x)\rangle|0\rangle^k$ for $n$-variable Boolean functions $f$ with low $T$-count. In our method…

Implementing many important sub-circuits on near-term quantum devices remains a challenge due to the high levels of noise and the prohibitive depth on standard nearest-neighbour topologies. Overcoming these barriers will likely require…

Quantum versions of the hydrogen atom and the harmonic oscillator are studied on non Euclidean spaces of dimension N. 2N-1 integrals, of arbitrary order, are constructed via a multi-dimensional version of the factorization method, thus…

The calculation of exclusive observables beyond the one-loop level requires elaborate techniques for the computation of multi-leg two-loop integrals. We discuss how the large number of different integrals appearing in actual two-loop…

Photonic integrated circuits have been extensively explored for optical processing with the aim of breaking the speed bottleneck of digital electronics. However, the input/output (IO) bottleneck remains one of the key barriers. Here we…

Binary matrix factorisation is an essential tool for identifying discrete patterns in binary data. In this paper we consider the rank-k binary matrix factorisation problem (k-BMF) under Boolean arithmetic: we are given an n x m binary…

In this paper we establish the connection between the Orthogonal Optical Codes (OOC) and binary compressed sensing matrices. We also introduce deterministic bipolar $m\times n$ RIP fulfilling $\pm 1$ matrices of order $k$ such that…

The Kruithof iterative scaling process, which adjusts matrices to meet target row and column sums, is a longstanding problem that lacks a general closed form for its limit. While Nathanson derived the closed form for the Sinkhorn limit of…

We consider the power of Boolean circuits with MOD$_{6}$ gates. First, we introduce a few basic notions of computational complexity, and describe the standard models with which we study the complexity of problems. We then define the model…

The computational function of a matchgate is represented by its character matrix. In this article, we show that all nonsingular character matrices are closed under matrix inverse operation, so that for every $k$, the nonsingular character…

We introduce an invariant linked to some foundational questions in geometric measure theory and provide bounds on this invariant by decomposing an arbitrary cycle into uniformly rectifiable pieces. Our invariant measures the difficulty of…

In this paper we present a generic construction to obtain an optimal T depth quantum circuit for any arbitrary $n$-input $m$-output Boolean function $f: \{0,1\}^n \rightarrow \{0,1\}^m$ having algebraic degree $k\leq n$, and it achieves an…

We present recursive multiport schemes for implementing quantum Fourier transforms and the inversion step in Grover's algorithm on an integrated linear optics device. In particular, each scheme shows how to execute a quantum operation on…

We give the first super-polynomial separation in the power of bounded-depth boolean formulas vs. circuits. Specifically, we consider the problem Distance $k(n)$ Connectivity, which asks whether two specified nodes in a graph of size $n$ are…

We show that, for each real number $\alpha > 0$ and odd integer $k\ge 5$ there is an integer $c$ such that, if $M$ is a simple binary matroid with $|M| \ge \alpha 2^{r(M)}$ and with no $k$-element circuit, then $M$ has critical number at…

We prove that every non-circular D0L system contains arbitrarily long repetitions. This result was already published in 1993 by Mignosi and S\'e\'ebold, however their proof is only a sketch. We give here a complete proof. Further, employing…

Discrete-time quantum walks with position-dependent coin operators have numerous applications. For a position dependence that is sufficiently smooth, it has been provided in Ref. [1] an approximate quantum-circuit implementation of the coin…

We continue to study the notion of cancellation-free linear circuits. We show that every matrix can be computed by a cancellation- free circuit, and almost all of these are at most a constant factor larger than the optimum linear circuit…