English
Related papers

Related papers: On second-order cone positive systems

200 papers

We introduce lower-bound certificates for classical planning tasks, which can be used to prove the unsolvability of a task or the optimality of a plan in a way that can be verified by an independent third party. We describe a general…

Artificial Intelligence · Computer Science 2025-05-06 Simon Dold , Malte Helmert , Jakob Nordström , Gabriele Röger , Tanja Schindler

Developing quantum computers for real-world applications requires understanding theoretical sources of quantum advantage and applying those insights to design more powerful machines. Toward that end, we introduce a high-fidelity gate set…

Quantum Physics · Physics 2021-08-04 Alexander D. Hill , Mark J. Hodson , Nicolas Didier , Matthew J. Reagor

Building models that comply with the invariances inherent to different domains, such as invariance under translation or rotation, is a key aspect of applying machine learning to real world problems like molecular property prediction,…

Machine Learning · Computer Science 2023-01-04 Jan Schuchardt , Stephan Günnemann

The Circularity Principle was successfully applied for developing a coinductive proving technique, known as circular coinduction. In this paper, we show that the same principle can be used to develop an inductive proving technique. A main…

Logic in Computer Science · Computer Science 2026-05-26 Dorel Lucanu , Grigore Rosu , Eugen Goriac , Georgiana Caltais

The idea of self-testing is to render guarantees concerning the inner workings of a device based on the measurement statistics. It is one of the most formidable quantum certification and benchmarking schemes. Recently it was shown by…

Quantum Physics · Physics 2021-08-20 Harshank Shrotriya , Kishor Bharti , Leong-Chuan Kwek

A quantum state transformation can be generally approximated by single- and two-qubit gates. This, however, does not hold with noisy intermediate-scale quantum technologies due to the errors appearing in the gate operations, where errors of…

Deciding the positivity of a sequence defined by a linear recurrence and initial conditions is, in general, a hard problem. When the coefficients of the recurrences are constants, decidability has only been proven up to order 5. The…

Symbolic Computation · Computer Science 2025-03-19 Alaa Ibrahim

An important aspect in the solution process of constraint satisfaction problems is to identify exclusion boxes which are boxes that do not contain feasible points. This paper presents a certificate of infeasibility for finding such boxes by…

Optimization and Control · Mathematics 2015-06-30 Hannes Fendl , Arnold Neumaier , Hermann Schichl

Neural networks have become increasingly popular in controller design due to their versatility and efficiency. However, their integration into feedback systems can pose stability challenges, particularly in the presence of uncertainties.…

Optimization and Control · Mathematics 2025-03-04 Yuhao Zhang , Xiangru Xu

Reliability-based design optimization (RBDO) is a methodology for designing systems and components under the consideration of probabilistic uncertainty. In practical engineering, the number of input data is often limited, which can damage…

Optimization and Control · Mathematics 2026-05-27 Takumi Fujiyama , Yoshihiro Kanno

Certifiable local robustness, which rigorously precludes small-norm adversarial examples, has received significant attention as a means of addressing security concerns in deep learning. However, for some classification problems, local…

Machine Learning · Computer Science 2021-06-15 Klas Leino , Matt Fredrikson

In this work, we prove global existence of solutions for second order differential problems in a general framework. More precisely, we consider second order differential inclusions involving proximal normal cone to a set-valued map. This…

Analysis of PDEs · Mathematics 2010-06-14 Frederic Bernicot , Juliette Venel

A program verifier produces reliable results only if both the logic used to justify the program's correctness is sound, and the implementation of the program verifier is itself correct. Whereas it is common to formally prove soundness of…

Programming Languages · Computer Science 2021-06-01 Gaurav Parthasarathy , Peter Müller , Alexander J. Summers

While certified robustness is widely promoted as a solution to adversarial examples in Artificial Intelligence systems, significant challenges remain before these techniques can be meaningfully deployed in real-world applications. We…

Cryptography and Security · Computer Science 2025-08-12 Andrew C. Cullen , Paul Montague , Sarah M. Erfani , Benjamin I. P. Rubinstein

We propose a new approach to computing global minimizers of singular value functions in two real variables. Specifically, we present new algorithms to compute the Kreiss constant of a matrix and the distance to uncontrollability of a linear…

Optimization and Control · Mathematics 2020-12-23 Tim Mitchell

We show that time complexity analysis of higher-order functional programs can be effectively reduced to an arguably simpler (although computationally equivalent) verification problem, namely checking first-order inequalities for validity.…

Logic in Computer Science · Computer Science 2012-10-26 Ugo Dal Lago , Barbara Petit

Self-testing is a method of quantum state and measurement estimation that does not rely on assumptions about the inner working of the used devices. Its experimental realization has been limited to sources producing single quantum states so…

In the current pandemic, testing continues to be the most important tool for monitoring and curbing the disease spread and early identification of the disease to perform health-related interventions like quarantine, contact tracing and etc.…

Cryptography and Security · Computer Science 2020-12-08 Abhishek Singh , Ramesh Raskar

With the COVID-19 pandemic entering a second phase and vaccination strategies being applied by countries and governments worldwide, there is an increasing expectation by people to return to normal life. There is currently a debate about…

Cryptography and Security · Computer Science 2021-05-13 John C. Polley , Ilias Politis , Christos Xenakis , Adarbad Master , Michał Kępkowski

The generation of certifiable randomness is the most fundamental information-theoretic task that meaningfully separates quantum devices from their classical counterparts. We propose a protocol for exponential certified randomness expansion…

Quantum Physics · Physics 2019-01-14 Matthew Coudron , Jalex Stark , Thomas Vidick