Related papers: The "quantum" Turan problem for operator systems
Quantum subspace diagonalization methods are an exciting new class of algorithms for solving large\rev{-}scale eigenvalue problems using quantum computers. Unfortunately, these methods require the solution of an ill-conditioned generalized…
We consider a class of quantum dissipative systems governed by a one parameter completely positive maps on a von-Neumann algebra. We introduce a notion of recurrent and metastable projections for the dynamics and prove that the unit…
In this paper we consider several instances of the k-center on a line problem where the goal is, given a set of points S in the plane and a parameter k >= 1, to find k disks with centers on a line l such that their union covers S and the…
We show that the topes of a complex of oriented matroids (abbreviated COM) of VC-dimension $d$ admit a proper labeled sample compression scheme of size $d$. This considerably extends results of Moran and Warmuth on ample classes, of…
We survey some of the main conceptual developments in the study of PT-symmetric and pseudo-Hermitian Hamiltonian operators that have taken place during the past ten years or so. We offer a precise mathematical description of a quantum…
We study the quantum query complexity of constant-sized subgraph containment. Such problems include determining whether an $ n $-vertex graph contains a triangle, clique or star of some size. For a general subgraph $ H $ with $ k $…
Let H be a positive semidefinite matrix partitioned into Hermitian blocks. Then, up to a direct sum operation, H is the average of matrices isometrically congruent to its partial trace. A few corollaries are given, related to important…
Motivated by understanding the power of quantum computation with restricted number of qubits, we give two complete characterizations of unitary quantum space bounded computation. First we show that approximating an element of the inverse of…
Recently Bender, Brody, Jones and Meister found that in the quantum brachistochrone problem the passage time needed for the evolution of certain initial states into specified final states can be made arbitrarily small, when the…
Topological quantum computing is a way of allowing precise quantum computations to run on noisy and imperfect hardware. One implementation uses surface codes created by forming defects in a highly-entangled cluster state. Such a method of…
A family of maximally superintegrable systems containing the Coulomb atom as a special case is constructed in N-dimensional Euclidean space. Two different sets of N commuting second order operators are found, overlapping in the Hamiltonian…
Let $V$ be a finite dimensional vector space equipped with a non-degenerate Hermitian form over a field $\mathbb{K}$. Let $\mathcal{G}(V)$ be the graph with vertex set the $1$-dimensional non-degenerate subspaces of $V$ and adjacency…
Given a quantum permutation group $G\subset S_N^+$, with orbits having the same size $K$, we construct a universal matrix model $\pi:C(G)\to M_K(C(X))$, having the property that the images of the standard coordinates $u_{ij}\in C(G)$ are…
Let P be a set of n points in the Euclidean plane and let O be the origin point in the plane. In the k-tour cover problem (called frequently the capacitated vehicle routing problem), the goal is to minimize the total length of tours that…
A quantum navigation problem concerns the identification of a time-optimal Hamiltonian that realises a required quantum process or task, under the influence of a prevailing `background' Hamiltonian that cannot be manipulated. When the task…
Let $n$ be any natural number. Let $K$ be any $n$-dimensional knot in $S^{n+2}$. We define a supersymmetric quantum system for $K$ with the following properties. We firstly construct a set of functional spaces (spaces of fermionic \{resp.…
A given Hamiltonian matrix H with real spectrum is assumed tridiagonal and non-Hermitian. Its possible Hermitizations via an amended, ad hoc inner-product metric are studied. Under certain reasonable assumptions, all of these metrics are…
Different quantum mechanical operators can correspond to the same classical quantity. Hermitian operators differing only by operator ordering of the canonical coordinates and momenta at one moment of time are the most familiar example.…
We obtain an upper bound on the time available for quantum computation for a given quantum computer and decohering environment with quantum error correction implemented. First, we derive an explicit quantum evolution operator for the…
The current applications of non-Hermitian but ${\cal PT}-$symmetric Hamiltonians $H$ cover several, mutually not too closely connected subdomains of quantum physics. Mathematically, the split between the open and closed systems can be…