Related papers: On second-order cone positive systems
Systems whose variable are constrained to be positive allow computationally efficient control design. We generalize these results to linear systems which leave a cone invariant. This is a wider class of systems than positive systems. We…
We provide a countable set of conditions based on elementary symmetric polynomials that are necessary and sufficient for a trace class integral operator to be positive semidefinite, which is an important cornerstone for quantum theory in…
Positive linear systems on arbitrary time scales are studied. The theory developed in the paper unifies and extends concepts and results known for continuous-time and discrete-time systems. A necessary and sufficient condition for a linear…
In the fight against Covid-19, many governments and businesses are in the process of evaluating, trialling and even implementing so-called immunity passports. Also known as antibody or health certificates, there is a clear demand for any…
Browsers can detect malicious websites that are provisioned with forged or fake TLS/SSL certificates. However, they are not so good at detecting malicious websites if they are provisioned with mistakenly issued certificates or certificates…
In the context of fine-grained complexity, we investigate the notion of certificate enabling faster polynomial-time algorithms. We specifically target radius (minimum eccentricity), diameter (maximum eccentricity), and all-eccentricity…
The onset of the era of fully-programmable error-corrected quantum computers will be marked by major breakthroughs in all areas of science and engineering. These devices promise to have significant technological and societal impact, notable…
In this paper, we consider the systems with trajectories originating in the nonnegative orthant becoming nonnegative after some finite time transient. First we consider dynamical systems (i.e., fully observable systems with no inputs),…
Self-testing--the attractive possibility to infer the underlying physics of a quantum device in a black-box scenario--has gained increased traction in recent years, with applications to device-independent quantum information processing.…
Second-order necessary optimality conditions for nonlinear conic programming problems that depend on a single Lagrange multiplier are usually built under nondegeneracy and strict complementarity. In this paper we establish a condition of…
A PhD student is locked inside a box, imitating a quantum system by mimicking the measurement statistics of any viable observable nominated by external observers. Inside a second box lies a genuine quantum system. Either box can be used to…
We describe and analyze an interior-point method to decide feasibility problems of second-order conic systems. A main feature of our algorithm is that arithmetic operations are performed with finite precision. Bounds for both the number of…
This article investigates the approximation quality achievable for biobjective minimization problems with respect to the Pareto cone by solutions that are (approximately) optimal with respect to larger ordering cones. When simultaneously…
Nonlocal correlations are useful for device independent (DI) randomness certification [Nature (London) {\bf 464}, 1021 (2010)]. The advantage of this DI protocol over the conventional quantum protocol is that randomness can be certified…
We study the parity-perturbed Hofstadter-type recursion $$ Q(1)=Q(2)=1,\qquad Q(n)=Q(n-Q(n-1))+Q(n-Q(n-2))+(-1)^n . $$ We prove, by computer-certified finite-state induction, that this recursion is well-defined for all $(n\ge 1)$. The proof…
Process tomography, the experimental characterization of physical processes, is a central task in science and engineering. Here we investigate the axiomatic requirements that guarantee the in-principle feasibility of process tomography in…
Inspired by applications in testing for Covid-19, we consider a variant of two-stage group testing called "conservative" (or "trivial") two-stage testing, where every item declared to be defective must be definitively confirmed by being…
Proof-carrying-code was proposed as a solution to ensure a trust relationship between two parties: a (heavyweight) analyzer and a (lightweight) checker. The analyzer verifies the conformance of a given application to a specified property…
This paper studies controllability of a discrete-time linear dynamical system using nonnegative and sparse inputs. These constraints on the control input arise naturally in many real-life systems where the external influence on the system…
Recent progress towards theoretical interpretability guarantees for AI has been made with classifiers that are based on interactive proof systems. A prover selects a certificate from the datapoint and sends it to a verifier who decides the…