Topic
Bounding overwatch
About: Bounding overwatch is a research topic. Over the lifetime, 966 publications have been published within this topic receiving 15156 citations.
Papers published on a yearly basis
Papers
More filters
9 citations
TL;DR: A new lower bound for multifacility location problems with lp distances is developed and it is proved that the method produces superior results to other known procedures.
Abstract: This paper develops a new lower bound for multifacility location problems with lp distances. We prove that the method produces superior results to other known procedures. The new bound is also computationally efficient.
9 citations
TL;DR: This paper describes three algorithms for effective recursive updating of the solution set of linear inequalities in a unified framework and compares them on the number of operations involved and the memory space required.
9 citations
TL;DR: In this article , the Trotter formula and its higher-order variants are compared to its second-order variant for H =H 1 + H 2 + H 1+H 2 , where the target Hamiltonian decomposes into two realizable terms.
Abstract: Simulating quantum dynamics beyond the reach of classical computers is one of the main envisioned applications of quantum computers. The most promising quantum algorithms to this end in the near term are the simplest, which use the Trotter formula and its higher-order variants to approximate the dynamics of interest. The approximation error of these algorithms is often poorly understood, even in the most basic and topical cases where the target Hamiltonian decomposes into two realizable terms: H=H_{1}+H_{2}. Recent studies have reported anomalously low approximation error with unexpected scaling in such cases, which they attribute to quantum interference between the errors from different steps of the algorithm. Here, we provide a simpler picture of these effects by relating the Trotter formula to its second-order variant for such H=H_{1}+H_{2} cases. Our method generalizes state-of-the-art error bounds without the technical caveats of prior studies, and elucidates how each part of the total error arises from the underlying quantum circuit. We compare our bound to the true error numerically, and find a close match over many orders of magnitude in the simulation parameters. Our findings further reduce the required circuit depth for the least experimentally demanding quantum simulation algorithms, and illustrate a useful method for bounding simulation error more broadly.
9 citations
04 Nov 2001
TL;DR: Several methods for generating bounding signals to overcome the difficulty of the selection of slew from the latest arriving signal and the corresponding slew problem in static timing analysis are described.
Abstract: In this paper, we study the propagation of slew dependent bounding signals and the corresponding slew problem in static timing analysis. The selection of slew from the latest arriving signal, a commonly used strategy, may violate the rule of monotonic delay. Several methods for generating bounding signals to overcome this difficulty are described. The accuracy and monotonicity of each method is analyzed. These methods can be easily implemented in a static timer to improve the accuracy.
9 citations