An entropy increasing circuit for quantum walking and its application in quantum encryption

preprint OA: closed
Full text JSON View at publisher
Full text 12,579 characters · extracted from preprint-html · click to expand
An entropy increasing circuit for quantum walking and its application in quantum encryption | 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 Research Article An entropy increasing circuit for quantum walking and its application in quantum encryption QingJi Zeng, JinQing Li, XiaoQiang Di This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6392028/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 21 Feb, 2026 Read the published version in Quantum Information Processing → Version 1 posted 10 You are reading this latest preprint version Abstract The rapid development of quantum computing poses a serious threat to traditional encryption technologies, especially in the field of image security, where existing encryption schemes struggle to withstand quantum attacks. Therefore, quantum image encryption research is crucial. In the field of quantum image encryption, keys with high randomness and high security are essential. To address the issue of insufficient randomness in quantum walks in low-dimensional spaces, this paper proposes two solutions: the high-dimensional quantum walk paradigm and the entropy-increasing circuit. The high-dimensional quantum walk paradigm enhances the complexity of random sequences by expanding the dimensions of quantum walks, while the entropy-increasing circuit boosts the entropy of the key through quantum operations, thereby improving its randomness and resistance to attacks. To verify the random performance of the entropy-increased key, it is applied to quantum image encryption, with the specific circuit implementation of the encryption process provided. Finally, experimental analysis demonstrates the security of the algorithm. quantum circuit Quantum Walk chaotic map Quantum image encryption Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 21 Feb, 2026 Read the published version in Quantum Information Processing → Version 1 posted Editorial decision: Revision requested 16 Sep, 2025 Reviews received at journal 29 Jun, 2025 Reviews received at journal 29 Jun, 2025 Reviewers agreed at journal 06 Jun, 2025 Reviewers agreed at journal 03 Jun, 2025 Reviewers agreed at journal 03 Jun, 2025 Reviewers invited by journal 03 Jun, 2025 Editor assigned by journal 09 Apr, 2025 Submission checks completed at journal 09 Apr, 2025 First submitted to journal 07 Apr, 2025 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-6392028","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":466161194,"identity":"33530eac-4e0b-4e09-a2a7-625c11e01079","order_by":0,"name":"QingJi Zeng","email":"","orcid":"","institution":"Changchun University of\nScience and Technology","correspondingAuthor":false,"prefix":"","firstName":"QingJi","middleName":"","lastName":"Zeng","suffix":""},{"id":466161195,"identity":"8da8308a-d691-4b17-bd41-cd9245c9ee22","order_by":1,"name":"JinQing Li","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA30lEQVRIiWNgGAWjYBACPmaGhAMMDBIMDOwNUKEDBLSwwbXwgJQmEKMFzpJIIFYLO8PDwwVlFnnykY+fSf78wSDHdyOB8XMBAYcdnnFOotjwdpqZNE8Cg7HkjQRm6RmEtPC2SSRunJ3DJg10WOKGGwlszDxEaZl5hk3yRwJDPfFa5kvwsEkAHZZgQJQWnnMSiRt40oytedIkDGeeedgsjU8LP/+Z5M88ZXWJ89sPP7z5w8ZGnu948sHP+LQAozABHDsGB8A8YJwyMDbg1QBMKAfAWuQJqRsFo2AUjIKRCwCwJkSQVDLWggAAAABJRU5ErkJggg==","orcid":"","institution":"Changchun University of Science and Technology","correspondingAuthor":true,"prefix":"","firstName":"JinQing","middleName":"","lastName":"Li","suffix":""},{"id":466161197,"identity":"691e5a9c-d184-486b-a4b5-0e117add8fd0","order_by":2,"name":"XiaoQiang Di","email":"","orcid":"","institution":"Changchun University of\nScience and Technology","correspondingAuthor":false,"prefix":"","firstName":"XiaoQiang","middleName":"","lastName":"Di","suffix":""}],"badges":[],"createdAt":"2025-04-07 08:38:25","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6392028/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6392028/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1007/s11128-026-05106-3","type":"published","date":"2026-02-21T15:59:21+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":103252710,"identity":"2282fcc0-a9e0-4bd5-b6b1-cf73b5d89043","added_by":"auto","created_at":"2026-02-23 16:15:46","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":7299507,"visible":true,"origin":"","legend":"","description":"","filename":"Anentropyincreasingcircuitforquantumwalkinganditsapplicationinquantumencryption.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6392028/v1_covered_d000d807-eb1c-4920-a41b-e7523e4aca2b.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"An entropy increasing circuit for quantum walking and its application in quantum encryption","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":"quantum-information-processing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"qinp","sideBox":"Learn more about [Quantum Information Processing](http://link.springer.com/journal/11128)","snPcode":"11128","submissionUrl":"https://submission.nature.com/new-submission/11128/3","title":"Quantum Information Processing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"quantum circuit, Quantum Walk, chaotic map, Quantum image encryption","lastPublishedDoi":"10.21203/rs.3.rs-6392028/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6392028/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"The rapid development of quantum computing poses a serious threat to traditional encryption technologies, especially in the field of image security, where existing encryption schemes struggle to withstand quantum attacks. Therefore, quantum image encryption research is crucial. In the field of quantum image encryption, keys with high randomness and high security are essential. To address the issue of insufficient randomness in quantum walks in low-dimensional spaces, this paper proposes two solutions: the high-dimensional quantum walk paradigm and the entropy-increasing circuit. The high-dimensional quantum walk paradigm enhances the complexity of random sequences by expanding the dimensions of quantum walks, while the entropy-increasing circuit boosts the entropy of the key through quantum operations, thereby improving its randomness and resistance to attacks. To verify the random performance of the entropy-increased key, it is applied to quantum image encryption, with the specific circuit implementation of the encryption process provided. Finally, experimental analysis demonstrates the security of the algorithm.","manuscriptTitle":"An entropy increasing circuit for quantum walking and its application in quantum encryption","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-06-05 07:20:29","doi":"10.21203/rs.3.rs-6392028/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2025-09-16T13:31:34+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-06-29T16:47:19+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-06-29T08:55:51+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"151817844403997649758678953595481662770","date":"2025-06-06T10:17:45+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"104885836503049662626948099845225777660","date":"2025-06-04T03:27:12+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"8627650561598755558553373260046626731","date":"2025-06-03T17:55:27+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-06-03T14:38:16+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-04-09T15:05:07+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-04-09T15:03:06+00:00","index":"","fulltext":""},{"type":"submitted","content":"Quantum Information Processing","date":"2025-04-07T08:32:03+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"quantum-information-processing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"qinp","sideBox":"Learn more about [Quantum Information Processing](http://link.springer.com/journal/11128)","snPcode":"11128","submissionUrl":"https://submission.nature.com/new-submission/11128/3","title":"Quantum Information Processing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"0ba0aaf7-5881-4e51-b8b5-909871484a4f","owner":[],"postedDate":"June 5th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[],"tags":[],"updatedAt":"2026-02-23T16:12:57+00:00","versionOfRecord":{"articleIdentity":"rs-6392028","link":"https://doi.org/10.1007/s11128-026-05106-3","journal":{"identity":"quantum-information-processing","isVorOnly":false,"title":"Quantum Information Processing"},"publishedOn":"2026-02-21 15:59:21","publishedOnDateReadable":"February 21st, 2026"},"versionCreatedAt":"2025-06-05 07:20:29","video":"","vorDoi":"10.1007/s11128-026-05106-3","vorDoiUrl":"https://doi.org/10.1007/s11128-026-05106-3","workflowStages":[]},"version":"v1","identity":"rs-6392028","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6392028","identity":"rs-6392028","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00