Related papers: Asymmetric All-or-nothing Transforms
We introduce the Normalized Matching Transformer (NMT), a deep learning approach for efficient and accurate sparse semantic keypoint matching between image pairs. NMT consists of a strong visual backbone, geometric feature refinement via…
An order parameter description of the Anderson-Mott transition (AMT) is given. We first derive an order parameter field theory for the AMT, and then present a mean-field solution. It is shown that the mean-field critical exponents are exact…
Topological phases in two dimensions support anyonic quasiparticle excitations that obey neither bosonic nor fermionic statistics. These anyon structures often carry global symmetries that relate distinct anyons with similar fusion and…
In this paper we present a first non-iterative imaging method for nonlinear materials, based on Monotonicity Principle. Specifically, we deal with the inverse obstacle problem, where the aim is to retrieve a nonlinear anomaly embedded in…
Finite (or Discrete) Fourier Transforms (FFT) are essential tools in engineering disciplines based on signal transmission, which is the case in most of them. FFT are related with circulant matrices, which can be viewed as group matrices of…
These are a set of lecture notes on generalized global symmetries in quantum field theory. The focus is on invertible symmetries with a few comments regarding non-invertible symmetries. The main topics covered are the basics of higher-form…
Fully homomorphic encryption is a kind of encryption scheme, which enables arbitrary computation on encrypted data without accessing the data. We present the quantum version of fully homomorphic encryption scheme, which is constructed based…
Symmetry acting on a (2+1)$D$ topological order can be anomalous in the sense that they possess an obstruction to being realized as a purely (2+1)$D$ on-site symmetry. In this paper, we develop a (3+1)$D$ topological quantum field theory to…
The Lieb-Schultz-Mattis theorem and its higher dimensional generalizations by Oshikawa and Hastings require that translationally invariant 2D spin systems with a half-integer spin per unit cell must either have a continuum of low energy…
Based on quantum entanglement, an all-or-nothing oblivious transfer protocol is proposed and is proven to be secure. The distinct merit of the present protocol lies in that it is not based on quantum bit commitment. More intriguingly, this…
We describe an exact sampler for a simply-typed, first-order functional programming language. Given an acyclic finite automaton, $\alpha_{\varnothing}$, it samples a random function uniformly without replacement from well-typed functions in…
When we consider a differential equation $\Delta=0$ whose set of solutions is ${{\cal S}}_\Delta$, a Lie-point exact symmetry of this is a Lie-point invertible transformation $T$ such that $T({{\cal S}}_\Delta)={{\cal S}}_\Delta$, i.e. such…
Fourier Transforms is a first in a series of monographs we present on harmonic analysis. Harmonic analysis is one of the most fascinating areas of research in mathematics. Its centrality in the development of many areas of mathematics such…
The algebraic formulation for linear network coding in acyclic networks with the links having integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay…
The z-transform of a sequence is a classical tool used within signal processing, control theory, computer science, and electrical engineering. It allows for studying sequences from their generating functions, with many operations that can…
A basic diagnostic of entanglement in mixed quantum states is known as the partial transpose and the corresponding entanglement measure is called the logarithmic negativity. Despite the great success of logarithmic negativity in…
We prove that there exists an absolute constant $\alpha<1$ such that for every finite dimension $d$ and every quantum channel $T$ on $\mathsf{L}(\mathbb{C}^d)$, $\left\|\Theta\circ(\mathrm{id}-T)\right\|_\diamond \le…
We define the Thue-Morse transform T on a class of infinite binary words. It sends the alternating word a_0 = 010101... to the Thue-Morse sequence. We then study its orbit a_m = T^m(a_0) as well as the sequences u_m and v_m giving…
Valiant's Holant theorem is a powerful tool for algorithms and reductions for counting problems. It states that if two sets $\mathcal{F}$ and $\mathcal{G}$ of tensors (a.k.a. constraint functions or signatures) are related by a…
We introduce the concept of quantum supermap, describing the most general transformation that maps an input quantum operation into an output quantum operation. Since quantum operations include as special cases quantum states, effects, and…