{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DU34QOHLRQ6NGEIIZIQZY6AJLP","short_pith_number":"pith:DU34QOHL","canonical_record":{"source":{"id":"1306.0719","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-06-04T10:13:01Z","cross_cats_sorted":[],"title_canon_sha256":"8884da12a4fcb451964e348730365a1f06fc4673b922c46c7902849c086ef007","abstract_canon_sha256":"1874cc21a026400fda015fa06e62ae7e5b636d81ce7efc60bf9a52d90c0aa899"},"schema_version":"1.0"},"canonical_sha256":"1d37c838eb8c3cd31108ca219c78095bc0eaebf9bbbedb3b5fa97602fb6c1b5e","source":{"kind":"arxiv","id":"1306.0719","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0719","created_at":"2026-05-18T02:43:00Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0719v5","created_at":"2026-05-18T02:43:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0719","created_at":"2026-05-18T02:43:00Z"},{"alias_kind":"pith_short_12","alias_value":"DU34QOHLRQ6N","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DU34QOHLRQ6NGEII","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DU34QOHL","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DU34QOHLRQ6NGEIIZIQZY6AJLP","target":"record","payload":{"canonical_record":{"source":{"id":"1306.0719","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-06-04T10:13:01Z","cross_cats_sorted":[],"title_canon_sha256":"8884da12a4fcb451964e348730365a1f06fc4673b922c46c7902849c086ef007","abstract_canon_sha256":"1874cc21a026400fda015fa06e62ae7e5b636d81ce7efc60bf9a52d90c0aa899"},"schema_version":"1.0"},"canonical_sha256":"1d37c838eb8c3cd31108ca219c78095bc0eaebf9bbbedb3b5fa97602fb6c1b5e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:00.819003Z","signature_b64":"L4uw//OngT8z86VJYt8Dnuu1LvHbEz3mfTfwOMfWhHMREn1p7ZwUuhQUdMPpQdleCZKm65Hno7ddmXJeTsItDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d37c838eb8c3cd31108ca219c78095bc0eaebf9bbbedb3b5fa97602fb6c1b5e","last_reissued_at":"2026-05-18T02:43:00.818564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:00.818564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.0719","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7kd/r2iz3KZC8+q6OYYOZhjbORipkGpmEu29iFtWbpG4cRkoIp54dGCgWu3mJSw1ABjBciWnz2AfUGDnUeAZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:45:29.811705Z"},"content_sha256":"da14f9e1a677daa8bb2f3ac38909ab7072e775209447ae6237541ee16e49cb6a","schema_version":"1.0","event_id":"sha256:da14f9e1a677daa8bb2f3ac38909ab7072e775209447ae6237541ee16e49cb6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DU34QOHLRQ6NGEIIZIQZY6AJLP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Identification of a reversible quantum gate: assessing the resources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Giacomo Mauro D'Ariano, Giulio Chiribella, Martin Roetteler","submitted_at":"2013-06-04T10:13:01Z","abstract_excerpt":"We assess the resources needed to identify a reversible quantum gate among a finite set of alternatives, including in our analysis both deterministic and probabilistic strategies. Among the probabilistic strategies we consider unambiguous gate discrimination, where errors are not tolerated but inconclusive outcomes are allowed, and we prove that parallel strategies are sufficient to unambiguously identify the unknown gate with minimum number of queries. This result is used to provide upper and lower bounds on the query complexity and on the minimum ancilla dimension. In addition, we introduce "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0719","kind":"arxiv","version":5},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fUiz+vPgfV42oIG4bl59foVlholPLmXGk0AtbL3upyJX4nWTV9eeVPkRVLQ8R9xFVZXNFNeyGZ9dig+iSWtiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:45:29.812400Z"},"content_sha256":"62e02e043415fdc707578048fec343acc0650a51589aaff450b59feb84e69b56","schema_version":"1.0","event_id":"sha256:62e02e043415fdc707578048fec343acc0650a51589aaff450b59feb84e69b56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DU34QOHLRQ6NGEIIZIQZY6AJLP/bundle.json","state_url":"https://pith.science/pith/DU34QOHLRQ6NGEIIZIQZY6AJLP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DU34QOHLRQ6NGEIIZIQZY6AJLP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T16:45:29Z","links":{"resolver":"https://pith.science/pith/DU34QOHLRQ6NGEIIZIQZY6AJLP","bundle":"https://pith.science/pith/DU34QOHLRQ6NGEIIZIQZY6AJLP/bundle.json","state":"https://pith.science/pith/DU34QOHLRQ6NGEIIZIQZY6AJLP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DU34QOHLRQ6NGEIIZIQZY6AJLP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DU34QOHLRQ6NGEIIZIQZY6AJLP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1874cc21a026400fda015fa06e62ae7e5b636d81ce7efc60bf9a52d90c0aa899","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-06-04T10:13:01Z","title_canon_sha256":"8884da12a4fcb451964e348730365a1f06fc4673b922c46c7902849c086ef007"},"schema_version":"1.0","source":{"id":"1306.0719","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0719","created_at":"2026-05-18T02:43:00Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0719v5","created_at":"2026-05-18T02:43:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0719","created_at":"2026-05-18T02:43:00Z"},{"alias_kind":"pith_short_12","alias_value":"DU34QOHLRQ6N","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DU34QOHLRQ6NGEII","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DU34QOHL","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:62e02e043415fdc707578048fec343acc0650a51589aaff450b59feb84e69b56","target":"graph","created_at":"2026-05-18T02:43:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We assess the resources needed to identify a reversible quantum gate among a finite set of alternatives, including in our analysis both deterministic and probabilistic strategies. Among the probabilistic strategies we consider unambiguous gate discrimination, where errors are not tolerated but inconclusive outcomes are allowed, and we prove that parallel strategies are sufficient to unambiguously identify the unknown gate with minimum number of queries. This result is used to provide upper and lower bounds on the query complexity and on the minimum ancilla dimension. In addition, we introduce ","authors_text":"Giacomo Mauro D'Ariano, Giulio Chiribella, Martin Roetteler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-06-04T10:13:01Z","title":"Identification of a reversible quantum gate: assessing the resources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0719","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:da14f9e1a677daa8bb2f3ac38909ab7072e775209447ae6237541ee16e49cb6a","target":"record","created_at":"2026-05-18T02:43:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1874cc21a026400fda015fa06e62ae7e5b636d81ce7efc60bf9a52d90c0aa899","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-06-04T10:13:01Z","title_canon_sha256":"8884da12a4fcb451964e348730365a1f06fc4673b922c46c7902849c086ef007"},"schema_version":"1.0","source":{"id":"1306.0719","kind":"arxiv","version":5}},"canonical_sha256":"1d37c838eb8c3cd31108ca219c78095bc0eaebf9bbbedb3b5fa97602fb6c1b5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d37c838eb8c3cd31108ca219c78095bc0eaebf9bbbedb3b5fa97602fb6c1b5e","first_computed_at":"2026-05-18T02:43:00.818564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:00.818564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L4uw//OngT8z86VJYt8Dnuu1LvHbEz3mfTfwOMfWhHMREn1p7ZwUuhQUdMPpQdleCZKm65Hno7ddmXJeTsItDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:00.819003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.0719","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da14f9e1a677daa8bb2f3ac38909ab7072e775209447ae6237541ee16e49cb6a","sha256:62e02e043415fdc707578048fec343acc0650a51589aaff450b59feb84e69b56"],"state_sha256":"8fad73e5554922f0ad659676c8d4d09c1487948238588d55a3bf7b90cf2c920c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pkjrkP7di+pF75ihAVxZGdlwzQQ4XRwW0GeMZc0wV3ARvNqQ0D1R1TJpIZ5q68zytXUqg7pEODDQ7EBUYJHIDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:45:29.815997Z","bundle_sha256":"d651910b68417cc6715a4692d996a0f26cfd9481ea4fa1ae167fe70624771a7b"}}