{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:3MGOKGCDCC5NWQTYGYWJOY7OE5","short_pith_number":"pith:3MGOKGCD","schema_version":"1.0","canonical_sha256":"db0ce5184310badb4278362c9763ee277d1a9b555ae6ec0eca435ce6eed55204","source":{"kind":"arxiv","id":"2108.08406","version":4},"attestation_state":"computed","paper":{"title":"Estimating distinguishability measures on quantum computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Kunal Sharma, Mark M. Wilde, Rochisha Agarwal, Soorya Rethinasamy","submitted_at":"2021-08-18T22:32:31Z","abstract_excerpt":"The performance of a quantum information processing protocol is ultimately judged by distinguishability measures that quantify how distinguishable the actual result of the protocol is from the ideal case. The most prominent distinguishability measures are those based on the fidelity and trace distance, due to their physical interpretations. In this paper, we propose and review several algorithms for estimating distinguishability measures based on trace distance and fidelity. The algorithms can be used for distinguishing quantum states, channels, and strategies (the last also known in the liter"},"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":"2108.08406","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-08-18T22:32:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7978872cef1ea0a723d8ebd8725a74c004d6234e8bd3fa10a68d6497380cbe00","abstract_canon_sha256":"c3e4f8bd31cd574510e847e1edb155230ac944f8d81023c5cc1daeed91051003"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:30:17.910711Z","signature_b64":"INDs6WS+7WjMm/hTpKvtSKsFHwVGNWURc2xaz66JGp3uPF3olnsbtTflQhN9B4OLneJCQuBYcDlKRqFJ0RZ1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db0ce5184310badb4278362c9763ee277d1a9b555ae6ec0eca435ce6eed55204","last_reissued_at":"2026-07-05T06:30:17.910194Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:30:17.910194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimating distinguishability measures on quantum computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Kunal Sharma, Mark M. Wilde, Rochisha Agarwal, Soorya Rethinasamy","submitted_at":"2021-08-18T22:32:31Z","abstract_excerpt":"The performance of a quantum information processing protocol is ultimately judged by distinguishability measures that quantify how distinguishable the actual result of the protocol is from the ideal case. The most prominent distinguishability measures are those based on the fidelity and trace distance, due to their physical interpretations. In this paper, we propose and review several algorithms for estimating distinguishability measures based on trace distance and fidelity. The algorithms can be used for distinguishing quantum states, channels, and strategies (the last also known in the liter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.08406","kind":"arxiv","version":4},"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/2108.08406/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":"2108.08406","created_at":"2026-07-05T06:30:17.910258+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.08406v4","created_at":"2026-07-05T06:30:17.910258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.08406","created_at":"2026-07-05T06:30:17.910258+00:00"},{"alias_kind":"pith_short_12","alias_value":"3MGOKGCDCC5N","created_at":"2026-07-05T06:30:17.910258+00:00"},{"alias_kind":"pith_short_16","alias_value":"3MGOKGCDCC5NWQTY","created_at":"2026-07-05T06:30:17.910258+00:00"},{"alias_kind":"pith_short_8","alias_value":"3MGOKGCD","created_at":"2026-07-05T06:30:17.910258+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.28927","citing_title":"Quantum encodings that preserve persistent homology","ref_index":69,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3MGOKGCDCC5NWQTYGYWJOY7OE5","json":"https://pith.science/pith/3MGOKGCDCC5NWQTYGYWJOY7OE5.json","graph_json":"https://pith.science/api/pith-number/3MGOKGCDCC5NWQTYGYWJOY7OE5/graph.json","events_json":"https://pith.science/api/pith-number/3MGOKGCDCC5NWQTYGYWJOY7OE5/events.json","paper":"https://pith.science/paper/3MGOKGCD"},"agent_actions":{"view_html":"https://pith.science/pith/3MGOKGCDCC5NWQTYGYWJOY7OE5","download_json":"https://pith.science/pith/3MGOKGCDCC5NWQTYGYWJOY7OE5.json","view_paper":"https://pith.science/paper/3MGOKGCD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.08406&json=true","fetch_graph":"https://pith.science/api/pith-number/3MGOKGCDCC5NWQTYGYWJOY7OE5/graph.json","fetch_events":"https://pith.science/api/pith-number/3MGOKGCDCC5NWQTYGYWJOY7OE5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3MGOKGCDCC5NWQTYGYWJOY7OE5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3MGOKGCDCC5NWQTYGYWJOY7OE5/action/storage_attestation","attest_author":"https://pith.science/pith/3MGOKGCDCC5NWQTYGYWJOY7OE5/action/author_attestation","sign_citation":"https://pith.science/pith/3MGOKGCDCC5NWQTYGYWJOY7OE5/action/citation_signature","submit_replication":"https://pith.science/pith/3MGOKGCDCC5NWQTYGYWJOY7OE5/action/replication_record"}},"created_at":"2026-07-05T06:30:17.910258+00:00","updated_at":"2026-07-05T06:30:17.910258+00:00"}