{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CUS6FH46Z5OVM2FBLE43AEQWW4","short_pith_number":"pith:CUS6FH46","schema_version":"1.0","canonical_sha256":"1525e29f9ecf5d5668a15939b01216b7292d4b23d6bcb01b1598069952062aac","source":{"kind":"arxiv","id":"1406.6767","version":1},"attestation_state":"computed","paper":{"title":"An introduction to boson-sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bryan T. Gard, Jonathan P. Dowling, Jonathan P. Olson, Keith R. Motes, Peter P. Rohde","submitted_at":"2014-06-26T04:34:39Z","abstract_excerpt":"Boson-sampling is a simplified model for quantum computing that may hold the key to implementing the first ever post-classical quantum computer. Boson-sampling is a non-universal quantum computer that is significantly more straightforward to build than any universal quantum computer proposed so far. We begin this chapter by motivating boson-sampling and discussing the history of linear optics quantum computing. We then summarize the boson-sampling formalism, discuss what a sampling problem is, explain why boson-sampling is easier than linear optics quantum computing, and discuss the Extended C"},"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":"1406.6767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-06-26T04:34:39Z","cross_cats_sorted":[],"title_canon_sha256":"0f3af8c7d4e07a119903b5f8ba9a972b721e39f37257dfc3dd0e73575d18d1d9","abstract_canon_sha256":"6bfa0a867439c3c42402a9015390f3077301e6f5b2c603224431ffff11d4808b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:38.939197Z","signature_b64":"0x3fuNsGKSiYZKP5jaci1YLr7iF7/2FSJxx+hWfEzMi/eae93kWAxLjCRCI9QeQKJ54pYBfY13VkAAwZQ0q3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1525e29f9ecf5d5668a15939b01216b7292d4b23d6bcb01b1598069952062aac","last_reissued_at":"2026-05-18T01:29:38.938614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:38.938614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An introduction to boson-sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bryan T. Gard, Jonathan P. Dowling, Jonathan P. Olson, Keith R. Motes, Peter P. Rohde","submitted_at":"2014-06-26T04:34:39Z","abstract_excerpt":"Boson-sampling is a simplified model for quantum computing that may hold the key to implementing the first ever post-classical quantum computer. Boson-sampling is a non-universal quantum computer that is significantly more straightforward to build than any universal quantum computer proposed so far. We begin this chapter by motivating boson-sampling and discussing the history of linear optics quantum computing. We then summarize the boson-sampling formalism, discuss what a sampling problem is, explain why boson-sampling is easier than linear optics quantum computing, and discuss the Extended C"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6767","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":"1406.6767","created_at":"2026-05-18T01:29:38.938703+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.6767v1","created_at":"2026-05-18T01:29:38.938703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6767","created_at":"2026-05-18T01:29:38.938703+00:00"},{"alias_kind":"pith_short_12","alias_value":"CUS6FH46Z5OV","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"CUS6FH46Z5OVM2FB","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"CUS6FH46","created_at":"2026-05-18T12:28:25.294606+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/CUS6FH46Z5OVM2FBLE43AEQWW4","json":"https://pith.science/pith/CUS6FH46Z5OVM2FBLE43AEQWW4.json","graph_json":"https://pith.science/api/pith-number/CUS6FH46Z5OVM2FBLE43AEQWW4/graph.json","events_json":"https://pith.science/api/pith-number/CUS6FH46Z5OVM2FBLE43AEQWW4/events.json","paper":"https://pith.science/paper/CUS6FH46"},"agent_actions":{"view_html":"https://pith.science/pith/CUS6FH46Z5OVM2FBLE43AEQWW4","download_json":"https://pith.science/pith/CUS6FH46Z5OVM2FBLE43AEQWW4.json","view_paper":"https://pith.science/paper/CUS6FH46","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.6767&json=true","fetch_graph":"https://pith.science/api/pith-number/CUS6FH46Z5OVM2FBLE43AEQWW4/graph.json","fetch_events":"https://pith.science/api/pith-number/CUS6FH46Z5OVM2FBLE43AEQWW4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CUS6FH46Z5OVM2FBLE43AEQWW4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CUS6FH46Z5OVM2FBLE43AEQWW4/action/storage_attestation","attest_author":"https://pith.science/pith/CUS6FH46Z5OVM2FBLE43AEQWW4/action/author_attestation","sign_citation":"https://pith.science/pith/CUS6FH46Z5OVM2FBLE43AEQWW4/action/citation_signature","submit_replication":"https://pith.science/pith/CUS6FH46Z5OVM2FBLE43AEQWW4/action/replication_record"}},"created_at":"2026-05-18T01:29:38.938703+00:00","updated_at":"2026-05-18T01:29:38.938703+00:00"}