Detection of entanglement in quantum networks consisting of many parties is one of the important steps towards building quantum communication and computation networks. We consider a scenario where the measurement devices used for this certification are uncharacterised. In this case, it is well known that by using quantum states as inputs for the measurement devices it is possible to detect any entangled state (a situation known as measurement device-independent entanglement witnessing). Here we go beyond entanglement detection and provide methods to estimate the amount of entanglement in a quantum network. We also consider the task of randomness certification and show that randomness can be certified in a variety of cases, including single-partite experiments or setups using only separable states.
According to quantum theory, the outcomes obtained by measuring an entangled state necessarily exhibit some randomness if they violate a Bell inequality. In particular, a maximal violation of the CHSH inequality guarantees that 1.23 bits of randomness are generated by the measurements. However, by performing measurements with binary outcomes on two subsystems one could in principle generate up to two bits of randomness. We show that correlations that violate arbitrarily little the CHSH inequality or states with arbitrarily little entanglement can be used to certify that close to the maximum of…
Quantum entanglement between two or more bipartite entities is a core concept in quantum information areas limited to microscopic regimes directly governed by Heisenberg uncertainty principle via quantum superposition, resulting in nondeterministic and probabilistic quantum features. Such quantum features cannot be generated by classical means. Here, a pure classical method of on-demand entangled light-pair generation is presented in a macroscopic regime via basis randomness. This conflicting idea of conventional quantum mechanics invokes a fundamental question about both classicality and quan…
We demonstrate the connection between an operator's matrix element distribution and entangling power via numerical simulations of random, pseudo-random, and quantum chaotic operators. Creating operators with a random distribution of matrix elements is more difficult than creating operators that reproduce other statistical properties of random matrices. Thus, operators that fulfill many random matrix statistical properties may not generate states of high multi-partite entanglement. To quantify the randomness of various statistical distributions and, by extension, entangling power, we use proper…
We show that in device independent quantum key distribution protocols the privacy of randomness is of crucial importance. For sublinear test sample sizes even the slightest guessing probability by an eavesdropper will completely compromise security. We show that a combined attack exploiting test sample and measurement choices compromises the security even with a linear size test sample and otherwise device independent security considerations. We explicitly derive the sample size needed to retrieve security as a function of the randomness quality. We demonstrate that exploiting features of genu…
Recently [Cavalcanti \textit{et al.} Nat Commun \textbf{6}, 7941 (2015)] proposed a method to certify the presence of entanglement in asymmetric networks, where some users do not have control over the measurements they are performing. Such asymmetry naturally emerges in realistic situtations, such as in cryptographic protocols over quantum networks. Here we implement such "semi-device independent" techniques to experimentally witness all types of entanglement on a three-qubit photonic W state. Furthermore we analise the amount of genuine randomness that can be certified in this scenario from a…
Enhancing Entanglement Purification with Shared Randomness
Pritzker School of Molecular Engineering, University of Chicago（芝加哥大学普里茨克分子工程学院）；Department of Electrical and Computer Engineering, University of Illinois Urbana-Champaign（伊利诺伊大学厄巴纳-香槟分校电气与计算机工程系）；IonQ Inc.（IonQ公司）
Entanglement is not only the most intriguing feature of quantum mechanics, but also a key resource in quantum information science. The entanglement content of random pure quantum states is almost maximal; such states find applications in various quantum information protocols. The preparation of a random state or, equivalently, the implementation of a random unitary operator, requires a number of elementary one- and two-qubit gates that is exponential in the number n_q of qubits, thus becoming rapidly unfeasible when increasing n_q. On the other hand, pseudo-random states approximating to the d…
Randomness is a potential resource for cryptography, simulations and algorithms. Non-local correlations violating Bell's inequality certify the generation of bit strings whose randomness is guaranteed in a device-independent manner. We provide interesting semi-device independent randomness certification protocols by Kochen-Specker (KS) contextuality. For this, we first cast the Mermin's magic-square proof of KS contextuality for two-qubit system as a semi-device independent communication game in prepare-measure scenario. This provides a semi-device independent certification of two-bit of rando…
The entanglement entropy of the two-dimensional random transverse Ising model is studied with a numerical implementation of the strong disorder renormalization group. The asymptotic behavior of the entropy per surface area diverges at, and only at, the quantum phase transition that is governed by an infinite randomness fixed point. Here we identify a double-logarithmic multiplicative correction to the area law for the entanglement entropy. This contrasts with the pure area law valid at the infinite randomness fixed point in the diluted transverse Ising model in higher dimensions.
Quantum information processing shows advantages in many tasks, including quantum communication and computation, comparing to its classical counterpart. The essence of quantum processing lies on the fundamental difference between classical and quantum states. For a physical system, the coherent superposition on a computational basis is different from the statistical mixture of states in the same basis. Such coherent superposition endows the possibility of generating true random numbers, realizing parallel computing, and other classically impossible tasks such as quantum Bernoulli factory. Consi…
Randomness expansion where one generates a longer sequence of random numbers from a short one is viable in quantum mechanics but not allowed classically. Device-independent quantum randomness expansion provides a randomness resource of the highest security level. Here, we report the first experimental realization of device-independent quantum randomness expansion secure against quantum side information established through quantum probability estimation. We generate $5.47\times10^8$ quantum-proof random bits while consuming $4.39\times10^8$ bits of entropy, expanding our store of randomness by …
Measurements of quantum systems can be used to generate classical data that is truly unpredictable for every observer. However, this true randomness needs to be discriminated from randomness due to ignorance or lack of control of the devices. We analyze the randomness gain of a measurement-device-independent setup, consisting of a well-characterized source of quantum states and a completely uncharacterized and untrusted detector. Our framework generalizes previous schemes as arbitrary input states and arbitrary measurements can be analyzed. Our method is used to suggest simple and realistic im…
Nonlocal correlations are useful for device independent (DI) randomness certification [Nature (London) {\bf 464}, 1021 (2010)]. The advantage of this DI protocol over the conventional quantum protocol is that randomness can be certified even when experimental apparatuses are not trusted. Quantum entanglement is the necessary physical source for the nonlocal correlation required for such DI task. However, nonlocality and entanglement are distinct concepts. There exist entangled states which produce no nonlocal correlation and hence are not useful for the DI randomness certification task. Here w…
By proposing device-independent protocols, S. Pironio et al. [Nature 464, 1021-1024 (2010)] and R. Colbeck et al. [Nature Physics 8, 450-453 (2012)] proved that new randomness can be generated by using perfectly free random sources or partially free ones as seed. Subsequently, Li et al. [Phys. Rev. A 84, 034301 (2011)] studied this topic in the framework of semi-device-independent and proved that new randomness can be obtained from perfectly free random sources. Here we discuss whether and how partially free random sources bring us new randomness in semi-device-independent scenario. We propose…
Randomness amplification is the task of transforming a source of somewhat random bits into a source of fully random bits. Although it is impossible to amplify randomness from a single source by classical means, the situation is different considering non-local correlations allowed by quantum mechanics. Here we give the first device-independent protocol for randomness amplification using a constant number of devices. The protocol involves four devices, can amplify any non-deterministic source into a fully random source, tolerates a constant rate of error, and has its correctness based solely on …
We present a device-independent randomness expansion protocol, involving only a constant number of non-signaling quantum devices, that achieves \emph{infinite expansion}: starting with $m$ bits of uniform private randomness, the protocol can produce an unbounded amount of certified randomness that is $\exp(-Ω(m^{1/3}))$-close to uniform and secure against a quantum adversary. The only parameters which depend on the size of the input are the soundness of the protocol and the security of the output (both are inverse exponential in $m$). This settles a long-standing open problem in the area of ra…
Expansion and amplification of weak randomness with untrusted quantum devices has recently become a very fruitful topic of research. Here we contribute with a procedure for amplifying a single weak random source using tri-partite GHZ-type entangled states. If the quality of the source reaches a fixed threshold $R=\frac{1}{4}\log_{2}(10)$, perfect random bits can be produced. This technique can be used to extract randomness from sources that can't be extracted neither classically, nor by existing procedures developed for Santha-Vazirani sources. Our protocol works with a single fault-free devic…
A quantum random number generator (QRNG) generates genuine randomness from the intrinsic probabilistic nature of quantum mechanics. The central problems for most QRNGs are estimating the entropy of the genuine randomness and producing such randomness at high rates. Here we propose and demonstrate a proof-of-concept QRNG that operates at a high rate of 24 Mbit/s by means of a high-dimensional entanglement system, in which the user monitors the entropy in real time via the observation of a nonlocal quantum interference, without a detailed characterization of the devices. Our work provides an imp…
We prove that as conjectured by Ac\'ın et al. [Phys. Rev. A 93, 040102(R) (2016)], two bits of randomness can be certified in a device-independent way from one bit of entanglement using the maximal quantum violation of Gisin's elegant Bell inequality. This suggests a surprising connection between maximal entanglement, complete sets of mutually unbiased bases, and elements of symmetric informationally complete positive operator-valued measures, on one side, and the optimal way of certifying maximal randomness, on the other.
The concept of randomness plays an important role in many disciplines. On one hand, the question of whether random processes exist is fundamental for our understanding of nature. On the other hand, randomness is a resource for cryptography, algorithms and simulations. Standard methods for generating randomness rely on assumptions on the devices that are difficult to meet in practice. However, quantum technologies allow for new methods for generating certified randomness. These methods are known as device-independent because do not rely on any modeling of the devices. Here we review the efforts…
The rates at which a user can generate device-independent quantum random numbers from a Bell-type experiment depend on the measurements that he performs. By numerically optimising over these measurements, we present lower bounds on the randomness generation rates for a family of two-qubit states composed from a mixture of partially entangled states and the completely mixed state. We also report on the randomness generation rates from a tomographic measurement. Interestingly in this case, the randomness generation rates are not monotonic functions of entanglement.
Quantum theory allows for randomness generation in a device-independent setting, where no detailed description of the experimental device is required. Here we derive a general upper bound on the amount of randomness that can be generated in such a setting. Our bound applies to any black-box scenario, thus covering a wide range of scenarios from partially characterised to completely uncharacterised devices. Specifically, we prove that the number of random bits that can be generated is limited by the number of different input states that enter the measurement device. We show explicitly that our …
Multi-party local quantum operations with shared quantum entanglement or shared classical randomness are studied. The following facts are established: (i) There is a ball of local operations with shared randomness lying within the space spanned by the no-signaling operations and centred at the completely noisy channel. (ii) The existence of the ball of local operations with shared randomness is employed to prove that the weak membership problem for local operations with shared entanglement is strongly NP-hard. (iii) Local operations with shared entanglement are characterized in terms of linear…
The study of local models using finite shared randomness originates from the consideration about the cost of classically simulating entanglement in composite quantum systems. We construct explicitly two families of local-hidden-state (LHS) models for T-states, by mapping the problem to the Werner state. The continuous decreasing of shared randomness along with entanglement, as the anisotropy increases, can be observed in the one from the most economical model for the Werner state. The construction of the one for separable states shows that the separable boundary of T-states can be generated fr…
We report a novel quantum random number generator based on the photon-number$-$path entangled state which is prepared via two-photon quantum interference at a beam splitter. The randomness in our scheme is of truly quantum mechanical origin as it comes from the projection measurement of the entangled two-photon state. The generated bit sequences satisfy the standard randomness test.
Device-independent protocols use nonlocality to certify that they are performing properly. This is achieved via Bell experiments on entangled quantum systems, which are kept isolated from one another during the measurements. However, with present-day technology, perfect isolation comes at the price of experimental complexity and extremely low data rates. Here we argue that for device-independent randomness generation -- and other device-independent protocols where the devices are in the same lab -- we can slightly relax the requirement of perfect isolation, and still retain most of the advanta…
We compare the power of quantum and classical physics in terms of randomness certification from devices which are only partially characterised. We study randomness certification based on state discrimination and take noncontextuality as the notion of classicality. A contextual advantage was recently shown to exist for state discrimination. Here, we develop quantum and noncontextual semi-device independent protocols for random-number generation based on maximum-confidence discrimination, which generalises unambiguous and minimum-error state discrimination. We show that, for quantum eavesdropppe…
The extraction of randomness from weakly random seeds is a topic of central importance in cryptography. Weak sources of randomness can be considered to be either private or public, where public sources such as the NIST randomness beacon broadcast the random bits once they are generated. The problem of device-independent randomness extraction from weak public sources against no-signalling adversaries has remained open. In this paper, we show protocols for device-independent and one-sided device-independent amplification of randomness from weak public Santha Vazirani (SV) sources that use a fini…
Device-independent randomness generation and quantum key distribution protocols rely on a fundamental relation between the non-locality of quantum theory and its random character. This relation is usually expressed in terms of a trade-off between the probability of guessing correctly the outcomes of measurements performed on quantum systems and the amount of violation of a given Bell inequality. However, a more accurate assessment of the randomness produced in Bell experiments can be obtained if the value of several Bell expressions is simultaneously taken into account, or if the full set of p…
Expansion and amplification of weak randomness plays a crucial role in many security protocols. Using quantum devices, such procedure is possible even without trusting the devices used, by utilizing correlations between outcomes of parts of the devices. We show here how to extract random bits with an arbitrarily low bias from a single arbitrarily weak min-entropy source in a device independent setting. To do this we use Mermin devices that exhibit super-classical correlations. Number of devices used scales polynomially in the length of the random sequence $n$. Our protocol is robust, it can to…
We demonstrate to what extent many copies of maximally entangled two-qubit states enable for generating a greater amount of certified randomness than that can be certified from a single copy. Although it appears that greater the dimension of the system implies a higher amount of randomness, the non-triviality lies in the device-independent simultaneous certification of generated randomness from many copies of entangled states. This is because, most of the two-outcome Bell inequalities (viz., Clauser-Horne-Shimony-Holt, Elegant, or Chain Bell inequality) are optimized for a single copy of two-q…
Applications of randomness such as private key generation and public randomness beacons require small blocks of certified random bits on demand. Device-independent quantum random number generators can produce such random bits, but existing quantum-proof protocols and loophole-free implementations suffer from high latency, requiring many hours to produce any random bits. We demonstrate device-independent quantum randomness generation from a loophole-free Bell test with a more efficient quantum-proof protocol, obtaining multiple blocks of $512$ bits with an average experiment time of less than $…
A device-independent randomness expansion protocol aims to take an initial random seed and generate a longer one without relying on details of how the devices operate for security. A large amount of work to date has focussed on a particular protocol based on spot-checking devices using the CHSH inequality. Here we show how to derive randomness expansion rates for a wide range of protocols, with security against a quantum adversary. Our technique uses semidefinite programming and a recent improvement of the entropy accumulation theorem. To support the work and facilitate its use, we provide cod…
Previous theoretical works showed that all pure two-qubit entangled states can generate one bit of local randomness and can be self-tested through the violation of proper Bell inequalities. We report an experiment in which nearly pure partially entangled states of photonic qubits are produced to investigate these tasks in a practical scenario. We show that small deviations from the ideal situation make low entangled states impractical to self-testing and randomness generation using the available techniques. Our results show that in practice lower entanglement implies lower randomness generatio…
While it has recently been demonstrated how to certify the maximal amount of randomness from any pure two-qubit entangled state in a device-independent way [E. Woodhead et al., Phys. Rev. Research 2, 042028(R)(2020)], the problem of optimal randomness certification from entangled states of higher local dimension remains open. Here we introduce a method for device-independent certification of the maximal possible amount of $2\log_23$ random bits using pure bipartite entangled two-qutrit states and extremal nine-outcome general non-projective measurements. To this aim, we exploit the extended Be…
We study time evolution of entanglement between two qubits, which are part of a larger system, after starting from a random initial product state. We show that, due to randomness in the initial product state, entanglement is present only between directly coupled qubits and only for short times. Time dependence of the entanglement appears essentially independent of the specific hamiltonian used for time evolution and is well reproduced by a parameter-free two-body random matrix model.
Lund University（隆德大学）；University of Jyväskylä（于韦斯屈莱大学）；Technical University of Denmark（丹麦技术大学）；Korea Advanced Institute of Science and Technology (KAIST)（韩国科学技术院）
The ability to produce random numbers that are unknown to any outside party is crucial for many applications. Device-independent randomness generation does not require trusted devices and therefore provides strong guarantees of the security of the output, but it comes at the price of requiring the violation of a Bell inequality for implementation. A further challenge is to make the bounds in the security proofs tight enough to allow randomness expansion with contemporary technology. Although randomness has been generated in recent experiments, the amount of randomness consumed in doing so has …
Randomness is an invaluable resource in today's life with a broad use reaching from numerical simulations through randomized algorithms to cryptography. However, on the classical level no true randomness is available and even the use of simple quantum devices in a prepare-measure setting suffers from lack of stability and controllability. This gave rise to a group of quantum protocols that provide randomness certified by classical statistical tests -- Device Independent Quantum Random Number Generators. In this paper we review the most relevant results in this field, which allow the production…
We consider several models of 1-round classical and quantum communication, some of these models have not been defined before. We "almost separate" the models of simultaneous quantum message passing with shared entanglement and the model of simultaneous quantum message passing with shared randomness. We define a relation which can be efficiently exactly solved in the first model but cannot be solved efficiently, either exactly or in 0-error setup in the second model. In fact, our relation is exactly solvable even in a more restricted model of simultaneous classical message passing with shared e…
In this paper, we analyze several critical issues in semi-device independent quantum information processing protocol. In practical experimental realization randomness generation in that scenario is possible only if the efficiency of the detectors used is above a certain threshold. Our analysis shows that the critical detection efficiency is 0.7071 in the symmetric setup, while in the asymmetric setup if one of the bases has perfect critical detection efficiency then the other one can be arbitrarily close to 0. We also analyze the semi-device independent random number generation efficiency base…
In randomness amplification a slightly random source is used to produce an improved random source. Perhaps surprisingly, a single source of randomness cannot be amplified at all classically. However, the situation is different if one considers correlations allowed by quantum mechanics as an extra resource. Here we present a protocol that amplifies Santha-Vazirani sources arbitrarily close to deterministic into fully random sources. The protocol is device independent, depending only on the observed statistics of the devices and on the validity of the no-signaling principle between different dev…
How to generate genuine quantum randomness from untrusted devices is an important problem in quantum information processing. Inspired by previous work on a self-testing quantum random number generator [T. Lunghi et al., Phys. Rev. Lett. 114, 150501 (2015)], we present a method to generate quantum randomness from a prepare-and-measure scenario with independent devices. In existing protocols, the quantum randomness depends only on a witness value (e.g., Clauser-Horne-Shimony-Holt value), which is calculated with the observed probabilities. Differently, here all the observed probabilities are dir…
Two parties sharing entangled quantum systems can generate correlations that cannot be produced using only shared classical resources. These nonlocal correlations are a fundamental feature of quantum theory but also have practical applications. For instance, they can be used for device-independent (DI) random number generation, whose security is certified independently of the operations performed inside the devices. The amount of certifiable randomness that can be generated from some given non-local correlations is a key quantity of interest. Here we derive tight analytic bounds on the maximum…
Device and semi-device independent quantum randomness generators (DI- and SDI-QRNGs) are crucial for applications requiring private randomness. However, they are vulnerable to detection inefficiency attacks and this limits severely their usage for practical purposes. Here, we present a method for protecting SDI-QRNGs in prepare-and-measure scenarios against detection inefficiency attacks. The key idea is the introduction of a blocking device that adds failures in the communication between the preparation and measurement devices. We prove that, for any detection efficiency, there is a blocking …
