Results 1  10
of
758
Quantum Error Correction Via Codes Over GF(4)
, 1997
"... The problem of finding quantumerrorcorrecting codes is transformed into the problem of finding additive codes over the field GF(4) which are selforthogonal with respect to a certain trace inner product. Many new codes and new bounds are presented, as well as a table of upper and lower bounds on s ..."
Abstract

Cited by 311 (21 self)
 Add to MetaCart
(Show Context)
The problem of finding quantumerrorcorrecting codes is transformed into the problem of finding additive codes over the field GF(4) which are selforthogonal with respect to a certain trace inner product. Many new codes and new bounds are presented, as well as a table of upper and lower bounds on such codes of length up to 30 qubits.
FullDiversity, HighRate SpaceTime Block Codes from Division Algebras
 IEEE TRANS. INFORM. THEORY
, 2003
"... We present some general techniques for constructing fullrank, minimaldelay, rate at least one spacetime block codes (STBCs) over a variety of signal sets for arbitrary number of transmit antennas using commutative division algebras (field extensions) as well as using noncommutative division algeb ..."
Abstract

Cited by 178 (56 self)
 Add to MetaCart
We present some general techniques for constructing fullrank, minimaldelay, rate at least one spacetime block codes (STBCs) over a variety of signal sets for arbitrary number of transmit antennas using commutative division algebras (field extensions) as well as using noncommutative division algebras of the rational field embedded in matrix rings. The first half of the paper deals with constructions using field extensions of . Working with cyclotomic field extensions, we construct several families of STBCs over a wide range of signal sets that are of full rank, minimal delay, and rate at least one appropriate for any number of transmit antennas. We study the coding gain and capacity of these codes. Using transcendental extensions we construct arbitrary rate codes that are full rank for arbitrary number of antennas. We also present a method of constructing STBCs using noncyclotomic field extensions. In the later half of the paper, we discuss two ways of embedding noncommutative division algebras into matrices: left regular representation, and representation over maximal cyclic subfields. The 4 4 real orthogonal design is obtained by the left regular representation of quaternions. Alamouti's code is just a special case of the construction using representation over maximal cyclic subfields and we observe certain algebraic uniqueness characteristics of it. Also, we discuss a general principle for constructing cyclic division algebras using the th root of a transcendental element and study the capacity of the STBCs obtained from this construction. Another family of cyclic division algebras discovered by Brauer is discussed and several examples of STBCs derived from each of these constructions are presented.
Some Concrete Aspects Of Hilbert's 17th Problem
 In Contemporary Mathematics
, 1996
"... This paper is dedicated to the memory of Raphael M. Robinson and Olga TausskyTodd. 1. Introduction ..."
Abstract

Cited by 156 (7 self)
 Add to MetaCart
(Show Context)
This paper is dedicated to the memory of Raphael M. Robinson and Olga TausskyTodd. 1. Introduction
Faltings, Degeneration of abelian varieties
, 1990
"... An abelian variety A defined over a finite field Fq admits sufficiently many complex multiplications, as Tate showed in [27]. For some details about complex multiplication, see §1.1. Is A the reduction of an abelian variety with sufficiently many complex multiplications in characteristic zero? We fo ..."
Abstract

Cited by 139 (8 self)
 Add to MetaCart
An abelian variety A defined over a finite field Fq admits sufficiently many complex multiplications, as Tate showed in [27]. For some details about complex multiplication, see §1.1. Is A the reduction of an abelian variety with sufficiently many complex multiplications in characteristic zero? We formulate several versions of this “CMlifting problem ” in §1.2. Honda
Quantum Computability
 SIAM Journal of Computation
, 1997
"... Abstract. In this paper some theoretical and (potentially) practical aspects of quantum computing are considered. Using the tools of transcendental number theory it is demonstrated that quantum Turing machines (QTM) with rational amplitudes are sufficient to define the class of bounded error quantum ..."
Abstract

Cited by 120 (0 self)
 Add to MetaCart
Abstract. In this paper some theoretical and (potentially) practical aspects of quantum computing are considered. Using the tools of transcendental number theory it is demonstrated that quantum Turing machines (QTM) with rational amplitudes are sufficient to define the class of bounded error quantum polynomial time (BQP) introduced by Bernstein and Vazirani [Proc. 25th ACM Symposium on Theory of Computation, 1993, pp. 11–20, SIAM J. Comput., 26 (1997), pp. 1411–1473]. On the other hand, if quantum Turing machines are allowed unrestricted amplitudes (i.e., arbitrary complex amplitudes), then the corresponding BQP class has uncountable cardinality and contains sets of all Turing degrees. In contrast, allowing unrestricted amplitudes does not increase the power of computation for errorfree quantum polynomial time (EQP). Moreover, with unrestricted amplitudes, BQP is not equal to EQP. The relationship between quantum complexity classes and classical complexity classes is also investigated. It is shown that when quantum Turing machines are restricted to have transition amplitudes which are algebraic numbers, BQP, EQP, and nondeterministic quantum polynomial time (NQP) are all contained in PP, hence in P #P and PSPACE. A potentially practical issue of designing “machine independent ” quantum programs is also addressed. A single (“almost universal”) quantum algorithm based on Shor’s method for factoring integers is developed which would run correctly on almost all quantum computers, even if the underlying unitary transformations are unknown to the programmer and the device builder.
Representation Theory for HighRate MultipleAntenna Code Design
 IEEE Trans. Inform. Theory
, 2000
"... this paper, we show how to design signal matrices satisfying these requirements. As shown in [1], the design problem for unitary space time constellations is the following: let ..."
Abstract

Cited by 118 (14 self)
 Add to MetaCart
(Show Context)
this paper, we show how to design signal matrices satisfying these requirements. As shown in [1], the design problem for unitary space time constellations is the following: let
Little Theories
 Automated DeductionCADE11, volume 607 of Lecture Notes in Computer Science
, 1992
"... In the "little theories" version of the axiomatic method, different portions of mathematics are developed in various different formal axiomatic theories. Axiomatic theories may be related by inclusion or by theory interpretation. We argue that the little theories approach is a desirable wa ..."
Abstract

Cited by 59 (18 self)
 Add to MetaCart
In the "little theories" version of the axiomatic method, different portions of mathematics are developed in various different formal axiomatic theories. Axiomatic theories may be related by inclusion or by theory interpretation. We argue that the little theories approach is a desirable way to formalize mathematics, and we describe how imps, an Interactive Mathematical Proof System, supports it.
Refined anisotropic Ktypes and supercuspidal representations
 Pacific J. Math
, 1998
"... Let F be a nonarchimedean local field, and G a connected reductive group defined over F. We classify the representations of G(F) that contain any anisotropic unrefined minimal Ktype satisfying a certain tameness condition. We show that these representations are induced from compact (mod center) sub ..."
Abstract

Cited by 49 (7 self)
 Add to MetaCart
(Show Context)
Let F be a nonarchimedean local field, and G a connected reductive group defined over F. We classify the representations of G(F) that contain any anisotropic unrefined minimal Ktype satisfying a certain tameness condition. We show that these representations are induced from compact (mod center) subgroups, and we construct corresponding refined minimal Ktypes. 0. Introduction. Let G be any connected reductive group defined over a nonarchimedean local field F of residual characteristic p. Under some tameness assumptions on G, we construct families of positivedepth supercuspidal representations of G = G(F). In particular, we classify (§2.7) the representations of G
New infinite families of exact sums of squares formulas, Jacobi elliptic functions, and Ramanujan’s tau function
, 1996
"... Dedicated to the memory of GianCarlo Rota who encouraged me to write this paper in the present style Abstract. In this paper we derive many infinite families of explicit exact formulas involving either squares or triangular numbers, two of which generalize Jacobi’s 4 and 8 squares identities to 4n ..."
Abstract

Cited by 45 (1 self)
 Add to MetaCart
Dedicated to the memory of GianCarlo Rota who encouraged me to write this paper in the present style Abstract. In this paper we derive many infinite families of explicit exact formulas involving either squares or triangular numbers, two of which generalize Jacobi’s 4 and 8 squares identities to 4n 2 or 4n(n + 1) squares, respectively, without using cusp forms. In fact, we similarly generalize to infinite families all of Jacobi’s explicitly stated degree 2, 4, 6, 8 Lambert series expansions of classical theta functions. In addition, we extend Jacobi’s special analysis of 2 squares, 2 triangles, 6 squares, 6 triangles to 12 squares, 12 triangles, 20 squares, 20 triangles, respectively. Our 24 squares identity leads to a different formula for Ramanujan’s tau function τ(n), when n is odd. These results, depending on new expansions for powers of various products of classical theta functions, arise in the setting of Jacobi elliptic functions, associated continued fractions, regular Cfractions, Hankel or Turánian determinants, Fourier series, Lambert series, inclusion/exclusion, Laplace expansion formula for determinants, and Schur functions. The Schur function form of these infinite families of identities are analogous to the ηfunction identities of Macdonald. Moreover, the powers 4n(n + 1), 2n 2 + n, 2n 2 − n that appear in Macdonald’s work also arise at appropriate places in our analysis. A special case of our general methods yields a proof of the two Kac–Wakimoto conjectured identities involving representing