{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:GK7N55ID2BKS6L33TFNKPDF5T7","short_pith_number":"pith:GK7N55ID","schema_version":"1.0","canonical_sha256":"32bedef503d0552f2f7b995aa78cbd9ff5c288f84d452e254cda4f77290da61f","source":{"kind":"arxiv","id":"quant-ph/0212096","version":1},"attestation_state":"computed","paper":{"title":"A common algebraic description for probabilistic and quantum computations","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jose M. Fernandez, Markus Holzer, Martin Beaudry","submitted_at":"2002-12-16T22:37:51Z","abstract_excerpt":"We study the computational complexity of the problem SFT (Sum-free Formula partial Trace): given a tensor formula F over a subsemiring of the complex field (C,+,.) plus a positive integer k, under the restrictions that all inputs are column vectors of L2-norm 1 and norm-preserving square matrices, and that the output matrix is a column vector, decide whether the k-partial trace of $F\\dagg{F}$ is superior to 1/2. The k-partial trace of a matrix is the sum of its lowermost k diagonal elements. We also consider the promise version of this problem, where the 1/2 threshold is an isolated cutpoint. "},"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":"quant-ph/0212096","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-12-16T22:37:51Z","cross_cats_sorted":[],"title_canon_sha256":"c47e49fa0f95b2631d5576b3e426ec70dfed5353595cb8f9769569b367fac1d8","abstract_canon_sha256":"e8cc6676cdee6ec0b6a32e447035cbb64625b630e320ca6670c1fd69f7ca4814"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:04.207363Z","signature_b64":"QraqJ6E5+mwe+8peaHDV9yU9S2CSfIgFgnwwkZke7j46H0ow35vpnILandZzwgjp9Yjvqwzlhth/zco+5PisBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32bedef503d0552f2f7b995aa78cbd9ff5c288f84d452e254cda4f77290da61f","last_reissued_at":"2026-05-18T01:05:04.206688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:04.206688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A common algebraic description for probabilistic and quantum computations","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jose M. Fernandez, Markus Holzer, Martin Beaudry","submitted_at":"2002-12-16T22:37:51Z","abstract_excerpt":"We study the computational complexity of the problem SFT (Sum-free Formula partial Trace): given a tensor formula F over a subsemiring of the complex field (C,+,.) plus a positive integer k, under the restrictions that all inputs are column vectors of L2-norm 1 and norm-preserving square matrices, and that the output matrix is a column vector, decide whether the k-partial trace of $F\\dagg{F}$ is superior to 1/2. The k-partial trace of a matrix is the sum of its lowermost k diagonal elements. We also consider the promise version of this problem, where the 1/2 threshold is an isolated cutpoint. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0212096","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":"quant-ph/0212096","created_at":"2026-05-18T01:05:04.206787+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0212096v1","created_at":"2026-05-18T01:05:04.206787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0212096","created_at":"2026-05-18T01:05:04.206787+00:00"},{"alias_kind":"pith_short_12","alias_value":"GK7N55ID2BKS","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_16","alias_value":"GK7N55ID2BKS6L33","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_8","alias_value":"GK7N55ID","created_at":"2026-05-18T12:25:50.845339+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/GK7N55ID2BKS6L33TFNKPDF5T7","json":"https://pith.science/pith/GK7N55ID2BKS6L33TFNKPDF5T7.json","graph_json":"https://pith.science/api/pith-number/GK7N55ID2BKS6L33TFNKPDF5T7/graph.json","events_json":"https://pith.science/api/pith-number/GK7N55ID2BKS6L33TFNKPDF5T7/events.json","paper":"https://pith.science/paper/GK7N55ID"},"agent_actions":{"view_html":"https://pith.science/pith/GK7N55ID2BKS6L33TFNKPDF5T7","download_json":"https://pith.science/pith/GK7N55ID2BKS6L33TFNKPDF5T7.json","view_paper":"https://pith.science/paper/GK7N55ID","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0212096&json=true","fetch_graph":"https://pith.science/api/pith-number/GK7N55ID2BKS6L33TFNKPDF5T7/graph.json","fetch_events":"https://pith.science/api/pith-number/GK7N55ID2BKS6L33TFNKPDF5T7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GK7N55ID2BKS6L33TFNKPDF5T7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GK7N55ID2BKS6L33TFNKPDF5T7/action/storage_attestation","attest_author":"https://pith.science/pith/GK7N55ID2BKS6L33TFNKPDF5T7/action/author_attestation","sign_citation":"https://pith.science/pith/GK7N55ID2BKS6L33TFNKPDF5T7/action/citation_signature","submit_replication":"https://pith.science/pith/GK7N55ID2BKS6L33TFNKPDF5T7/action/replication_record"}},"created_at":"2026-05-18T01:05:04.206787+00:00","updated_at":"2026-05-18T01:05:04.206787+00:00"}