Researcher profile

Nicolas Brunner

Nicolas Brunner contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
21works
0followers
8topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

21 published item(s)

preprint2026arXiv

Thermodynamic Networks: Harnessing Non-Equilibrium Steady States for Computation

We introduce thermodynamic networks, a general framework for autonomous, physics-based computation using non-equilibrium steady states. These networks are modeled as a collection of finite-size reservoirs that exchange conserved quantities--such as electric charge or molecular number--while relaxing to a non-equilibrium steady state, which encodes the solution of a computational problem. We identify Negative Differential Conductance (NDC) as the critical physical property governing the computational expressivity of the thermodynamic network. While networks lacking NDC are restricted to computing monotonic functions, the presence of NDC enables universal function approximation. For the training of the network, we use protocols that take advantage of the natural tendency of the system to equilibrate. We illustrate the versatility of our approach via two different platforms: quantum dot networks and enzymatic reaction networks. Both systems can be engineered to have NDC, enabling high performance in standard benchmarks, including sine function approximation and MNIST digit classification. Overall, our work establishes a rigorous link between non-equilibrium steady states and computational expressivity.

preprint2026arXiv

Trading symmetry for Hilbert-space dimension in Bell-inequality violation

In quantum information, asymmetry, i.e., the lack of symmetry, is a resource allowing one to accomplish certain tasks that are otherwise impossible. Similarly, in a Bell test using any given Bell inequality, the maximum violation achievable using quantum strategies respecting or disregarding a certain symmetry can be different. In this work, we focus on the symmetry involved in the exchange of parties and explore when we have to trade this symmetry for a lower-dimensional quantum strategy in achieving the maximal violation of given Bell inequalities. For the family of symmetric Collins-Gisin-Linden-Massar-Popescu inequalities, we provide evidence showing that there is no such trade-off. However, for several other Bell inequalities with a small number of dichotomic measurement settings, we show that symmetric quantum strategies in the minimal Hilbert space dimension can only lead to a suboptimal Bell violation. In other words, there exist symmetric Bell inequalities that can only be maximally violated by asymmetric quantum strategies of minimal dimension. In contrast, one can also find examples of asymmetric Bell inequalities that are maximally violated by symmetric correlations. The implications of these findings on the geometry of the set of quantum correlations and the possibility of performing self-testing therefrom are briefly discussed.

preprint2025arXiv

Device Independent Quantum Key Activation

Device-independent quantum key distribution (DIQKD) allows two distant parties to establish a secret key, based only on the observed Bell nonlocal distribution. It remains however, unclear what the minimal resources for enabling DIQKD are and how to maximize the key rate from a given distribution. In the present work, we consider a scenario where several copies of a given quantum distribution are jointly processed via a local and classical wiring operation. We find that, under few assumptions, it is possible to activate device-independent key. That is, starting from a distribution that is useless in a DIQKD protocol, we obtain a positive key rate by wiring several copies together. We coin this effect device-independent key activation. Our analysis focuses on the standard DIQKD protocol with one-way post-processing, and we resort to semi-definite programming techniques for computing lower bounds on the key rate.

preprint2022arXiv

Building separable approximations for quantum states via neural networks

Finding the closest separable state to a given target state is a notoriously difficult task, even more difficult than deciding whether a state is entangled or separable. To tackle this task, we parametrize separable states with a neural network and train it to minimize the distance to a given target state, with respect to a differentiable distance, such as the trace distance or Hilbert--Schmidt distance. By examining the output of the algorithm, we obtain an upper bound on the entanglement of the target state, and construct an approximation for its closest separable state. We benchmark the method on a variety of well-known classes of bipartite states and find excellent agreement, even up to local dimension of $d=10$, while providing conjectures and analytic insight for isotropic and Werner states. Moreover, we show our method to be efficient in the multipartite case, considering different notions of separability. Examining three and four-party GHZ and W states we recover known bounds and obtain additional ones, for instance for triseparability.

preprint2022arXiv

Experimental relativistic zero-knowledge proofs

Protecting secrets is a key challenge in our contemporary information-based era. In common situations, however, revealing secrets appears unavoidable, for instance, when identifying oneself in a bank to retrieve money. In turn, this may have highly undesirable consequences in the unlikely, yet not unrealistic, case where the bank's security gets compromised. This naturally raises the question of whether disclosing secrets is fundamentally necessary for identifying oneself, or more generally for proving a statement to be correct. Developments in computer science provide an elegant solution via the concept of zero-knowledge proofs: a prover can convince a verifier of the validity of a certain statement without facilitating the elaboration of a proof at all. In this work, we report the experimental realisation of such a zero-knowledge protocol involving two separated verifier-prover pairs. Security is enforced via the physical principle of special relativity, and no computational assumption (such as the existence of one-way functions) is required. Our implementation exclusively relies on off-the-shelf equipment and works at both short (60 m) and long distances ($\geqslant$400 m) in about one second. This demonstrates the practical potential of multi-prover zero-knowledge protocols, promising for identification tasks and blockchain applications such as cryptocurrencies or smart contracts.

preprint2022arXiv

Receiver-Device-Independent Quantum Key Distribution

We present protocols for quantum key distribution in a prepare-and-measure setup with an asymmetric level of trust. While the device of the sender (Alice) is partially characterized, the receiver's (Bob's) device is treated as a black-box. The security of the protocols is based on the assumption that Alice's prepared states have limited overlaps, but no explicit bound on the Hilbert space dimension is required. The protocols are immune to attacks on the receiver's device, such as blinding attacks. The users can establish a secret key while continuously monitoring the correct functioning of their devices through observed statistics. We report a proof-of-principle demonstration, involving mostly off-the-shelf equipment, as well as a high-efficiency superconducting nanowire detector. A positive key rate is demonstrated over a 4.8 km low-loss optical fiber with finite-key analysis. The prospects of implementing these protocols over longer distances is discussed.

preprint2022arXiv

Receiver-Device-Independent Quantum Key Distribution Protocols

We discuss quantum key distribution protocols and their security analysis, considering a receiver-device-independent (RDI) model. The sender's (Alice's) device is partially characterized, in the sense that we assume bounds on the overlaps of the prepared quantum states. The receiver's (Bob's) device requires no characterisation and can be represented as a black-box. Our protocols are therefore robust to any attack on Bob, such as blinding attacks. In particular, we show that a secret key can be established even when the quantum channel has arbitrarily low transmission by considering RDI protocols exploiting sufficiently many states. Finally, we discuss how the hypothesis of bounded overlaps can be naturally applied to practical devices.

preprint2022arXiv

Self-testing entangled measurements in quantum networks

Self-testing refers to the possibility of characterizing an unknown quantum device based only on the observed statistics. Here we develop methods for self-testing entangled quantum measurements, a key element for quantum networks. Our approach is based on the natural assumption that separated physical sources in a network should be considered independent. This provides a natural formulation of the problem of certifying entangled measurements. Considering the setup of entanglement swapping, we derive a robust self-test for the Bell-state measurement, tolerating noise levels up to 5%. We also discuss generalizations to other entangled measurements.

preprint2022arXiv

Semi-Device-Independent Certification of Causal Nonseparability with Trusted Quantum Inputs

While the standard formulation of quantum theory assumes a fixed background causal structure, one can relax this assumption within the so-called process matrix framework. Remarkably, some processes, termed causally nonseparable, are incompatible with a definite causal order. We explore a form of certification of causal nonseparability in a semi-device-independent scenario where the involved parties receive trusted quantum inputs, but whose operations are otherwise uncharacterised. Defining the notion of causally nonseparable distributed measurements, we show that certain causally nonseparable processes which cannot violate any causal inequality, including the canonical example of the quantum switch, can generate noncausal correlations in such a scenario. Moreover, by imposing some further natural structure to the untrusted operations, we show that all bipartite causally nonseparable process matrices can be certified with trusted quantum inputs.

preprint2021arXiv

Genuine network quantum nonlocality and self-testing

The network structure offers in principle the possibility for novel forms of quantum nonlocal correlations, that are proper to networks and cannot be traced back to standard quantum Bell nonlocality. Here we define a notion of genuine network quantum nonlocality. Our approach is operational and views standard quantum nonlocality as a resource for producing correlations in networks. We show several examples of correlations that are genuine network nonlocal, considering the so-called bilocality network of entanglement swapping. In particular, we present an example of quantum self-testing which relies on the network structure; the considered correlations are non-bilocal, but are local according to the usual definition of Bell locality.

preprint2021arXiv

Quantum measurement incompatibility in subspaces

We consider the question of characterising the incompatibility of sets of high-dimensional quantum measurements. We introduce the concept of measurement incompatibility in subspaces. That is, starting from a set of measurements that is incompatible, one considers the set of measurements obtained by projection onto any strict subspace of fixed dimension. We identify three possible forms of incompatibility in subspaces: (i) incompressible incompatibility: measurements that become compatible in every subspace, (ii) fully compressible incompatibility: measurements that remain incompatible in every subspace, and (iii) partly compressible incompatibility: measurements that are compatible in some subspace and incompatible in another. For each class we discuss explicit examples. Finally, we present some applications of these ideas. First we show that joint measurability and coexistence are two inequivalent notions of incompatibility in the simplest case of qubit systems. Second we highlight the implications of our results for tests of quantum steering.

preprint2020arXiv

A neural network oracle for quantum nonlocality problems in networks

Characterizing quantum nonlocality in networks is a challenging, but important problem. Using quantum sources one can achieve distributions which are unattainable classically. A key point in investigations is to decide whether an observed probability distribution can be reproduced using only classical resources. This causal inference task is challenging even for simple networks, both analytically and using standard numerical techniques. We propose to use neural networks as numerical tools to overcome these challenges, by learning the classical strategies required to reproduce a distribution. As such, the neural network acts as an oracle, demonstrating that a behavior is classical if it can be learned. We apply our method to several examples in the triangle configuration. After demonstrating that the method is consistent with previously known results, we give solid evidence that the distribution presented in [N. Gisin, Entropy 21(3), 325 (2019)] is indeed nonlocal as conjectured. Finally we examine the genuinely nonlocal distribution presented in [M.-O. Renou et al., PRL 123, 140401 (2019)], and, guided by the findings of the neural network, conjecture nonlocality in a new range of parameters in these distributions. The method allows us to get an estimate on the noise robustness of all examined distributions.

preprint2020arXiv

Constraints on nonlocality in networks from no-signaling and independence

Generalising the concept of Bell nonlocality to networks leads to novel forms of correlations, the characterization of which is however challenging. Here we investigate constraints on correlations in networks under the two natural assumptions of no-signaling and independence of the sources. We consider the ``triangle network'', and derive strong constraints on correlations even though the parties receive no input, i.e. each party performs a fixed measurement. We show that some of these constraints are tight, by constructing explicit local models (i.e. where sources distribute classical variables) that can saturate them. However, we also observe that other constraints can apparently not be saturated by local models, which opens the possibility of having nonlocal (but non-signaling) correlations in the triangle network.

preprint2020arXiv

Fast semidefinite programming with feedforward neural networks

Semidefinite programming is an important optimization task, often used in time-sensitive applications. Though they are solvable in polynomial time, in practice they can be too slow to be used in online, i.e. real-time applications. Here we propose to solve feasibility semidefinite programs using artificial neural networks. Given the optimization constraints as an input, a neural network outputs values for the optimization parameters such that the constraints are satisfied, both for the primal and the dual formulations of the task. We train the network without having to exactly solve the semidefinite program even once, thus avoiding the possibly time-consuming task of having to generate many training samples with conventional solvers. The neural network method is only inconclusive if both the primal and dual models fail to provide feasible solutions. Otherwise we always obtain a certificate, which guarantees false positives to be excluded. We examine the performance of the method on a hierarchy of quantum information tasks, the Navascués-Pironio-Acín hierarchy applied to the Bell scenario. We demonstrate that the trained neural network gives decent accuracy, while showing orders of magnitude increase in speed compared to a traditional solver.

preprint2020arXiv

Quantifying measurement incompatibility of mutually unbiased bases

Quantum measurements based on mutually unbiased bases are commonly used in quantum information processing, as they are generally viewed as being maximally incompatible and complementary. Here we quantify precisely the degree of incompatibility of mutually unbiased bases (MUB) using the notion of noise robustness. Specifically, for sets of $k$ MUB in dimension $d$, we provide upper and lower bounds on this quantity. Notably, we get a tight bound in several cases, in particular for complete sets of $k=d+1$ MUB (given $d$ is a prime power). On the way, we also derive a general upper bound on the noise robustness for an arbitrary set of quantum measurements. Moreover, we prove the existence of sets of $k$ MUB that are operationally inequivalent, as they feature different noise robustness, and we provide a lower bound on the number of such inequivalent sets up to dimension 32. Finally, we discuss applications of our results for Einstein-Podolsky-Rosen steering.

preprint2020arXiv

Quantum nonlocality in networks can be demonstrated with an arbitrarily small level of independence between the sources

Quantum nonlocality can be observed in networks even in the case where every party can only perform a single measurement, i.e. does not receive any input. So far, this effect has been demonstrated under the assumption that all sources in the network are fully independent from each other. Here we investigate to what extent this independence assumption can be relaxed. After formalizing the question, we show that, in the triangle network without inputs, quantum nonlocality can be observed, even when assuming only an arbitrarily small level of independence between the sources. This means that quantum predictions cannot be reproduced by a local model unless the three sources can be perfectly correlated.

preprint2020arXiv

Quantum teleportation of single-electron states

We consider a scheme for on-demand teleportation of a dual-rail electron qubit state, based on single-electron sources and detectors. The scheme has a maximal efficiency of 25%, which is limited both by the shared entangled state as well as the Bell-state measurement. We consider two experimental implementations, realizable with current technology. The first relies on surface acoustic waves, where all the ingredients are readily available. The second is based on Lorentzian voltage pulses in quantum Hall edge channels. As single-electron detection is not yet experimentally established in these systems, we consider a tomographic detection of teleportation using current correlators up to (and including) third order. For both implementations we take into account environmental effects.

preprint2019arXiv

All quantum resources provide an advantage in exclusion tasks

A key ingredient in quantum resource theories is a notion of measure. Such as a measure should have a number of fundamental properties, and desirably also a clear operational meaning. Here we show that a natural measure known as the convex weight, which quantifies the resource cost of a quantum device, has all the desired properties. In particular, the convex weight of any quantum resource corresponds exactly to the relative advantage it offers in an exclusion task. After presenting the general result, we show how the construction works for state assemblages, sets of measurements and sets of transformations. Moreover, in order to bound the convex weight analytically, we give a complete characterisation of the convex components and corresponding weights of such devices.

preprint2019arXiv

Autonomous multipartite entanglement engines

The generation of genuine multipartite entangled states is challenging in practice. Here we explore a new route to this task, via autonomous entanglement engines which use only incoherent coupling to thermal baths and time-independent interactions. We present a general machine architecture, which allows for the generation of a broad range of multipartite entangled states in a heralded manner. Specifically, given a target multiple-qubit state, we give a sufficient condition ensuring that it can be generated by our machine. We discuss the cases of Greenberger-Horne-Zeilinger, Dicke and cluster states in detail. These results demonstrate the potential of purely thermal resources for creating multipartite entangled states useful for quantum information processing.

preprint2019arXiv

Practical self-testing quantum random number generator based on an energy bound

We present a scheme for a self-testing quantum random number generator. Compared to the fully device-independent model, our scheme requires an extra natural assumption, namely that the mean energy per signal is bounded. The scheme is self-testing, as it allows the user to verify in real-time the correct functioning of the setup, hence guaranteeing the continuous generation of certified random bits. Based on a prepare-and-measure setup, our scheme is practical, and we implement it using only off-the-shelf optical components. The randomness generation rate is 1.25 Mbits/s, comparable to commercial solutions. Overall, we believe that this scheme achieves a promising trade-off between the required assumptions, ease-of-implementation and performance.

preprint2018arXiv

Self-testing non-projective quantum measurements in prepare-and-measure experiments

Self-testing represents the strongest form of certification of a quantum system. Here we investigate theoretically and experimentally the question of self-testing non-projective quantum measurements. That is, how can one certify, from observed data only, that an uncharacterised measurement device implements a desired non-projective positive-operator-valued-measure (POVM). We consider a prepare-and-measure scenario with a bound on the Hilbert space dimension, which we argue is natural for this problem since any measurement can be made projective by artificially increasing the Hilbert space dimension. We develop methods for (i) robustly self-testing extremal qubit POVMs (which feature either three or four outcomes), and (ii) certify that an uncharacterised qubit measurement is non-projective, or even a genuine four-outcome POVM. Our methods are robust to noise and thus applicable in practice, as we demonstrate in a photonic experiment. Specifically, we show that our experimental data implies that the implemented measurements are very close to certain ideal three and four outcome qubit POVMs, and hence non-projective. In the latter case, the data certifies a genuine four-outcome qubit POVM. Our results open interesting perspective for strong `black-box' certification of quantum devices.