{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:G4FST7JAMCW5YRRNAUYK3FWA7T","short_pith_number":"pith:G4FST7JA","schema_version":"1.0","canonical_sha256":"370b29fd2060addc462d0530ad96c0fcc5edeb3a52c321ce105c50fbe652d446","source":{"kind":"arxiv","id":"2402.18530","version":1},"attestation_state":"computed","paper":{"title":"Reducing the Number of Qubits from $n^2$ to $n\\log_{2} (n)$ to Solve the Traveling Salesman Problem with Quantum Computers: A Proposal for Demonstrating Quantum Supremacy in the NISQ Era","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alireza Bahrampour, Mehdi Ramezani, Mehdi Shokhmkar, Morteza Moradi, Sadegh Salami","submitted_at":"2024-02-28T18:08:52Z","abstract_excerpt":"In our pursuit of quantum supremacy during the NISQ era, this research introduces a novel approach rooted in the Quantum Approximate Optimization Algorithm (QAOA) framework to address the Traveling Salesman Problem (TSP). By strategically reducing the requisite qubit count from $n^2$ to $n\\log_{2} (n)$, our QAOA-based algorithm not only contributes to the ongoing discourse on qubit efficiency but also demonstrates improved performance based on established metrics, underscoring its potential for achieving NISQ-era supremacy in solving real-world optimization challenges."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2402.18530","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2024-02-28T18:08:52Z","cross_cats_sorted":[],"title_canon_sha256":"a63325aea573beb9d140f039de18213c043c0e3e92def557a932a9c80d91d246","abstract_canon_sha256":"a3546fe9e0996b1c72ca07fdad393027f6e338f4f617becbde54f376562582f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:50:17.213969Z","signature_b64":"U3s3X0Z/GwUivPo19mHDKUIi6jTH28DTkCyC1nRMo883R7qZ0JjO3gnjzp71L/BByKF51ZGSzGHLz9MUhhQGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"370b29fd2060addc462d0530ad96c0fcc5edeb3a52c321ce105c50fbe652d446","last_reissued_at":"2026-07-05T07:50:17.213491Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:50:17.213491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reducing the Number of Qubits from $n^2$ to $n\\log_{2} (n)$ to Solve the Traveling Salesman Problem with Quantum Computers: A Proposal for Demonstrating Quantum Supremacy in the NISQ Era","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alireza Bahrampour, Mehdi Ramezani, Mehdi Shokhmkar, Morteza Moradi, Sadegh Salami","submitted_at":"2024-02-28T18:08:52Z","abstract_excerpt":"In our pursuit of quantum supremacy during the NISQ era, this research introduces a novel approach rooted in the Quantum Approximate Optimization Algorithm (QAOA) framework to address the Traveling Salesman Problem (TSP). By strategically reducing the requisite qubit count from $n^2$ to $n\\log_{2} (n)$, our QAOA-based algorithm not only contributes to the ongoing discourse on qubit efficiency but also demonstrates improved performance based on established metrics, underscoring its potential for achieving NISQ-era supremacy in solving real-world optimization challenges."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.18530","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.18530/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2402.18530","created_at":"2026-07-05T07:50:17.213551+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.18530v1","created_at":"2026-07-05T07:50:17.213551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.18530","created_at":"2026-07-05T07:50:17.213551+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4FST7JAMCW5","created_at":"2026-07-05T07:50:17.213551+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4FST7JAMCW5YRRN","created_at":"2026-07-05T07:50:17.213551+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4FST7JA","created_at":"2026-07-05T07:50:17.213551+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2601.01516","citing_title":"Constraint-Aware Quantum Optimization via Hamming Weight Operators","ref_index":63,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00739","citing_title":"A Resource-Efficient Variational Quantum Framework for the Traveling Salesman Problem","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G4FST7JAMCW5YRRNAUYK3FWA7T","json":"https://pith.science/pith/G4FST7JAMCW5YRRNAUYK3FWA7T.json","graph_json":"https://pith.science/api/pith-number/G4FST7JAMCW5YRRNAUYK3FWA7T/graph.json","events_json":"https://pith.science/api/pith-number/G4FST7JAMCW5YRRNAUYK3FWA7T/events.json","paper":"https://pith.science/paper/G4FST7JA"},"agent_actions":{"view_html":"https://pith.science/pith/G4FST7JAMCW5YRRNAUYK3FWA7T","download_json":"https://pith.science/pith/G4FST7JAMCW5YRRNAUYK3FWA7T.json","view_paper":"https://pith.science/paper/G4FST7JA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.18530&json=true","fetch_graph":"https://pith.science/api/pith-number/G4FST7JAMCW5YRRNAUYK3FWA7T/graph.json","fetch_events":"https://pith.science/api/pith-number/G4FST7JAMCW5YRRNAUYK3FWA7T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4FST7JAMCW5YRRNAUYK3FWA7T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4FST7JAMCW5YRRNAUYK3FWA7T/action/storage_attestation","attest_author":"https://pith.science/pith/G4FST7JAMCW5YRRNAUYK3FWA7T/action/author_attestation","sign_citation":"https://pith.science/pith/G4FST7JAMCW5YRRNAUYK3FWA7T/action/citation_signature","submit_replication":"https://pith.science/pith/G4FST7JAMCW5YRRNAUYK3FWA7T/action/replication_record"}},"created_at":"2026-07-05T07:50:17.213551+00:00","updated_at":"2026-07-05T07:50:17.213551+00:00"}