Related papers: Quantum complexity of the Kronecker coefficients
The geometry of quantum states provides a unifying framework for estimation processes based on quantum probes, and it allows to derive the ultimate bounds of the achievable precision. We show a relation between the statistical distance…
In Cogdell et al., \it LMS Lecture Notes Series \bf 459, \rm 393--427 (2020), \rm the authors proved an analogue of Kronecker's limit formula associated to any divisor $\mathcal D$ which is smooth in codimension one on any smooth K\"ahler…
We study the computational model where we can access a matrix $\mathbf{A}$ only by computing matrix-vector products $\mathbf{A}\mathrm{x}$ for vectors of the form $\mathrm{x} = \mathrm{x}_1 \otimes \cdots \otimes \mathrm{x}_q$. We prove…
Quantum error correction (QEC) is a key concept in quantum computation as well as many areas of physics. There are fundamental tensions between continuous symmetries and QEC. One vital situation is unfolded by the Eastin--Knill theorem,…
We establish a lower bound on the quantum coherence of an arbitrary quantum state in arbitrary dimension, using a noncommutativity estimator of an arbitrary observable of sub-unit norm, where the estimator is the commutator of the…
For any three element set of positive integers, $\{a,b,n\}$, with $a<b<n$, $n$ sufficiently large and $\gcd(a,b)=1$, we find the least $\alpha$ such that given any real numbers $t_1$, $t_2$, $t_3$, there is a real number $x$ such that…
We study the problem of estimating the trace of a matrix $\mathbf{A}$ that can only be accessed through Kronecker-matrix-vector products. That is, for any Kronecker-structured vector $\mathrm{x} = \otimes_{i=1}^k \mathrm{x}_i$, we can…
We introduce a framework unifying the mathematical characterisation of different measures of general quantum resources and allowing for a systematic way to define a variety of faithful quantifiers for any given convex quantum resource…
Kernel methods are powerful learning methodologies that allow to perform non-linear data analysis. Despite their popularity, they suffer from poor scalability in big data scenarios. Various approximation methods, including random feature…
A general state of an $m\otimes n$ system is a classical-quantum state if and only if its associated $A$-correlation matrix (a matrix constructed from the coherence vector of the party $A$, the correlation matrix of the state, and a…
With nowadays steadily growing quantum processors, it is required to develop new quantum tomography tools that are tailored for high-dimensional systems. In this work, we describe such a computational tool, based on recent ideas from…
This paper consists of two prongs. Firstly, we prove that any Specht module labelled by a 2-separated partition is semisimple and we completely determine its decomposition as a direct sum of graded simple modules. Secondly, we apply these…
We obtain for the Kempner series (i.e. harmonic series where certain digits are excluded from all denominators, for example the digit 9 in base 10) new representations as geometrically convergent series. The coefficients for these…
This article shows that one can consistently incorporate nonunitary representations of at least one group into the ``ordinary'' nonrelativistic quantum mechanics. This group turns out to be Lorentz group thus giving us an alternative…
We define correlational (von Neumann) entropy for an individual quantum state of a system whose time-independent hamiltonian contains random parameters and is treated as a member of a statistical ensemble. This entropy is representation…
We present a quantum algorithm that additively approximates the value of a tensor network to a certain scale. When combined with existing results, this provides a complete problem for quantum computation. The result is a simple new way of…
Quantum discord as a measure of the quantum correlations cannot be easily computed for most of density operators. In this paper, we present a measure of the total quantum correlations that is operationally simple and can be computed…
The complexity of the quantum state of a multiparticle system and the maximum possible accuracy of its quantum description are connected by a relation similar to the coordinate-momentum uncertainty relation. The coefficient in this relation…
Quantum computers have the potential to provide an advantage over classical computers in a number of areas. Numerous metrics to benchmark the performance of quantum computers, ranging from their individual hardware components to entire…
The aim of this paper is to give a simple, geometric proof of Wigner's theorem on the realization of symmetries in quantum mechanics that clarifies its relation to projective geometry. Although several proofs exist already, it seems that…