Related papers: The "quantum" Turan problem for operator systems
The problem of construction of irreducible representations of quantum $A^q_n$ algebras is solved at the level of explicit integration of the linear (inhomogeneous) system in finite differences in the n-dimensional space. The general…
Generalized virial theorem for quantum mechanical nonrelativistic and relativistic systems with translational and rotational symmetry is derived in the form of the commutator between the generator of dilations G and the Hamiltonian H. If…
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas. In this paper we show that if CTCs existed, then quantum…
In recent years, quantum computers have emerged as promising candidates for implementing kernels. Quantum Embedding Kernels embed data points into quantum states and calculate their inner product in a high-dimensional Hilbert Space by…
In orthodox quantum theory the observables of spacelike separated quantum systems commute. I shall call this the commutation constraint. It severely limits quantum theory's explanatory power. For instance, the constraint cannot be met in…
Quasi-elliptic cohomology is a variant of Tate K-theory. It is the orbifold K-theory of a space of constant loops. For global quotient orbifolds, it can be expressed in terms of equivariant K-theories. In this paper we show how this theory…
For a permutation f of an n-dimensional vector space V over a finite field of order q we let k-affinity(f) denote the number of k-flats X of V such that f(X) is also a k-flat. By k-spectrum(n,q) we mean the set of integers k-affinity(f)…
We study when local reduced density operators, viewed as quantum marginals, can be assembled into a global quantum state with a prescribed Markov structure. The starting point is a canonical logarithmic construction $T(\mathcal R)$, the…
Krylov quantum diagonalization methods have emerged as a promising use case for quantum computers. However, many existing implementations rely on controlled operations, which pose challenges to near-term quantum hardware. We introduce a…
In the context of Covariant Quantum Mechanics for a spin particle, we classify the ``quantum vector fields'', i.e. the projectable Hermitian vector fields of a complex bundle of complex dimension 2 over spacetime. Indeed, we prove that the…
We study the Chern-Simons approach to the topological quantum computing. We use quantum $\mathcal{R}$-matrices as universal quantum gates and study the approximations of some one-qubit operations. We make some modifications to the known…
One of the main problems in quantum complexity theory is that our understanding of the theory of QMA-completeness is not as rich as its classical analogue, the NP- completeness. In this paper we consider the clique problem in graphs, which…
We consider the class of non-Hermitian operators represented by infinite tridiagonal matrices, selfadjoint in an indefinite inner product space with one negative square. We approximate them with their finite truncations. Both infinite and…
We consider a complex Plateau problem for strongly pseudoconvex contours in non K\"ahler manifolds. A positive solution in the case of manifolds carrying a pluriclosed Hermitian metric forms is given. For the general case we propose a…
In complete analogy with the classical situation (which is briefly reviewed) it is possible to define bi-Hamiltonian descriptions for Quantum systems. We also analyze compatible Hermitian structures in full analogy with compatible Poisson…
We study extensions of the classic \emph{Line Cover} problem, which asks whether a set of $n$ points in the plane can be covered using $k$ lines. Line Cover is known to be NP-hard, and we focus on two natural generalizations. The first is…
The problem of finding a $k \times k$ submatrix of maximum volume of a matrix $A$ is of interest in a variety of applications. For example, it yields a quasi-best low-rank approximation constructed from the rows and columns of $A$. We show…
Given an undirected graph $G$, a quasi-clique is a subgraph of $G$ whose density is at least $\gamma$ $(0 < \gamma \leq 1)$. Two optimization problems can be defined for quasi-cliques: the Maximum Quasi-Clique (MQC) Problem, which finds a…
Quantum process tomography is a procedure by which the unknown dynamical evolution of an open quantum system can be fully experimentally characterized. We demonstrate explicitly how this procedure can be implemented with a nuclear magnetic…
We consider the k-disjoint-clique problem. The input is an undirected graph G in which the nodes represent data items, and edges indicate a similarity between the corresponding items. The problem is to find within the graph k disjoint…