Related papers: On generating r-uniform subspaces with the isometr…
Heterogeneous bipartite quantum pure states, composed of two subsystems with a different number of levels, cannot have both reductions maximally mixed. In this work, we demonstrate existence of a wide range of highly entangled states of…
In this paper we tackle the problem of generating uniform designs in very small subregions of computer model input space that have been identified in previous experiments as worthy of further study. The method is capable of producing…
We introduce to this paper new kinds of coherent states for some quantum solvable models: a free particle on a sphere, one-dimensional Calogero-Sutherland model, the motion of spinless electrons subjected to a perpendicular magnetic field…
Errors are inevitable during all kinds quantum informational tasks and quantum error-correcting codes (QECCs) are powerful tools to fight various quantum noises. For standard QECCs physical systems have the same number of energy levels.…
The essential insight of quantum error correction was that quantum information can be protected by suitably encoding this quantum information across multiple independently erred quantum systems. Recently it was realized that, since the most…
Certain semi-Riemannian metrics may be decomposed into a Riemannian part and an isochronal part. We use this idea and an idea of Kasner to construct a manifold in 6+1 Minkowski space with a well known metric. The full embedding we display…
We give a general procedure for constructing metric spaces from systems of partitions. This generalises and provides analogues of Sageev's construction of dual CAT(0) cube complexes for the settings of hyperbolic and injective metric…
We consider the problem of establishing dense correspondences within a set of related shapes of strongly varying geometry. For such input, traditional shape matching approaches often produce unsatisfactory results. We propose an ensemble…
We introduce and obtain multimode paraboson coherent states. In appropriate subspaces these coherent states provide a decomposition of unity where the measure, when expressed using the cat-type states, is positive definite. Bicoherent…
We use projection methods to construct (global) quantum states with prescribed reduced (marginal) states, and possibly with some special properties such as having specific eigenvalues, having specific rank and extreme von Neumann or Renyi…
We propose a new method for constructing small-bias spaces through a combination of Hermitian codes. For a class of parameters our multisets are much faster to construct than what can be achieved by use of the traditional algebraic…
It is possible to reduce some types of quantum computation errors by symmetrizing the quantum state of a redundant array. Various models are discussed.
Entanglement-assisted quantum error-correcting codes (EAQECCs) to desired rate, error-correcting capability and maximum shared entanglement are constructed. Thus for a required rate $R$, required error-correcting capability to correct $t$…
Recent work on approximate quantum error correction (QEC) has opened up the possibility of constructing subspace codes that protect information with high fidelity in scenarios where perfect error correction is impossible. Motivated by this,…
We introduce a new type of sparse CSS quantum error correcting code based on the homology of hypermaps. Sparse quantum error correcting codes are of interest in the building of quantum computers due to their ease of implementation and the…
A general framework for solving the subspace clustering problem using the CUR decomposition is presented. The CUR decomposition provides a natural way to construct similarity matrices for data that come from a union of unknown subspaces…
In this paper we propose constellations with suitable structure which allow one to construct codes with excellent diversity using geometrical symmetry and numerical methods. We also demonstrate how these structured constellations…
Selecting a set of basis states is a common task in quantum computing, in order to increase and/or evaluate their probabilities. This is similar to designing WHERE clauses in classical database queries. Even though one can find heuristic…
Considering some important classes of generalized coherent states known in literature, we demonstrated that all of them can be created via conventional fashion, i.e. the "lowering operator eigen-state" and the "displacement operator"…
We prove that every $1$-error-correcting code over a finite field can be embedded in a $1$-perfect code of some larger length. Embedding in this context means that the original code is a subcode of the resulting $1$-perfect code and can be…