{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3XRJ4LW274GQJRRR7CZB2FF4RS","short_pith_number":"pith:3XRJ4LW2","schema_version":"1.0","canonical_sha256":"dde29e2edaff0d04c631f8b21d14bc8c9aa37c981533e29d14311d41217e93ec","source":{"kind":"arxiv","id":"1808.08927","version":1},"attestation_state":"computed","paper":{"title":"Variational Quantum Factoring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Al\\'an Aspuru-Guzik, Eric R. Anschuetz, Jonathan P. Olson, Yudong Cao","submitted_at":"2018-08-27T16:58:40Z","abstract_excerpt":"Integer factorization has been one of the cornerstone applications of the field of quantum computing since the discovery of an efficient algorithm for factoring by Peter Shor. Unfortunately, factoring via Shor's algorithm is well beyond the capabilities of today's noisy intermediate-scale quantum (NISQ) devices. In this work, we revisit the problem of factoring, developing an alternative to Shor's algorithm, which employs established techniques to map the factoring problem to the ground state of an Ising Hamiltonian. The proposed variational quantum factoring (VQF) algorithm starts by simplify"},"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":"1808.08927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-08-27T16:58:40Z","cross_cats_sorted":[],"title_canon_sha256":"82c8ea5889462127db6fd3b2abc42cb6c2fb63ad5b9b113d7fd112b002ba1152","abstract_canon_sha256":"4c6e94111a39aca03286d47b9444cd66be90892b9f8079bca66bdc8311ccd71f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:12.808893Z","signature_b64":"A2mqez7y5k7YyO/UZB1oHo2KzmmF4u9RJHSXHDZ6VPu7i9Cs9xLp1Uthg5y1JzOpC4Yv2mm0ZYRF72uZai84CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dde29e2edaff0d04c631f8b21d14bc8c9aa37c981533e29d14311d41217e93ec","last_reissued_at":"2026-05-18T00:07:12.808074Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:12.808074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variational Quantum Factoring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Al\\'an Aspuru-Guzik, Eric R. Anschuetz, Jonathan P. Olson, Yudong Cao","submitted_at":"2018-08-27T16:58:40Z","abstract_excerpt":"Integer factorization has been one of the cornerstone applications of the field of quantum computing since the discovery of an efficient algorithm for factoring by Peter Shor. Unfortunately, factoring via Shor's algorithm is well beyond the capabilities of today's noisy intermediate-scale quantum (NISQ) devices. In this work, we revisit the problem of factoring, developing an alternative to Shor's algorithm, which employs established techniques to map the factoring problem to the ground state of an Ising Hamiltonian. The proposed variational quantum factoring (VQF) algorithm starts by simplify"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08927","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":""},"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":"1808.08927","created_at":"2026-05-18T00:07:12.808200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.08927v1","created_at":"2026-05-18T00:07:12.808200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08927","created_at":"2026-05-18T00:07:12.808200+00:00"},{"alias_kind":"pith_short_12","alias_value":"3XRJ4LW274GQ","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"3XRJ4LW274GQJRRR","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"3XRJ4LW2","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2312.10054","citing_title":"Efficient Quantum Oracle for Solving Bilinear Diophantine Equations on Digital Quantum Computers","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"1811.04968","citing_title":"PennyLane: Automatic differentiation of hybrid quantum-classical computations","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3XRJ4LW274GQJRRR7CZB2FF4RS","json":"https://pith.science/pith/3XRJ4LW274GQJRRR7CZB2FF4RS.json","graph_json":"https://pith.science/api/pith-number/3XRJ4LW274GQJRRR7CZB2FF4RS/graph.json","events_json":"https://pith.science/api/pith-number/3XRJ4LW274GQJRRR7CZB2FF4RS/events.json","paper":"https://pith.science/paper/3XRJ4LW2"},"agent_actions":{"view_html":"https://pith.science/pith/3XRJ4LW274GQJRRR7CZB2FF4RS","download_json":"https://pith.science/pith/3XRJ4LW274GQJRRR7CZB2FF4RS.json","view_paper":"https://pith.science/paper/3XRJ4LW2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.08927&json=true","fetch_graph":"https://pith.science/api/pith-number/3XRJ4LW274GQJRRR7CZB2FF4RS/graph.json","fetch_events":"https://pith.science/api/pith-number/3XRJ4LW274GQJRRR7CZB2FF4RS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3XRJ4LW274GQJRRR7CZB2FF4RS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3XRJ4LW274GQJRRR7CZB2FF4RS/action/storage_attestation","attest_author":"https://pith.science/pith/3XRJ4LW274GQJRRR7CZB2FF4RS/action/author_attestation","sign_citation":"https://pith.science/pith/3XRJ4LW274GQJRRR7CZB2FF4RS/action/citation_signature","submit_replication":"https://pith.science/pith/3XRJ4LW274GQJRRR7CZB2FF4RS/action/replication_record"}},"created_at":"2026-05-18T00:07:12.808200+00:00","updated_at":"2026-05-18T00:07:12.808200+00:00"}