Related papers: Efficiently Computing the Cyclic Output-to-Output …
A new approach for enhancing the process-variation tolerance of digital circuits is described. We extend recent advances in statistical timing analysis into an optimization framework. Our objective is to reduce the performance variance of a…
We consider the problem of learning the Hamiltonian of a quantum system from estimates of Gibbs-state expectation values. Various methods for achieving this task were proposed recently, both from a practical and theoretical point of view.…
This paper studies a stabilization problem for linear MIMO systems subject to external perturbation that further requires the closed-loop system render a specified gain from the external perturbation to the output. The problem arises from…
The Hamiltonian cycle problem (HCP), which is an NP-complete problem, consists of having a graph G with n nodes and m edges and finding the path that connects each node exactly once. In this paper we compare some algorithms to solve a…
It has been known for some time that proportional output feedback will stabilize MIMO, minimum-phase, linear time-invariant systems if the feedback gain is sufficiently large. High-gain adaptive controllers achieve stability by…
The precise implementation and manipulation of quantum gates is key to extracting advantages from future quantum technologies. Achieving this requires very accurate control over the quantum system. If one has complete knowledge about a…
We introduce an algorithm to compute Hamiltonian dynamics on digital quantum computers that requires only a finite circuit depth to reach an arbitrary precision, i.e. achieves zero discretization error with finite depth. This finite number…
This paper concerns a class of uncertain linear quantum systems subject to quadratic perturbations in the system Hamiltonian. A small gain approach is used to evaluate the performance of the given quantum system. In order to get improved…
We present a new approach to simulating Hamiltonian dynamics based on implementing linear combinations of unitary operations rather than products of unitary operations. The resulting algorithm has superior performance to existing simulation…
An upper bound for the number of Hamiltonian cycles of symmetric diagraphs is established first in this paper, which is tighter than the famous Minc's bound and the Br$\acute{e}$gman's bound. A transformation on graphs is proposed, so that…
We propose an improved algorithm for counting the number of Hamiltonian cycles in a directed graph. The basic idea of the method is sequential acceptance/rejection, which is successfully used in approximating the number of perfect matchings…
We develop a general approach for monitoring and controlling evolution of open quantum systems. In contrast to the master equations describing time evolution of density operators, here, we formulate a dynamical equation for the evolution of…
-This work addresses output feedback stabilization via event triggered output feedback. In the first part of the paper, linear systems are considered, whereas the second part shows that a dynamic event triggered output feedback control law…
This paper discusses a method for pipelining the calculation of CRC's, such as ITU/CCITT CRC32, into a mostly feed-forward architecture. This method allows several benefits such as independent scaling of circuit frequency and data…
A Hamiltonian formulation of generic many-body systems with balanced loss and gain is presented. It is shown that a Hamiltonian formulation is possible only if the balancing of loss and gain terms occur in a pairwise fashion. It is also…
The computation of the $L_\infty $-norm is an important issue in $H_{\infty}$ control, particularly for analyzing system stability and robustness. This paper focuses on symbolic computation methods for determining the $L_{\infty} $-norm of…
We combine the finite size scaling method with the meshfree spectral method to calculate quantum critical parameters for a given Hamiltonian. The basic idea is to expand the exact wave function in a finite exponential basis set and…
A commonly employed measure of the signal amplification properties of an input/output system is its induced L2 norm, sometimes also known as "H infinity" gain. In general, however, it is extremely difficult to compute the numerical value…
We study the Hamilton cycle problem with input a random graph G=G(n,p) in two settings. In the first one, G is given to us in the form of randomly ordered adjacency lists while in the second one we are given the adjacency matrix of G. In…
In this paper we consider the following total functional problem: Given a cubic Hamiltonian graph $G$ and a Hamiltonian cycle $C_0$ of $G$, how can we compute a second Hamiltonian cycle $C_1 \neq C_0$ of $G$? Cedric Smith proved in 1946,…