Related papers: A Sparse $Z_2$ Chain Complex Without a Sparse Lift
The use of codes defined by sparse characteristic matrices, like QC-LDPC and QC-MDPC codes, has become an established solution to design secure and efficient code-based public-key encryption schemes, as also witnessed by the ongoing NIST…
We determine the excitations and $S$ matrix of an integrable isotropic antiferromagnetic quantum spin chain of alternating spin 1/2 and spin 1. There are two types of gapless one-particle excitations: the usual spin 1/2 (``spinor'') kink,…
We propose a scheme for implementing quantum gates and entanglement between spin qubits in the outer dots of a triple-dot system with an empty central dot. The voltage applied to the central dot can be tuned to realize the gate. Our scheme…
We investigate spatial reflection and associated nonlocal order in spin chain quantum systems. The proposed string order parameters, e.g., reflected via operations of the spatial reflection or combinations of it with spin reflection, are…
Taking the excess electron spin in a unit cell of semiconductor multiple quantum-dot structure as a qubit, we can implement scalable quantum computation without resorting to spin-spin interactions. The technique of single electron…
In many networks of scientific interest we know that the link between any pair of vertices conforms to a specific probability, such as the link probability in the Barab\'asi-Albert scale-free networks. Here we demonstrate how the…
We construct a $40$-dimensional extremal Type II lattice not having any subsets consisting of $40$ orthogonal minimal vectors, and determine the automorphism group. This lattice gives an example different from the $16470$ lattices…
We present an introductory overview of the use of spin chains as quantum wires, which has recently developed into a topic of lively interest. The principal motivation is in connecting quantum registers without resorting to optics. A spin…
In this contribution we review the theory of integrability of quantum systems in one spatial dimension. We introduce the basic concepts such as the Yang-Baxter equation, commuting currents, and the algebraic Bethe ansatz. Quite extensively…
Sparse superimposed coding (SSC) has emerged as a promising technique for short-packet transmission in ultra-reliable low-latency communication scenarios. However, conventional SSC schemes often suffer from high encoding and decoding…
For any two disjoint oriented circles embedded into the 3-dimensional real projective space, we construct a 3-dimensional configuration space and its map to the projective space such that the linking number of the circles is the half of the…
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.…
A classification of the semisimple subalgebras of the Lie algebra of traceless $3\times 3$ matrices with complex entries, denoted $A_2$, is well-known. We classify its nonsemisimple subalgebras, thus completing the classification of the…
We investigate a scheme for implementing quantum dense coding via atomic ensembles, where prior distribution of the quantum entangled state is not needed. Our scheme also combines another two distinct advantages: atomic ensembles qubits…
Motivated by the order fractionalization in Kitaev-Kondo model, we propose an exactly solvable spin-charge ladder model to study the order fractionalization with discrete symmetry. The spin-charge ladder is composed of a spin chain and a…
Many quantum computing platforms are based on a two-dimensional physical layout. Here we explore a concept called looped pipelines which permits one to obtain many of the advantages of a 3D lattice while operating a strictly 2D device. The…
We present a new construction of a class pseudo BL-algebras, called kite pseudo BL-algebras. We start with a basic pseudo hoop $A$. Using two injective mappings from one set, $J$, into the second one, $I$, and with an identical copy…
The Pairwise Conditional Gradients (PCG) algorithm is a powerful extension of the Frank-Wolfe algorithm leading to particularly sparse solutions, which makes PCG very appealing for problems such as sparse signal recovery, sparse regression,…
A quantum cryptographic protocol based in public key cryptography combinations and private key cryptography is presented. Unlike the BB84 protocol [1] and its many variants [2,3] two quantum channels are used. The present research does not…
We demonstrate a new construction for perfect quantum secret sharing (QSS) schemes based on imperfect "ramp" secret sharing combined with classical encryption, in which the individual parties' shares are split into quantum and classical…