We consider how randomness can be made to play a useful role in quantum information processing - in particular, for decoherence control and the implementation of quantum algorithms. For a two-level system in which the decoherence channel is non-dissipative, we show that decoherence suppression is possible if memory is present in the channel. Random switching between two potentially harmful noise sources can then provide a source of stochastic control. Such random switching can also be used in an advantageous way for the implementation of quantum algorithms.
We suggest that the randomness of the choices of measurement basis by Alice and Bob provides an additional important resource for quantum cryptography. As a specific application, we present a novel protocol for quantum key distribution (QKD) which enhances the BB84 scheme by encrypting the information sent over the classical channel during key sifting. We show that, in the limit of long keys, this process prevents an eavesdropper from reproducing the sifting process carried out by the legitimate users. The inability of the eavesdropper to sift the information gathered by tapping the quantum ch…
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…
Quantum advantage is notoriously hard to find and even harder to prove. For example the class of functions computable with classical physics actually exactly coincides with the class computable quantum-mechanically. It is strongly believed, but not proven, that quantum computing provides exponential speed-up for a range of problems, such as factoring. Here we address a computational scenario of "randomness processing" in which quantum theory provably yields, not only resource reduction over classical stochastic physics, but a strictly larger class of problems which can be solved. Beyond new fo…
Coherently manipulating multipartite quantum correlations leads to remarkable advantages in quantum information processing. A fundamental question is whether such quantum advantages persist only by exploiting multipartite correlations, such as entanglement. Recently, Dale, Jennings, and Rudolph negated the question by showing that a randomness processing, quantum Bernoulli factory, using quantum coherence, is strictly more powerful than the one with classical mechanics. In this Letter, focusing on the same scenario, we propose a theoretical protocol that is classically impossible but can be im…
Unconditional security of the BB84 quantum key distribution protocol has been proved by exploiting the fundamental laws of quantum mechanics, but the practical quantum key distribution system maybe hacked by considering the imperfect state preparation and measurement respectively. Until now, different attacking schemes have been proposed by utilizing imperfect devices, but the general security analysis model against all of the practical attacking schemes has not been proposed. Here, we demonstrate that the general practical attacking schemes can be divided into the Trojan horse attack, strong …
This work uses a simple quantum computer model to discuss the randomness of bit strings originated from integer sequences. The considered quantum computer model has three elements: a processing unit responsible for a mathematical operation, an initial equally weighted superposition and a quantum state used as resource. The randomness depends on the last.
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…
Stream randomness extraction against quantum side information
Future Research Lab, China Mobile Research Institute（中国移动研究院未来研究实验室）；Department of Physics, Renmin University of China（中国人民大学物理系）；QICI Quantum Information and Computation Initiative, Department of Computer Science, The University of Hong Kong（香港大学计算机科学系量子信息与计算倡议）
In a previous paper, we introduced a semi-device-independent scheme consisting of an untrusted source sending quantum states to an untrusted measuring device, with the sole assumption that the average energy of the states emitted by the source is bounded. Given this energy constraint, we showed that certain correlations between the source and the measuring device can only occur if the outcomes of the measurement are non-deterministic, i.e., these correlations certify the presence of randomness. In the present paper, we go further and show how to quantify the randomness as a function of the cor…
The generation of series of random numbers is an important and difficult problem. Appropriate measurements on entangled states have been proposed as the definitive solution, based on the impossibility of exploiting quantum non locality to get faster than light signaling. There is a controversy regarding what is preferable to produce series with utilizable randomness in practice, high or low entanglement. We prepare biphotons with three different levels of entanglement, easy entangled, marginally entangled and no entangled. Randomness is evaluated, independently of the quantum non locality argu…
The entropy or randomness source is an essential ingredient in random number generation. Quantum random number generators generally require well modeled and calibrated light sources, such as a laser, to generate randomness. With uncharacterized light sources, such as sunlight or an uncharacterized laser, genuine randomness is practically hard to be quantified or extracted owing to its unknown or complicated structure. By exploiting a recently proposed source-independent randomness generation protocol, we theoretically modify it by considering practical issues and experimentally realize the mod…
The intrinsic random nature of quantum physics offers novel tools for the generation of random numbers, a central challenge for a plethora of fields. Bell non-local correlations obtained by measurements on entangled states allow for the generation of bit strings whose randomness is guaranteed in a device-independent manner, i.e. without assumptions on the measurement and state-generation devices. Here, we generate this strong form of certified randomness on a new platform: the so-called instrumental scenario, which is central to the field of causal inference. First, we theoretically show that …
We show how to efficiently generate pseudo-random states suitable for quantum information processing via cluster-state quantum computation. By reformulating pseudo-random algorithms in the cluster-state picture, we identify a strategy for optimizing pseudo-random circuits by properly choosing single-qubit rotations. A Markov chain analysis provides the tool for analyzing convergence rates to the Haar measure and finding the optimal single-qubit gate distribution. Our results may be viewed as an alternative construction of approximate unitary 2-designs.
In recent years, several hacking attacks have broken the security of quantum cryptography implementations by exploiting the presence of losses and the ability of the eavesdropper to tune detection efficiencies. We present a simple attack of this form that applies to any protocol in which the key is constructed from the results of untrusted measurements performed on particles coming from an insecure source or channel. Because of its generality, the attack applies to a large class of protocols, from standard prepare-and-measure to device-independent schemes. Our attack gives bounds on the critic…
We propose an all-optical implementation of quantum-information processing in semiconductor quantum dots, where electron-hole excitations (excitons) serve as the computational degrees of freedom (qubits). We show that the strong dot confinement leads to an overall enhancement of Coulomb correlations and to a strong renormalization of the excitonic states, which can be exploited for performing conditional and unconditional qubit operations.
Semi-device-independent randomness certification on discretized continuous-variable platforms
Federal University of Rio Grande do Norte（北里奥格兰德联邦大学）；International Institute of Physics, Federal University of Rio Grande do Norte（北里奥格兰德联邦大学国际物理研究所）；QuIIN - Quantum Industrial Innovation, EMBRAPII CIMATEC Competence Center in Quantum Technologies, SENAI CIMATEC（QuIIN量子工业创新，EMBRAPII CIMATEC量子技术能力中心，SENAI CIMATEC）；Center for Macroscopic Quantum States bigQ, Department of Physics, Technical University of Denmark（丹麦技术大学宏观量子态bigQ研究中心）
We suggest a method of entangling significantly the distant ends of a spin chain using minimal control. This entanglement between distant individual spins is brought about solely by exploiting the dynamics of an initial mixed state with Neel order if the lattice features nearest-neighbor XXZ interaction. There is no need to control single spins or to have engineered couplings or to pulse globally. The method only requires an initial nonadiabatic switch (a quench) between two Hamiltonians followed by an evolution under the second Hamiltonian. The scheme is robust to randomness of the couplings …
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…
The speed of quantum random number generators is a major concern for practical quantum applications. However, the bit extraction process limits the final bit rate due to lack of comparably fast electronics. Here we introduce optical scattering as a method to perform optical bit extraction. Scattering is a probabilistic phenomenon and it increases the chaotic behaviour of coherent sources. As a result, it broadens the distribution of photon statistics and makes it super-Poissonian. We show that the raw signal of the sources with super-Poissonian distribution have better randomness compared to P…
On-chip semi-device-independent quantum random number generator exploiting contextuality
Technical University of Denmark（丹麦技术大学）；Queen Mary University of London（伦敦大学玛丽女王学院）；IHP – Leibniz-Institut für innovative Mikroelektronik（IHP – 莱布尼茨创新微电子研究所）；Technische Universität Berlin（柏林工业大学）；University of Florence（佛罗伦萨大学）；QTI s.r.l.（QTI有限公司）
We present an algorithm that exploits quantum parallelism to simulate randomness in a quantum system. In our scheme, all possible realizations of the random parameters are encoded quantum mechanically in a superposition state of an auxiliary system. We show how our algorithm allows for the efficient simulation of dynamics of quantum random spin chains with known numerical methods. We also propose an experimental realization based on atoms in optical lattices in which disorder could be simulated in parallel and in a controlled way through the interaction with another atomic species.
Quantum communication with systems of dimension larger than two provides advantages in information processing tasks. Examples include higher rates of key distribution and random number generation. The main disadvantage of using such multi-dimensional quantum systems is the increased complexity of the experimental setup. Here, we analyze a not-so-obvious problem: the relation between randomness certification and computational requirements of the postprocessing of experimental data. In particular, we consider semi-device independent randomness certification from an experiment using a four dimens…
How to generate provably true randomness with minimal assumptions? This question is important not only for the efficiency and the security of information processing, but also for understanding how extremely unpredictable events are possible in Nature. All current solutions require special structures in the initial source of randomness, or a certain independence relation among two or more sources. Both types of assumptions are impossible to test and difficult to guarantee in practice. Here we show how this fundamental limit can be circumvented by extractors that base security on the validity of…
In this work we introduce the randomness which is truly quantum mechanical in nature arising as an act of measurement. For a composite classical system we have the joint entropy to quantify the randomness present in the total system and that happens to be equal to the sum of the entropy of one subsystem and the conditional entropy of the other subsystem given we know the first system. The same analogy caries over to the quantum setting by replacing the Shannon entropy by the Von Neumann entropy. However, if we replace the conditional von Neumann entropy by the average conditional entropy due t…
We present a random number generator based on quantum effects in photonic emission and detection. It is unique in simultaneous use of both spatial and temporal quantum information contained in the system which makes it resilient to hardware failure and signal injection attacks. We show that its deviation from randomness cam be estimated based on simple measurements. Generated numbers pass NIST Statistical test suite without post-processing.
In a measurement-device-independent or quantum-refereed protocol, a referee can verify whether two parties share entanglement or Einstein-Podolsky-Rosen (EPR) steering without the need to trust either of the parties or their devices. The need for trusting a party is substituted by a quantum channel between the referee and that party, through which the referee encodes the measurements to be performed on that party's subsystem in a set of nonorthogonal quantum states. In this Letter, an EPR-steering inequality is adapted as a quantum-refereed EPR-steering witness, and the trust-free experimental…
Even if the output of a Random Number Generator (RNG) is perfectly uniformly distributed, it may be correlated to pre-existing information and therefore be predictable. Statistical tests are thus not sufficient to guarantee that an RNG is usable for applications, e.g., in cryptography or gambling, where unpredictability is important. To enable such applications a stronger notion of randomness, termed "true randomness", is required, which includes independence from prior information. Quantum systems are particularly suitable for true randomness generation, as their unpredictability can be prove…
Beam-splitter-free, high-rate quantum key distribution inspired by intrinsic quantum mechanical spatial randomness of entangled photons
Physical Research Laboratory（物理研究实验室）；Indian Institute of Technology Gandhinagar（甘地纳加尔印度理工学院）；Indian Institute of Technology Dharwad（达瓦德印度理工学院）；Indian Institute of Science（印度科学学院）
It has been proven that Boson sampling is a much promising model of optical quantum computation, which has been applied to designing quantum computer successfully, such as "Jiuzhang". However, the meaningful randomness of Boson sampling results, whose correctness and significance were proved from a specific quantum mechanical distribution, has not been utilized or exploited. In this research, Boson sampling is applied to design a novel Quantum Random Number Generator (QRNG) by fully exploiting the randomness of Boson sampling results, and its prototype system is constructed with the programmab…
Benchmarking weak randomness in Quantum and Natural Sources
University of Gdańsk（格但斯克大学）；University of Malta（马耳他大学）；Jagiellonian University（雅盖隆大学）；EMGG TerraData Limitada（EMGG TerraData有限公司）；Universidad de Concepción（康塞普西翁大学）；Universidad Católica de la Santísima Concepción（康塞普西翁天主教大学）；SeQure Quantum SpA（SeQure量子股份公司）
Random number has many applications, it plays an important role in quantum information processing. It's not difficult to generate true random numbers, the main difficulty is how to certify the random numbers generated by untrusted devices. In [Nature(London) 464, 1021 (2010)], the authors provided us a way to generate certified random number by Bell's theorem. In their scheme, we can use the nonlocal behavior of entangled states to generate certified randomness. But there are entangled states, which admit a local hidden variable model, could not be used in their scheme. We show in our paper th…
We propose a method to implement cavity QED and quantum information processing in high-Q cavities with a single trapped but non-localized atom. The system is beyond the Lamb-Dick limit due to the atomic thermal motion. Our method is based on adiabatic passages, which make the relevant dynamics insensitive to the randomness of the atom position with an appropriate interaction configuration. The validity of this method is demonstrated from both approximate analytical calculations and exact numerical simulations. We also discuss various applications of this method based on the current experimenta…
Quantum chaos is presented as a paradigm of information processing by dynamical systems at the bottom of the range of phase-space scales. Starting with a brief review of classical chaos as entropy flow from micro- to macro-scales, I argue that quantum chaos came as an indispensable rectification, removing inconsistencies related to entropy in classical chaos: Bottom-up information currents require an inexhaustible entropy production and a diverging information density in phase space, reminiscent of Gibbs' paradox in Statistical Mechanics. It is shown how a mere discretization of the state spac…
In recent years, true random number generators (TRNGs) based on magnetic tunnelling junction (MTJ) have become increasingly attractive. This is because MTJ-based TRNGs offer some advantages over traditional CMOS-based TRNGs, such as smaller area and simpler structure. However, there has been no work thus far that quantified the quality of the raw output of an MTJ-based TRNG and performed suitable randomness extraction to produce provably-secure random bits, unlike their CMOS-based counterparts. In this work, we implement an MTJ-based TRNG and characterise the entropy of the raw output. Using t…
Randomness is a vital resource for modern day information processing, especially for cryptography. A wide range of applications critically rely on abundant, high quality random numbers generated securely. Here we show how to expand a random seed at an exponential rate without trusting the underlying quantum devices. Our approach is secure against the most general adversaries, and has the following new features: cryptographic level of security, tolerating a constant level of imprecision in the devices, requiring only a unit size quantum memory per device component for the honest implementation,…
Local finite rate semi device independent randomness expansion from quantum contextuality
Center for Quantum Science and Technology, Indian Institute of Technology, Mandi（印度技术学院曼迪分校量子科学与技术中心）；School of Physical Sciences, Indian Institute of Technology, Mandi（印度技术学院曼迪分校物理科学学院）
In space-like separated experiments and other scenarios where multiple parties share a classical common cause but no cause-effect relations, quantum theory allows a variety of nonsignaling resources which are useful for distributed quantum information processing. These include quantum states, nonlocal boxes, steering assemblages, teleportages, channel steering assemblages, and so on. Such resources are often studied using nonlocal games, semiquantum games, entanglement-witnesses, teleportation experiments, and similar tasks. We introduce a unifying framework which subsumes the full range of no…
A quantum random number generator (QRNG) can generate true randomness by exploiting the fundamental indeterminism of quantum mechanics. Most approaches to QRNG employ single-photon detection technologies and are limited in speed. Here, we propose and experimentally demonstrate an ultrafast QRNG at a rate over 6 Gb/s based on the quantum phase fluctuations of a laser operating near threshold. Moreover, we consider a potential adversary who has partial knowledge on the raw data and discuss how one can rigorously remove such partial knowledge with post-processing. We quantify the quantum randomne…
Quantum computation based on quantum cellular automata (QCA) can greatly reduce the control and precision necessary for experimental implementations of quantum information processing. A QCA system consists of a few species of qubits in which all qubits of a species evolve in parallel. We show that, in spite of its inherent constraints, a QCA system can be used to study complex quantum dynamics. To this aim, we demonstrate scalable operations on a QCA system that fulfill statistical criteria of randomness and explore which criteria of randomness can be fulfilled by operators from various QCA ar…
We present improved circuits intended for building a universal computer based on Random Pulse Computing (RPC) paradigm, a biologically-inspired way of computation in which variable is represented by a frequency of a Random Pulse Train (RPT) rather than a logic state. The RPC we mention here is also known as "stochastic unipolar computation" in newer literature. Unlike in previous art, where randomness is obtained from electronics noise or a pseudorandom shift register while processing circuitry is deterministic, in our approach both variable generation and signal processing rely on the random …
The lack of perfect randomness can cause significant problems in securing communication between two parties. McInnes and Pinkas proved that unconditionally secure encryption is impossible when the key is sampled from a weak random source. The adversary can always gain some information about the plaintext, regardless of the cryptosystem design. Most notably, the adversary can obtain full information about the plaintext if he has access to just two bits of information about the source (irrespective on length of the key). In this paper we show that for every weak random source there is a cryptosy…
Randomness is an indispensable resource in modern science and information technology. Fortunately, an experimentally simple procedure exists to generate randomness with well-characterized devices: measuring a quantum system in a basis complementary to its preparation. Towards realizing this goal one may consider using atoms or superconducting qubits, promising candidates for quantum information processing. However, their unavoidable interaction with the electromagnetic field affects their dynamics. At large time scales, this can result in decoherence. Smaller time scales in principle avoid thi…
Quantum random number generation exploits inherent randomness of quantum mechanical processes and measurements. Real-time generation rate of quantum random numbers is usually limited by electronic bandwidth and data processing rates. Here we use a multiplexing scheme to create a fast real-time quantum random number generator based on continuous variable vacuum fluctuations. Multiple sideband frequency modes of a quantum vacuum state within a homodyne detection bandwidth are concurrently extracted as the randomness source. Parallel post-processing of raw data from three sub-entropy sources is r…
