Correlation-free large-scale probabilistic computing with true-random chaotic oscillator p-bit

Correlation-free large-scale probabilistic computing with true-random chaotic oscillator p-bit | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Article Correlation-free large-scale probabilistic computing with true-random chaotic oscillator p-bit Woojin Lee, Hyunjin Kim, Hyundo Jung, Yohan Choi, Jinwoo Jeon, and 1 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4470680/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 07 Mar, 2025 Read the published version in Scientific Reports → Version 1 posted 10 You are reading this latest preprint version Abstract Probabilistic computing—quantum-inspired computing that uses probabilistic bits (p-bits)—has emerged as a powerful method owing to its fast search speed and robust connectivity. Previous works used linear feedback shift registers (LFSRs) or stochastic magnetic tunnel junctions (MTJs) to implement p-bits. However, in large-scale problems, periodicity and correlation issues in LFSR p-bits and inherent variations in MTJ-based p-bits with narrow stochastic regions lead to unreliable results when seeking the appropriate solution. Therefore, we propose a fully CMOS frequency-scalable p-bit implemented with a discrete-time flipped-hook tent-map chaotic oscillator. The proposed chaotic oscillator produces high-quality noise voltage that is uniformly distributed across the entire supply voltage range, enabling aligned responses of p-bits free from calibration and an input resolution of 8 bits. In contrast to LFSR-based p-bits with hardware-dependent correlation, the chaotic oscillator p-bits could factorize semiprimes with lengths up to 64 bits without changing hardware size. The chaotic oscillator exhibited an energy efficiency of 4.26 pJ/bit at 1.8 V supply voltage. The robustness and the high randomness of the proposed chaotic oscillator p-bit suggest a new direction of a p-bit scalable to large-scale probabilistic computing. Physical sciences/Engineering/Electrical and electronic engineering Physical sciences/Mathematics and computing/Computer science Full Text Additional Declarations No competing interests reported. Supplementary Files Supplementaryinformationmanuscript.docx Cite Share Download PDF Status: Published Journal Publication published 07 Mar, 2025 Read the published version in Scientific Reports → Version 1 posted Editorial decision: Revision requested 09 Jan, 2025 Reviews received at journal 26 Dec, 2024 Reviewers agreed at journal 14 Dec, 2024 Reviews received at journal 19 Sep, 2024 Reviewers agreed at journal 10 Sep, 2024 Reviewers invited by journal 30 May, 2024 Editor assigned by journal 30 May, 2024 Editor invited by journal 30 May, 2024 Submission checks completed at journal 27 May, 2024 First submitted to journal 24 May, 2024 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-4470680","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Article","associatedPublications":[],"authors":[{"id":310696805,"identity":"5b06faa8-f9f6-4e89-8d77-00fd098b31d8","order_by":0,"name":"Woojin Lee","email":"","orcid":"","institution":"Korea University","correspondingAuthor":false,"prefix":"","firstName":"Woojin","middleName":"","lastName":"Lee","suffix":""},{"id":310696806,"identity":"11ce138a-3c47-4452-a76c-80b67367b9c6","order_by":1,"name":"Hyunjin Kim","email":"","orcid":"","institution":"Korea University","correspondingAuthor":false,"prefix":"","firstName":"Hyunjin","middleName":"","lastName":"Kim","suffix":""},{"id":310696807,"identity":"e212befe-1eab-4cef-85b4-aad20640d598","order_by":2,"name":"Hyundo Jung","email":"","orcid":"","institution":"Korea University","correspondingAuthor":false,"prefix":"","firstName":"Hyundo","middleName":"","lastName":"Jung","suffix":""},{"id":310696808,"identity":"68ecf11a-1985-4cb0-b0ab-7abba13f2379","order_by":3,"name":"Yohan Choi","email":"","orcid":"","institution":"Korea University","correspondingAuthor":false,"prefix":"","firstName":"Yohan","middleName":"","lastName":"Choi","suffix":""},{"id":310696809,"identity":"4c206c0d-132a-48fb-a4fc-622067e29000","order_by":4,"name":"Jinwoo Jeon","email":"","orcid":"","institution":"Korea University","correspondingAuthor":false,"prefix":"","firstName":"Jinwoo","middleName":"","lastName":"Jeon","suffix":""},{"id":310696810,"identity":"d9244c39-d0c5-4a23-aa72-8867147fbd88","order_by":5,"name":"Chulwoo Kim","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAuklEQVRIiWNgGAWjYDACHsYGhg8H4NwE4rQwziBRCwMDMw9JWvh7Drdutjljk8/PfoDxww+GtHyCWiTONrbdzrmRZjmzJ4FZsochx7KBkBYDfkaglg+HDQwOJDBIMzBUGBC0BazFAqjF/vwD5t/EaeEFOozhBtAWiQQ2oC05hLVInDnYdrPnTJqBxI2HbZY9BmmEtfD3pD+78eOYjQF/f/LhGz8qkglrQQLAZMBAkoZRMApGwSgYBTgBANdHO6ih3BsMAAAAAElFTkSuQmCC","orcid":"","institution":"Korea University","correspondingAuthor":true,"prefix":"","firstName":"Chulwoo","middleName":"","lastName":"Kim","suffix":""}],"badges":[],"createdAt":"2024-05-24 07:21:54","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4470680/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4470680/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1038/s41598-025-93218-8","type":"published","date":"2025-03-07T15:57:15+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":78183821,"identity":"e7aee4d3-b5b6-4dac-9cd7-c5c6083233e1","added_by":"auto","created_at":"2025-03-10 18:18:43","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":936265,"visible":true,"origin":"","legend":"","description":"","filename":"Naturemanuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4470680/v1_covered_abff632e-87ea-49e5-a13c-677173202e57.pdf"},{"id":57926273,"identity":"508bccb6-0eef-4a6e-bc50-dd37b5983d8f","added_by":"auto","created_at":"2024-06-07 14:29:39","extension":"docx","order_by":1,"title":"","display":"","copyAsset":false,"role":"supplement","size":606737,"visible":true,"origin":"","legend":"","description":"","filename":"Supplementaryinformationmanuscript.docx","url":"https://assets-eu.researchsquare.com/files/rs-4470680/v1/4d2b64198644e3f19e1dfde2.docx"}],"financialInterests":"No competing interests reported.","formattedTitle":"Correlation-free large-scale probabilistic computing with true-random chaotic oscillator p-bit","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"scientific-reports","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"scirep","sideBox":"Learn more about [Scientific Reports](http://www.nature.com/srep/)","snPcode":"","submissionUrl":"","title":"Scientific Reports","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Scientific Reports","inReviewEnabled":true,"inReviewRevisionsEnabled":true},"keywords":"","lastPublishedDoi":"10.21203/rs.3.rs-4470680/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4470680/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eProbabilistic computing—quantum-inspired computing that uses probabilistic bits (p-bits)—has emerged as a powerful method owing to its fast search speed and robust connectivity. Previous works used linear feedback shift registers (LFSRs) or stochastic magnetic tunnel junctions (MTJs) to implement p-bits. However, in large-scale problems, periodicity and correlation issues in LFSR p-bits and inherent variations in MTJ-based p-bits with narrow stochastic regions lead to unreliable results when seeking the appropriate solution. Therefore, we propose a fully CMOS frequency-scalable p-bit implemented with a discrete-time flipped-hook tent-map chaotic oscillator. The proposed chaotic oscillator produces high-quality noise voltage that is uniformly distributed across the entire supply voltage range, enabling aligned responses of p-bits free from calibration and an input resolution of 8 bits. In contrast to LFSR-based p-bits with hardware-dependent correlation, the chaotic oscillator p-bits could factorize semiprimes with lengths up to 64 bits without changing hardware size. The chaotic oscillator exhibited an energy efficiency of 4.26 pJ/bit at 1.8 V supply voltage. The robustness and the high randomness of the proposed chaotic oscillator p-bit suggest a new direction of a p-bit scalable to large-scale probabilistic computing.\u003c/p\u003e","manuscriptTitle":"Correlation-free large-scale probabilistic computing with true-random chaotic oscillator p-bit","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-06-07 14:29:34","doi":"10.21203/rs.3.rs-4470680/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2025-01-10T04:56:10+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-12-26T07:58:36+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"212505960601919951399086517255778792134","date":"2024-12-14T05:10:22+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-09-19T11:17:40+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"205054652909871960590288264793737423101","date":"2024-09-10T05:06:04+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2024-05-31T03:42:27+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2024-05-31T03:38:02+00:00","index":"","fulltext":""},{"type":"editorInvited","content":"","date":"2024-05-30T15:31:36+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2024-05-27T07:03:30+00:00","index":"","fulltext":""},{"type":"submitted","content":"Scientific Reports","date":"2024-05-24T07:20:27+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"scientific-reports","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"scirep","sideBox":"Learn more about [Scientific Reports](http://www.nature.com/srep/)","snPcode":"","submissionUrl":"","title":"Scientific Reports","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Scientific Reports","inReviewEnabled":true,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"c8dc73ca-852f-43b5-900a-9596e0a6a512","owner":[],"postedDate":"June 7th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[{"id":32834044,"name":"Physical sciences/Engineering/Electrical and electronic engineering"},{"id":32834045,"name":"Physical sciences/Mathematics and computing/Computer science"}],"tags":[],"updatedAt":"2025-03-10T17:46:44+00:00","versionOfRecord":{"articleIdentity":"rs-4470680","link":"https://doi.org/10.1038/s41598-025-93218-8","journal":{"identity":"scientific-reports","isVorOnly":false,"title":"Scientific Reports"},"publishedOn":"2025-03-07 15:57:15","publishedOnDateReadable":"March 7th, 2025"},"versionCreatedAt":"2024-06-07 14:29:34","video":"","vorDoi":"10.1038/s41598-025-93218-8","vorDoiUrl":"https://doi.org/10.1038/s41598-025-93218-8","workflowStages":[]},"version":"v1","identity":"rs-4470680","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4470680","identity":"rs-4470680","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}