{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AAU5Q2KOAG6XHUHIOSYAVH4BEO","short_pith_number":"pith:AAU5Q2KO","schema_version":"1.0","canonical_sha256":"0029d8694e01bd73d0e874b00a9f8123aae6d7cc10c202d0378558186659abcd","source":{"kind":"arxiv","id":"1903.11738","version":2},"attestation_state":"computed","paper":{"title":"Strong bound between trace distance and Hilbert-Schmidt distance for low-rank states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Lukasz Cincio, M. Cerezo, Patrick J. Coles","submitted_at":"2019-03-28T00:24:15Z","abstract_excerpt":"The trace distance between two quantum states, $\\rho$ and $\\sigma$, is an operationally meaningful quantity in quantum information theory. However, in general it is difficult to compute, involving the diagonalization of $\\rho - \\sigma$. In contrast, the Hilbert-Schmidt distance can be computed without diagonalization, although it is less operationally significant. Here, we relate the trace distance and the Hilbert-Schmidt distance with a bound that is particularly strong when either $\\rho$ or $\\sigma$ is low rank. Our bound is stronger than the bound one could obtain via the norm equivalence o"},"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":"1903.11738","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-03-28T00:24:15Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"12605da285251654372b4629c68e7b1151d4b57717e3ab0128f4c6547d98d1c9","abstract_canon_sha256":"a34f8085d749c8a029e2c3699a623819c60b24f183888a8c5fa980de056e7d09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:40.769523Z","signature_b64":"XrpMePQesJxI283izlhPuBzSi3XwPgQuQ3QS//jlul33KKwNjHSUHNliDQ1685KwkagyaoJR+h/q3BEIr1gbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0029d8694e01bd73d0e874b00a9f8123aae6d7cc10c202d0378558186659abcd","last_reissued_at":"2026-07-04T23:51:40.769100Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:40.769100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong bound between trace distance and Hilbert-Schmidt distance for low-rank states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Lukasz Cincio, M. Cerezo, Patrick J. Coles","submitted_at":"2019-03-28T00:24:15Z","abstract_excerpt":"The trace distance between two quantum states, $\\rho$ and $\\sigma$, is an operationally meaningful quantity in quantum information theory. However, in general it is difficult to compute, involving the diagonalization of $\\rho - \\sigma$. In contrast, the Hilbert-Schmidt distance can be computed without diagonalization, although it is less operationally significant. Here, we relate the trace distance and the Hilbert-Schmidt distance with a bound that is particularly strong when either $\\rho$ or $\\sigma$ is low rank. Our bound is stronger than the bound one could obtain via the norm equivalence o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11738","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/1903.11738/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":"1903.11738","created_at":"2026-07-04T23:51:40.769155+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.11738v2","created_at":"2026-07-04T23:51:40.769155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11738","created_at":"2026-07-04T23:51:40.769155+00:00"},{"alias_kind":"pith_short_12","alias_value":"AAU5Q2KOAG6X","created_at":"2026-07-04T23:51:40.769155+00:00"},{"alias_kind":"pith_short_16","alias_value":"AAU5Q2KOAG6XHUHI","created_at":"2026-07-04T23:51:40.769155+00:00"},{"alias_kind":"pith_short_8","alias_value":"AAU5Q2KO","created_at":"2026-07-04T23:51:40.769155+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.05036","citing_title":"Efficient simulation of noisy IQP circuits with amplitude-damping noise","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AAU5Q2KOAG6XHUHIOSYAVH4BEO","json":"https://pith.science/pith/AAU5Q2KOAG6XHUHIOSYAVH4BEO.json","graph_json":"https://pith.science/api/pith-number/AAU5Q2KOAG6XHUHIOSYAVH4BEO/graph.json","events_json":"https://pith.science/api/pith-number/AAU5Q2KOAG6XHUHIOSYAVH4BEO/events.json","paper":"https://pith.science/paper/AAU5Q2KO"},"agent_actions":{"view_html":"https://pith.science/pith/AAU5Q2KOAG6XHUHIOSYAVH4BEO","download_json":"https://pith.science/pith/AAU5Q2KOAG6XHUHIOSYAVH4BEO.json","view_paper":"https://pith.science/paper/AAU5Q2KO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.11738&json=true","fetch_graph":"https://pith.science/api/pith-number/AAU5Q2KOAG6XHUHIOSYAVH4BEO/graph.json","fetch_events":"https://pith.science/api/pith-number/AAU5Q2KOAG6XHUHIOSYAVH4BEO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AAU5Q2KOAG6XHUHIOSYAVH4BEO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AAU5Q2KOAG6XHUHIOSYAVH4BEO/action/storage_attestation","attest_author":"https://pith.science/pith/AAU5Q2KOAG6XHUHIOSYAVH4BEO/action/author_attestation","sign_citation":"https://pith.science/pith/AAU5Q2KOAG6XHUHIOSYAVH4BEO/action/citation_signature","submit_replication":"https://pith.science/pith/AAU5Q2KOAG6XHUHIOSYAVH4BEO/action/replication_record"}},"created_at":"2026-07-04T23:51:40.769155+00:00","updated_at":"2026-07-04T23:51:40.769155+00:00"}