arXiv subjects

Sadra Boreiri

Publications and source records attributed to Sadra Boreiri.

11 recordsLinked to original sources

arXiv2026

Fermions are fundamentally more nonlocal than Bosons

Bell's theorem shows that entangled quantum particles can exhibit correlations that classical particles cannot reproduce without an additional nonlocal resource, such as communication. In this sense, quantum particles are fundamentally more nonlocal than classical ones, and entanglement becomes unavoidable in physics. Here we prove the analogous result within quantum theory itself: indistinguishable fermions transmitted through a quantum network can generate correlations that distinguishable particles or indistinguishable bosons cannot reproduce without additional communication. In the same sense, fermions are fundamentally more nonlocal than bosons or distinguishable particles, motivating fermionic anticommutation and indistinguishability as unavoidable operational resources. Our result further implies that fermions can strictly surpass all qubit-based protocols for certain distributed computing tasks, demonstrating that a complete understanding of information processing requires going beyond qubits to fermionic information carriers - febits.

quant-ph↗

arXiv2026

Stronger Welch Bounds and Optimal Approximate $k$-Designs

A fundamental question asks how uniformly finite sets of pure quantum states can be distributed in a Hilbert space. The Welch bounds address this question, and are saturated by $k$-designs, i.e. sets of states reproducing the $k$-th Haar moments. However, these bounds quickly become uninformative when the number of states is below that required for an exact $k$-design. We derive strengthened Welch-type inequalities that remain sharp in this regime by exploiting rank constraints from partial transposition and spectral properties of the partially transposed Haar moment operator. We prove that the deviation from the Welch bound captures the average-case approximation error, hence characterizing a natural notion of minimum achievable error at fixed cardinality. For $k=3$, we prove that SICs and complete MUB sets saturate our bounds, making them optimal approximate 3-designs of their cardinality. This leads to a natural variational criterion to rule out the existence of a complete set MUBs, which we use to obtain numerical evidence against such set in dimension $6$. As a key technical ingredient, we compute the complete spectrum of the partially transposed symmetric-subspace projector, including multiplicities and eigenvectors, which may find applications beyond the present work.

quant-ph↗

arXiv2025

Bell nonlocality in quantum networks with unreliable sources: Loophole-free postelection via self-testing

We discuss Bell nonlocality in quantum networks with unreliable sources. Our main result is a condition on the observed data which ensures that inconclusive events can be safely discarded, without introducing any loophole. More formally, we characterize the fair-sampling property for measurements in a network. When all measurements are fair-sampling, we show that the post-selection of conclusive outcomes does not compromise the assumption of source independence, hence avoiding the detection loophole. Furthermore, we show that in some cases, the fair-sampling property can in fact be guaranteed based only on observed data. To show this, we prove that saturation of the Finner inequality provides a self-test of the underlying quantum model. We illustrate the relevance of our results by demonstrating an improvement in device-independent randomness generation for a photonic Bell test with a probabilistic source and for the triangle network.

quant-ph↗

arXiv2024

Topologically Robust Quantum Network Nonlocality

We discuss quantum network Bell nonlocality in a setting where the network structure is not fully known. More concretely, an honest user may trust their local network topology, but not the structure of the rest of the network, involving distant (and potentially dishonest) parties. We demonstrate that quantum network nonlocality can still be demonstrated in such a setting, hence exhibiting topological robustness. Specifically, we present quantum distributions obtained from a simple network that cannot be reproduced by classical models, even when the latter are based on more powerful networks. In particular, we show that in a large ring network, the knowledge of only a small part of the network structure (involving only 2 or 3 neighbouring parties) is enough to guarantee nonlocality over the entire network. This shows that quantum network nonlocality can be extremely robust to changes in the network topology. Moreover, we demonstrate that applications of quantum nonlocality, such as the black-box certification of randomness and entanglement, are also possible in such a setting.

quant-ph↗

arXiv2024

Towards a minimal example of quantum nonlocality without inputs

The network scenario offers interesting new perspectives on the phenomenon of quantum nonlocality. Notably, when considering networks with independent sources, it is possible to demonstrate quantum nonlocality without the need for measurements inputs, i.e. with all parties performing a fixed quantum measurement. Here we aim to find minimal examples of this effect. Focusing on the minimal case of the triangle network, we present examples involving output cardinalities of $3-3-3$ and $3-3-2$. Finally, we discuss the prospects of finding an example of quantum nonlocality in the triangle network with binary outputs, and point out a connection to the Lovasz local lemma.

quant-ph↗

arXiv2023

Noise-robust proofs of quantum network nonlocality

Quantum networks allow for novel forms of quantum nonlocality. By exploiting the combination of entangled states and entangled measurements, strong nonlocal correlations can be generated across the entire network. So far, all proofs of this effect are essentially restricted to the idealized case of pure entangled states and projective local measurements. Here we present noise-robust proofs of network quantum nonlocality, for a class of quantum distributions on the triangle network that are based on entangled states and entangled measurements. The key ingredient is a result of approximate rigidity for local distributions that satisfy the so-called ``parity token counting'' property with high probability. Our methods can be applied to any type of noise. As illustrative examples, we consider quantum distributions obtained with imperfect sources and obtain a noise robustness up to $\sim 80\%$ for dephasing noise and up to $\sim 0.5\%$ for white noise. Additionally, we prove that all distributions in the vicinity of some ideal quantum distribution are nonlocal, with a bound on the total-variation distance $\sim 0.25\%$. Our work opens interesting perspectives towards the practical implementation of quantum network nonlocality.

quant-ph↗

arXiv2022

Partial self-testing and randomness certification in the triangle network

Quantum nonlocality can be demonstrated without inputs (i.e. each party using a fixed measurement setting) in a network with independent sources. Here we consider this effect on ring networks, and show that the underlying quantum strategy can be partially characterized, or self-tested, from observed correlations. Applying these results to the triangle network allows us to show that the nonlocal distribution of Renou et al. [Phys. Rev. Lett. 123, 140401 (2019)] requires that (i) all sources produce a minimal amount of entanglement, (ii) all local measurements are entangled, and (iii) each local outcome features a minimal entropy. Hence we show that the triangle network allows for genuine network quantum nonlocality and certifiable randomness.

quant-ph↗

arXiv2021

A Unified Theory of Decentralized SGD with Changing Topology and Local Updates

Decentralized stochastic optimization methods have gained a lot of attention recently, mainly because of their cheap per iteration cost, data locality, and their communication-efficiency. In this paper we introduce a unified convergence analysis that covers a large variety of decentralized SGD methods which so far have required different intuitions, have different applications, and which have been developed separately in various communities. Our algorithmic framework covers local SGD updates and synchronous and pairwise gossip updates on adaptive network topology. We derive universal convergence rates for smooth (convex and non-convex) problems and the rates interpolate between the heterogeneous (non-identically distributed data) and iid-data settings, recovering linear convergence rates in many special cases, for instance for over-parametrized models. Our proofs rely on weak assumptions (typically improving over prior work in several aspects) and recover (and improve) the best known complexity results for a host of important scenarios, such as for instance coorperative SGD and federated averaging (local SGD).

cs.LG↗

arXiv2019

Genuine quantum nonlocality in the triangle network

Quantum networks allow in principle for completely novel forms of quantum correlations. In particular, quantum nonlocality can be demonstrated here without the need of having various input settings, but only by considering the joint statistics of fixed local measurement outputs. However, previous examples of this intriguing phenomenon all appear to stem directly from the usual form of quantum nonlocality, namely via the violation of a standard Bell inequality. Here we present novel examples of 'quantum nonlocality without inputs', which we believe represent a new form of quantum nonlocality, genuine to networks. Our simplest examples, for the triangle network, involve both entangled states and joint entangled measurements. A generalization to any odd-cycle network is also presented. Finally, we conclude with some open questions.

quant-ph↗

arXiv2019

Computing on Quantum Shared Secrets for General Quantum Access Structures

Quantum secret sharing is a method for sharing a secret quantum state among a number of individuals such that certain authorized subsets of participants can recover the secret shared state by collaboration and other subsets cannot. In this paper, we first propose a method for sharing a quantum secret in a basic $(2,3)$ threshold scheme, only by using qubits and the 7-qubit CSS code. Based on this $(2,3)$ scheme, we propose a new $(n, n)$ scheme and we also construct a quantum secret sharing scheme for any quantum access structure by induction. Secondly, based on the techniques of performing quantum computation on 7-qubit CSS codes, we introduce a method that authorized subsets can perform universal quantum computation on this shared state, without the need for recovering it. This generalizes recent attempts for doing quantum computation on $(n, n)$ threshold schemes.

quant-ph↗

arXiv2019

Limits on correlations in networks for quantum and no-signaling resources

A quantum network consists of independent sources distributing entangled states to distant nodes which can then perform entangled measurements, thus establishing correlations across the entire network. But how strong can these correlations be? Here we address this question, by deriving bounds on possible quantum correlations in a given network. These bounds are nonlinear inequalities that depend only on the topology of the network. We discuss in detail the notably challenging case of the triangle network. Moreover, we conjecture that our bounds hold in general no-signaling theories. In particular, we prove that our inequalities for the triangle network hold when the sources are arbitrary no-signaling boxes which can be wired together. Finally, we discuss an application of our results for the device-independent characterization of the topology of a quantum network.

quant-ph↗