相关论文: Beyond Stabilizer Codes I: Nice Error Bases

Stabilizer codes are a simple and successful class of quantum error-correcting codes. Yet this success comes in spite of some harsh limitations on the ability of these codes to fault-tolerantly compute. Here we introduce a new metric for…

The stabiliser fragment of quantum theory is a foundational building block for quantum error correction and the fault-tolerant compilation of quantum programs. In this article, we develop a sound, universal and complete denotational…

The standard stabilizer formalism provides a setting to show that quantum computation restricted to operations within the Clifford group are classically efficiently simulable: this is the content of the well-known Gottesman-Knill theorem.…

The Gottesman-Knill theorem allows for the efficient simulation of stabilizer-based quantum error-correction circuits. Errors in these circuits are commonly modeled as depolarizing channels by using Monte Carlo methods to insert Pauli gates…

A class of good integers has been introduced by P. Moree in $1997$ together with the characterization of good odd integers. Such integers have shown to have nice number theoretical properties and wide applications. In this paper, a complete…

We study idempotent measures and the structure of the convolution semigroups of measures over definable groups. We isolate the property of generic transitivity and demonstrate that it is sufficient (and necessary) to develop stable group…

The Pauli groups are ubiquitous in quantum information theory because of their usefulness in describing quantum states and operations and their readily understood symmetry properties. In addition, the most well-understood quantum error…

Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some striking differences…

We establish an Excision type theorem for niceness of group structure on the orbit space of unimodular rows of length $n$ modulo elementary action. This permits us to establish niceness for relative versions of results for the cases when $n…

We study the relationship between Bell states, finite groups and complete sets of bases. We show how to obtain a set of N+1 bases in which Bell states are invariant. They generalize the X, Y and Z qubit bases and are associated to groups of…

This paper describes several classical constructions of thin bases of finite order in additive number theory, and, in particular, gives a complete presentation of a beautiful construction of J. W. S. Cassels of a class of polynomially…

In additive number theory, a finite set $A$ of integers is an $h$-basis for $n$ if every integer in $\{0,1,2,\ldots, n\}$ can be represented as the sum of exactly $h$ not necessarily distinct elements of $A$. This paper introduces a new…

While deep neural networks are sensitive to adversarial noise, sparse coding using the Basis Pursuit (BP) method is robust against such attacks, including its multi-layer extensions. We prove that the stability theorem of BP holds upon the…

Conditional stability estimates require additional regularization for obtaining stable approximate solutions if the validity area of such estimates is not completely known. In this context, we consider ill-posed nonlinear inverse problems…

Ill posed linear and nonlinear initial value problems may be stabilized, that it converted to to well posed initial value problems, by the addition of purely nonscalar linear dispersive terms. This is a stability analog of the Turing…

We investigate Conjecture 1.6 introduced by Barker and Gelvin in [3], which says that any source algebra of a p-block (p is a prime) of finite group has the unit group containing a basis stabilized by left and right action of the defect…

Using the Weyl commutation relations over a finite field we introduce a family of error-correcting quantum stabilizer codes based on a class of symmetric matrices over the finite field satisfying certain natural conditions. When the field…

Auditing is an increasingly important operation for computer programming, for example in security (e.g. to enable history-based access control) and to enable reproducibility and accountability (e.g. provenance in scientific programming).…

Stabilizer codes form an important class of quantum error correcting codes which have an elegant theory, efficient error detection, and many known examples. Constructing stabilizer codes of length $n$ is equivalent to constructing subspaces…

The performance of quantum error correction can be significantly improved if detailed information about the noise is available, allowing to optimize both codes and decoders. It has been proposed to estimate error rates from the syndrome…