English
Related papers

Related papers: Quantitatively Nonblocking Supervisory Control of …

200 papers

Inventory and queueing systems are often designed by controlling weighted combination of some time-averaged performance metrics (like cumulative holding, shortage, server-utilization or congestion costs); but real-world constraints, like…

Optimization and Control · Mathematics 2025-07-01 Madhu Dhiman , Veeraruna Kavitha , Nandyala Hemachandra

We investigate the advantage of coherent superposition of two different coded channels in quantum metrology. In a continuous variable system, we show that the Heisenberg limit $1/N$ can be beaten by the coherent superposition without the…

Quantum Physics · Physics 2021-12-15 Dong Xie , Chunling Xu , An Min Wang

This paper addresses the quantitative verification of constrained occupation time in stochastic discrete-time systems, focusing on the probability of visiting a target set at least $k$ times while maintaining safety. Such cumulative…

Systems and Control · Electrical Eng. & Systems 2026-04-21 Bai Xue , Peixin Wang , C. -H. Luke Ong

To implement quantum information technologies, carefully designed control for preparing a desired state plays a key role. However, in realistic situation, the actual performance of those methodologies is severely limited by decoherence.…

Quantum Physics · Physics 2025-10-02 Kohei Kobayashi

The ability to accurately control a quantum system is a fundamental requirement in many areas of modern science such as quantum information processing and the coherent manipulation of molecular systems. It is usually necessary to realize…

Fundamental questions in chemistry and physics may never be answered due to the exponential complexity of the underlying quantum phenomena. A desire to overcome this challenge has sparked a new industry of quantum technologies with the…

In this paper, we use concepts from supervisory control theory of discrete event systems to propose a method to learn optimal control policies for a finite-state Markov Decision Process (MDP) in which (only) certain sequences of actions are…

Machine Learning · Computer Science 2022-01-04 Arun Raman , Keerthan Shagrithaya , Shalabh Bhatnagar

This paper proposed a quantum analogue of classical queue automata by using the definition of the quantum Turing machine and quantum finite-state automata. However, quantum automata equipped with storage medium of a stack has been…

Quantum Physics · Physics 2018-10-30 Amandeep Singh Bhatia , Ajay Kumar

In various physical implementations of quantum information processing, qubits are realized in a Lambda type system configuration as two stable lower energy levels coupled indirectly via an unstable higher energy level, that is, in…

Quantum Physics · Physics 2025-11-11 Julia Cen , Domenico D'Alessandro

A fundamental task in quantum information science is to measure nonlinear functionals of quantum states, such as $\mathrm{Tr}(\rho^k O)$. Intuitively, one expects that computing a $k$-th order quantity generally requires $O(k)$ copies of…

Quantum Physics · Physics 2025-09-03 Yukun Zhang , Yusen Wu , You Zhou , Xiao Yuan

We present a new algorithm to solve the supervisory control problem over non-terminating processes modeled as $\omega$-regular automata. A solution to this problem was obtained by Thistle in 1995 which uses complex manipulations of…

Logic in Computer Science · Computer Science 2021-08-27 Rupak Majumdar , Anne-Kathrin Schmuck

Every language recognized by a non-deterministic finite automaton can be recognized by a deterministic automaton, at the cost of a potential increase of the number of states, which in the worst case can go from $n$ states to $2^n$ states.…

Formal Languages and Automata Theory · Computer Science 2025-02-05 Arnaud Carayol , Philippe Duchon , Florent Koechlin , Cyril Nicaud

Superconducting circuits have demonstrated significant potential in quantum information processing and quantum sensing. Implementing novel control and measurement sequences for superconducting qubits is often a complex and time-consuming…

This paper is a continuation of a previous study on the so-called measure once finite quantum automata model introduced by Moore and Crutchfield in 2000. We investigate conditions assuring that, given a language recognized by such a device…

Formal Languages and Automata Theory · Computer Science 2025-07-16 Andrea Benso , Flavio D'Alessandro , Paolo Papi

The state estimation of continuous-time nonlinear systems in which a subset of sensor outputs can be maliciously controlled through injecting a potentially unbounded additive signal is considered in this paper. Analogous to our earlier work…

Optimization and Control · Mathematics 2020-08-31 Michelle S. Chong , Henrik Sandberg , Joao P. Hespanha

Discounting the influence of future events is a key paradigm in economics and it is widely used in computer-science models, such as games, Markov decision processes (MDPs), reinforcement learning, and automata. While a single game or MDP…

Logic in Computer Science · Computer Science 2025-06-11 Udi Boker , Guy Hefetz

Recent advancements in quantum technologies have highlighted the importance of mitigating system imperfections, including parameter uncertainties and decoherence effects, to improve the performance of experimental platforms. However, most…

Improving open-ended learning capabilities is a promising approach to enable robots to face the unbounded complexity of the real-world. Among existing methods, the ability of Quality-Diversity algorithms to generate large collections of…

Machine Learning · Computer Science 2022-11-29 Luca Grillotti , Antoine Cully

Only a few states in high-dimensional systems can be identified as (un)steerable using existing theoretical or experimental methods. We utilize semidefinite programming (SDP) to construct a dataset for steerability detection in…

Quantum Physics · Physics 2025-02-27 Pu Wang , Zhongyan Li , Huixian Meng

We introduce the problem of temporal coverability for realizability and synthesis. Namely, given a language of words that must be covered by a produced system, how to automatically produce such a system. We consider the case of coverability…

Logic in Computer Science · Computer Science 2018-04-11 Krishnendu Chatterjee , Nir Piterman