Quantum nonlocality is possible in the triangle network with no inputs and binary outputs, which is the smallest such scenario by number of variables and outcomes.
Quantum And Relativistic Protocols For Secure Multi-Party Computation
11 Pith papers cite this work, alongside 13 external citations. Polarity classification is still indexing.
11
Pith papers citing it
13
external citations · Pith
abstract
After a general introduction, the thesis is divided into four parts. In the first, we discuss the task of coin tossing, principally in order to highlight the effect different physical theories have on security in a straightforward manner, but, also, to introduce a new protocol for non-relativistic strong coin tossing. This protocol matches the security of the best protocol known to date while using a conceptually different approach to achieve the task. In the second part variable bias coin tossing is introduced. This is a variant of coin tossing in which one party secretly chooses one of two biased coins to toss. It is shown that this can be achieved with unconditional security for a specified range of biases, and with cheat-evident security for any bias. We also discuss two further protocols which are conjectured to be unconditionally secure for any bias. The third section looks at other two-party secure computations for which, prior to our work, protocols and no-go theorems were unknown. We introduce a general model for such computations, and show that, within this model, a wide range of functions are impossible to compute securely. We give explicit cheating attacks for such functions. In the final chapter we discuss the task of expanding a private random string, while dropping the usual assumption that the protocol's user trusts her devices. Instead we assume that all quantum devices are supplied by an arbitrarily malicious adversary. We give two protocols that we conjecture securely perform this task. The first allows a private random string to be expanded by a finite amount, while the second generates an arbitrarily large expansion of such a string.
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 11roles
background 1polarities
background 1representative citing papers
All three-qubit biconditional-parity nonlocality paradoxes are classified by valid Charlie clocks plus canonical Alice–Bob coset completions and layer shifts; new exotic and non-interpolant examples exist.
New multipartite Bell inequality with analytical SOS decomposition for arbitrary odd inputs per party yields optimal quantum violation, self-testing, and m bits of global DI randomness.
The authors prove a no-go result on tightening the Dupuis et al. chain rule in the device-independent setting and introduce a new chain rule that slightly improves the Rényi EAT in certain contexts, while unifying existing chain rules.
Unbiased extremal rank-one measurements generate characterized randomness in dimension 2, with tetrahedral SIC having the least, and SICs achieve maximal 2 log d randomness device-dependently in dimensions where they exist.
A single N-qubit state can violate all binom(N,k) Bell inequalities for its (N-k)-partite subsystems at once, with the effect extending across multiple subsystem sizes via hyper-polygamy.
The paper constructs an autonomous quantum thermal machine whose steady state violates Bell inequalities, with collective noise shown to counteract local dephasing effects.
Bell inequalities certify non-signaling quantum correlations and DI randomness under noisy signaling channels, remaining robust even with near-perfect input copies.
Two new semi-device-independent randomness expansion protocols achieve high rates by recycling input randomness or biasing inputs, secure against quantum side information, with expansion possible in 10^5 to 10^6 rounds.
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
A literature review of authentication in quantum networks concludes that it is not an intrinsic limitation but depends on explicit resources and deployment assumptions.
citing papers explorer
-
The minimal example of quantum network Bell nonlocality
Quantum nonlocality is possible in the triangle network with no inputs and binary outputs, which is the smallest such scenario by number of variables and outcomes.
-
Three-qubit nonlocality paradoxes: beyond GHZ
All three-qubit biconditional-parity nonlocality paradoxes are classified by valid Charlie clocks plus canonical Alice–Bob coset completions and layer shifts; new exotic and non-interpolant examples exist.
-
Genuine Multipartite Nonlocality for Arbitrary Input: Maximal Randomness Generation and Robust Self-Testing
New multipartite Bell inequality with analytical SOS decomposition for arbitrary odd inputs per party yields optimal quantum violation, self-testing, and m bits of global DI randomness.
-
Chain rules for conditional entropies in quantum cryptography: limitations and improvements
The authors prove a no-go result on tightening the Dupuis et al. chain rule in the device-independent setting and introduce a new chain rule that slightly improves the Rényi EAT in certain contexts, while unifying existing chain rules.
-
Quantum randomness beyond projective measurements
Unbiased extremal rank-one measurements generate characterized randomness in dimension 2, with tetrahedral SIC having the least, and SICs achieve maximal 2 log d randomness device-dependently in dimensions where they exist.
-
The Richness of Bell Nonlocality: Generalized Bell Polygamy and Hyper-Polygamy
A single N-qubit state can violate all binom(N,k) Bell inequalities for its (N-k)-partite subsystems at once, with the effect extending across multiple subsystem sizes via hyper-polygamy.
-
Steady-state Bell nonlocality in an autonomous quantum thermal machine
The paper constructs an autonomous quantum thermal machine whose steady state violates Bell inequalities, with collective noise shown to counteract local dephasing effects.
-
Quantum Nonlocality and Device-Independent Randomness are Robust to Noisy Signaling Channels
Bell inequalities certify non-signaling quantum correlations and DI randomness under noisy signaling channels, remaining robust even with near-perfect input copies.
-
Higher rates for semi-device-independent randomness expansion by recycling input randomness
Two new semi-device-independent randomness expansion protocols achieve high rates by recycling input randomness or biasing inputs, secure against quantum side information, with expansion possible in 10^5 to 10^6 rounds.
-
Lower overhead fault-tolerant building blocks for noisy quantum computers
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
-
Authentication in Quantum Networks
A literature review of authentication in quantum networks concludes that it is not an intrinsic limitation but depends on explicit resources and deployment assumptions.