Related papers: A Quantum Pigeonhole Principle and Two Semidefinit…
Quantum-inspired classical algorithms provide us with a new way to understand the computational power of quantum computers for practically-relevant problems, especially in machine learning. In the past several years, numerous efficient…
De Finetti theorems show how sufficiently exchangeable states are well-approximated by convex combinations of i.i.d. states. Recently, it was shown that in many quantum information applications a more relaxed de Finetti reduction (i.e. only…
We reformulate and extend our recently introduced quantum kinetic theory for interacting fermion and scalar fields. Our formalism is based on the coherent quasiparticle approximation (cQPA) where nonlocal coherence information is encoded in…
There are many formalisms to describe quantum decoherence. However, many of them give a non general and ad hoc definition of "pointer basis" or "moving preferred basis", and this fact is a problem for the decoherence program. In this paper…
We present abstract complexity results about Coquand and Hyland-Ong game semantics, that will lead to new bounds on the length of first-order cut-elimination, normalization, interaction between expansion trees and any other dialogical…
We study the fundamental, classical mechanism design problem of single-buyer multi-item Bayesian revenue-maximizing auctions under the lens of communication complexity between the buyer and the seller. Specifically, we ask whether using…
Communication complexity is an area of classical computer science which studies how much communication is necessary to solve various distributed computational problems. Quantum information processing can be used to reduce the amount of…
Lifting theorems are one of the most powerful tools for proving communication lower bounds, with numerous downstream applications in proof complexity, monotone circuit lower bounds, data structures, and combinatorial optimization. However,…
It is commonly stated that decoherence in open quantum systems is due to growing entanglement with an environment. In practice, however, surprisingly often decoherence may equally well be described by random unitary dynamics without…
We show that in the mathematical framework of the quantum theory the classical pigeonhole principle can be violated more directly than previously suggested, i.e., in a setting closer to the traditional statement of the principle. We…
Two-party one-way quantum communication has been extensively studied in the recent literature. We target the size of minimal information that is necessary for a feasible party to finish a given combinatorial task, such as distinction of…
Motivated by recent connections to factorised databases, we analyse the efficiency of representations by context free grammars (CFGs). Concretely, we prove a recent conjecture by Kimelfeld, Martens, and Niewerth (ICDT 2025), that for finite…
Max-min bilinear optimization models, where one agent maximizes and an adversary minimizes a common bilinear objective, serve as canonical saddle-point formulations in optimization theory. They capture, among others, two-player zero-sum…
Quantum communication in general helps deter potential eavesdropping in the course of transmission of bits to enable secure communication between two or more parties. In this paper, we propose a novel quasi-deterministic secure quantum…
We will derive here the relaxation behavior of a simple quantum random matrix model. The aim is to derive the effective equations which rise when a random matrix interaction is taken in the weak coupling limit. The physical situation this…
A relativistic quantized particle model avoids difficulties through (1) a Hamiltonian undecomposable into H=H(0)+H(I), (2) a separation of the evolution parameter s from dynamics, (3) "leptons" and "hadrons" composed of "quarks," and (4)…
We study shared randomness in the context of multi-party number-in-hand communication protocols in the simultaneous message passing model. We show that with three or more players, shared randomness exhibits new interesting properties that…
Coherent states provide a natural connection of quantum systems to their classical limit and are employed in various fields of physics. Here we derive general systematic expansions, with respect to quantum parameters, of expectation values…
For general quadratically-constrained quadratic programming (QCQP), we propose a parabolic relaxation described with convex quadratic constraints. An interesting property of the parabolic relaxation is that the original non-convex feasible…
Quantum entanglement, perhaps the most non-classical manifestation of quantum information theory, cannot be used to transmit information between remote parties. Yet, it can be used to reduce the amount of communication required to process a…