Searching for evidence of algorithmic randomness and incomputability in the output of quantum random number generators
Ideal quantum random number generators (QRNGs) can produce algorithmically random and thus incomputable sequences, in contrast to pseudo-random number generators. However, the verification of the presence of algorithmic randomness and incomputability is a nontrivial task. We present the results of a...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2021-01 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Kavulich, John T Van Deren, Brennan P Schlosshauer, Maximilian |
| description | Ideal quantum random number generators (QRNGs) can produce algorithmically random and thus incomputable sequences, in contrast to pseudo-random number generators. However, the verification of the presence of algorithmic randomness and incomputability is a nontrivial task. We present the results of a search for algorithmic randomness and incomputability in the output from two different QRNGs, performed by applying tests based on the Solovay-Strassen test of primality and the Chaitin-Schwartz theorem. The first QRNG uses measurements of quantum vacuum fluctuations. The second QRNG is based on polarization measurements on entangled single photons; for this generator, we use looped (and thus highly compressible) strings that also allow us to assess the ability of the tests to detect repeated bit patterns. Compared to a previous search for algorithmic randomness, our study increases statistical power by almost 3 orders of magnitude. |
| doi_str_mv | 10.48550/arxiv.2101.01238 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2101_01238</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2475610417</sourcerecordid><originalsourceid>FETCH-LOGICAL-a527-d584d8de48280d614e4ebabb68540ab97855811503535f4ca7ca8f4e8a9f63a43</originalsourceid><addsrcrecordid>eNotkElrwzAQhUWh0JDmB_RUQc92tdrKsYRuEOihuZuxLScKsZRoCc2_r7KcZuG94c2H0BMlpVBSklfwf-ZYMkpoSSjj6g5NGOe0UIKxBzQLYUsIYVXNpOQTdPzV4LuNsWs8OI_10fTadhq7AcNu7byJm9F02IPt3Wh1CDh32NjOjfsUoTU7E095xnGTTSnm5dl7SGBjGm8-bNPYao_X2moP0fnwiO4H2AU9u9UpWn28rxZfxfLn83vxtixAsrropRK96rVQTJG-okIL3ULbVkoKAu28zg8rSiXhkstBdFB3oAahFcyHioPgU_R8PXuB0uy9GcGfmjOc5gInK16uir13h6RDbLYueZszNUzUsqJE0Jr_A0jrab4</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2475610417</pqid></control><display><type>article</type><title>Searching for evidence of algorithmic randomness and incomputability in the output of quantum random number generators</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Kavulich, John T ; Van Deren, Brennan P ; Schlosshauer, Maximilian</creator><creatorcontrib>Kavulich, John T ; Van Deren, Brennan P ; Schlosshauer, Maximilian</creatorcontrib><description>Ideal quantum random number generators (QRNGs) can produce algorithmically random and thus incomputable sequences, in contrast to pseudo-random number generators. However, the verification of the presence of algorithmic randomness and incomputability is a nontrivial task. We present the results of a search for algorithmic randomness and incomputability in the output from two different QRNGs, performed by applying tests based on the Solovay-Strassen test of primality and the Chaitin-Schwartz theorem. The first QRNG uses measurements of quantum vacuum fluctuations. The second QRNG is based on polarization measurements on entangled single photons; for this generator, we use looped (and thus highly compressible) strings that also allow us to assess the ability of the tests to detect repeated bit patterns. Compared to a previous search for algorithmic randomness, our study increases statistical power by almost 3 orders of magnitude.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2101.01238</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Compressibility ; Generators ; Numbers ; Physics - Quantum Physics ; Pseudorandom ; Random numbers ; Randomness ; Sequences</subject><ispartof>arXiv.org, 2021-01</ispartof><rights>2021. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,784,885,27925</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.2101.01238$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.1016/j.physleta.2020.127032$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Kavulich, John T</creatorcontrib><creatorcontrib>Van Deren, Brennan P</creatorcontrib><creatorcontrib>Schlosshauer, Maximilian</creatorcontrib><title>Searching for evidence of algorithmic randomness and incomputability in the output of quantum random number generators</title><title>arXiv.org</title><description>Ideal quantum random number generators (QRNGs) can produce algorithmically random and thus incomputable sequences, in contrast to pseudo-random number generators. However, the verification of the presence of algorithmic randomness and incomputability is a nontrivial task. We present the results of a search for algorithmic randomness and incomputability in the output from two different QRNGs, performed by applying tests based on the Solovay-Strassen test of primality and the Chaitin-Schwartz theorem. The first QRNG uses measurements of quantum vacuum fluctuations. The second QRNG is based on polarization measurements on entangled single photons; for this generator, we use looped (and thus highly compressible) strings that also allow us to assess the ability of the tests to detect repeated bit patterns. Compared to a previous search for algorithmic randomness, our study increases statistical power by almost 3 orders of magnitude.</description><subject>Algorithms</subject><subject>Compressibility</subject><subject>Generators</subject><subject>Numbers</subject><subject>Physics - Quantum Physics</subject><subject>Pseudorandom</subject><subject>Random numbers</subject><subject>Randomness</subject><subject>Sequences</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotkElrwzAQhUWh0JDmB_RUQc92tdrKsYRuEOihuZuxLScKsZRoCc2_r7KcZuG94c2H0BMlpVBSklfwf-ZYMkpoSSjj6g5NGOe0UIKxBzQLYUsIYVXNpOQTdPzV4LuNsWs8OI_10fTadhq7AcNu7byJm9F02IPt3Wh1CDh32NjOjfsUoTU7E095xnGTTSnm5dl7SGBjGm8-bNPYao_X2moP0fnwiO4H2AU9u9UpWn28rxZfxfLn83vxtixAsrropRK96rVQTJG-okIL3ULbVkoKAu28zg8rSiXhkstBdFB3oAahFcyHioPgU_R8PXuB0uy9GcGfmjOc5gInK16uir13h6RDbLYueZszNUzUsqJE0Jr_A0jrab4</recordid><startdate>20210104</startdate><enddate>20210104</enddate><creator>Kavulich, John T</creator><creator>Van Deren, Brennan P</creator><creator>Schlosshauer, Maximilian</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>GOX</scope></search><sort><creationdate>20210104</creationdate><title>Searching for evidence of algorithmic randomness and incomputability in the output of quantum random number generators</title><author>Kavulich, John T ; Van Deren, Brennan P ; Schlosshauer, Maximilian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a527-d584d8de48280d614e4ebabb68540ab97855811503535f4ca7ca8f4e8a9f63a43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Compressibility</topic><topic>Generators</topic><topic>Numbers</topic><topic>Physics - Quantum Physics</topic><topic>Pseudorandom</topic><topic>Random numbers</topic><topic>Randomness</topic><topic>Sequences</topic><toplevel>online_resources</toplevel><creatorcontrib>Kavulich, John T</creatorcontrib><creatorcontrib>Van Deren, Brennan P</creatorcontrib><creatorcontrib>Schlosshauer, Maximilian</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kavulich, John T</au><au>Van Deren, Brennan P</au><au>Schlosshauer, Maximilian</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Searching for evidence of algorithmic randomness and incomputability in the output of quantum random number generators</atitle><jtitle>arXiv.org</jtitle><date>2021-01-04</date><risdate>2021</risdate><eissn>2331-8422</eissn><abstract>Ideal quantum random number generators (QRNGs) can produce algorithmically random and thus incomputable sequences, in contrast to pseudo-random number generators. However, the verification of the presence of algorithmic randomness and incomputability is a nontrivial task. We present the results of a search for algorithmic randomness and incomputability in the output from two different QRNGs, performed by applying tests based on the Solovay-Strassen test of primality and the Chaitin-Schwartz theorem. The first QRNG uses measurements of quantum vacuum fluctuations. The second QRNG is based on polarization measurements on entangled single photons; for this generator, we use looped (and thus highly compressible) strings that also allow us to assess the ability of the tests to detect repeated bit patterns. Compared to a previous search for algorithmic randomness, our study increases statistical power by almost 3 orders of magnitude.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2101.01238</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2021-01 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_2101_01238 |
| source | arXiv.org; Free E- Journals |
| subjects | Algorithms Compressibility Generators Numbers Physics - Quantum Physics Pseudorandom Random numbers Randomness Sequences |
| title | Searching for evidence of algorithmic randomness and incomputability in the output of quantum random number generators |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T01%3A47%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Searching%20for%20evidence%20of%20algorithmic%20randomness%20and%20incomputability%20in%20the%20output%20of%20quantum%20random%20number%20generators&rft.jtitle=arXiv.org&rft.au=Kavulich,%20John%20T&rft.date=2021-01-04&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2101.01238&rft_dat=%3Cproquest_arxiv%3E2475610417%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2475610417&rft_id=info:pmid/&rfr_iscdi=true |