arXiv subjects

Dmitri Saberi

Publications and source records attributed to Dmitri Saberi.

4 recordsLinked to original sources

arXiv2026

DRAMPyML: A Formal Description of DRAM Protocols with Timed Petri Nets

The JEDEC committee defines various domain-specific DRAM standards. These standards feature increasingly complex and evolving protocol specifications, which are detailed in timing diagrams and command tables. Understanding these protocols is becoming progressively challenging as new features and complex device hierarchies are difficult to comprehend without an expressive model. While each JEDEC standard features a simplified state machine, this state machine fails to reflect the parallel operation of memory banks. In this paper, we present an evolved modeling approach based on timed Petri nets and Python. This model provides a more accurate representation of DRAM protocols, making them easier to understand and directly executable, which enables the evaluation of interesting metrics and the verification of controller RTL models, DRAM logic and memory simulators.

cs.AR↗

arXiv2022

Provably efficient variational generative modeling of quantum many-body systems via quantum-probabilistic information geometry

The dual tasks of quantum Hamiltonian learning and quantum Gibbs sampling are relevant to many important problems in physics and chemistry. In the low temperature regime, algorithms for these tasks often suffer from intractabilities, for example from poor sample- or time-complexity. With the aim of addressing such intractabilities, we introduce a generalization of quantum natural gradient descent to parameterized mixed states, as well as provide a robust first-order approximating algorithm, Quantum-Probabilistic Mirror Descent. We prove data sample efficiency for the dual tasks using tools from information geometry and quantum metrology, thus generalizing the seminal result of classical Fisher efficiency to a variational quantum algorithm for the first time. Our approaches extend previously sample-efficient techniques to allow for flexibility in model choice, including to spectrally-decomposed models like Quantum Hamiltonian-Based Models, which may circumvent intractable time complexities. Our first-order algorithm is derived using a novel quantum generalization of the classical mirror descent duality. Both results require a special choice of metric, namely, the Bogoliubov-Kubo-Mori metric. To test our proposed algorithms numerically, we compare their performance to existing baselines on the task of quantum Gibbs sampling for the transverse field Ising model. Finally, we propose an initialization strategy leveraging geometric locality for the modelling of sequences of states such as those arising from quantum-stochastic processes. We demonstrate its effectiveness empirically for both real and imaginary time evolution while defining a broader class of potential applications.

quant-ph↗

arXiv2020

Regulated State Synchronization for Discrete-Time Homogeneous Networks of Non-Introspective Agents in Presence of Unknown Non-Uniform Input Delays: A Scale-Free Protocol Design (with a general MATLAB implementation)

This paper studies regulated state synchronization of discrete-time homogeneous networks of non-introspective agents in presence of unknown non-uniform input delays. A scale free protocol is designed based on additional information exchange, which does not need any knowledge of the directed network topology and the spectrum of the associated Laplacian matrix. The proposed protocol is scalable and achieves state synchronization for any arbitrary number of agents. Meanwhile, an upper bound for the input delay tolerance is obtained, which explicitly depends on the agent dynamics.

eess.SY↗

arXiv2020

Regulated State Synchronization for Homogeneous Networks of Non-introspective Agents in Presence of Input Delays: A Scale-Free Protocol Design (with a general MATLAB implementation)

This paper studies regulated state synchronization of homogeneous networks of non-introspective agents in presence of unknown nonuniform input delays. A scale-free protocol is designed based on additional information exchange, which does not need any knowledge of the directed network topology and the spectrum of the associated Laplacian matrix. The proposed protocol is scalable and achieves state synchronization for any arbitrary number of agents. Meanwhile, an upper bound for the input delay tolerance is obtained, which explicitly depends on the agent dynamics.

eess.SY↗