{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:P3NWVBBGL7NKWPTY3PY4BE3ZKL","short_pith_number":"pith:P3NWVBBG","schema_version":"1.0","canonical_sha256":"7edb6a84265fdaab3e78dbf1c0937952d366daab57d799e1f10d1fc700057158","source":{"kind":"arxiv","id":"1807.02023","version":1},"attestation_state":"computed","paper":{"title":"Quantum circuits for floating-point arithmetic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Krysta M. Svore, Martin Roetteler, Mathias Soeken, Thomas H\\\"aner","submitted_at":"2018-07-05T14:31:51Z","abstract_excerpt":"Quantum algorithms to solve practical problems in quantum chemistry, materials science, and matrix inversion often involve a significant amount of arithmetic operations which act on a superposition of inputs. These have to be compiled to a set of fault-tolerant low-level operations and throughout this translation process, the compiler aims to come close to the Pareto-optimal front between the number of required qubits and the depth of the resulting circuit. In this paper, we provide quantum circuits for floating-point addition and multiplication which we find using two vastly different approac"},"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":"1807.02023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-07-05T14:31:51Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"f4c39af96599fffc7a891c26ff12807959f7183d9144bada6b150f65eb9adf61","abstract_canon_sha256":"bca19d38b7c917d67fd69cab5fe1ddb1d256f6756ab0c48d763a559d7c85f11f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:24.431210Z","signature_b64":"SLOpaU+TkzgwbyAbgq00EmYnzCnMBigOgXpXSMxUPzH5T0guUR4SBhVEioQ/e1FdCK7DcbneTJTGoEZOx85FAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7edb6a84265fdaab3e78dbf1c0937952d366daab57d799e1f10d1fc700057158","last_reissued_at":"2026-05-18T00:11:24.430545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:24.430545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum circuits for floating-point arithmetic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Krysta M. Svore, Martin Roetteler, Mathias Soeken, Thomas H\\\"aner","submitted_at":"2018-07-05T14:31:51Z","abstract_excerpt":"Quantum algorithms to solve practical problems in quantum chemistry, materials science, and matrix inversion often involve a significant amount of arithmetic operations which act on a superposition of inputs. These have to be compiled to a set of fault-tolerant low-level operations and throughout this translation process, the compiler aims to come close to the Pareto-optimal front between the number of required qubits and the depth of the resulting circuit. In this paper, we provide quantum circuits for floating-point addition and multiplication which we find using two vastly different approac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02023","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":"1807.02023","created_at":"2026-05-18T00:11:24.430658+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.02023v1","created_at":"2026-05-18T00:11:24.430658+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02023","created_at":"2026-05-18T00:11:24.430658+00:00"},{"alias_kind":"pith_short_12","alias_value":"P3NWVBBGL7NK","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"P3NWVBBGL7NKWPTY","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"P3NWVBBG","created_at":"2026-05-18T12:32:43.782077+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/P3NWVBBGL7NKWPTY3PY4BE3ZKL","json":"https://pith.science/pith/P3NWVBBGL7NKWPTY3PY4BE3ZKL.json","graph_json":"https://pith.science/api/pith-number/P3NWVBBGL7NKWPTY3PY4BE3ZKL/graph.json","events_json":"https://pith.science/api/pith-number/P3NWVBBGL7NKWPTY3PY4BE3ZKL/events.json","paper":"https://pith.science/paper/P3NWVBBG"},"agent_actions":{"view_html":"https://pith.science/pith/P3NWVBBGL7NKWPTY3PY4BE3ZKL","download_json":"https://pith.science/pith/P3NWVBBGL7NKWPTY3PY4BE3ZKL.json","view_paper":"https://pith.science/paper/P3NWVBBG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.02023&json=true","fetch_graph":"https://pith.science/api/pith-number/P3NWVBBGL7NKWPTY3PY4BE3ZKL/graph.json","fetch_events":"https://pith.science/api/pith-number/P3NWVBBGL7NKWPTY3PY4BE3ZKL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P3NWVBBGL7NKWPTY3PY4BE3ZKL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P3NWVBBGL7NKWPTY3PY4BE3ZKL/action/storage_attestation","attest_author":"https://pith.science/pith/P3NWVBBGL7NKWPTY3PY4BE3ZKL/action/author_attestation","sign_citation":"https://pith.science/pith/P3NWVBBGL7NKWPTY3PY4BE3ZKL/action/citation_signature","submit_replication":"https://pith.science/pith/P3NWVBBGL7NKWPTY3PY4BE3ZKL/action/replication_record"}},"created_at":"2026-05-18T00:11:24.430658+00:00","updated_at":"2026-05-18T00:11:24.430658+00:00"}