Related papers: The "quantum" Turan problem for operator systems
Quantum computing is gaining increased attention as a potential way to speed up simulations of physical systems, and it is also of interest to apply it to simulations of classical plasmas. However, quantum information science is…
In this work, we investigate the possibility of compressing a quantum system to one of smaller dimension in a way that preserves the measurement statistics of a given set of observables. In this process, we allow for an arbitrary amount of…
We construct large classes of exactly solvable pseudo-Hermitian 2D spin Hamiltonians. The ground states of these systems depend only on the spatial topology of the system. We identify the ground state system on a surface with the value…
In quantum information theory and statistical physics, symmetries of multiple copies, or replicas, of a system play a pivotal role. For unitary ensembles, these symmetries are encoded in the replicated commutant: the algebra of operators…
We consider the classic $k$-center problem {in the constant dimensional Euclidean space} under a parallel setting, on the low-local-space Massively Parallel Computation (MPC) model, with local space per machine of ${O}(n^{\delta})$, where…
We prove a quantum query lower bound \Omega(n^{(d+1)/(d+2)}) for the problem of deciding whether an input string of size n contains a k-tuple which belongs to a fixed orthogonal array on k factors of strength d<=k-1 and index 1, provided…
Extended quantum mechanics using non-Hermitian, pseudo-Hermitian Hamiltonians is briefly reviewed. Supersymmetric regularizations, solvable simulations and large-N expansion techniques are recollected as suitable means for the study of…
The quantum statistics mechanism is very powerful for investigating the equilibrium states and the phase transitions in complex spin disorder systems. The spin disorder systems act as an interdisciplinary platform for solving the optimum…
Let $k$ be a field. We consider triples $(V,U,T)$, where $V$ is a finite dimensional $k$-space, $U$ a subspace of $V$ and $T \:V \to V$ a linear operator with $T^n = 0$ for some $n$, and such that $T(U) \subseteq U$. Thus, $T$ is a…
We present a critique of the many-world interpretation of quantum mechanics, based on different ``pictures'' that describe the time evolution of an isolated quantum system. Without an externally imposed frame to restrict these possible…
We consider methods for obtaining local lower bounds on characteristics of quantum (correspondingly, classical) systems, i.e. lower bounds valid in the trace norm $\epsilon$-neighborhood of a given state (correspondingly, probability…
The problem of finding minimizing geodesics for a manifold M with a sub-Riemannian structure is equivalent to the time optimal control of a driftless system on M with a bound on the control. We consider here a class of sub-Riemannian…
We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group of minimal degree m and on the number of its elements of any given support.…
We consider a variational problem for submanifolds Q $\subset$ M with nonempty boundary $\partial$Q = K. We propose the definition that the boundary K of any critical point Q have constant mean curvature, which seems to be a new perspective…
The purpose of this thesis is to give a formal definition of quantum Kolmogorov complexity (QC), and rigorous mathematical proofs of its basic properties. The definition used here is similar to that by Berthiaume, van Dam, and Laplante. It…
The topical quantum computation paradigm is a transposition of the Turing machine into the quantum framework. Implementations based on this paradigm have limitations as to the number of: qubits, computation steps, efficient quantum…
In conventional quantum mechanics, quantum no-deleting and no-cloning theorems indicate that two different and nonorthogonal states cannot be perfectly and deterministically deleted and cloned, respectively. Here, we investigate the quantum…
We present new results on the landscape of problems that can be solved by quantum Turing machines (QTM's) employing severely limited amounts of memory. In this context, we demonstrate two infinite time hierarchies of complexity classes…
Classical simulation of quantum operations is essential for algorithm design, noise characterisation, and benchmarking of quantum hardware. The most general physically realisable operation can be described by a positive linear map acting on…
A number of recent studies have proposed that linear representations are appropriate for solving nonlinear dynamical systems with quantum computers, which fundamentally act linearly on a wave function in a Hilbert space. Linear…