Related papers: Limitations on quantum dimensionality reduction

The paper re-analyzes a version of the celebrated Johnson-Lindenstrauss Lemma, in which matrices are subjected to constraints that naturally emerge from neuroscience applications: a) sparsity and b) sign-consistency. This particular variant…

Zyczkowski, Horodecki, Sanpera, and Lewenstein (ZHSL) recently proposed a ``natural measure'' on the N-dimensional quantum systems (quant-ph/9804024), but expressed surprise when it led them to conclude that for N = 2 x 2, disentangled…

The celebrated Lott-Sturm-Villani theory of metric measure spaces furnishes synthetic notions of a Ricci curvature lower bound $K$ joint with an upper bound $N$ on the dimension. Their condition, called the Curvature-Dimension condition and…

Dimension reduction is the process of embedding high-dimensional data into a lower dimensional space to facilitate its analysis. In the Euclidean setting, one fundamental technique for dimension reduction is to apply a random linear map to…

We propose a new generalization to quantum states of the Wasserstein distance, which is a fundamental distance between probability distributions given by the minimization of a transport cost. Our proposal is the first where the transport…

The two-dimensional Levinson theorem for the Klein-Gordon equation with a cylindrically symmetric potential $V(r)$ is established. It is shown that $N_{m}\pi=\pi (n_{m}^{+}-n_{m}^{-})= [\delta_{m}(M)+\beta_{1}]-[\delta_{m}(-M)+\beta_{2}]$,…

Dimension reduction algorithms are a crucial part of many data science pipelines, including data exploration, feature creation and selection, and denoising. Despite their wide utilization, many non-linear dimension reduction algorithms are…

We present a noncommutative optimal transport framework for quantum channels acting on von Neumann algebras. Our central object is the Lipschitz cost measure, a transportation-inspired quantity that evaluates the minimal cost required to…

I discuss a set of strong, but probabilistically intelligible, axioms from which one can {\em almost} derive the appratus of finite dimensional quantum theory. Stated informally, these require that systems appear completely classical as…

We consider a quantum version of the famous low-rank approximation problem. Specifically, we consider the distance $D(\rho,\sigma)$ between two normalized quantum states, $\rho$ and $\sigma$, where the rank of $\sigma$ is constrained to be…

In this work, the relativistic phenomena of Lorentz contraction and time dilation are derived using a modified distance formula appropriate for discrete space. This new distance formula is different than Pythagoras's theorem but converges…

This paper addresses the problem of improving properties of a linear operator u in $l_2^n$ by restricting it onto coordinate subspaces. We discuss how to reduce the norm of u by a random coordinate restriction, how to approximate u by a…

The most powerful technique known at present for bounding the size of quantum codes of prescribed minimum distance is the quantum linear programming bound. Unlike the classical linear programming bound, it is not immediately obvious that if…

In this work, we analyze dimension reduction algorithms based on the Kac walk and discrete variants. (1) For $n$ points in $\mathbb{R}^{d}$, we design an optimal Johnson-Lindenstrauss (JL) transform based on the Kac walk which can be…

A new model of a Quantum Automaton (QA), working with qubits is proposed. The quantum states of the automaton can be pure or mixed and are represented by density operators. This is the appropriated approach to deal with measurements and…

In a series of recent papers we have proved rigorously that time travel is a reality and very much feasible by using quantum mechanical processes. There are plenty of indirect experimental support untill a direct experiment is conducted.…

Over the last few years the study of possible Planck-scale departures from classical Lorentz symmetry has been one of the most active areas of quantum-gravity research. We now have a satisfactory description of the fate of Lorentz symmetry…

We consider vectors from $\{0,1\}^n$. The weight of such a vector $v$ is the sum of the coordinates of $v$. The distance ratio of a set $L$ of vectors is ${\rm dr}(L):=\max \{\rho(x,y):\ x,y \in L\}/ \min \{\rho(x,y):\ x,y \in L,\ x\neq…

We show that any classical two-way communication protocol with shared randomness that can approximately simulate the result of applying an arbitrary measurement (held by one party) to a quantum state of $n$ qubits (held by another), up to…

We show that generalizations of classical and quantum dynamics with two times lead to fundamentally constrained evolution. At the level of classical physics, Newton's second law is extended and exactly integrated in $1+2$ dimensional space,…