Sufficient condition for the coherent control of n -qubit systems

We study quantum systems with even numbers N of levels that are completely state controlled by unitary transformations generated by Lie algebras isomorphic to sp(N) of dimension N(N+1) 2 as discussed by Albertini and D\u27Allesandro [IEEE Trans. Autom. Control 48, 1399 (2003)]. These Lie algebras are smaller than the corresponding su(N) with dimension N2 -1. We show that this reduction constrains the field-free Hamiltonian to have symmetric energy levels. An example of such a system is an n -qubit system with state-independent interaction terms. Using Clifford\u27s geometric algebra to represent the quantum wave function of a finite system, we present an explicit example of a two-qubit system that can be controlled by the elements of the Lie algebra sp(4) [isomorphic to spin(5) and so(5)] with dimension 10 rather than su(4) with dimension 15, but only if its field-free energy levels are symmetrically distributed about an average. These results enable one to envision more efficient algorithms for the design of fields for quantum-state engineering in certain quantum-computing applications, and provide more insight into the fundamental structure of quantum control

Almost-Euclidean subspaces of ℓ1N\ell_1^N via tensor products: a simple approach to randomness reduction

It has been known since 1970's that the N-dimensional $\ell_1$-space contains nearly Euclidean subspaces whose dimension is $\Omega(N)$. However, proofs of existence of such subspaces were probabilistic, hence non-constructive, which made the results not-quite-suitable for subsequently discovered applications to high-dimensional nearest neighbor search, error-correcting codes over the reals, compressive sensing and other computational problems. In this paper we present a "low-tech" scheme which, for any $a > 0$, allows to exhibit nearly Euclidean $\Omega(N)$-dimensional subspaces of $\ell_1^N$ while using only $N^a$ random bits. Our results extend and complement (particularly) recent work by Guruswami-Lee-Wigderson. Characteristic features of our approach include (1) simplicity (we use only tensor products) and (2) yielding "almost Euclidean" subspaces with arbitrarily small distortions.Comment: 11 pages; title change, abstract and references added, other minor change

Some results on affine Deligne-Lusztig varieties

The study of affine Deligne-Lusztig varieties originally arose from arithmetic geometry, but many problems on affine Deligne-Lusztig varieties are purely Lie-theoretic in nature. This survey deals with recent progress on several important problems on affine Deligne-Lusztig varieties. The emphasis is on the Lie-theoretic aspect, while some connections and applications to arithmetic geometry will also be mentioned.Comment: 2018 ICM report, reference update

Structured Deformations of Continua: Theory and Applications

The scope of this contribution is to present an overview of the theory of structured deformations of continua, together with some applications. Structured deformations aim at being a unified theory in which elastic and plastic behaviours, as well as fractures and defects can be described in a single setting. Since its introduction in the scientific community of rational mechanicists (Del Piero-Owen, ARMA 1993), the theory has been put in the framework of variational calculus (Choksi-Fonseca, ARMA 1997), thus allowing for solution of problems via energy minimization. Some background, three problems and a discussion on future directions are presented.Comment: 11 pages, 1 figure, 1 diagram. Submitted to the Proceedings volume of the conference CoMFoS1

Two Structural Results for Low Degree Polynomials and Applications

In this paper, two structural results concerning low degree polynomials over finite fields are given. The first states that over any finite field $\mathbb{F}$, for any polynomial $f$ on $n$ variables with degree $d \le \log(n)/10$, there exists a subspace of $\mathbb{F}^n$ with dimension $\Omega(d \cdot n^{1/(d-1)})$ on which $f$ is constant. This result is shown to be tight. Stated differently, a degree $d$ polynomial cannot compute an affine disperser for dimension smaller than $\Omega(d \cdot n^{1/(d-1)})$. Using a recursive argument, we obtain our second structural result, showing that any degree $d$ polynomial $f$ induces a partition of $F^n$ to affine subspaces of dimension $\Omega(n^{1/(d-1)!})$, such that $f$ is constant on each part. We extend both structural results to more than one polynomial. We further prove an analog of the first structural result to sparse polynomials (with no restriction on the degree) and to functions that are close to low degree polynomials. We also consider the algorithmic aspect of the two structural results. Our structural results have various applications, two of which are: * Dvir [CC 2012] introduced the notion of extractors for varieties, and gave explicit constructions of such extractors over large fields. We show that over any finite field, any affine extractor is also an extractor for varieties with related parameters. Our reduction also holds for dispersers, and we conclude that Shaltiel's affine disperser [FOCS 2011] is a disperser for varieties over $F_2$. * Ben-Sasson and Kopparty [SIAM J. C 2012] proved that any degree 3 affine disperser over a prime field is also an affine extractor with related parameters. Using our structural results, and based on the work of Kaufman and Lovett [FOCS 2008] and Haramaty and Shpilka [STOC 2010], we generalize this result to any constant degree

Effective Invariant Theory of Permutation Groups using Representation Theory

Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner combinatorial description of the invariant ring.Comment: Draft version, the corrected full version is available at http://www.springer.com

The GNAT method for nonlinear model reduction: effective implementation and application to computational fluid dynamics and turbulent flows

The Gauss--Newton with approximated tensors (GNAT) method is a nonlinear model reduction method that operates on fully discretized computational models. It achieves dimension reduction by a Petrov--Galerkin projection associated with residual minimization; it delivers computational efficency by a hyper-reduction procedure based on the `gappy POD' technique. Originally presented in Ref. [1], where it was applied to implicit nonlinear structural-dynamics models, this method is further developed here and applied to the solution of a benchmark turbulent viscous flow problem. To begin, this paper develops global state-space error bounds that justify the method's design and highlight its advantages in terms of minimizing components of these error bounds. Next, the paper introduces a `sample mesh' concept that enables a distributed, computationally efficient implementation of the GNAT method in finite-volume-based computational-fluid-dynamics (CFD) codes. The suitability of GNAT for parameterized problems is highlighted with the solution of an academic problem featuring moving discontinuities. Finally, the capability of this method to reduce by orders of magnitude the core-hours required for large-scale CFD computations, while preserving accuracy, is demonstrated with the simulation of turbulent flow over the Ahmed body. For an instance of this benchmark problem with over 17 million degrees of freedom, GNAT outperforms several other nonlinear model-reduction methods, reduces the required computational resources by more than two orders of magnitude, and delivers a solution that differs by less than 1% from its high-dimensional counterpart