Related papers: On generating r-uniform subspaces with the isometr…
Although many machine learning algorithms involve learning subspaces with particular characteristics, optimizing a parameter matrix that is constrained to represent a subspace can be challenging. One solution is to use Riemannian…
A mixed supersymmetric-algebraic approach to construction of the minimum uncertainty coherent states of anharmonic oscillators is presented. It permits generating not only the well-known coherent states of the harmonic and Morse oscillators…
We propose a protocol where one can exploit dual quantum and classical channels to achieve perfect ``cloning'' and ``orthogonal-complementing'' of an unknown state with a minimal assistance from a state preparer (without revealing what the…
In this paper, we consider the iterative method of subspace corrections with random ordering. We prove identities for the expected convergence rate, which can provide sharp estimates for the error reduction per iteration. We also study the…
We present a novel sparse modeling approach to non-rigid shape matching using only the ability to detect repeatable regions. As the input to our algorithm, we are given only two sets of regions in two shapes; no descriptors are provided so…
Stacked quantum memory is an architecture in which multiple layers of qubits are stacked. Quantum rank-metric codes are effective for error correction in stacked quantum memories. However, the previously proposed quantum Gabidulin codes…
Entangled quantum states can be given a separable decomposition if we relax the restriction that the local operators be quantum states. Motivated by the construction of classical simulations and local hidden variable models, we construct…
Supersymmetry is a technique that allows us to extract information about the states and spectra of quantum mechanical systems which may otherwise be unsolvable. In this paper we reconstruct Ioffe's set of states for the singular…
It is well-known that any two pure quantum states (in the same Hilbert space) can be mapped to any other using unitary transformations. However, previous approaches to this problem required two explicit bases for the Hilbert space, one each…
Achieving reliable performance on early fault-tolerant quantum hardware will depend on protocols that manage noise without incurring prohibitive overhead. We propose a novel framework that integrates quantum computation with the…
The Numerical Assembly Technique is extended to investigate arbitrary planar frame structures with the focus on the computation of natural frequencies. This allows us to obtain highly accurate results without resorting to spatial…
In this paper we propose an approach for computing multiple high-quality near-isometric dense correspondences between a pair of 3D shapes. Our method is fully automatic and does not rely on user-provided landmarks or descriptors. This…
We establish universality and ultra-homogeneity of $(\mathcal{U},u_\mathrm{GH})$, the collection of all compact ultrametric spaces endowed with the so-called Gromov-Hausdorff ultrametric. This result also gives rise to a novel construction…
Given a non-compact Riemannian manifold M and a submanifold N of codimension q, we will construct under certain assumptions on both M and N a wrong way map in uniformly finite homology. Using an equivariant version of the construction and…
Decoherence-free subspace (DFS) provides a crucial mechanism for passive error mitigation in quantum computation by encoding information within symmetry-protected subspaces of the Hilbert space, which are immune from collective decoherence.…
Reconstructing a complete object from its parts is a fundamental problem in many scientific domains. The purpose of this article is to provide a systematic survey on this topic. The reassembly problem requires understanding the attributes…
We discuss the construction of $n$-qubit pure states with maximum bipartite entanglement across all possible choices of $k$ vs $n-k$ bi-partitioning, which implies that the Von Neumann entropy of every $k$-qubit reduced density matrix…
I describe a method for pasting together certain quantum error-correcting codes that correct one error to make a single larger one-error quantum code. I show how to construct codes encoding 7 qubits in 13 qubits using the method, as well as…
In this paper, we discuss a construction method of quantum deletion error-correcting codes. First of all, we define deletion errors for quantum states, an encoder, a decoder, and two conditions which is expressed by only the combinatorial…
The quantum orthogonal arrays define remarkable classes of multipartite entangled states called $k$-uniform states whose every reductions to $k$ parties are maximally mixed. We present constructions of quantum orthogonal arrays of strength…