Experimental certification of random numbers via quantum contextuality.
Ontology highlight
ABSTRACT:
SUBMITTER: Um M
PROVIDER: S-EPMC4070742 | biostudies-other | 2013
REPOSITORIES: biostudies-other
Similar Datasets
Project description:Generation of random numbers is a central problem for many applications in the field of information processing, including, e.g., cryptography, in classical and quantum regime, but also mathematical modeling, Monte Carlo methods, gambling and many others. Both, the quality of the randomness and efficiency of the random numbers generation process are crucial for the most of these applications. Software produced pseudorandom bit sequences, though sufficiently quick, do not fulfill required randomness quality demands. Hence, the physical hardware methods are intensively developed to generate truly random number sequences for information processing and electronic security application. In the present paper we discuss the idea of the quantum random number generators. We also present a variety of tests utilized to assess the quality of randomness of generated bit sequences. In the experimental part we apply such tests to assess and compare two quantum random number generators, PQ4000KSI (of company ComScire US) and JUR01 (constructed in Wroclaw University of Science and Technology upon the project of The National Center for Research and Development) as well as a pseudorandom generator from the Mathematica Wolfram package. Finally, we present our new prototype of fully operative miniaturized quantum random generator JUR02 producing a random bit sequence with velocity of 1 Mb/s, which successfully passed standard tests of randomness quality (like NIST and Dieharder tests). We also shortly discuss our former concept of an entanglement-based quantum random number generator protocol with unconditionally secure public randomness verification.
| S-EPMC8352985 | biostudies-literature
Project description:Random number generation is crucial in many aspects of everyday life, as online security and privacy depend ultimately on the quality of random numbers. Many current implementations are based on pseudo-random number generators, but information security requires true random numbers for sensitive applications like key generation in banking, defence or even social media. True random number generators are systems whose outputs cannot be determined, even if their internal structure and response history are known. Sources of quantum noise are thus ideal for this application due to their intrinsic uncertainty. In this work, we propose using resonant tunnelling diodes as practical true random number generators based on a quantum mechanical effect. The output of the proposed devices can be directly used as a random stream of bits or can be further distilled using randomness extraction algorithms, depending on the application.
| S-EPMC5736612 | biostudies-literature
Project description: Not available
| S-EPMC10550226 | biostudies-literature
Project description:Quantum technologies promise a variety of exciting applications. Even though impressive progress has been achieved recently, a major bottleneck currently is the lack of practical certification techniques. The challenge consists of ensuring that classically intractable quantum devices perform as expected. Here we present an experimentally friendly and reliable certification tool for photonic quantum technologies: an efficient certification test for experimental preparations of multimode pure Gaussian states, pure non-Gaussian states generated by linear-optical circuits with Fock-basis states of constant boson number as inputs, and pure states generated from the latter class by post-selecting with Fock-basis measurements on ancillary modes. Only classical computing capabilities and homodyne or hetorodyne detection are required. Minimal assumptions are made on the noise or experimental capabilities of the preparation. The method constitutes a step forward in many-body quantum certification, which is ultimately about testing quantum mechanics at large scales.
| S-EPMC4673657 | biostudies-literature
Project description:Certification of quantum channels is based on quantum hypothesis testing and involves also preparation of an input state and choosing the final measurement. This work primarily focuses on the scenario when the false negative error cannot occur, even if it leads to the growth of the probability of false positive error. We establish a condition when it is possible to exclude false negative error after a finite number of queries to the quantum channel in parallel, and we provide an upper bound on the number of queries. On top of that, we found a class of channels which allow for excluding false negative error after a finite number of queries in parallel, but cannot be distinguished unambiguously. Moreover, it will be proved that parallel certification scheme is always sufficient, however the number of steps may be decreased by the use of adaptive scheme. Finally, we consider examples of certification of various classes of quantum channels and measurements.
| S-EPMC8571408 | biostudies-literature
Project description:Pseudo-random number generators (PRNGs) are software algorithms generating a sequence of numbers approximating the properties of random numbers. They are critical components in many information systems that require unpredictable and nonarbitrary behaviors, such as parameter configuration in machine learning, gaming, cryptography, and simulation. A PRNG is commonly validated through a statistical test suite, such as NIST SP 800-22rev1a (NIST test suite), to evaluate its robustness and the randomness of the numbers. In this paper, we propose a Wasserstein distance-based generative adversarial network (WGAN) approach to generating PRNGs that fully satisfy the NIST test suite. In this approach, the existing Mersenne Twister (MT) PRNG is learned without implementing any mathematical programming code. We remove the dropout layers from the conventional WGAN network to learn random numbers distributed in the entire feature space because the nearly infinite amount of data can suppress the overfitting problems that occur without dropout layers. We conduct experimental studies to evaluate our learned pseudo-random number generator (LPRNG) by adopting cosine-function-based numbers with poor random number properties according to the NIST test suite as seed numbers. The experimental results show that our LPRNG successfully converted the sequence of seed numbers to random numbers that fully satisfy the NIST test suite. This study opens the way for the "democratization" of PRNGs through the end-to-end learning of conventional PRNGs, which means that PRNGs can be generated without deep mathematical know-how. Such tailor-made PRNGs will effectively enhance the unpredictability and nonarbitrariness of a wide range of information systems, even if the seed numbers can be revealed by reverse engineering. The experimental results also show that overfitting was observed after about 450,000 trials of learning, suggesting that there is an upper limit to the number of learning counts for a fixed-size neural network, even when learning with unlimited data.
| S-EPMC10266608 | biostudies-literature
Project description:Mapping a many-body state on a loop in parameter space is a simple way to characterize a quantum state. The connections of such a geometrical representation to the concepts of Chern number and Majorana zero mode are investigated based on a generalized quantum spin system with short and long-range interactions. We show that the topological invariants, the Chern numbers of corresponding Bloch band, is equivalent to the winding number in the auxiliary plane, which can be utilized to characterize the phase diagram. We introduce the concept of Majorana charge, the magnitude of which is defined by the distribution of Majorana fermion probability in zero-mode states, and the sign is defined by the type of Majorana fermion. By direct calculations of the Majorana modes we analytically and numerically verify that the Majorana charge is equal to Chern numbers and winding numbers.
| S-EPMC5558019 | biostudies-other
Project description:Quantum theory is compatible with scenarios in which the order of operations is indefinite. Experimental investigations of such scenarios, all of which have been based on a process known as the quantum switch, have provided demonstrations of indefinite causal order conditioned on assumptions on the devices used in the laboratory. But is a device-independent certification possible, similar to the certification of Bell nonlocality through the violation of Bell inequalities? Previous results have shown that the answer is negative if the switch is considered in isolation. Here, however, we present an inequality that can be used to device-independently certify indefinite causal order in the quantum switch in the presence of an additional spacelike-separated observer under an assumption asserting the impossibility of superluminal and retrocausal influences.
| S-EPMC10509257 | biostudies-literature
Project description:In this paper, we investigate the potential application of quantum computation for constructing pseudo-random number generators (PRNGs) and further construct a novel PRNG based on quantum random walks (QRWs), a famous quantum computation model. The PRNG merely relies on the equations used in the QRWs, and thus the generation algorithm is simple and the computation speed is fast. The proposed PRNG is subjected to statistical tests such as NIST and successfully passed the test. Compared with the representative PRNG based on quantum chaotic maps (QCM), the present QRWs-based PRNG has some advantages such as better statistical complexity and recurrence. For example, the normalized Shannon entropy and the statistical complexity of the QRWs-based PRNG are 0.999699456771172 and 1.799961178212329e-04 respectively given the number of 8 bits-words, say, 16Mbits. By contrast, the corresponding values of the QCM-based PRNG are 0.999448131481064 and 3.701210794388818e-04 respectively. Thus the statistical complexity and the normalized entropy of the QRWs-based PRNG are closer to 0 and 1 respectively than those of the QCM-based PRNG when the number of words of the analyzed sequence increases. It provides a new clue to construct PRNGs and also extends the applications of quantum computation.
| S-EPMC4740897 | biostudies-literature
Project description:We present a new class of polymeric ligands for quantum dot (QD) water solubilization to yield biocompatible and derivatizable QDs with compact size (approximately 10-12 nm diameter), high quantum yields (>50%), excellent stability across a large pH range (pH 5-10.5), and low nonspecific binding. To address the fundamental problem of thiol instability in traditional ligand exchange systems, the polymers here employ a stable multidentate imidazole binding motif to the QD surface. The polymers are synthesized via reversible addition-fragmentation chain transfer-mediated polymerization to produce molecular weight controlled monodisperse random copolymers from three types of monomers that feature imidazole groups for QD binding, polyethylene glycol (PEG) groups for water solubilization, and either primary amines or biotin groups for derivatization. The polymer architecture can be tuned by the monomer ratios to yield aqueous QDs with targeted surface functionalities. By incorporating amino-PEG monomers, we demonstrate covalent conjugation of a dye to form a highly efficient QD-dye energy transfer pair as well as covalent conjugation to streptavidin for high-affinity single molecule imaging of biotinylated receptors on live cells with minimal nonspecific binding. The small size and low serum binding of these polymer-coated QDs also allow us to demonstrate their utility for in vivo imaging of the tumor microenvironment in live mice.
| S-EPMC2871316 | biostudies-literature