相关论文: A Sparse $Z_2$ Chain Complex Without a Sparse Lift

We show that using a slightly modified XX model for a spin-1/2 chain, one can transmit almost perfectly a maximally entangled two-qubit state from one end of the chain to the other one. This is accomplished without external fields or…

Coded recurrent neural networks with three levels of sparsity are introduced. The first level is related to the size of messages, much smaller than the number of available neurons. The second one is provided by a particular coding rule,…

We consider point sets in $\mathbb{Z}_n^2$ where no three points are on a line - also called caps or arcs. For the determination of caps with maximum cardinality and complete caps with minimum cardinality we provide integer linear…

In this Letter we give a method for constructing sets of simple circuits that can determine the spectrum of a partially transposed density matrix, without requiring either a tomographically complete POVM or the addition of noise to make the…

A computable structure A is x-computably categorical for some Turing degree x, if for every computable structure B isomorphic to A there is an isomorphism f:B -> A with f computable in x. A degree x is a degree of categoricity if there is a…

We present schemes to prepare two-dimensional cluster states [H. J. Briegel and R. Raussendorf, Phys. Rev. Lett. {\bf 86}, 910 (2001)] with atomic ions confined in a micro-structured linear ion trap and coupled by an engineered spin-spin…

We show that the quantum-algebra-invariant open spin chains associated with the affine Lie algebras $A^{(1)}_n$ for $n>1$ are integrable. The argument, which applies to a large class of other quantum-algebra-invariant chains, does not…

We recently showed in [1] the superiority of certain structured coding matrices ensembles (such as partial row-orthogonal) for sparse superposition codes when compared with purely random matrices with i.i.d. entries, both…

We construct $\mathbb{Z}_p$-lattices and $\mathbb{F}_q[\![t]\!]$-lattices from cyclic $(f,\sigma)$-codes over finite chain rings, employing quotients of natural nonassociative orders and principal left ideals in carefully chosen…

The quasi-particle structure of the higher spin XXZ model is studied. We obtained a new description of crystals associated with the level $k$ integrable highest weight $U_q(\widehat{sl_2})$ modules in terms of the creation operators at…

In this work, we investigate the trade-off between the circuit depth and the number of ancillary qubits for preparing sparse quantum states. We prove that any $n$-qubit $d$-spare quantum state (i.e., it has only $d$ non-zero amplitudes) can…

This work proposes a scalable framework for topological quantum computing using Matryoshka-type Sine-Cosine chains. These chains support high-dimensional qudit encoding within single systems, reducing the physical resource overhead compared…

We consider the model of quantum computer, which is represented as a Ising spin lattice, where qubits (spin-half systems) are separated by the isolators (two spin-half systems). In the idle mode or at the single bit operations the total…

Three-dimensional (3D) quantum XYZ product can construct a class of non-CSS quantum codes by using three classical codes. However, there has been limited study on their error-correcting performance so far and whether this code construction…

In this paper, we investigate a high-dimensional quantum state transfer protocol. An arbitrary unknown high-dimensional state can be transferred with high fidelity between two remote registers through a XX coupling spin chain of arbitrary…

Entangled quantum mechanical states in one dimension can be used to represent and simulate classical stochastic processes with nontrivial statistical properties. Long-range quantum correlations translate into fractional processes with their…

Many standard linear algebra problems can be solved on a quantum computer by using recently developed quantum linear algebra algorithms that make use of block encodings and quantum eigenvalue/singular value transformations. A block encoding…

A cluster algorithm is constructed and applied to study the chiral limit of the strongly coupled lattice Schwinger model involving staggered fermions. The algorithm is based on a novel loop representation of the model. Finite size scaling…

We are interested in clustering parts of a given single multi-variate series in an unsupervised manner. We would like to segment and cluster the series such that the resulting blocks present in each cluster are coherent with respect to a…

Given a real dataset and a computation family, we wish to encode and store the dataset in a distributed system so that any computation from the family can be performed by accessing a small number of nodes. In this work, we focus on the…