{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:Z45HFVR6KT6XOGDKX4L3H5SJCO","short_pith_number":"pith:Z45HFVR6","schema_version":"1.0","canonical_sha256":"cf3a72d63e54fd77186abf17b3f64913b139dda010dfd24fffca297ba4e144ea","source":{"kind":"arxiv","id":"1112.2184","version":1},"attestation_state":"computed","paper":{"title":"Classical simulation of dissipative fermionic linear optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Robert Koenig, Sergey Bravyi","submitted_at":"2011-12-09T19:06:38Z","abstract_excerpt":"Fermionic linear optics is a limited form of quantum computation which is known to be efficiently simulable on a classical computer. We revisit and extend this result by enlarging the set of available computational gates: in addition to unitaries and measurements, we allow dissipative evolution governed by a Markovian master equation with linear Lindblad operators. We show that this more general form of fermionic computation is also simulable efficiently by classical means. Given a system of $N$ fermionic modes, our algorithm simulates any such gate in time $O(N^3)$ while a single-mode measure"},"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":"1112.2184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-09T19:06:38Z","cross_cats_sorted":[],"title_canon_sha256":"7b7f3547ef0a10ed4c1fc82c5b8cadfa2582d408579e7cc9e48e743a22c73f1d","abstract_canon_sha256":"776307d2862fff9cffd19e5b2d2e3e806ffcdfc58dbf284f4f6de3033fca5be2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:33.698830Z","signature_b64":"Tf4sgdE9yXMFf6MlmoTcRxz3La7g4R2h8Y0TU+Fcgq1k6Qj5tP9lFc6JJgIInLC8zmAQE5PRTAsgRuG9QJ1gDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf3a72d63e54fd77186abf17b3f64913b139dda010dfd24fffca297ba4e144ea","last_reissued_at":"2026-05-18T03:11:33.698344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:33.698344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classical simulation of dissipative fermionic linear optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Robert Koenig, Sergey Bravyi","submitted_at":"2011-12-09T19:06:38Z","abstract_excerpt":"Fermionic linear optics is a limited form of quantum computation which is known to be efficiently simulable on a classical computer. We revisit and extend this result by enlarging the set of available computational gates: in addition to unitaries and measurements, we allow dissipative evolution governed by a Markovian master equation with linear Lindblad operators. We show that this more general form of fermionic computation is also simulable efficiently by classical means. Given a system of $N$ fermionic modes, our algorithm simulates any such gate in time $O(N^3)$ while a single-mode measure"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2184","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":"1112.2184","created_at":"2026-05-18T03:11:33.698414+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.2184v1","created_at":"2026-05-18T03:11:33.698414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2184","created_at":"2026-05-18T03:11:33.698414+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z45HFVR6KT6X","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z45HFVR6KT6XOGDK","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z45HFVR6","created_at":"2026-05-18T12:26:47.523578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.04689","citing_title":"Probabilistic quantum algorithm for Lyapunov equations and matrix inversion","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z45HFVR6KT6XOGDKX4L3H5SJCO","json":"https://pith.science/pith/Z45HFVR6KT6XOGDKX4L3H5SJCO.json","graph_json":"https://pith.science/api/pith-number/Z45HFVR6KT6XOGDKX4L3H5SJCO/graph.json","events_json":"https://pith.science/api/pith-number/Z45HFVR6KT6XOGDKX4L3H5SJCO/events.json","paper":"https://pith.science/paper/Z45HFVR6"},"agent_actions":{"view_html":"https://pith.science/pith/Z45HFVR6KT6XOGDKX4L3H5SJCO","download_json":"https://pith.science/pith/Z45HFVR6KT6XOGDKX4L3H5SJCO.json","view_paper":"https://pith.science/paper/Z45HFVR6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.2184&json=true","fetch_graph":"https://pith.science/api/pith-number/Z45HFVR6KT6XOGDKX4L3H5SJCO/graph.json","fetch_events":"https://pith.science/api/pith-number/Z45HFVR6KT6XOGDKX4L3H5SJCO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z45HFVR6KT6XOGDKX4L3H5SJCO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z45HFVR6KT6XOGDKX4L3H5SJCO/action/storage_attestation","attest_author":"https://pith.science/pith/Z45HFVR6KT6XOGDKX4L3H5SJCO/action/author_attestation","sign_citation":"https://pith.science/pith/Z45HFVR6KT6XOGDKX4L3H5SJCO/action/citation_signature","submit_replication":"https://pith.science/pith/Z45HFVR6KT6XOGDKX4L3H5SJCO/action/replication_record"}},"created_at":"2026-05-18T03:11:33.698414+00:00","updated_at":"2026-05-18T03:11:33.698414+00:00"}