English
Related papers

Related papers: Model Counting Modulo Theories

200 papers

In this paper we describe a method for verifying secure information flow of programs, where apart from direct and indirect flows a secret information can be leaked through covert timing channels. That is, no two computations of a program…

Programming Languages · Computer Science 2013-07-18 Aleksandar S. Dimovski

Leakage errors, in which a qubit is excited to a level outside the qubit subspace, represent a significant obstacle in the development of robust quantum computers. We present a computationally efficient simulation methodology for studying…

Quantum Physics · Physics 2025-01-22 Hidetaka Manabe , Yasunari Suzuki , Andrew S. Darmawan

This paper technically explores the secrecy rate $\Lambda$ and a maximisation problem over the concave version of the secrecy outage probability (SOP) as $\mathop{{\rm \mathbb{M}ax}}\limits_{\Delta } {\rm \; } \mathbb{P}\mathscr{r} \big(…

Information Theory · Computer Science 2022-06-15 Makan Zamanipour

Mistrustful quantum cryptographic protocols encode information in incompatible observables, so that any attempt by a dishonest party to access multiple pieces of information necessarily involves a tradeoff. A natural class of such…

Quantum Physics · Physics 2026-03-31 Chen-Xun Weng , Minglong Qin , Yanglin Hu , Marco Tomamichel

The primary objective of quantum Shannon theory is to evaluate the capacity of quantum channels. In spite of the existence of rigorous coding theorems that quantify the transmission of information through quantum channels, superadditivity…

Quantum Physics · Physics 2024-01-17 Rajiuddin Sk , Prasanta K. Panigrahi

Secure multiparty computation enables the joint evaluation of multivariate functions across distributed users while ensuring the privacy of their local inputs. This field has become increasingly urgent due to the exploding demand for…

Quantum Physics · Physics 2026-01-07 Kfir Sulimany , Sri Krishna Vadlamani , Ryan Hamerly , Prahlad Iyengar , Dirk Englund

The problem of identifying the channel with the highest capacity among several discrete memoryless channels (DMCs) is considered. The problem is cast as a pure-exploration multi-armed bandit problem, which follows the practical use of…

Information Theory · Computer Science 2024-01-19 Maximilian Egger , Rawad Bitar , Antonia Wachter-Zeh , Deniz Gündüz , Nir Weinberger

In this article, we are proposing a closed-form solution for the capacity of the single quantum channel. The Gaussian distributed input has been considered for the analytical calculation of the capacity. In our previous couple of papers, we…

Information Theory · Computer Science 2023-02-17 Mouli Chakraborty , Harun Siljak , Indrakshi Dey , Nicola Marchetti

Large Language Models (LLMs) are being used more and more for various coding tasks, including to help coders identify bugs and are a promising avenue to support coders in various tasks including vulnerability detection -- particularly given…

Software Engineering · Computer Science 2025-05-27 Ignacio Mariano Andreozzi Pofcher , Joshua Ellul

In this paper, a new wiretap channel model is proposed, where the legitimate transmitter and receiver communicate over a discrete memoryless channel. The wiretapper has perfect access to a fixed-length subset of the transmitted codeword…

Information Theory · Computer Science 2017-01-25 Mohamed Nafea , Aylin Yener

Dynamic quantization emerged as a practical approach to increase the utilization and efficiency of the machine learning serving flow. Unlike static quantization, which applies quantization offline, dynamic quantization operates on tensors…

Cryptography and Security · Computer Science 2026-04-30 Hanna Foerster , Ilia Shumailov , Cheng Zhang , Yiren Zhao , Jamie Hayes , Robert Mullins

Spatial concurrent constraint programming (SCCP) is an algebraic model of spatial modalities in constrained-based process calculi; it can be used to reason about spatial information distributed among the agents of a system. This work…

Logic in Computer Science · Computer Science 2018-05-22 Miguel Romero , Camilo Rocha

Fidelity is one of the most widely used quantities in quantum information that measure the distance of quantum states through a noisy channel. In this paper, we introduce a quantum analogy of computation tree logic (CTL) called QCTL, which…

Logic in Computer Science · Computer Science 2023-10-20 Ming Xu , Jianling Fu , Jingyi Mei , Yuxin Deng

Implementation security, higher generation rate, and lower cost are primary missions in the domain of quantum key distributions in recent years. However, simultaneously achieving robust security, high speed, and low cost often resembles an…

Satisfiability Modulo Theory (SMT) solvers have advanced automated reasoning, solving complex formulas across discrete and continuous domains. Recent progress in propositional model counting motivates extending SMT capabilities toward model…

Logic in Computer Science · Computer Science 2026-03-02 Arijit Shaw , Kuldeep S. Meel

Quantum Computing (QC) has gained immense popularity as a potential solution to deal with the ever-increasing size of data and associated challenges leveraging the concept of quantum random access memory (QRAM). QC promises quadratic or…

Learning and compression are driven by the common aim of identifying and exploiting statistical regularities in data, which opens the door for fertile collaboration between these areas. A promising group of compression techniques for…

Machine Learning · Computer Science 2021-02-02 Fernando E. Rosas , Pedro A. M. Mediano , Michael Gastpar

Machine learning (ML) systems are increasingly deployed in high-stakes domains where reliability is paramount. This thesis investigates how uncertainty estimation can enhance the safety and trustworthiness of ML, focusing on selective…

Machine Learning · Computer Science 2025-09-09 Stephan Rabanser

The Shannon entropy is a widely used summary statistic, for example, network traffic measurement, anomaly detection, neural computations, spike trains, etc. This study focuses on estimating Shannon entropy of data streams. It is known that…

Data Structures and Algorithms · Computer Science 2009-10-09 Ping Li

Backtesting LLMs on resolved events assumes models reason only from pre-cutoff knowledge, yet pretrained models inevitably leak post-cutoff knowledge. We introduce a claim-level evaluation framework that decomposes prediction rationales…

Artificial Intelligence · Computer Science 2026-05-26 Zeyu Zhang , Ryan Chen , Bradly C. Stadie