{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:BZXUZSAUFC32YF46NPZ2KGVMVD","short_pith_number":"pith:BZXUZSAU","schema_version":"1.0","canonical_sha256":"0e6f4cc81428b7ac179e6bf3a51aaca8d4b5792e29e6289e87e704c87a124617","source":{"kind":"arxiv","id":"1109.5987","version":2},"attestation_state":"computed","paper":{"title":"Quantum computation with programmable connections between gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Giacomo Mauro D'Ariano, Paolo Perinotti, Stefano Facchini, Timoteo Colnaghi","submitted_at":"2011-09-27T18:42:55Z","abstract_excerpt":"A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e. g. in achieving the programmability of permutations of N different unitary channels with 1 use instead of N uses per channel. For this task, a new elemental resource is needed, the \"quantum switch\", which can be programmed to switch the order of two channels with a single use of each one."},"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":"1109.5987","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-09-27T18:42:55Z","cross_cats_sorted":[],"title_canon_sha256":"64b84cff751ee1e6332b161ecd97cf0b808c7bfcc418f04710515aaae312502f","abstract_canon_sha256":"1155d85ed2dd175d9b6d9e19e4410a11b463a98a1351fabed6b514eadd296552"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:04.387774Z","signature_b64":"BNYMJsRJwEohAEntvToQfGciO0aCXIhcDpqW9tZCxPDP2Q0nhKKWYr4dK79LHn3BnlXZWopTejALhEIV9/YYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e6f4cc81428b7ac179e6bf3a51aaca8d4b5792e29e6289e87e704c87a124617","last_reissued_at":"2026-05-18T03:25:04.387186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:04.387186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum computation with programmable connections between gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Giacomo Mauro D'Ariano, Paolo Perinotti, Stefano Facchini, Timoteo Colnaghi","submitted_at":"2011-09-27T18:42:55Z","abstract_excerpt":"A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e. g. in achieving the programmability of permutations of N different unitary channels with 1 use instead of N uses per channel. For this task, a new elemental resource is needed, the \"quantum switch\", which can be programmed to switch the order of two channels with a single use of each one."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5987","kind":"arxiv","version":2},"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":"1109.5987","created_at":"2026-05-18T03:25:04.387260+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.5987v2","created_at":"2026-05-18T03:25:04.387260+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5987","created_at":"2026-05-18T03:25:04.387260+00:00"},{"alias_kind":"pith_short_12","alias_value":"BZXUZSAUFC32","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BZXUZSAUFC32YF46","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BZXUZSAU","created_at":"2026-05-18T12:26:24.575870+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/BZXUZSAUFC32YF46NPZ2KGVMVD","json":"https://pith.science/pith/BZXUZSAUFC32YF46NPZ2KGVMVD.json","graph_json":"https://pith.science/api/pith-number/BZXUZSAUFC32YF46NPZ2KGVMVD/graph.json","events_json":"https://pith.science/api/pith-number/BZXUZSAUFC32YF46NPZ2KGVMVD/events.json","paper":"https://pith.science/paper/BZXUZSAU"},"agent_actions":{"view_html":"https://pith.science/pith/BZXUZSAUFC32YF46NPZ2KGVMVD","download_json":"https://pith.science/pith/BZXUZSAUFC32YF46NPZ2KGVMVD.json","view_paper":"https://pith.science/paper/BZXUZSAU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.5987&json=true","fetch_graph":"https://pith.science/api/pith-number/BZXUZSAUFC32YF46NPZ2KGVMVD/graph.json","fetch_events":"https://pith.science/api/pith-number/BZXUZSAUFC32YF46NPZ2KGVMVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BZXUZSAUFC32YF46NPZ2KGVMVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BZXUZSAUFC32YF46NPZ2KGVMVD/action/storage_attestation","attest_author":"https://pith.science/pith/BZXUZSAUFC32YF46NPZ2KGVMVD/action/author_attestation","sign_citation":"https://pith.science/pith/BZXUZSAUFC32YF46NPZ2KGVMVD/action/citation_signature","submit_replication":"https://pith.science/pith/BZXUZSAUFC32YF46NPZ2KGVMVD/action/replication_record"}},"created_at":"2026-05-18T03:25:04.387260+00:00","updated_at":"2026-05-18T03:25:04.387260+00:00"}