Department ofPhysics of Complex Systems

Quantum information theory

Dr. Rotem Arnon-Friedman

01 / Research

Research

The group works at the foundations of quantum information theory, where the central question is how the rules of quantum mechanics constrain what can be learned, communicated, and kept secret. A particular focus is device-independent cryptography: protocols whose security follows from observed violations of Bell inequalities alone, requiring no trust in the internal workings of the devices that carry them out. Establishing such guarantees rigorously calls for tools that bound an adversary's knowledge directly from correlations between measurement outcomes.

Underpinning this effort is entanglement theory and quantum information measures — entropies, the structure of correlations, and how these quantities behave when many systems are composed or processed in sequence. The group develops mathematical techniques, such as entropy accumulation and reductions from general attacks to simpler structured ones, that turn statements about idealized single rounds into provable security for realistic, finite protocols. The aim is to put quantum cryptography on the same firm logical footing that classical complexity-based cryptography has long enjoyed, while clarifying which physical resources genuinely enable advantage.

Bell nonlocalityQuantum entropy estimationEntropy accumulation theoremSemidefinite programmingInformation-theoretic security proofsQuantum de Finetti reductions
Device-independent cryptographyDesigning key-distribution and randomness-generation protocols whose security rests on Bell violations rather than trust in the hardware.
Entropy accumulationDeveloping techniques that certify the accumulated randomness of many-round protocols from the behaviour of a single round.
Quantum randomness certificationQuantifying and verifying genuine randomness produced by quantum measurements for use in cryptographic applications.
Entanglement as a resourceCharacterizing how entanglement and nonlocal correlations enable information-processing tasks impossible with classical resources.
Finite-size security analysisClosing the gap between asymptotic security proofs and protocols run with finitely many rounds and realistic noise.
02 / People

Group members

PhD students 2
  • Noam Avidan
  • Ilya Merkulov

2 people are listed with this group, besides the principal investigator. Names and categories are as published in the Weizmann directory and on the group's own page; rooms, phone numbers and e-mail addresses are on the People page.

03 / Output

Recent publications

All publications