Related papers: Order O(1) algorithm for first-principles transien…
More than 25 years ago Chazelle~\emph{et al.} (FOCS 1991) studied the following question: Is it possible to cut any set of $n$ lines in ${\Bbb R}^3$ into a subquadratic number of fragments such that the resulting fragments admit a depth…
Networks-on-chip (NoCs) have become the standard for interconnect solutions in industrial designs ranging from client CPUs to many-core chip-multiprocessors. Since NoCs play a vital role in system performance and power consumption,…
We study a polynomial-time decision problem in which each input encodes a depth-$N$ causal execution in which a single non-duplicable token must traverse an ordered sequence of steps, revealing at most $O(1)$ bits of routing information at…
Online linear programming (OLP) has found broad applications in revenue management and resource allocation. State-of-the-art OLP algorithms achieve low regret by repeatedly solving linear programming (LP) subproblems that incorporate…
Optimized quantum control can enhance the performance and noise resilience of quantum metrology. However, the optimization quickly becomes intractable when multiple control operations are applied sequentially. In this work, we propose…
Holographic search algorithms such as direct search and simulated annealing allow high-quality holograms to be generated at the expense of long execution times. This is due to single iteration computational costs of $O(N_x N_y)$ and number…
We present an algorithm for efficiently approximating of qubit unitaries over gate sets derived from totally definite quaternion algebras. It achieves $\varepsilon$-approximations using circuits of length $O(\log(1/\varepsilon))$, which is…
In this paper we investigate the convergence of a recently popular class of first-order primal-dual algorithms for saddle point problems under the presence of errors occurring in the proximal maps and gradients. We study several types of…
A commonly held view in the turbomachinery community is that finite element methods are not well-suited for very large-scale thermomechanical simulations. We seek to dispel this notion by presenting performance data for a collection of…
The simulation of the time-dependent evolution of the resonant tunneling diode is done by a multiscale algorithm exploiting the existence of resonant states. After revisiting and improving the algorithm developed in [N. Ben Abdallah, O.…
One of the most primitive but elusive current-voltage (I-V) responses of a superconductor is when its supercurrent grows steadily after a voltage is first applied. The present work employed a measurement system that could simultaneously…
Classical simulation of quantum computation is necessary for studying the numerical behavior of quantum algorithms, as there does not yet exist a large viable quantum computer on which to perform numerical tests. Tensor network (TN)…
Phonon-assisted tunneling plays a crucial role for electronic device performance and even more so with future size down-scaling. We show how one can include this effect in large-scale first-principles calculations using a single "special…
Out-of-time-order correlators (OTOCs) are the main tool for probing quantum chaos and scrambling, and have become crucial probes in many areas of quantum computing. However, the measurement of OTOCs is difficult to implement on analog…
We present an algorithm that prepares thermal Gibbs states of one dimensional quantum systems on a quantum computer without any memory overhead, and in a time significantly shorter than other known alternatives. Specifically, the time…
Potential disagreement in the result induced by discontinuities is revealed in this paper between a novel power system transient simulation scheme using numerical integrators considering second order derivative and conventional ones using…
I introduce a new approach to the maximum flow problem by a simple algorithm with a slightly better runtime. This approach is based on sorting arcs insight of vertices on a residual graph. This new approach leads to an O(mn^0.5) time bound…
We investigate the second-order von Neumann approach from a diagrammatic point-of-view and demonstrate its equivalence with the resonant tunneling approximation. Investigation of higher-order diagrams shows that the method correctly…
Time-dependent quantum transport for graphene nanoribbons (GNR) are calculated by the hierarchical equation of motion (HEOM) method based on the nonequilibrium Green's function (NEGF) theory (Xie et.al, J. Chem. Phys. 137, 044113, 2012). In…
This paper addresses Online Convex Optimization (OCO) problems where the constraints have additive perturbations that (i) vary over time and (ii) are not known at the time to make a decision. Perturbations may not be i.i.d. generated and…