516 research outputs found
Finite Fields: Theory and Applications
Finite ïŹelds are the focal point of many interesting geometric, algorithmic and combinatorial problems. The workshop was devoted to progress on these questions, with an eye also on the important applications of ïŹnite ïŹeld techniques in cryptography, error correcting codes, and random number generation
Recommended from our members
Algebraic and analytic techniques in coding theory
Error correcting codes are designed to tackle the problem of reliable trans- mission of data through noisy channels. A major challenge in coding theory is to efficiently recover the original message even when many symbols of the received data have been corrupted. This is called the unique decoding problem of error correcting codes. More precisely, if the user wants to send K bits, the code stretches K bits to N bits to tolerate errors in the N bits. Then the goal is to recover the original K bits of the message.
Often, the receiver requires only a certain part of the message. In such cases, analyzing the entire received data (word) becomes prohibitive. The challenge is to design a local decoder which queries only few locations of the received word and outputs the part of the message required. This is known as local decoding of an error correcting code.
The unique decoding problem faces a certain combinatorial barrier. That is, there is a limit to the number of errors it can tolerate in order to uniquely identify the correct message. This is called the unique decoding radius. A major open problem is to understand what happens if one allows for errors beyond this threshold. The goal is to design an algorithm that can recover the right message, or possibly a list of messages (preferably a small number). This is referred to as list decoding of an error correcting code.
At the core of many such codes lies polynomials. Polynomials play a fundamental role in computer science with important applications in algorithm design, complexity theory, pseudo-randomness and machine learning.
In this dissertation, we improve our understanding of well known classes of codes and discover various properties of polynomials. As an additional consequence, we obtain results in a suite of problems in effective algebraic geometry, including Hilbertâs nullstellensatz, ideal membership problem and counting rational points in a variety.Computer Science
Quantum algorithms for algebraic problems
Quantum computers can execute algorithms that dramatically outperform
classical computation. As the best-known example, Shor discovered an efficient
quantum algorithm for factoring integers, whereas factoring appears to be
difficult for classical computers. Understanding what other computational
problems can be solved significantly faster using quantum algorithms is one of
the major challenges in the theory of quantum computation, and such algorithms
motivate the formidable task of building a large-scale quantum computer. This
article reviews the current state of quantum algorithms, focusing on algorithms
with superpolynomial speedup over classical computation, and in particular, on
problems with an algebraic flavor.Comment: 52 pages, 3 figures, to appear in Reviews of Modern Physic
Algebraic methods in randomness and pseudorandomness
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.Cataloged from PDF version of thesis.Includes bibliographical references (p. 183-188).Algebra and randomness come together rather nicely in computation. A central example of this relationship in action is the Schwartz-Zippel lemma and its application to the fast randomized checking of polynomial identities. In this thesis, we further this relationship in two ways: (1) by compiling new algebraic techniques that are of potential computational interest, and (2) demonstrating the relevance of these techniques by making progress on several questions in randomness and pseudorandomness. The technical ingredients we introduce include: " Multiplicity-enhanced versions of the Schwartz-Zippel lenina and the "polynomial method", extending their applicability to "higher-degree" polynomials. " Conditions for polynomials to have an unusually small number of roots. " Conditions for polynomials to have an unusually structured set of roots, e.g., containing a large linear space. Our applications include: * Explicit constructions of randomness extractors with logarithmic seed and vanishing "entropy loss". " Limit laws for first-order logic augmented with the parity quantifier on random graphs (extending the classical 0-1 law). " Explicit dispersers for affine sources of imperfect randomness with sublinear entropy.by Swastik Kopparty.Ph.D
Q(sqrt(-3))-Integral Points on a Mordell Curve
We use an extension of quadratic Chabauty to number fields,recently developed by the author with Balakrishnan, Besser and M Ìuller,combined with a sieving technique, to determine the integral points overQ(ââ3) on the Mordell curve y2 = x3 â 4
Multipartite Quantum States and their Marginals
Subsystems of composite quantum systems are described by reduced density
matrices, or quantum marginals. Important physical properties often do not
depend on the whole wave function but rather only on the marginals. Not every
collection of reduced density matrices can arise as the marginals of a quantum
state. Instead, there are profound compatibility conditions -- such as Pauli's
exclusion principle or the monogamy of quantum entanglement -- which
fundamentally influence the physics of many-body quantum systems and the
structure of quantum information. The aim of this thesis is a systematic and
rigorous study of the general relation between multipartite quantum states,
i.e., states of quantum systems that are composed of several subsystems, and
their marginals. In the first part, we focus on the one-body marginals of
multipartite quantum states; in the second part, we study general quantum
marginals from the perspective of entropy.Comment: PhD thesis, ETH Zurich. The first part contains material from
arXiv:1208.0365, arXiv:1204.0741, and arXiv:1204.4379. The second part is
based on arXiv:1302.6990 and arXiv:1210.046
- âŠ