6,066 research outputs found
Quantum Query Complexity of Multilinear Identity Testing
Motivated by the quantum algorithm in \cite{MN05} for testing commutativity
of black-box groups, we study the following problem: Given a black-box finite
ring where is an additive
generating set for and a multilinear polynomial over
also accessed as a black-box function (where we allow the
indeterminates to be commuting or noncommuting), we study the
problem of testing if is an \emph{identity} for the ring . More
precisely, the problem is to test if for all .
We give a quantum algorithm with query complexity assuming . Towards a lower bound,
we also discuss a reduction from a version of -collision to this problem.
We also observe a randomized test with query complexity and constant
success probability and a deterministic test with query complexity.Comment: 12 page
The use of singular value gradients and optimization techniques to design robust controllers for multiloop systems
A method for designing robust feedback controllers for multiloop systems is presented. Robustness is characterized in terms of the minimum singular value of the system return difference matrix at the plant input. Analytical gradients of the singular values with respect to design variables in the controller are derived. A cumulative measure of the singular values and their gradients with respect to the design variables is used with a numerical optimization technique to increase the system's robustness. Both unconstrained and constrained optimization techniques are evaluated. Numerical results are presented for a two output drone flight control system
Application of matrix singular value properties for evaluating gain and phase margins of multiloop systems
For Abstract see A83-12457 (or A8312457/2
Application of constrained optimization to active control of aeroelastic response
Active control of aeroelastic response is a complex in which the designer usually tries to satisfy many criteria which are often conflicting. To further complicate the design problem, the state space equations describing this type of control problem are usually of high order, involving a large number of states to represent the flexible structure and unsteady aerodynamics. Control laws based on the standard Linear-Quadratic-Gaussian (LQG) method are of the same high order as the aeroelastic plant. To overcome this disadvantage of the LQG mode, an approach developed for designing low order optimal control laws which uses a nonlinear programming algorithm to search for the values of the control law variables that minimize a composite performance index, was extended to the constrained optimization problem. The method involves searching for the values of the control law variables that minimize a basic performance index while satisfying several inequality constraints that describe the design criteria. The method is applied to gust load alleviation of a drone aircraft
The Fractional Quantum Hall effect in an array of quantum wires
We demonstrate the emergence of the quantum Hall (QH) hierarchy in a 2D model
of coupled quantum wires in a perpendicular magnetic field. At commensurate
values of the magnetic field, the system can develop instabilities to
appropriate inter-wire electron hopping processes that drive the system into a
variety of QH states. Some of the QH states are not included in the
Haldane-Halperin hierarchy. In addition, we find operators allowed at any field
that lead to novel crystals of Laughlin quasiparticles. We demonstrate that any
QH state is the groundstate of a Hamiltonian that we explicitly construct.Comment: Revtex, 4 pages, 2 figure
Control law synthesis and optimization software for large order aeroservoelastic systems
A flexible aircraft or space structure with active control is typically modeled by a large-order state space system of equations in order to accurately represent the rigid and flexible body modes, unsteady aerodynamic forces, actuator dynamics and gust spectra. The control law of this multi-input/multi-output (MIMO) system is expected to satisfy multiple design requirements on the dynamic loads, responses, actuator deflection and rate limitations, as well as maintain certain stability margins, yet should be simple enough to be implemented on an onboard digital microprocessor. A software package for performing an analog or digital control law synthesis for such a system, using optimal control theory and constrained optimization techniques is described
Accurate Evaluation of Charge Asymmetry in Aqueous Solvation
Charge hydration asymmetry (CHA)--a characteristic dependence of hydration
free energy on the sign of the solute charge--quantifies the asymmetric
response of water to electric field at microscopic level. Accurate estimates of
CHA are critical for understanding hydration effects ubiquitous in chemistry
and biology. However, measuring hydration energies of charged species is
fraught with significant difficulties, which lead to unacceptably large (up to
300%) variation in the available estimates of the CHA effect. We circumvent
these difficulties by developing a framework which allows us to extract and
accurately estimate the intrinsic propensity of water to exhibit CHA from
accurate experimental hydration free energies of neutral polar molecules.
Specifically, from a set of 504 small molecules we identify two pairs that are
analogous, with respect to CHA, to the K+/F- pair--a classical probe for the
effect. We use these "CHA-conjugate" molecule pairs to quantify the intrinsic
charge-asymmetric response of water to the microscopic charge perturbations:
the asymmetry of the response is strong, ~50% of the average hydration free
energy of these molecules. The ability of widely used classical water models to
predict hydration energies of small molecules correlates with their ability to
predict CHA
Efficient Black-Box Identity Testing for Free Group Algebras
Hrubes and Wigderson [Pavel Hrubes and Avi Wigderson, 2014] initiated the study of noncommutative arithmetic circuits with division computing a noncommutative rational function in the free skew field, and raised the question of rational identity testing. For noncommutative formulas with inverses the problem can be solved in deterministic polynomial time in the white-box model [Ankit Garg et al., 2016; Ivanyos et al., 2018]. It can be solved in randomized polynomial time in the black-box model [Harm Derksen and Visu Makam, 2017], where the running time is polynomial in the size of the formula. The complexity of identity testing of noncommutative rational functions, in general, remains open for noncommutative circuits with inverses.
We solve the problem for a natural special case. We consider expressions in the free group algebra F(X,X^{-1}) where X={x_1, x_2, ..., x_n}. Our main results are the following.
1) Given a degree d expression f in F(X,X^{-1}) as a black-box, we obtain a randomized poly(n,d) algorithm to check whether f is an identically zero expression or not. The technical contribution is an Amitsur-Levitzki type theorem [A. S. Amitsur and J. Levitzki, 1950] for F(X, X^{-1}). This also yields a deterministic identity testing algorithm (and even an expression reconstruction algorithm) that is polynomial time in the sparsity of the input expression.
2) Given an expression f in F(X,X^{-1}) of degree D and sparsity s, as black-box, we can check whether f is identically zero or not in randomized poly(n,log s, log D) time. This yields a randomized polynomial-time algorithm when D and s are exponential in n
- …