相关论文: Beyond Stabilizer Codes I: Nice Error Bases
We introduce a stabilizer formalism for EAQECCs with noise ebits, using special subgroups of product groups of two Pauli groups. This formalism includes the two coding schemes,given by Lai and Brun (C.Y. Lai and T. A. Brun, PHYSICAL REVIEW…
This paper is a modified chapter of the author's Ph.D. thesis. We introduce the notions of sequentially approximated types and sequentially approximated Keisler measures. As the names imply, these are types which can be approximated by a…
We develop a most likely error Pauli error decoding algorithm for stabiliser codes based on general purpose integer optimisation. Using this decoder we analyse the performance of holographic codes against Pauli errors and find numerical…
This note studies the robust output feedback stabilization problem of a class of multi-input multi-output invertible nonlinear systems, for which an "ideal" state feedback based on feedback linearization can be designed under certain mild…
Given a grading on a nonassociative algebra by an abelian group, we have two subgroups of automorphisms attached to it: the automorphisms that stabilize each homogeneous component (as a subspace) and the automorphisms that permute the…
This work presents a precise connection between Clifford circuits, Shor's factoring algorithm and several other famous quantum algorithms with exponential quantum speed-ups for solving Abelian hidden subgroup problems. We show that all…
The theory of "subalgebra basis" analogous to standard basis (the generalization of Gr\"{o}bner bases to monomial ordering which are not necessarily well ordering \cite{GP1}.) for ideals in polynomial rings over a field is developed. We…
Field equations for generalized principle models with nonconstant metric are derived and ansatz for their Lax pairs is given. Equations that define the Lax pairs are solved for the simplest solvable group. The solution is dependent on one…
We study groups having the property that every non-abelian subgroup is equal to its normalizer. This class of groups is closely related to an open problem posed by Berkovich. We give a full classification of finite groups having the above…
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…
Uniformly regular equilibrium problems are natural generalizations of abstract equilibrium prob lems and they are defined over the uniformly prox-regular nonconvex sets. Some new efficient implicit methods for solving uniformly regular…
Let J be a strongly stable monomial ideal in P=k[X0,...,Xn] and let BSt(J) be the family of all the homogeneous ideals in P such that the set N(J) of all the monomials that do not belong to J is a k-vector basis of the quotient P/I. We show…
Let $k$ be a field, $K/k$ a field extension, $X$ a connected scheme proper over $k$, $x_K\in X_K(K)$ lying over $x\in X(k)$, $\mathcal{C}_X$ and $\mathcal{C}_{X_K}$ the Tannakian categories over $X$ and $X_K$ respectively,…
In this paper, we consider a matroid generalization of the stable matching problem. In particular, we consider the setting where preferences may contain ties. For this generalization, we propose a polynomial-time algorithm for the problem…
We prove homology stability for elementary and special linear groups over rings with many units improving known stability ranges. Our result implies stability for unstable Quillen K-groups and proves a conjecture of Bass. For commutative…
This article began as a study of the structure of infinite permutation groups G in which point stabilisers are finite and all infinite normal subgroups are transitive. That led to two variations. One is the generalisation in which point…
General revision. In particular the parts concerning involutive bases over rings have been significantly changed. In addition some proofs have been improved.
In this paper we exhibit the notion of (uniformly) good sections of arithmetic fundamental groups. We introduce and investigate the problem of cuspidalisation of sections of arithmetic fundamental groups, its ultimate aim is to reduce the…
We develop analytical and algorithmic techniques that enable efficient simulation of a broad class of noisy stabilizer circuits. We derive closed-form expressions of expectation values for tensor product of Paulis in circuits with…
Shnirel'man's inequality and Shnirel'man's basis theorem are fundamental results about sums of sets of positive integers in additive number theory. It is proved that these results are inherently order-theoretic and extend to partially…