{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:WL7MQKHJ76WOCOU3DGOUEHEJGY","short_pith_number":"pith:WL7MQKHJ","schema_version":"1.0","canonical_sha256":"b2fec828e9fface13a9b199d421c89361d417c3b6c4a00c749f02ca6f3bf2918","source":{"kind":"arxiv","id":"2011.08300","version":2},"attestation_state":"computed","paper":{"title":"Strict hierarchy between parallel, sequential, and indefinite-causal-order strategies for channel discrimination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jessica Bavaresco, Marco T\\'ulio Quintino, Mio Murao","submitted_at":"2020-11-16T21:49:43Z","abstract_excerpt":"We present an instance of a task of minimum-error discrimination of two qubit-qubit quantum channels for which a sequential strategy outperforms any parallel strategy. We then establish two new classes of strategies for channel discrimination that involve indefinite causal order and show that there exists a strict hierarchy among the performance of all four strategies. Our proof technique employs a general method of computer-assisted proofs. We also provide a systematic method for finding pairs of channels that showcase this phenomenon, demonstrating that the hierarchy between the strategies i"},"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":"2011.08300","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-11-16T21:49:43Z","cross_cats_sorted":[],"title_canon_sha256":"af93d37d997547c34c7ffc4de436072a3255901a24e984e488f41dd65e4650d1","abstract_canon_sha256":"5faf005b42e882e06d329b887f1c61b276ed1445cda62751fe06600520a487b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:34:20.698332Z","signature_b64":"jokTYg8p1HfVbTqjCAuZUMypDz6cG2juBXq2D/T8DuHBgRdNbzE47qkIgBtdqfuSnGbu+lHgWtf2VwXpHPkxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2fec828e9fface13a9b199d421c89361d417c3b6c4a00c749f02ca6f3bf2918","last_reissued_at":"2026-07-05T03:34:20.697868Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:34:20.697868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strict hierarchy between parallel, sequential, and indefinite-causal-order strategies for channel discrimination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jessica Bavaresco, Marco T\\'ulio Quintino, Mio Murao","submitted_at":"2020-11-16T21:49:43Z","abstract_excerpt":"We present an instance of a task of minimum-error discrimination of two qubit-qubit quantum channels for which a sequential strategy outperforms any parallel strategy. We then establish two new classes of strategies for channel discrimination that involve indefinite causal order and show that there exists a strict hierarchy among the performance of all four strategies. Our proof technique employs a general method of computer-assisted proofs. We also provide a systematic method for finding pairs of channels that showcase this phenomenon, demonstrating that the hierarchy between the strategies i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.08300","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.08300/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2011.08300","created_at":"2026-07-05T03:34:20.697925+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.08300v2","created_at":"2026-07-05T03:34:20.697925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.08300","created_at":"2026-07-05T03:34:20.697925+00:00"},{"alias_kind":"pith_short_12","alias_value":"WL7MQKHJ76WO","created_at":"2026-07-05T03:34:20.697925+00:00"},{"alias_kind":"pith_short_16","alias_value":"WL7MQKHJ76WOCOU3","created_at":"2026-07-05T03:34:20.697925+00:00"},{"alias_kind":"pith_short_8","alias_value":"WL7MQKHJ","created_at":"2026-07-05T03:34:20.697925+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.31519","citing_title":"Entanglement in quantum channel discrimination: sometimes less is more","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WL7MQKHJ76WOCOU3DGOUEHEJGY","json":"https://pith.science/pith/WL7MQKHJ76WOCOU3DGOUEHEJGY.json","graph_json":"https://pith.science/api/pith-number/WL7MQKHJ76WOCOU3DGOUEHEJGY/graph.json","events_json":"https://pith.science/api/pith-number/WL7MQKHJ76WOCOU3DGOUEHEJGY/events.json","paper":"https://pith.science/paper/WL7MQKHJ"},"agent_actions":{"view_html":"https://pith.science/pith/WL7MQKHJ76WOCOU3DGOUEHEJGY","download_json":"https://pith.science/pith/WL7MQKHJ76WOCOU3DGOUEHEJGY.json","view_paper":"https://pith.science/paper/WL7MQKHJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.08300&json=true","fetch_graph":"https://pith.science/api/pith-number/WL7MQKHJ76WOCOU3DGOUEHEJGY/graph.json","fetch_events":"https://pith.science/api/pith-number/WL7MQKHJ76WOCOU3DGOUEHEJGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WL7MQKHJ76WOCOU3DGOUEHEJGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WL7MQKHJ76WOCOU3DGOUEHEJGY/action/storage_attestation","attest_author":"https://pith.science/pith/WL7MQKHJ76WOCOU3DGOUEHEJGY/action/author_attestation","sign_citation":"https://pith.science/pith/WL7MQKHJ76WOCOU3DGOUEHEJGY/action/citation_signature","submit_replication":"https://pith.science/pith/WL7MQKHJ76WOCOU3DGOUEHEJGY/action/replication_record"}},"created_at":"2026-07-05T03:34:20.697925+00:00","updated_at":"2026-07-05T03:34:20.697925+00:00"}