7,904 research outputs found
CM cycles on Kuga–Sato varieties over Shimura curves and Selmer groups
Given a modular form f of even weight larger than two and an imaginary quadratic field K
satisfying a relaxed Heegner hypothesis, we construct a collection of CM cycles on a Kuga–Sato
variety over a suitable Shimura curve which gives rise to a system of Galois cohomology classes
attached to f enjoying the compatibility properties of an Euler system. Then we use Kolyvagin’s
method [21], as adapted by Nekova´¿r [28] to higher weight modular forms, to bound the size of the relevant Selmer group associated to f and K and prove the finiteness of the (primary part) of the Shafarevich–Tate group, provided that a suitable cohomology class does not vanish.Peer ReviewedPostprint (author's final draft
Nearly Optimal Computations with Structured Matrices
We estimate the Boolean complexity of multiplication of structured matrices
by a vector and the solution of nonsingular linear systems of equations with
these matrices. We study four basic most popular classes, that is, Toeplitz,
Hankel, Cauchy and Van-der-monde matrices, for which the cited computational
problems are equivalent to the task of polynomial multiplication and division
and polynomial and rational multipoint evaluation and interpolation. The
Boolean cost estimates for the latter problems have been obtained by Kirrinnis
in \cite{kirrinnis-joc-1998}, except for rational interpolation, which we
supply now. All known Boolean cost estimates for these problems rely on using
Kronecker product. This implies the -fold precision increase for the -th
degree output, but we avoid such an increase by relying on distinct techniques
based on employing FFT. Furthermore we simplify the analysis and make it more
transparent by combining the representation of our tasks and algorithms in
terms of both structured matrices and polynomials and rational functions. This
also enables further extensions of our estimates to cover Trummer's important
problem and computations with the popular classes of structured matrices that
generalize the four cited basic matrix classes.Comment: (2014-04-10
Semi-optimal Practicable Algorithmic Cooling
Algorithmic Cooling (AC) of spins applies entropy manipulation algorithms in
open spin-systems in order to cool spins far beyond Shannon's entropy bound. AC
of nuclear spins was demonstrated experimentally, and may contribute to nuclear
magnetic resonance (NMR) spectroscopy. Several cooling algorithms were
suggested in recent years, including practicable algorithmic cooling (PAC) and
exhaustive AC. Practicable algorithms have simple implementations, yet their
level of cooling is far from optimal; Exhaustive algorithms, on the other hand,
cool much better, and some even reach (asymptotically) an optimal level of
cooling, but they are not practicable. We introduce here semi-optimal
practicable AC (SOPAC), wherein few cycles (typically 2-6) are performed at
each recursive level. Two classes of SOPAC algorithms are proposed and
analyzed. Both attain cooling levels significantly better than PAC, and are
much more efficient than the exhaustive algorithms. The new algorithms are
shown to bridge the gap between PAC and exhaustive AC. In addition, we
calculated the number of spins required by SOPAC in order to purify qubits for
quantum computation. As few as 12 and 7 spins are required (in an ideal
scenario) to yield a mildly pure spin (60% polarized) from initial
polarizations of 1% and 10%, respectively. In the latter case, about five more
spins are sufficient to produce a highly pure spin (99.99% polarized), which
could be relevant for fault-tolerant quantum computing.Comment: 13 pages, 5 figure
- …