{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ASYEWXYNKUBZKNQJZ5X6FVAXBQ","short_pith_number":"pith:ASYEWXYN","schema_version":"1.0","canonical_sha256":"04b04b5f0d5503953609cf6fe2d4170c28c0e3a28c1f14beb6d020c4ca2dca05","source":{"kind":"arxiv","id":"2212.12372","version":1},"attestation_state":"computed","paper":{"title":"Factoring integers with sublinear resources on a superconducting quantum processor","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bao Yan, Chao Song, Chuanyu Zhang, Feitong Jin, Gui-Lu Long, Haocong Jiang, Hekang Li, Hong Wang, H. Wang, Jiachen Chen, Lan Luo, Qianheng Duan, ShiJie Wei, Weilong Wang, Wenhao Shi, Xiangdong Meng, Xuhao Zhu, Yangyang Fei, Yiting Liu, Yu Han, Zheng Shan, Zhen Wang, Zhi Ma, Ziqi Tan","submitted_at":"2022-12-23T14:45:02Z","abstract_excerpt":"Shor's algorithm has seriously challenged information security based on public key cryptosystems. However, to break the widely used RSA-2048 scheme, one needs millions of physical qubits, which is far beyond current technical capabilities. Here, we report a universal quantum algorithm for integer factorization by combining the classical lattice reduction with a quantum approximate optimization algorithm (QAOA). The number of qubits required is O(logN/loglog N), which is sublinear in the bit length of the integer $N$, making it the most qubit-saving factorization algorithm to date. We demonstra"},"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":"2212.12372","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2022-12-23T14:45:02Z","cross_cats_sorted":[],"title_canon_sha256":"fa3f19bed2617df70565978fc6aaa50ed4dbf84de03091fb78aeaa9f4c1e6e65","abstract_canon_sha256":"bd8e78c1ae88147020287243246fb74961da443f3776bc634995308de9fb1fca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:28:01.598814Z","signature_b64":"LG09WneDdZddTlyXM1uiGAPljDIpRpdlv86QvguXwYIjGlqtUF8SdQglhZWCLIzanJfRokrccNt0rDciHI8+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04b04b5f0d5503953609cf6fe2d4170c28c0e3a28c1f14beb6d020c4ca2dca05","last_reissued_at":"2026-07-05T05:28:01.598350Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:28:01.598350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Factoring integers with sublinear resources on a superconducting quantum processor","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bao Yan, Chao Song, Chuanyu Zhang, Feitong Jin, Gui-Lu Long, Haocong Jiang, Hekang Li, Hong Wang, H. Wang, Jiachen Chen, Lan Luo, Qianheng Duan, ShiJie Wei, Weilong Wang, Wenhao Shi, Xiangdong Meng, Xuhao Zhu, Yangyang Fei, Yiting Liu, Yu Han, Zheng Shan, Zhen Wang, Zhi Ma, Ziqi Tan","submitted_at":"2022-12-23T14:45:02Z","abstract_excerpt":"Shor's algorithm has seriously challenged information security based on public key cryptosystems. However, to break the widely used RSA-2048 scheme, one needs millions of physical qubits, which is far beyond current technical capabilities. Here, we report a universal quantum algorithm for integer factorization by combining the classical lattice reduction with a quantum approximate optimization algorithm (QAOA). The number of qubits required is O(logN/loglog N), which is sublinear in the bit length of the integer $N$, making it the most qubit-saving factorization algorithm to date. We demonstra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.12372","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/2212.12372/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":"2212.12372","created_at":"2026-07-05T05:28:01.598410+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.12372v1","created_at":"2026-07-05T05:28:01.598410+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.12372","created_at":"2026-07-05T05:28:01.598410+00:00"},{"alias_kind":"pith_short_12","alias_value":"ASYEWXYNKUBZ","created_at":"2026-07-05T05:28:01.598410+00:00"},{"alias_kind":"pith_short_16","alias_value":"ASYEWXYNKUBZKNQJ","created_at":"2026-07-05T05:28:01.598410+00:00"},{"alias_kind":"pith_short_8","alias_value":"ASYEWXYN","created_at":"2026-07-05T05:28:01.598410+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2312.10054","citing_title":"Efficient Quantum Oracle for Solving Bilinear Diophantine Equations on Digital Quantum Computers","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03682","citing_title":"Resource-efficient parallel entanglement generation for multinode quantum networks via time-bin multiplexing","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ASYEWXYNKUBZKNQJZ5X6FVAXBQ","json":"https://pith.science/pith/ASYEWXYNKUBZKNQJZ5X6FVAXBQ.json","graph_json":"https://pith.science/api/pith-number/ASYEWXYNKUBZKNQJZ5X6FVAXBQ/graph.json","events_json":"https://pith.science/api/pith-number/ASYEWXYNKUBZKNQJZ5X6FVAXBQ/events.json","paper":"https://pith.science/paper/ASYEWXYN"},"agent_actions":{"view_html":"https://pith.science/pith/ASYEWXYNKUBZKNQJZ5X6FVAXBQ","download_json":"https://pith.science/pith/ASYEWXYNKUBZKNQJZ5X6FVAXBQ.json","view_paper":"https://pith.science/paper/ASYEWXYN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.12372&json=true","fetch_graph":"https://pith.science/api/pith-number/ASYEWXYNKUBZKNQJZ5X6FVAXBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ASYEWXYNKUBZKNQJZ5X6FVAXBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ASYEWXYNKUBZKNQJZ5X6FVAXBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ASYEWXYNKUBZKNQJZ5X6FVAXBQ/action/storage_attestation","attest_author":"https://pith.science/pith/ASYEWXYNKUBZKNQJZ5X6FVAXBQ/action/author_attestation","sign_citation":"https://pith.science/pith/ASYEWXYNKUBZKNQJZ5X6FVAXBQ/action/citation_signature","submit_replication":"https://pith.science/pith/ASYEWXYNKUBZKNQJZ5X6FVAXBQ/action/replication_record"}},"created_at":"2026-07-05T05:28:01.598410+00:00","updated_at":"2026-07-05T05:28:01.598410+00:00"}