ABSTRACT
As in modern communication networks, the security of quantum networks will rely on complex cryptographic tasks that are based on a handful of fundamental primitives. Weak coin flipping (WCF) is a significant such primitive which allows two mistrustful parties to agree on a random bit while they favor opposite outcomes. Remarkably, perfect information-theoretic security can be achieved in principle for quantum WCF. Here, we overcome conceptual and practical issues that have prevented the experimental demonstration of this primitive to date, and demonstrate how quantum resources can provide cheat sensitivity, whereby each party can detect a cheating opponent, and an honest party is never sanctioned. Such a property is not known to be classically achievable with information-theoretic security. Our experiment implements a refined, loss-tolerant version of a recently proposed theoretical protocol and exploits heralded single photons generated by spontaneous parametric down conversion, a carefully optimized linear optical interferometer including beam splitters with variable reflectivities and a fast optical switch for the verification step. High values of our protocol benchmarks are maintained for attenuation corresponding to several kilometers of telecom optical fiber.
ABSTRACT
Quantum computers promise to dramatically outperform their classical counterparts. However, the nonclassical resources enabling such computational advantages are challenging to pinpoint, as it is not a single resource but the subtle interplay of many that can be held responsible for these potential advantages. In this Letter, we show that every bosonic quantum computation can be recast into a continuous-variable sampling computation where all computational resources are contained in the input state. Using this reduction, we derive a general classical algorithm for the strong simulation of bosonic computations, whose complexity scales with the non-Gaussian stellar rank of both the input state and the measurement setup. We further study the conditions for an efficient classical simulation of the associated continuous-variable sampling computations and identify an operational notion of non-Gaussian entanglement based on the lack of passive separability, thus clarifying the interplay of bosonic quantum computational resources such as squeezing, non-Gaussianity, and entanglement.
ABSTRACT
Quantum computers promise considerable speedups with respect to their classical counterparts. However, the identification of the innately quantum features that enable these speedups is challenging. In the continuous-variable setting-a promising paradigm for the realization of universal, scalable, and fault-tolerant quantum computing-contextuality and Wigner negativity have been perceived as two such distinct resources. Here we show that they are in fact equivalent for the standard models of continuous-variable quantum computing. While our results provide a unifying picture of continuous-variable resources for quantum speedup, they also pave the way toward practical demonstrations of continuous-variable contextuality and shed light on the significance of negative probabilities in phase-space descriptions of quantum mechanics.
ABSTRACT
The so-called stellar formalism allows us to represent the non-Gaussian properties of single-mode quantum states by the distribution of the zeros of their Husimi Q function in phase space. We use this representation in order to derive an infinite hierarchy of single-mode states based on the number of zeros of the Husimi Q function: the stellar hierarchy. We give an operational characterization of the states in this hierarchy with the minimal number of single-photon additions needed to engineer them, and derive equivalence classes under Gaussian unitary operations. We study in detail the topological properties of this hierarchy with respect to the trace norm, and discuss implications for non-Gaussian state engineering, and continuous variable quantum computing.
