Open Problems Related to Quantum Query Complexity

I offer a case that quantum query complexity still has loads of enticing and fundamental open problems—from relativized QMA versus QCMA and BQP versus IP , to time/space tradeoffs for collision and element distinctness, to polynomial degree versus quantum query complexity for partial functions, to the Unitary Synthesis Problem and more.

Synthesis of a mobile robot spatial stabilization system based on machine learning control by symbolic regression

The spatial stabilization system synthesis problem of the robot is considered. The historical overview of methods and approaches for solving the problem of control synthesis is given. It is shown that the control synthesis problem is the most important task in the field of control, for which there are no universal numerical methods for solving it. As one of the ways to solve this problem, it is proposed to use the method of machine learning based on the application of modern symbolic regression methods. This allows you to build universal algorithms for solving control synthesis problems. Several most promising symbolic regression methods are considered for application in control tasks. The formal statement of the control synthesis problem for its numerical solution is given. Examples of solving problems of synthesis of system of spatial stabilization of mobile robot by method of network operator and variation Cartesian genetic programming are given. The problem required finding one nonlinear feedback function to move the robot from thirty initial conditions to one terminal point. Mathematical records of the obtained control functions are given. Results of simulation of control systems obtained by symbolic regression methods are given.

Synthesis of highly efficient multilayer dielectric diffraction gratings for spectral combining of laser beams

Статья посвящена синтезу многослойных диэлектрических отражательных дифракционных решеток, с высокой эффективностью обеспечивающих спектральное сложение пучков с различной длиной волны в заданном дифракционном порядке. Приводятся результаты решения задачи синтеза многослойных диэлектрических дифракционных решеток, обеспечивающих спектральное сложение в первом или минус первом порядке дифракции. Кроме того, решается задача синтеза для таких решеток с учетом возможных технологических ограничений на высоту профиля (глубину травления). Решение задачи синтеза проводится путем минимизации зависящего от параметров решетки целевого функционала методом Нелдера-Мида. Решение прямой задачи на каждом шаге минимизации осуществляется при помощи комбинации неполного метода Галеркина и метода матриц рассеяния. The paper is devoted to the synthesis of multilayer dielectric reflection diffraction gratings providing high-efficiency spectral combining of the beams with different wavelengths in a given diffraction order. The results are presented for solving the synthesis problems for multilayer dielectric diffraction gratings providing spectral combining in the first or minus first diffraction order. Besides, the synthesis problem for such gratings is solved with account taken of possible technological constraints imposed by the height of the grating profile (etch depth). The solution of the synthesis problem is obtained by means of Nelder-Mead minimization of the merit function depending on the grating parameters. At each minimization step the direct problem is solved using a combination of the incomplete Galerkin method and scattering matrix method.

Synthesizing Best-effort Strategies under Multiple Environment Specifications

We formally introduce and solve the synthesis problem for LTL goals in the case of multiple, even contradicting, assumptions about the environment. Our solution concept is based on ``best-effort strategies'' which are agent plans that, for each of the environment specifications individually, achieve the agent goal against a maximal set of environments satisfying that specification. By means of a novel automata theoretic characterization we demonstrate that this best-effort synthesis for multiple environments is 2ExpTime-complete, i.e., no harder than plain LTL synthesis. We study an important case in which the environment specifications are increasingly indeterminate, and show that as in the case of a single environment, best-effort strategies always exist for this setting. Moreover, we show that in this setting the set of solutions are exactly the strategies formed as follows: amongst the best-effort agent strategies for ɸ under the environment specification E1, find those that do a best-effort for ɸ under (the more indeterminate) environment specification E2, and amongst those find those that do a best-effort for ɸ under the environment specification E3, etc.

A Machine Learning Approach to Solving the Alt-Burmester Problem for Synthesis of Defect-free Spatial Mechanisms

In this paper, we present a machine-learning algorithm to synthesize defect-free single degree of freedom spatial mechanisms for the Alt-Burmester problem. The Alt-Burmester problem is a generalization of a pure motion synthesis problem to include via path-points with missing orientations. While much work has been done towards the synthesis of planar and, to some extent, spherical mechanisms, the generation of mechanisms that are free of circuit, branch, and order defects has proven to be a difficult task. This is even more challenging for spatial mechanisms, which can consist of a large number of circuits and branches. Moreover, the Alt-Burmester problem makes solving such problems using an analytical approach further demanding. In this paper, we present a novel machine-learning algorithm for solving the Alt-Burmester problem for spatial 5-SS platform mechanism using a Variational Auto-Encoder (VAE) architecture. The VAE helps capture the relationship between path and orientation properties of the motion of the 5-SS mechanisms, which enables reformulating the Alt-Burmester problem into a pure motion synthesis problem. The end goal is to produce defect-free spatial mechanism design solutions. While our focus in this paper is on the 5-SS mechanisms, this approach can be scaled to any single-degree-of-freedom spatial mechanisms.