Error-Resilient Quantum Circuit Design of Hybrid Approximate-Exact 5:2 Compressors for Arithmetic Applications

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract This work presents a resource-efficient architecture for quantum 5:2 compressors, addressing the prohibitively high T-count and circuit depth of exact arithmetic in the Noisy Intermediate-Scale Quantum (NISQ) regime. We implement a Hybrid Approximate-Exact synthesis methodology that fundamentally alters the logic synthesis path to prioritize quantum cost over strict logical equivalence. The proposed design intentionally isolates and excludes the fourth input bit (í µí±¥ 4)from the critical carry computation path during the initial approximation stage, significantly pruning the required Toffoli gate count. To mitigate the induced error, the proposed approach integrate a dedicated Error Correction Module (ECM) based on half-adder logic that realigns the significance weights of the intermediate sum and carry vectors. Validation via Qiskit Aer exhaustive statevector simulation confirms that this architecture achieves a superior Pareto frontier between circuit fidelity and arithmetic precision compared to fully exact baselines. The resulting topology minimizes decoherence-induced errors by reducing the gate depth, providing a viable arithmetic primitive for error-tolerant quantum algorithms.
Full text 12,490 characters · extracted from preprint-html · click to expand
Error-Resilient Quantum Circuit Design of Hybrid Approximate-Exact 5:2 Compressors for Arithmetic Applications | 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 Error-Resilient Quantum Circuit Design of Hybrid Approximate-Exact 5:2 Compressors for Arithmetic Applications Sreeprad V S A L Manda, Aravindhan Alagarsamy, Ernest Ravindran, and 3 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-8588723/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 6 You are reading this latest preprint version Abstract This work presents a resource-efficient architecture for quantum 5:2 compressors, addressing the prohibitively high T-count and circuit depth of exact arithmetic in the Noisy Intermediate-Scale Quantum (NISQ) regime. We implement a Hybrid Approximate-Exact synthesis methodology that fundamentally alters the logic synthesis path to prioritize quantum cost over strict logical equivalence. The proposed design intentionally isolates and excludes the fourth input bit (í µí±¥ 4)from the critical carry computation path during the initial approximation stage, significantly pruning the required Toffoli gate count. To mitigate the induced error, the proposed approach integrate a dedicated Error Correction Module (ECM) based on half-adder logic that realigns the significance weights of the intermediate sum and carry vectors. Validation via Qiskit Aer exhaustive statevector simulation confirms that this architecture achieves a superior Pareto frontier between circuit fidelity and arithmetic precision compared to fully exact baselines. The resulting topology minimizes decoherence-induced errors by reducing the gate depth, providing a viable arithmetic primitive for error-tolerant quantum algorithms. Quantum logic circuit Approximate 5:2 compressor Reversible logic Hybrid architecture Error correction Quantum simulation Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Reviews received at journal 03 Mar, 2026 Reviewers agreed at journal 25 Feb, 2026 Reviewers invited by journal 24 Feb, 2026 Editor assigned by journal 14 Jan, 2026 Submission checks completed at journal 14 Jan, 2026 First submitted to journal 13 Jan, 2026 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-8588723","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":596073369,"identity":"56aac726-6826-4484-8dc9-c6620913ef64","order_by":0,"name":"Sreeprad V S A L Manda","email":"","orcid":"","institution":"Koneru Lakshmaiah Education Foundation","correspondingAuthor":false,"prefix":"","firstName":"Sreeprad","middleName":"V S A L","lastName":"Manda","suffix":""},{"id":596073370,"identity":"7d6b4dee-fc3f-4114-bad8-23c45a537bd2","order_by":1,"name":"Aravindhan Alagarsamy","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABJElEQVRIiWNgGAWjYLCCBAbmBDDjAYhgbwASBhZEagGTPAdAWiQI2YOsRQJC4lTLP/vwM4mHO6zz+Gc3MH5IqKmVN5/5/OqGHwUSDPzt3QnYtEicSzOTSDyTXixx5wCzRMKx44ZzbueU3ewBOkzizNkNWK05w2BskNh2OLHhRgLQSWzHGGdI56Td4AFqMZDIxapF/gz7Z7CW+TcSmH8k/DtmP0PyTNrNP3i0GJzhMXwA0rLhRgKbRGJbTeIMCfZjt/HZYniGpxCoJT1x443ENovEvgPJM3hy2G7LGEjw4PKL3Bn2DQd/tlknzruRfPjGh291tjPYjz+7+eaPjRx/ey927yMAYwOQOAzEPAYgLg8B5XBQB8TsD4hVPQpGwSgYBSMDAAB5HGnXgBi0FQAAAABJRU5ErkJggg==","orcid":"","institution":"Koneru Lakshmaiah Education Foundation","correspondingAuthor":true,"prefix":"","firstName":"Aravindhan","middleName":"","lastName":"Alagarsamy","suffix":""},{"id":596073371,"identity":"db096a1f-2e7b-497d-a2da-4c243fe972eb","order_by":2,"name":"Ernest Ravindran","email":"","orcid":"","institution":"Koneru Lakshmaiah Education Foundation","correspondingAuthor":false,"prefix":"","firstName":"Ernest","middleName":"","lastName":"Ravindran","suffix":""},{"id":596073372,"identity":"45ebe95b-c005-469f-b9dd-dbe87157f2e9","order_by":3,"name":"Yu-Chen Hu","email":"","orcid":"","institution":"Tunghai University","correspondingAuthor":false,"prefix":"","firstName":"Yu-Chen","middleName":"","lastName":"Hu","suffix":""},{"id":596073373,"identity":"e827495b-0526-45b6-ab8c-0cd9b4a3ecb1","order_by":4,"name":"Gian Carlo Cardarilli","email":"","orcid":"","institution":"University of Rome Tor Vergata","correspondingAuthor":false,"prefix":"","firstName":"Gian","middleName":"Carlo","lastName":"Cardarilli","suffix":""},{"id":596073374,"identity":"ceb50ca6-1502-426f-9c74-3b15cd757fe6","order_by":5,"name":"Seok-Bum Ko","email":"","orcid":"","institution":"University of Saskatchewan","correspondingAuthor":false,"prefix":"","firstName":"Seok-Bum","middleName":"","lastName":"Ko","suffix":""}],"badges":[],"createdAt":"2026-01-13 07:38:57","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-8588723/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-8588723/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":104397654,"identity":"da1d7f8d-e992-41aa-a3a7-8363848e2d04","added_by":"auto","created_at":"2026-03-11 11:53:56","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":546194,"visible":true,"origin":"","legend":"","description":"","filename":"Manuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-8588723/v1_covered_993367a5-dfad-4c63-87d8-0355a353482c.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Error-Resilient Quantum Circuit Design of Hybrid Approximate-Exact 5:2 Compressors for Arithmetic Applications","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"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":"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 logic circuit, Approximate 5:2 compressor, Reversible logic, Hybrid architecture, Error correction, Quantum simulation","lastPublishedDoi":"10.21203/rs.3.rs-8588723/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-8588723/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"This work presents a resource-efficient architecture for quantum 5:2 compressors, addressing the prohibitively high T-count and circuit depth of exact arithmetic in the Noisy Intermediate-Scale Quantum (NISQ) regime. We implement a Hybrid Approximate-Exact synthesis methodology that fundamentally alters the logic synthesis path to prioritize quantum cost over strict logical equivalence. The proposed design intentionally isolates and excludes the fourth input bit (í µí±¥ 4)from the critical carry computation path during the initial approximation stage, significantly pruning the required Toffoli gate count. To mitigate the induced error, the proposed approach integrate a dedicated Error Correction Module (ECM) based on half-adder logic that realigns the significance weights of the intermediate sum and carry vectors. Validation via Qiskit Aer exhaustive statevector simulation confirms that this architecture achieves a superior Pareto frontier between circuit fidelity and arithmetic precision compared to fully exact baselines. The resulting topology minimizes decoherence-induced errors by reducing the gate depth, providing a viable arithmetic primitive for error-tolerant quantum algorithms.","manuscriptTitle":"Error-Resilient Quantum Circuit Design of Hybrid Approximate-Exact 5:2 Compressors for Arithmetic Applications","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-02-25 10:33:10","doi":"10.21203/rs.3.rs-8588723/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"editorInvitedReview","content":"","date":"2026-03-04T00:42:24+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"215749725144291368097577196250885761134","date":"2026-02-25T12:46:50+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2026-02-24T06:15:59+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2026-01-14T08:01:44+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2026-01-14T08:01:15+00:00","index":"","fulltext":""},{"type":"submitted","content":"Quantum Information Processing","date":"2026-01-13T07:19:28+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":"2794c896-79db-40ff-9678-2dfbc9ec5749","owner":[],"postedDate":"February 25th, 2026","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-02-25T10:33:10+00:00","versionOfRecord":[],"versionCreatedAt":"2026-02-25 10:33:10","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-8588723","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-8588723","identity":"rs-8588723","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","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 (2026) — 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