{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:CESUGKUUYCBAKBIKNCLUJQQS67","short_pith_number":"pith:CESUGKUU","schema_version":"1.0","canonical_sha256":"1125432a94c08205050a689744c212f7e5b68c6453f9256d4c0b60a96e3751fd","source":{"kind":"arxiv","id":"1011.3245","version":1},"attestation_state":"computed","paper":{"title":"The Computational Complexity of Linear Optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Alex Arkhipov, Scott Aaronson","submitted_at":"2010-11-14T18:36:44Z","abstract_excerpt":"We give new evidence that quantum computers -- moreover, rudimentary quantum computers built entirely out of linear-optical elements -- cannot be efficiently simulated by classical computers. In particular, we define a model of computation in which identical photons are generated, sent through a linear-optical network, then nonadaptively measured to count the number of photons in each mode. This model is not known or believed to be universal for quantum computation, and indeed, we discuss the prospects for realizing the model using current technology. On the other hand, we prove that the model"},"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":"1011.3245","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-11-14T18:36:44Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"9edee2e61b865c52696c53b3b3a3f2080d4b8acf92d17d3e69c96b0b79301b19","abstract_canon_sha256":"94a75cd3016c05d9b3d548e3e18e1a07575e51027ab00d114f639e28a21f6ae9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:56.273983Z","signature_b64":"/iLbftyV0NR0By95WG0ZpDfQPhIzujxtg37zbmSiKPuBdoTiyVv+9UAxCfx7b1sS3xGB0ErIgl8ZwD8IaCykCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1125432a94c08205050a689744c212f7e5b68c6453f9256d4c0b60a96e3751fd","last_reissued_at":"2026-05-18T04:35:56.273592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:56.273592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Computational Complexity of Linear Optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Alex Arkhipov, Scott Aaronson","submitted_at":"2010-11-14T18:36:44Z","abstract_excerpt":"We give new evidence that quantum computers -- moreover, rudimentary quantum computers built entirely out of linear-optical elements -- cannot be efficiently simulated by classical computers. In particular, we define a model of computation in which identical photons are generated, sent through a linear-optical network, then nonadaptively measured to count the number of photons in each mode. This model is not known or believed to be universal for quantum computation, and indeed, we discuss the prospects for realizing the model using current technology. On the other hand, we prove that the model"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3245","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":"1011.3245","created_at":"2026-05-18T04:35:56.273653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.3245v1","created_at":"2026-05-18T04:35:56.273653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3245","created_at":"2026-05-18T04:35:56.273653+00:00"},{"alias_kind":"pith_short_12","alias_value":"CESUGKUUYCBA","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CESUGKUUYCBAKBIK","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CESUGKUU","created_at":"2026-05-18T12:26:05.355336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"1907.08224","citing_title":"The one clean qubit model without entanglement is classically simulable","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2410.23721","citing_title":"Assessing non-Gaussian quantum state conversion with the stellar rank","ref_index":59,"is_internal_anchor":true},{"citing_arxiv_id":"2502.01737","citing_title":"Heisenberg picture tensor network formalism for optical circuits","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2506.03435","citing_title":"Computational Complexity and Simulability of Non-Hermitian Quantum Dynamics","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2604.12330","citing_title":"Gaussian boson sampling: Benchmarking quantum advantage","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20180","citing_title":"Tensor network surrogate models for variational quantum computation","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CESUGKUUYCBAKBIKNCLUJQQS67","json":"https://pith.science/pith/CESUGKUUYCBAKBIKNCLUJQQS67.json","graph_json":"https://pith.science/api/pith-number/CESUGKUUYCBAKBIKNCLUJQQS67/graph.json","events_json":"https://pith.science/api/pith-number/CESUGKUUYCBAKBIKNCLUJQQS67/events.json","paper":"https://pith.science/paper/CESUGKUU"},"agent_actions":{"view_html":"https://pith.science/pith/CESUGKUUYCBAKBIKNCLUJQQS67","download_json":"https://pith.science/pith/CESUGKUUYCBAKBIKNCLUJQQS67.json","view_paper":"https://pith.science/paper/CESUGKUU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.3245&json=true","fetch_graph":"https://pith.science/api/pith-number/CESUGKUUYCBAKBIKNCLUJQQS67/graph.json","fetch_events":"https://pith.science/api/pith-number/CESUGKUUYCBAKBIKNCLUJQQS67/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CESUGKUUYCBAKBIKNCLUJQQS67/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CESUGKUUYCBAKBIKNCLUJQQS67/action/storage_attestation","attest_author":"https://pith.science/pith/CESUGKUUYCBAKBIKNCLUJQQS67/action/author_attestation","sign_citation":"https://pith.science/pith/CESUGKUUYCBAKBIKNCLUJQQS67/action/citation_signature","submit_replication":"https://pith.science/pith/CESUGKUUYCBAKBIKNCLUJQQS67/action/replication_record"}},"created_at":"2026-05-18T04:35:56.273653+00:00","updated_at":"2026-05-18T04:35:56.273653+00:00"}