Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2101.07802 · Annals of Physics

Know the enemy: 2D Fermi liquids

S. Das Sarma, Yunxiang Liao

Published May 1, 2021• 13 citations
arXivHTMLPDF
DOI
10.1016/j.aop.2021.168495

Related papers

2D non-Fermi liquids from coupled Leech wires

Eugeniu Plamadeala, Dominic V. Else, Michael Mulligan +1 more

Bulletin of the American Physical Society•Mar 15, 2017•0 citations

Many-body effects in low-density strongly-interacting 2D structures: Fermi liquids or not?

S. Das Sarma

Bulletin of the American Physical Society•Mar 13, 2006•0 citations

A Two Dimensional Fermi Liquid. Part 1: Overview

Joel Feldman, Horst Kn�rrer, Eugene Trubowitz B

arXiv:math-ph/0209047•Communications in Mathematical Physics•Apr 7, 2004•58 citations

Know your enemy

Marcos Curty

Nature Physics•Jun 6, 2014•3 citations

Secret key agreement by public discussion from common information

Ueli M. Maurer

The problem of generating a shared secret key S by two parties knowing dependent random variables X and Y, respectively, but not sharing a secret key initially, is considered. An enemy who knows the random variable Z, jointly distributed with X and Y according to some probability distribution P/sub XYZ/, can also receive all messages exchanged by the two parties over a public channel. The goal of a protocol is that the enemy obtains at most a negligible amount of information about S. Upper bounds on H(S) as a function of P/sub XYZ/ are presented. Lower bounds on the rate H(S)/N (as N to infinity ) are derived for the case in which X=(X/sub 1/, . . ., X/sub N/), Y=(Y/sub 1/, . . ., Y/sub N/) and Z=(Z/sub 1/, . . ., Z/sub N/) result from N independent executions of a random experiment generating X/sub i/, Y/sub i/ and Z/sub i/ for i=1, . . ., N. It is shown that such a secret key agreement is possible for a scenario in which all three parties receive the output of a binary symmetric source over independent binary symmetric channels, even when the enemy's channel is superior to the other two channels.>

IEEE Transactions on Information Theory•May 1, 1993•1,994 citations

Fermi Liquids in Two Dimensions

WORLD SCIENTIFIC eBooks•Mar 1, 2008•0 citations
The problem of generating a shared secret key S by two parties knowing dependent random variables X and Y, respectively, but not sharing a secret key initially, is considered. An enemy who knows the random variable Z, jointly distributed with X and Y according to some probability distribution P/sub XYZ/, can also receive all messages exchanged by the two parties over a public channel. The goal of a protocol is that the enemy obtains at most a negligible amount of information about S. Upper bounds on H(S) as a function of P/sub XYZ/ are presented. Lower bounds on the rate H(S)/N (as N to infinity ) are derived for the case in which X=(X/sub 1/, . . ., X/sub N/), Y=(Y/sub 1/, . . ., Y/sub N/) and Z=(Z/sub 1/, . . ., Z/sub N/) result from N independent executions of a random experiment generating X/sub i/, Y/sub i/ and Z/sub i/ for i=1, . . ., N. It is shown that such a secret key agreement is possible for a scenario in which all three parties receive the output of a binary symmetric source over independent binary symmetric channels, even when the enemy's channel is superior to the other two channels.>