Fault-Tolerant Quantum Communication over r-Robust Graph Topologies under Adversarial and Noisy Conditions

Fault-Tolerant Quantum Communication over r-Robust Graph Topologies under Adversarial and Noisy Conditions | 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 Fault-Tolerant Quantum Communication over r-Robust Graph Topologies under Adversarial and Noisy Conditions Suresh Kumar Jha, Siddhanta Kumar Singh, Aditya Narayan Hati This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7262145/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract The realization of scalable quantum communication networks faces critical challenges from decoherence, noise, and adversarial attacks. This paper presents a comprehensive framework for fault-tolerant quantum communication using \textit{r}-robust graph topologies, which ensure strong connectivity and resilience in the presence of both random failures and Byzantine adversaries. We formalize \textit{r}-robustness in single-layer and multiplex quantum networks and derive theoretical bounds on fidelity, consensus success, and error propagation. A hybrid quantum-classical protocol is proposed that leverages multi-path entanglement and quantum certificate-based identity enforcement. Extensive simulations using Qiskit and NetworkX show that \textit{r}-robust networks improve average entanglement fidelity by up to 26\%, achieve over 95\% consensus success under 30\% adversarial nodes, and exponentially suppress error rates. Compared to ring, scale-free, and random graphs, \textit{r}-robust topologies provide superior robustness with moderate resource overhead. Our results establish a graph-theoretic foundation for constructing secure, resilient, and NISQ-compatible quantum networks capable of sustaining high-performance communication in noisy and adversarial environments. Quantum Networks r-Robust Graphs Fault-Tolerant Quantum Communication Quantum Entanglement Distribution Byzantine Fault Tolerance Network Resilience Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Posted Version 1 posted 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-7262145","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":570775280,"identity":"bf5f48bc-61cb-4a7f-ad13-ac79d878b5b0","order_by":0,"name":"Suresh Kumar Jha","email":"","orcid":"","institution":"Manipal University Jaipur","correspondingAuthor":false,"prefix":"","firstName":"Suresh","middleName":"Kumar","lastName":"Jha","suffix":""},{"id":570775281,"identity":"671c431a-6ef9-454c-a587-ad8f97237a94","order_by":1,"name":"Siddhanta Kumar Singh","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABUklEQVRIie2RP2vCQBTAXwjocjHricV8hQtCl/pNupgpU0Do0qG0J0KyiK6RlvYrmL3DlQd16QcI6JAgZHITihQpvaCRJkrnDvfjDt79+d17jwNQKP4jOrBWEQs52hrX+GGdB/39/hmFFkqnorBTBX4p+anDK6cnihXo0aJ/t7w3eT3F/tfSHQbor4xXuDYfh36yZdBuxL3SI1i7uQrfM0oFYTgdZ95g5AQdkoEXLt8Ce8Sg06woOrlskRpSEATQGKE34I7fIgI8Hjs+JQycWVmxhrnyjdQS9SRXXG2S7pUXqTR3DB4qCqBUDB8pE7JIssWeFh6yzOI8YNBjZ3oxxtiMUPZicLQHYRrYT4J6USybumDUnn4kpcImGC3IJ5rtebDakB1a9sTNkrXoes+xm6Xr267VmJcLO6LLqfkANoda8VHH4A92Mu/+JhSKQqFQKH4AjAiFByESrt4AAAAASUVORK5CYII=","orcid":"","institution":"Manipal University Jaipur","correspondingAuthor":true,"prefix":"","firstName":"Siddhanta","middleName":"Kumar","lastName":"Singh","suffix":""},{"id":570775282,"identity":"86f421cd-01c4-470b-acf1-8f58075c4807","order_by":2,"name":"Aditya Narayan Hati","email":"","orcid":"","institution":"Manipal University Jaipur","correspondingAuthor":false,"prefix":"","firstName":"Aditya","middleName":"Narayan","lastName":"Hati","suffix":""}],"badges":[],"createdAt":"2025-07-31 12:23:14","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-7262145/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7262145/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":108159590,"identity":"bf8d13b1-6475-4993-a55b-d6987cf3480a","added_by":"auto","created_at":"2026-04-30 03:40:17","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1252952,"visible":true,"origin":"","legend":"","description":"","filename":"Quantumrrobustgraph.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7262145/v1_covered_96bb7d91-37d1-44e3-9af3-28cba3065c14.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Fault-Tolerant Quantum Communication over r-Robust Graph Topologies under Adversarial and Noisy Conditions","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Quantum Networks, r-Robust Graphs, Fault-Tolerant, Quantum Communication, Quantum Entanglement Distribution, Byzantine Fault Tolerance, Network Resilience","lastPublishedDoi":"10.21203/rs.3.rs-7262145/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7262145/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eThe realization of scalable quantum communication networks faces critical challenges from decoherence, noise, and adversarial attacks. This paper presents a comprehensive framework for fault-tolerant quantum communication using \\textit{r}-robust graph topologies, which ensure strong connectivity and resilience in the presence of both random failures and Byzantine adversaries. We formalize \\textit{r}-robustness in single-layer and multiplex quantum networks and derive theoretical bounds on fidelity, consensus success, and error propagation. A hybrid quantum-classical protocol is proposed that leverages multi-path entanglement and quantum certificate-based identity enforcement. Extensive simulations using Qiskit and NetworkX show that \\textit{r}-robust networks improve average entanglement fidelity by up to 26\\%, achieve over 95\\% consensus success under 30\\% adversarial nodes, and exponentially suppress error rates. Compared to ring, scale-free, and random graphs, \\textit{r}-robust topologies provide superior robustness with moderate resource overhead. Our results establish a graph-theoretic foundation for constructing secure, resilient, and NISQ-compatible quantum networks capable of sustaining high-performance communication in noisy and adversarial environments.\u003c/p\u003e","manuscriptTitle":"Fault-Tolerant Quantum Communication over r-Robust Graph Topologies under Adversarial and Noisy Conditions","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-01-08 08:30:45","doi":"10.21203/rs.3.rs-7262145/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"63e75625-d255-4bd6-a4e8-f9ff5e64043d","owner":[],"postedDate":"January 8th, 2026","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2026-04-30T03:40:01+00:00","versionOfRecord":[],"versionCreatedAt":"2026-01-08 08:30:45","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-7262145","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7262145","identity":"rs-7262145","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}