English
Related papers

Related papers: The Garden-Hose Model

200 papers

A classical density functional theory is applied to study solvation of solutes in water. An approx- imate form of the excess functional is proposed for water. This functional requires the knowledge of pure solvent direct correlation…

Chemical Physics · Physics 2014-09-01 Guillaume Jeanmairet

Many important quantities in quantum information science, such as entropy and entanglement, are non-linear functions of the density matrix and cannot be expressed as operator observables. Standard open-system approaches evolve only a single…

Quantum Physics · Physics 2025-08-20 Julian Rapp , Radhika H. Joshi , Alwin van Steensel , Yuli V. Nazarov , Mohammad H. Ansari

We propose a new adversarial attack on frequency-hopping based wireless communication between two users, namely Alice and Bob. In this attack, the adversary, referred to as Eve, instantaneously modifies the transmitted signal by Alice…

Information Theory · Computer Science 2019-03-28 J. Harshan , Yih-Chun Hu

The single-particle Green's function of an interacting Fermi system with dominant forward scattering is calculated by decoupling the interaction by means of a Hubbard-Stratonowich transformation involving a bosonic auxiliary field…

Condensed Matter · Physics 2007-05-23 Peter Kopietz

Given that any communication is communication through quantum fields, we here study the scenario where a sender, Alice, causes information-carrying disturbances in a quantum field. We track the exact spread of these disturbances in space…

Lotuses are certain types of finite contractible simplicial complexes, obtained by identifying vertices of polygons subdivided by diagonals. As we explained in a previous paper, each time one resolves a complex reduced plane curve…

Algebraic Geometry · Mathematics 2025-02-25 Evelia R. García Barroso , Pedro D. González Pérez , Patrick Popescu-Pampu

Since the seminal work of Paturi and Simon \cite[FOCS'84 & JCSS'86]{PS86}, the unbounded-error classical communication complexity of a Boolean function has been studied based on the arrangement of points and hyperplanes. Recently,…

Quantum Physics · Physics 2016-05-24 Kazuo Iwama , Harumichi Nishimura , Rudy Raymond , Shigeru Yamashita

In a variety of physically relevant settings for learning from quantum data, designing protocols that can computationally efficiently extract information remains largely an art, and there are important cases where we believe this to be…

Quantum Physics · Physics 2025-06-18 Sitan Chen , Weiyuan Gong , Jonas Haferkamp , Yihui Quek

The classical theories of communication rely on the assumption that there has to be a flow of particles from Bob to Alice in order for him to send a message to her. We develop a quantum protocol that allows Alice to perceive Bob's message…

Quantum Physics · Physics 2017-05-17 David Roland Miran Arvidsson-Shukur , Crispin Henry William Barnes

Security and privacy are major concerns in modern communication networks. In recent years, the information theory of covert communications, where the very presence of the communication is undetectable to a watchful and determined adversary,…

Information Theory · Computer Science 2017-11-29 Ramin Soltani , Dennis Goeckel , Don Towsley , Amir Houmansadr

We exhibit a Boolean function for which the quantum communication complexity is exponentially larger than the classical information complexity. An exponential separation in the other direction was already known from the work of Kerenidis…

Quantum Physics · Physics 2017-09-29 Anurag Anshu , Dave Touchette , Penghui Yao , Nengkun Yu

This paper is an invitation to the process systems engineering community to change the paradigm for process plants. The goal is to achieve much easier convergence while retaining accuracy on par with the rigorous models. Accurate plant…

Systems and Control · Electrical Eng. & Systems 2024-08-29 Vladimir Mahalec

We consider the scenario where Alice wants to send a secret (classical) $n$-bit message to Bob using a classical key, and where only one-way transmission from Alice to Bob is possible. In this case, quantum communication cannot help to…

Quantum Physics · Physics 2007-05-23 Ivan Damgaard , Thomas Pedersen , Louis Salvail

The conditional disclosure of secrets (CDS) primitive is among the simplest cryptographic settings in which to study the relationship between communication, randomness, and security. CDS involves two parties, Alice and Bob, who do not…

Quantum Physics · Physics 2025-10-22 Vahid R. Asadi , Kohdai Kuroiwa , Debbie Leung , Alex May , Sabrina Pasterski , Chris Waddell

Equality and disjointness are two of the most studied problems in communication complexity. They have been studied for both classical and also quantum communication and for various models and modes of communication. Buhrman et al. [Buh98]…

Computational Complexity · Computer Science 2013-10-01 Jozef Gruska , Daowen Qiu , Shenggen Zheng

We show that for a relation $f\subseteq \{0,1\}^n\times \mathcal{O}$ and a function $g:\{0,1\}^{m}\times \{0,1\}^{m} \rightarrow \{0,1\}$ (with $m= O(\log n)$), $$\mathrm{R}_{1/3}(f\circ g^n) = \Omega\left(\mathrm{R}_{1/3}(f) \cdot…

Computational Complexity · Computer Science 2018-01-23 Anurag Anshu , Naresh B. Goud , Rahul Jain , Srijita Kundu , Priyanka Mukhopadhyay

We consider the private classical capacity of a quantum wiretap channel, where the users (sender Alice, receiver Bob, and eavesdropper Eve) have access to the resource of a shared quantum state, additionally to their channel inputs and…

Quantum Physics · Physics 2024-09-25 Minglai Cai , Andreas Winter

We study semidefinite relaxations of $\Pi_1$ combinatorial statements. By relaxing the pigeonhole principle, we obtain a new "quantum" pigeonhole principle which is a stronger statement. By relaxing statements of the form "the communication…

Computational Complexity · Computer Science 2024-09-10 Pavel Dvořák , Bruno Loff , Suhail Sherif

The \emph{beep model} is a very weak communications model in which devices in a network can communicate only via beeps and silence. As a result of its weak assumptions, it has broad applicability to many different implementations of…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-03-19 Artur Czumaj , Peter Davies

The Hybrid network model was introduced in [Augustine et al., SODA '20] for laying down a theoretical foundation for networks which combine two possible modes of communication: One mode allows high-bandwidth communication with neighboring…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-01-19 Keren Censor-Hillel , Dean Leitersdorf , Volodymyr Polosukhin