Search

Numerous distributed tasks have to be handled in a setting where a fraction of nodes behaves Byzantine, that is, deviates arbitrarily from the intended protocol. Resilient, deterministic protocols rely on the detection of majorities to avoid inconsistencies if there is a Byzantine minority, which requires individual nodes to handle a communication load that is proportional to the size of the network -- an intolerable disadvantage in large networks. Randomized protocols circumvent this by probing only small parts of the network, thus allowing for consistent decisions quickly and with a high level of confidence with communication that is near-constant in the network size. However, such protocols usually come with the drawback of limiting the fault tolerance of the protocol. For instance, by severely restricting the number or type of failures that the protocol can tolerate. We present randomized protocols to reliably aggregate and broadcast information, form consensus and compute common coins that tolerate a constant fraction of Byzantine failures, do not require cryptographic methods and have a near-constant time and message complexity per node. Our main technique is to compute a system of witness committees as a pre-computation step almost optimally. This pre-computation step allows to solve the aforementioned distributed tasks repeatedly and efficiently, but may have far reaching further applications, e.g., for sharding of distributed data structures.

State engineering of quantum objects is a central requirement in most implementations. In the cases where the quantum dynamics can be described by analytical solutions or simple approximation models, optimal state preparation protocols have been theoretically proposed and experimentally realized. For more complex systems, however, such as multi-component quantum gases, simplifying assumptions do not apply anymore and the optimization techniques become computationally impractical. Here, we propose Bayesian optimization based on multi-output Gaussian processes to learn the quantum state's physical properties from few simulations only. We evaluate its performance on an optimization study case of diabatically transporting a Bose-Einstein condensate while keeping it in its ground state, and show that within only few hundreds of executions of the underlying physics simulation, we reach a competitive performance with other protocols. While restricting this benchmarking to well known approximations for straightforward comparisons, we expect a similar performance when employing more involving models, which are computationally more challenging. This paves the way to efficient state engineering of complex quantum systems., Comment: 12 pages, 5 figures

We present a fabrication uncertainty aware and robust design optimization approach that can be used to obtain robust design estimates for nonlinear, nonconvex, and expensive model functions. It is founded on Gaussian processes and a Monte Carlo sampling procedure, and assumes knowledge about the uncertainties associated with a manufacturing process. The approach itself is iterative. First, a large parameter domain is sampled in a coarse fashion. This coarse sampling is used primarily to determine smaller candidate regions to investigate in a second, more refined sampling pass. This finer step is used to obtain an estimate of the expected performance of the found design parameter under the assumed manufacturing uncertainties. We apply the presented approach to the robust optimization of the Purcell enhancement of a photonic crystal nanobeam cavity. We obtain a predicted robust Purcell enhancement of $\overline{F}_{\mathrm{P}} \approx 3.3$. For comparison we also perform an optimization without robustness. We find that an unrobust optimum of $F_{\mathrm{P}} \approx 256.5$ dwindles to only $\overline{F}_{\mathrm{P}} \approx 0.7$ when fabrication uncertainties are taken into account. We thus demonstrate that the presented approach is able to find designs of significantly higher performance than those obtained with conventional optimization.

A family of leaderless, decentralized consensus protocols, called Snow consensus was introduced in a recent whitepaper by Yin et al. These protocols address limitations of existing consensus methods, such as those using proof-of-work or quorums, by utilizing randomization and maintaining some level of resilience against Byzantine participants. Crucially, Snow consensus underpins the Avalanche blockchain, which provides a popular cryptocurrency and a platform for running smart contracts. Snow consensus algorithms are built on a natural, randomized routine, whereby participants continuously sample subsets of others and adopt an observed majority value until consensus is achieved. Additionally, Snow consensus defines conditions based on participants' local views and security parameters. These conditions indicate when a party can confidently finalize its local value, knowing it will be adopted by honest participants. Although Snow consensus algorithms can be formulated concisely, there is a complex interaction between randomization, adversarial influence, and security parameters, which requires a formal analysis of their security and liveness. Snow protocols form the foundation for Avalanche-type blockchains, and this work aims to increase our understanding of such protocols by providing insights into their liveness and safety characteristics. First, we analyze these Snow protocols in terms of latency and security. Second, we expose a design issue where the trade-off between these two is unfavorable. Third, we propose a modification of the original protocol where this trade-off is much more favorable.

The generation of cold atom clouds is a complex process which involves the optimization of noisy data in high dimensional parameter spaces. Optimization can be challenging both in and especially outside of the lab due to lack of time, expertise, or access for lengthy manual optimization. In recent years, it was demonstrated that machine learning offers a solution since it can optimize high dimensional problems quickly, without knowledge of the experiment itself. In this paper we present results showing the benchmarking of nine different optimization techniques and implementations, alongside their ability to optimize a Rubidium (Rb) cold atom experiment. The investigations are performed on a 3D $^{87}$Rb molasses with 10 and 18 adjustable parameters, respectively, where the atom number obtained by absorption imaging was chosen as the test problem. We further compare the best performing optimizers under different effective noise conditions by reducing the Signal-to-Noise ratio of the images via adapting the atomic vapor pressure in the 2D+ MOT and the detection laser frequency stability.

In this work we consider the HYBRID model of distributed computing, introduced recently by Augustine, Hinnenthal, Kuhn, Scheideler, and Schneider (SODA 2020), where nodes have access to two different communication modes: high-bandwidth local communication along the edges of the graph and low-bandwidth all-to-all communication, capturing the non-uniform nature of modern communication networks. Prior work in HYBRID has focused on showing existentially optimal algorithms, meaning there exists a pathological family of instances on which no algorithm can do better. This neglects the fact that such worst-case instances often do not appear or can be actively avoided in practice. In this work, we focus on the notion of universal optimality, first raised by Garay, Kutten, and Peleg (FOCS 1993). Roughly speaking, a universally optimal algorithm is one that, given any input graph, runs as fast as the best algorithm designed specifically for that graph. We show the first universally optimal algorithms in HYBRID. We present universally optimal solutions for fundamental information dissemination tasks, such as broadcasting and unicasting multiple messages in HYBRID. Furthermore, we apply these tools to obtain universally optimal solutions for various shortest paths problems in HYBRID. A main conceptual contribution of this work is the conception of a new graph parameter called neighborhood quality that captures the inherent complexity of many fundamental graph problems in HYBRID. We also show new existentially optimal shortest paths algorithms in HYBRID, which are utilized as key subroutines in our universally optimal algorithms and are of independent interest. Our new algorithms for $k$-source shortest paths match the existing $\tilde{\Omega}(\sqrt{k})$ lower bound for all $k$. Previously, the lower bound was only known to be tight when $k \in \tilde{\Omega}(n^{2/3})$., Comment: This work combines the three preprints arXiv:2304.06317, arXiv:2304.07107, and arXiv:2306.05977 with some improved results

Modelling the scattering of focused, coherent light by nano-scale structures is oftentimes used to reconstruct or infer geometrical or material properties of structures under investigation in optical scatterometry. This comprises both periodic and aperiodic nano-structures. Coherent Fourier scatterometry with focused light exploits the diffraction pattern formed by the nano-structures in Fourier plane. While the scattering of a focused beam by a spatially isolated scatterer is a standard modelling task for state-of-the art electromagnetic solvers based, e.g., on the finite element method, the case of periodically structured samples is more involved. In particular when the focused light covers several grating periods of as it is commonly the case. We will present a coherent illumination model for scattering of focused beams such as Gaussian -- and Bessel -- beams by periodic structures such as line gratings. The model allows to take into account optical wavefront aberrations in optical systems used for both, the illumination and detection of the scattered fields. We compare the model with strategies implemented on large-scale super-cells and inverse Floquet-transform strategies to superimpose both near- and far- fields coherently., Comment: Proceedings article, SPIE conference "Modeling Aspects in Optical Metrology IX"

A drawback of the classic approach for complexity analysis of distributed graph problems is that it mostly informs about the complexity of notorious classes of ``worst case'' graphs. Algorithms that are used to prove a tight (existential) bound are essentially optimized to perform well on such worst case graphs. However, such graphs are often either unlikely or actively avoided in practice, where benign graph instances usually admit much faster solutions. To circumnavigate these drawbacks, the concept of universal complexity analysis in the distributed setting was suggested by [Kutten and Peleg, PODC'95] and actively pursued by [Haeupler et al., STOC'21]. Here, the aim is to gauge the complexity of a distributed graph problem depending on the given graph instance. The challenge is to identify and understand the graph property that allows to accurately quantify the complexity of a distributed problem on a given graph. In the present work, we consider distributed shortest paths problems in the HYBRID model of distributed computing, where nodes have simultaneous access to two different modes of communication: one is restricted by locality and the other is restricted by congestion. We identify the graph parameter of neighborhood quality and show that it accurately describes a universal bound for the complexity of certain class of shortest paths problems in the HYBRID model.

We investigate the calculation of resonance modes of a VCSEL with a Riesz projection eigenvalue solver. The eigenvalue solver is based on the principle of contour integration where for the solution of scattering problems physical right sides are used. Here, it is investigated how numerical parameters impact the performance of the method, where we focus on the computation of the fundamental VCSEL mode., Comment: Proceedings article, SPIE conference "Integrated Optics: Design, Devices, Systems, and Applications VII"

In optical nano metrology numerical models are used widely for parameter reconstructions. Using the Bayesian target vector optimization method we fit a finite element numerical model to a Grazing Incidence X-Ray fluorescence data set in order to obtain the geometrical parameters of a nano structured line grating. Gaussian process, stochastic machine learning surrogate models, were trained during the reconstruction and afterwards sampled with a Markov chain Monte Carlo sampler to determine the distribution of the reconstructed model parameters. The numerical discretization parameters of the used finite element model impact the numerical discretization error of the forward model. We investigated the impact of the polynomial order of the finite element ansatz functions on the reconstructed parameters as well as on the model parameter distributions. We showed that such a convergence study allows to determine numerical parameters which allows for efficient and accurate reconstruction results., Comment: Submitted to Metrologia Focus Issue on MATHMET 2023 conference

Shortest paths problems are subject to extensive studies in classic distributed models such as the CONGEST or Congested Clique. These models dictate how nodes may communicate in order to determine shortest paths in a distributed input graph. This article focuses on shortest paths problems in the HYBRID model, which combines local communication along edges of the input graph with global communication between arbitrary pairs of nodes that is restricted in terms of bandwidth. Previous work showed that it takes $\tilde \Omega(\!\sqrt{k})$ rounds in the \hybrid model for each node to learn its distance to $k$ dedicated source nodes (aka the $k$-SSP problem), even for crude approximations. This lower bound was also matched with algorithmic solutions for $k \geq n^{2/3}$. However, as $k$ gets smaller, the gap between the known upper and lower bounds diverges and even becomes exponential for a single source. In this work we close this gap for the whole range of $k$ (up to terms that are polylogarithmic in $n$), by giving algorithmic solutions for $k$-SSP in $\tilde O\big(\!\sqrt k\big)$ rounds for any $k$.

We consider the problem of computing routing schemes in the $\mathsf{HYBRID}$ model of distributed computing where nodes have access to two fundamentally different communication modes. In this problem nodes have to compute small labels and routing tables that allow for efficient routing of messages in the local network, which typically offers the majority of the throughput. Recent work has shown that using the $\mathsf{HYBRID}$ model admits a significant speed-up compared to what would be possible if either communication mode were used in isolation. Nonetheless, if general graphs are used as the input graph the computation of routing schemes still takes polynomial rounds in the $\mathsf{HYBRID}$ model. We bypass this lower bound by restricting the local graph to unit-disc-graphs and solve the problem deterministically with running time $O(|\mathcal H|^2 \!+\! \log n)$, label size $O(\log n)$, and size of routing tables $O(|\mathcal H|^2 \!\cdot\! \log n)$ where $|\mathcal H|$ is the number of ``radio holes'' in the network. Our work builds on recent work by Coy et al., who obtain this result in the much simpler setting where the input graph has no radio holes. We develop new techniques to achieve this, including a decomposition of the local graph into path-convex regions, where each region contains a shortest path for any pair of nodes in it.

Resonances are omnipresent in physics and essential for the description of wave phenomena. We present an approach for computing eigenfrequency sensitivities of resonances. The theory is based on Riesz projections and the approach can be applied to compute partial derivatives of the complex eigenfrequencies of any resonance problem. Here, the method is derived for Maxwell's equations. Its numerical realization essentially relies on direct differentiation of scattering problems. We use a numerical implementation to demonstrate the performance of the approach compared to differentiation using finite differences. The method is applied for the efficient optimization of the quality factor of a nanophotonic resonator.

Parameter reconstructions are indispensable in metrology. Here, the objective is to to explain $K$ experimental measurements by fitting to them a parameterized model of the measurement process. The model parameters are regularly determined by least-square methods, i.e., by minimizing the sum of the squared residuals between the $K$ model predictions and the $K$ experimental observations, $\chi^2$. The model functions often involve computationally demanding numerical simulations. Bayesian optimization methods are specifically suited for minimizing expensive model functions. However, in contrast to least-square methods such as the Levenberg-Marquardt algorithm, they only take the value of $\chi^2$ into account, and neglect the $K$ individual model outputs. We present a Bayesian target-vector optimization scheme with improved performance over previous developments, that considers all $K$ contributions of the model function and that is specifically suited for parameter reconstruction problems which are often based on hundreds of observations. Its performance is compared to established methods for an optical metrology reconstruction problem and two synthetic least-squares problems. The proposed method outperforms established optimization methods. It also enables to determine accurate uncertainty estimates with very few observations of the actual model function by using Markov chain Monte Carlo sampling on a trained surrogate model.

Hybrid networks, i.e., networks that leverage different means of communication, become ever more widespread. To allow theoretical study of such networks, [Augustine et al., SODA'20] introduced the $\mathsf{HYBRID}$ model, which is based on the concept of synchronous message passing and uses two fundamentally different principles of communication: a local mode, which allows every node to exchange one message per round with each neighbor in a local communication graph; and a global mode where any pair of nodes can exchange messages, but only few such exchanges can take place per round. A sizable portion of the previous research for the $\mathsf{HYBRID}$ model revolves around basic communication primitives and computing distances or shortest paths in networks. In this paper, we extend this study to a related fundamental problem of computing compact routing schemes for near-shortest paths in the local communication graph. We demonstrate that, for the case where the local communication graph is a unit-disc graph with $n$ nodes that is realized in the plane and has no radio holes, we can deterministically compute a routing scheme that has constant stretch and uses labels and local routing tables of size $O(\log n)$ bits in only $O(\log n)$ rounds.

The $\mathsf{HYBRID}$ model was introduced as a means for theoretical study of distributed networks that use various communication modes. Conceptually, it is a synchronous message passing model with a local communication mode, where in each round each node can send large messages to all its neighbors in a local network (a graph), and a global communication mode, where each node is allotted limited (polylogarithmic) bandwidth per round which it can use to communicate with any node in the network. Prior work has often focused on shortest paths problems in the local network, as their global nature makes these an interesting case study how combining communication modes in the $\mathsf{HYBRID}$ model can overcome the individual lower bounds of either mode. In this work we consider a similar problem, namely computation of distance oracles and routing schemes. In the former, all nodes have to compute local tables, which allows them to look up the distance (estimates) to any target node in the local network when provided with the label of the target. In the latter, it suffices that nodes give the next node on an (approximately) shortest path to the target. Our goal is to compute these local tables as fast as possible with labels as small as possible. We show that this can be done exactly in $\widetilde O(n^{1/3})$ communication rounds and labels of size $\Theta(n^{2/3})$ bits. For constant stretch approximations we achieve labels of size $O(\log n)$ in the same time. Further, as our main technical contribution, we provide computational lower bounds for a variety of problem parameters. For instance, we show that computing solutions with stretch below a certain constant takes $\widetilde \Omega(n^{1/3})$ rounds even for labels of size $O(n^{2/3})$.

Parameter reconstruction is a common problem in optical nano metrology. It generally involves a set of measurements, to which one attempts to fit a numerical model of the measurement process. The model evaluation typically involves to solve Maxwell's equations and is thus time consuming. This makes the reconstruction computationally demanding. Several methods exist for fitting the model to the measurements. On the one hand, Bayesian optimization methods for expensive black-box optimization enable an efficient reconstruction by training a machine learning model of the squared sum of deviations. On the other hand, curve fitting algorithms, such as the Levenberg-Marquardt method, take the deviations between all model outputs and corresponding measurement values into account which enables a fast local convergence. In this paper we present a Bayesian Target Vector Optimization scheme which combines these two approaches. We compare the performance of the presented method against a standard Levenberg-Marquardt-like algorithm, a conventional Bayesian optimization scheme, and the L-BFGS-B and Nelder-Mead simplex algorithms. As a stand-in for problems from nano metrology, we employ a non-linear least-square problem from the NIST Standard Reference Database. We find that the presented method generally uses fewer calls of the model function than any of the competing schemes to achieve similar reconstruction performance., Comment: Proceedings article, SPIE conference "Modeling Aspects in Optical Metrology VIII"

Nanostructures can be used for boosting the light outcoupling of color centers in diamond; however, the fiber coupling performance of these nanostructures is rarely investigated. Here, we use a finite element method for computing the emission from color centers in inverted nanocones and the overlap of this emission with the propagation mode in a single-mode fiber. Using different figures of merit, the inverted nanocone parameters are optimized to obtain maximal fiber coupling efficiency, free-space collection efficiency, or rate enhancement. The optimized inverted nanocone designs show promising results with 66% fiber coupling or 83% free-space coupling efficiency at the tin-vacancy center zero-phonon line wavelength of 619 nm. Moreover, when evaluated for broadband performance, the optimized designs show 55% and 76% for fiber coupling and free-space efficiencies respectively, for collecting the full tin-vacancy emission spectrum at room temperature. An analysis of fabrication insensitivity indicates that these nanostructures are robust against imperfections. For maximum emission rate into a fiber mode, a design with a Purcell factor of 2.34 is identified. Finally, possible improvements offered by a hybrid inverted nanocone, formed by patterning into two different materials, are investigated, and increases the achievable fiber coupling efficiency to 71%., Comment: The following article has been accepted by Applied Physics Letters. After it is published, it will be found at https://doi.org/10.1063/5.0050338

For the reliable fabrication of the current and next generation of nanostructures it is essential to be able to determine their material composition and dimensional parameters. Using the grazing incidence X-ray fluoresence technique, which is taking advantage of the X-ray standing wave field effect, nanostructures can be investigated with a high sensitivity with respect to the structural and elemental composition. This is demonstrated using lamellar gratings made of Si$_3$N$_4$. Rigorous field simulations obtained from a Maxwell solver based on the finite element method allow to determine the spatial distribution of elemental species and the geometrical shape with sub-nm resolution. The increasing complexity of nanostructures and demanded sensitivity for small changes quickly turn the curse of dimensionality for numerical simulation into a problem which can no longer be solved rationally even with massive parallelisation. New optimization schemes, e.g. machine learning, are required to satisfy the metrological requirements. We present reconstruction results obtained with a Bayesian optimization approach to reduce the computational effort., Comment: Event: SPIE Optical Metrology, 2019, Munich, Germany. arXiv admin note: text overlap with arXiv:1801.04157

The characterization of nanostructured surfaces with sensitivity in the sub-nm range is of high importance for the development of current and next generation integrated electronic circuits. Modern transistor architectures for e.g. FinFETs are realized by lithographic fabrication of complex, well ordered nanostructures. Recently, a novel characterization technique based on X-ray fluorescence measurements in grazing incidence geometry has been proposed for such applications. This technique uses the X-ray standing wave field, arising from an interference between incident and the reflected radiation, as a nanoscale sensor for the dimensional and compositional parameters of the nanostructure. The element sensitivity of the X-ray fluorescence technique allows for a reconstruction of the spatial element distribution using a finite-element method. Due to a high computational time, intelligent optimization methods employing machine learning algorithms are essential for a timely provision of results. Here, a sampling of the probability distributions by Bayesian optimization is not only fast, it also provides an initial estimate of the parameter uncertainties and sensitivities. The high sensitivity of the method requires a precise knowledge of the material parameters in the modeling of the dimensional shape provided that some physical properties of the material are known or determined beforehand. The unknown optical constants were extracted from an unstructured but otherwise identical layer system by means of soft X-ray reflectometry. The spatial distribution profiles of the different elements contained in the grating structure were compared to scanning electron and atomic force microscopy and the influence of carbon surface contamination on the modeling results were discussed.

We propose the combination of forward shape derivatives and the use of an iterative inversion scheme for Bayesian optimization to find optimal designs of nanophotonic devices. This approach widens the range of applicability of Bayesian optmization to situations where a larger number of iterations is required and where derivative information is available. This was previously impractical because the computational efforts required to identify the next evaluation point in the parameter space became much larger than the actual evaluation of the objective function. We demonstrate an implementation of the method by optimizing a waveguide edge coupler.

The $\mathsf{HYBRID}$ model, introduced in [Augustine et al., SODA '20], provides a theoretical foundation for networks that allow multiple communication modes. The model follows the principles of synchronous message passing, whereas nodes are allowed to use \textit{two} fundamentally different communication modes. First, a local mode where nodes may exchange arbitrary information per round over edges of a local communication graph $G$ (akin to the $\mathsf{LOCAL}$ model). Second, a global mode where every node may exchange $O(\log n)$ messages of size $O(\log n)$ bits per round with arbitrary nodes in the network. The $\mathsf{HYBRID}$ model intends to reflect the conditions of many real hybrid networks, where high-bandwidth but inherently local communication is combined with highly flexible global communication with restricted bandwidth. We continue to explore the power and limitations of the $\mathsf{HYBRID}$ model by investigating the complexity of computing shortest paths and diameter of the local communication graph $G$. We improve on the known upper bound for the exact all pairs shortest paths problem (APSP) from [Augustine et al., SODA '20] and provide algorithms to approximate solutions for the $k$ source shortest paths problem ($k$-SSSP). We demonstrate that our results for APSP and $k$-SSP are almost tight (up to poly-logarithmic factors). Furthermore, we give an improved algorithm for the exact single source shortest paths problem for graphs with large diameter. For the problem of approximating the diameter of the local communication network we give the first non-trivial upper bound. This upper bound is complemented by a lower bound for the exact diameter problem.

Background: Scatterometry is a fast, indirect and non-destructive optical method for quality control in the production of lithography masks. To solve the inverse problem in compliance with the upcoming need for improved accuracy, a computationally expensive forward model has to be defined which maps geometry parameters to diffracted light intensities. Aim: To quantify the uncertainties in the reconstruction of the geometry parameters, a fast to evaluate surrogate for the forward model has to be introduced. Approach: We use a non-intrusive polynomial chaos based approximation of the forward model which increases speed and thus enables the exploration of the posterior through direct Bayesian inference. Additionally, this surrogate allows for a global sensitivity analysis at no additional computational overhead. Results: This approach yields information about the complete distribution of the geometry parameters of a silicon line grating, which in return allows to quantify the reconstruction uncertainties in the form of means, variances and higher order moments of the parameters. Conclusion: The use of a polynomial chaos surrogate allows to quantify both parameter influences and reconstruction uncertainties. This approach is easy to use since no adaptation of the expensive forward model is required., Comment: arXiv admin note: substantial text overlap with arXiv:1910.14435

A user-friendly fibre-coupled single-photon source operating at telecom wavelengths is a key component of photonic quantum networks providing long-haul ultra-secure data exchange. To take full advantage of quantum-mechanical data protection and to maximize the transmission rate and distance, a true quantum source providing single-photons on demand is highly desirable. We tackle this great challenge by developing a ready to use semiconductor quantum dot (QD)-based device that launches single photons at a wavelength of 1.3 um directly into a single-mode optical fibre. In our approach the QD is deterministically integrated into a nanophotonic structure to ensure efficient on-chip coupling into a fibre. The whole arrangement is integrated into a 19" compatible housing to enable stand-alone operation by cooling via a compact Stirling cryocooler. The realized source delivers single photons with multiphoton events probability as low as 0.15 and single-photon emission rate up to 73 kHz into a standard telecom single-mode fibre., Comment: 20 pages, 3 figures

Scatterometry is a fast, indirect and nondestructive optical method for the quality control in the production of lithography masks. Geometry parameters of line gratings are obtained from diffracted light intensities by solving an inverse problem. To comply with the upcoming need for improved accuracy and precision and thus for the reduction of uncertainties, typically computationally expansive forward models have been used. In this paper we use Bayesian inversion to estimate parameters from scatterometry measurements of a silicon line grating and determine the associated uncertainties. Since the direct application of Bayesian inference using Markov-Chain Monte Carlo methods to physics-based partial differential equation (PDE) model is not feasible due to high computational costs, we use an approximation of the PDE forward model based on a polynomial chaos expansion. The expansion provides not only a surrogate for the PDE forward model, but also Sobol indices for a global sensitivity analysis. Finally, we compare our results for the global sensitivity analysis with the uncertainties of estimated parameters.

We introduce a communication model for hybrid networks, where nodes have access to two different communication modes: a local mode where communication is only possible between specific pairs of nodes, and a global mode where communication between any pair of nodes is possible. This can be motivated, for instance, by wireless networks in which we combine direct device-to-device communication (e.g., using WiFi) with communication via a shared infrastructure (like base stations, the cellular network, or satellites). Typically, communication over short-range connections is cheaper and can be done at a much higher rate. Hence, we are focusing here on the LOCAL model (in which the nodes can exchange an unbounded amount of information in each round) for the local connections while for the global communication we assume the so-called node-capacitated clique model, where in each round every node can exchange only $O(\log n)$-bit messages with just $O(\log n)$ other nodes. In order to explore the power of combining local and global communication, we study the impact of hybrid communication on the complexity of computing shortest paths in the graph given by the local connections. Specifically, for the all-pairs shortest paths problem (APSP), we show that an exact solution can be computed in time $\tilde O\big(n^{2/3}\big)$ and that approximate solutions can be computed in time $\tilde \Theta\big(\!\sqrt{n}\big)$. For the single-source shortest paths problem (SSSP), we show that an exact solution can be computed in time $\tilde O\big(\!\sqrt{\mathsf{SPD}}\big)$, where $\mathsf{SPD}$ denotes the shortest path diameter. We further show that a $\big(1\!+\!o(1)\big)$-approximate solution can be computed in time $\tilde O\big(n^{1/3}\big)$. Additionally, we show that for every constant $\varepsilon>0$, it is possible to compute an $O(1)$-approximate solution in time $\tilde O(n^\varepsilon)$.

Optical scatterometry is a method to measure the size and shape of periodic micro- or nanostructures on surfaces. For this purpose the geometry parameters of the structures are obtained by reproducing experimental measurement results through numerical simulations. We compare the performance of Bayesian optimization to different local minimization algorithms for this numerical optimization problem. Bayesian optimization uses Gaussian-process regression to find promising parameter values. We examine how pre-computed simulation results can be used to train the Gaussian process and to accelerate the optimization., Comment: 8 pages, 4 figures

Numerical optimization is an important tool in the field of computational physics in general and in nano-optics in specific. It has attracted attention with the increase in complexity of structures that can be realized with nowadays nano-fabrication technologies for which a rational design is no longer feasible. Also, numerical resources are available to enable the computational photonic material design and to identify structures that meet predefined optical properties for specific applications. However, the optimization objective function is in general non-convex and its computation remains resource demanding such that the right choice for the optimization method is crucial to obtain excellent results. Here, we benchmark five global optimization methods for three typical nano-optical optimization problems: \removed{downhill simplex optimization, the limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) algorithm, particle swarm optimization, differential evolution, and Bayesian optimization} \added{particle swarm optimization, differential evolution, and Bayesian optimization as well as multi-start versions of downhill simplex optimization and the limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) algorithm}. In the shown examples from the field of shape optimization and parameter reconstruction, Bayesian optimization, mainly known from machine learning applications, obtains significantly better results in a fraction of the run times of the other optimization methods., Comment: 11 pages, 4 figures

The distinction of chiral and mirror symmetric objects is straightforward from a geometrical point of view. Since the biological as well as the optical activity of molecules strongly depend on their handedness, chirality has recently attracted high interest in the field of nano-optics. Various aspects of associated phenomena including the influences of internal and external degrees of freedom on the optical response have been discussed. Here, we propose a constructive method to evaluate the possibility of observing any chiral response from an optical scatterer. Based on solely the T-matrix of one enantiomer, planes of minimal chiral response are located and compared to geometric mirror planes. This provides insights into the relation of geometric and optical properties and enables identifying the potential of chiral scatterers for nano-optical experiments.