Jarn de Jong

Jarn de Jong

Auto-generated profile, based on publicly available information

Jarn de Jong

Technische Universität Berlin

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 December 2020 in PRX Quantum
Verified
Journal Article
Open access
PDF file
FHFrederik Hahn
Frederik Hahn
JJJarn de Jong
Jarn de Jong
APAnna Pappa
Anna Pappa
Conference key agreement (CKA) is a cryptographic effort of multiple parties to establish a shared secret key. In future quantum networks, generating secret keys in an anonymous way is of tremendous importance for parties that want to keep their shared key secret and at the same time protect their own identity. We provide a definition of anonymity for general protocols and present a CKA protocol that is provably anonymous under realistic adversarial scenarios. We base our protocol on shared Greenberger-Horne-Zeilinger states, which have been proposed as more efficient resources for CKA protocols, compared to bipartite entangled resources. The existence of secure and anonymous protocols based on multipartite entangled states provides a new insight on their potential as resources and paves the way for further applications.

27 March 2024 in Physical Review Research
Verified
Journal Article
Open access
PDF file
JJJ. de Jong
J. de Jong
FHF. Hahn
F. Hahn
NTNikolay Tcholtchev
Nikolay Tcholtchev
MHM. Hauswirth
M. Hauswirth
APA. Pappa
A. Pappa
Quantum information processing architectures typically only allow for nearest-neighbor entanglement creation. In many cases, this prevents the direct generation of GHZ states, which are commonly used for many communication and computation tasks. Here, we show how to obtain GHZ states between nodes in a network that are connected in a straight line, naturally allowing them to initially share linear cluster states. We prove a strict upper bound of ⌊(n+3)/2⌋ on the size of the set of nodes sharing a GHZ state that can be obtained from a linear cluster state of n qubits, using local Clifford unitaries, local Pauli measurements, and classical communication. Furthermore, we completely characterize all selections of nodes below this threshold that can share a GHZ state obtained within this setting. Finally, we demonstrate these transformations on the IBMQ Montreal quantum device for linear cluster states of up to n=19 qubits.

21 September 2023 in Quantum
Verified
Journal Article
Open access
PDF file
JJJarn de Jong
Jarn de Jong
FHFrederik Hahn
Frederik Hahn
JEJens Eisert
Jens Eisert
NWNathan Walk
Nathan Walk
APAnna Pappa
Anna Pappa
Jarn de Jong, Frederik Hahn, Jens Eisert, Nathan Walk, and Anna Pappa, Quantum 7, 1117 (2023). Sharing multi-partite quantum entanglement between parties allows for diverse secure communication tasks to be performed. Among them, conference key agreement (CKA) - an extension of key dis…

28 May 2025 in Physical Review A
Verified
Journal Article
Open access
LVLina Vandré
Lina Vandré
JJJarn de Jong
Jarn de Jong
FHFrederik Hahn
Frederik Hahn
ABAdam Burchardt
Adam Burchardt
OGOtfried Gühne
Otfried Gühne
APAnna Pappa
Anna Pappa
Graph states are a class of multipartite entangled quantum states that are ubiquitous in quantum information. We study equivalence relations between graph states under local unitaries (LU) to obtain distinguishing methods both in local and in networked settings. Based on the marginal structure of graph states, we introduce a family of easy-to-compute LU invariants. We show that these invariants uniquely identify the entanglement classes of every graph state up to eight qubits and discuss their reliability for larger numbers of qubits. To handle larger graphs, we generalize tools to test for local Clifford (LC) equivalence of graph states that work by condensing large graphs into smaller graphs. In turn, we show that statements on the equivalence of these smaller graphs (which are easier to compute) can be used to infer statements on the equivalence of the original, larger graphs. We analyze LU equivalence in two key settings, with and without allowing for the permutation of qubits. We identify entanglement classes, whose marginal structure does not allow us to distinguish them. As a result, we increase the bound on the number of qubits where the LU-LC conjecture holds from 8 to 10 qubits in the setting where qubit permutations are allowed. Published by the American Physical Society 2025

18 November 2025 in Physical Review Applied
Verified
Journal Article
Open access
JJJarn de Jong
Jarn de Jong
SSSantiago Scheiner
Santiago Scheiner
NSNaomi R. Solomons
Naomi R. Solomons
ZCZiad Chaoui
Ziad Chaoui
DMDamian Markham
Damian Markham
APAnna Pappa
Anna Pappa
Anonymity and privacy are two key properties of modern communication networks. In quantum networks, distributed quantum sensing has emerged as a powerful use case, with applications to clock synchronization, detecting gravitational effects, and more. In this work, we develop a new protocol that, for the first time, combines the different cryptographic properties of anonymity and privacy for the task of distributed parameter estimation. That is, we present a protocol that allows a selected subset of network participants to anonymously collaborate in estimating the average of their private parameters. Crucially, this is achieved without disclosing either the individual parameter values or the identities of the participants, neither to each other nor to the broader network.

5 September 2023 in arXiv
Verified
Preprint
Open access
PDF file
JJJarn de Jong
Jarn de Jong
FHFrederik Hahn
Frederik Hahn
JEJens Eisert
Jens Eisert
NWNathan Walk
Nathan Walk
APAnna Pappa
Anna Pappa
Sharing multi-partite quantum entanglement between parties allows for diverse secure communication tasks to be performed. Among them, conference key agreement (CKA), an extension of key distribution to multiple parties, has received much attention recently. Interestingly, CKA can also be performed in a way that protects the identities of the participating parties, therefore providing anonymity. In this work, we propose an anonymous CKA protocol for three parties that is implemented in a highly practical network setting. Specifically, a line of quantum repeater nodes is used to build a linear cluster state among all nodes, which is then used to anonymously establish a secret key between any three of them. The nodes need only share maximally entangled pairs with their neighbours, therefore avoiding the necessity of a central server sharing entangled states. This repeater setup makes our protocol an excellent candidate for implementation in future quantum networks. We explicitly prove that our protocol protects the identities of the participants from one another and perform an analysis of the key rate in the finite regime, contributing to the quest of identifying feasible quantum communication tasks for network architectures beyond point-to-point.