{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PVAPER4YLAKV3QCDFTA4SKHQUW","short_pith_number":"pith:PVAPER4Y","schema_version":"1.0","canonical_sha256":"7d40f2479858155dc0432cc1c928f0a5beaa882cf3e77d3c68b24cb2851d0ae3","source":{"kind":"arxiv","id":"2304.12100","version":2},"attestation_state":"computed","paper":{"title":"Distributed Phase Estimation Algorithm and Distributed Shor's Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daowen Qiu, Le Luo, Ligang Xiao, Paulo Mateus","submitted_at":"2023-04-24T13:52:05Z","abstract_excerpt":"Shor's algorithm is one of the most significant quantum algorithms. Shor's algorithm can factor large integers with a certain success probability in polynomial time. However, Shor's algorithm requires an unbearable amount of qubits in the NISQ (Noisy Intermediate-scale Quantum) era. To reduce the resources required for Shor's algorithm, in this paper we first propose a new distributed phase estimation algorithm. Our distributed phase estimation algorithm does not require quantum communication and it reduces the number of qubits of a single node compared to the traditional phase estimation algo"},"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":"2304.12100","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-04-24T13:52:05Z","cross_cats_sorted":[],"title_canon_sha256":"0f32c9793aacfdad99dd3cc4bc9bd2048926a8383c67464784f504b8ff86c971","abstract_canon_sha256":"a7858c47145bceb621e7abdf2202e4b8a8d118868428c9ab8d74d783c17a36c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:48:29.111794Z","signature_b64":"ITIKrSWj6/T0hsu25vSD0jWCpzL6v9nqxcTcqH+6utWENZFfwLE+30jqlla35Uxq9YInWut8RpPZjQwvgiqJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d40f2479858155dc0432cc1c928f0a5beaa882cf3e77d3c68b24cb2851d0ae3","last_reissued_at":"2026-07-05T09:48:29.111309Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:48:29.111309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Phase Estimation Algorithm and Distributed Shor's Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daowen Qiu, Le Luo, Ligang Xiao, Paulo Mateus","submitted_at":"2023-04-24T13:52:05Z","abstract_excerpt":"Shor's algorithm is one of the most significant quantum algorithms. Shor's algorithm can factor large integers with a certain success probability in polynomial time. However, Shor's algorithm requires an unbearable amount of qubits in the NISQ (Noisy Intermediate-scale Quantum) era. To reduce the resources required for Shor's algorithm, in this paper we first propose a new distributed phase estimation algorithm. Our distributed phase estimation algorithm does not require quantum communication and it reduces the number of qubits of a single node compared to the traditional phase estimation algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.12100","kind":"arxiv","version":2},"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/2304.12100/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":"2304.12100","created_at":"2026-07-05T09:48:29.111373+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.12100v2","created_at":"2026-07-05T09:48:29.111373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.12100","created_at":"2026-07-05T09:48:29.111373+00:00"},{"alias_kind":"pith_short_12","alias_value":"PVAPER4YLAKV","created_at":"2026-07-05T09:48:29.111373+00:00"},{"alias_kind":"pith_short_16","alias_value":"PVAPER4YLAKV3QCD","created_at":"2026-07-05T09:48:29.111373+00:00"},{"alias_kind":"pith_short_8","alias_value":"PVAPER4Y","created_at":"2026-07-05T09:48:29.111373+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PVAPER4YLAKV3QCDFTA4SKHQUW","json":"https://pith.science/pith/PVAPER4YLAKV3QCDFTA4SKHQUW.json","graph_json":"https://pith.science/api/pith-number/PVAPER4YLAKV3QCDFTA4SKHQUW/graph.json","events_json":"https://pith.science/api/pith-number/PVAPER4YLAKV3QCDFTA4SKHQUW/events.json","paper":"https://pith.science/paper/PVAPER4Y"},"agent_actions":{"view_html":"https://pith.science/pith/PVAPER4YLAKV3QCDFTA4SKHQUW","download_json":"https://pith.science/pith/PVAPER4YLAKV3QCDFTA4SKHQUW.json","view_paper":"https://pith.science/paper/PVAPER4Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.12100&json=true","fetch_graph":"https://pith.science/api/pith-number/PVAPER4YLAKV3QCDFTA4SKHQUW/graph.json","fetch_events":"https://pith.science/api/pith-number/PVAPER4YLAKV3QCDFTA4SKHQUW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PVAPER4YLAKV3QCDFTA4SKHQUW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PVAPER4YLAKV3QCDFTA4SKHQUW/action/storage_attestation","attest_author":"https://pith.science/pith/PVAPER4YLAKV3QCDFTA4SKHQUW/action/author_attestation","sign_citation":"https://pith.science/pith/PVAPER4YLAKV3QCDFTA4SKHQUW/action/citation_signature","submit_replication":"https://pith.science/pith/PVAPER4YLAKV3QCDFTA4SKHQUW/action/replication_record"}},"created_at":"2026-07-05T09:48:29.111373+00:00","updated_at":"2026-07-05T09:48:29.111373+00:00"}