{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:LW5EXRG7H6HHFT7OODX5ATPIIQ","short_pith_number":"pith:LW5EXRG7","schema_version":"1.0","canonical_sha256":"5dba4bc4df3f8e72cfee70efd04de84424a68ce7479fd783afcc024b17b5acdc","source":{"kind":"arxiv","id":"2204.07155","version":2},"attestation_state":"computed","paper":{"title":"Tight Bounds for Quantum State Certification with Incoherent Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","cs.LG","math.IT"],"primary_cat":"quant-ph","authors_text":"Allen Liu, Brice Huang, Jerry Li, Sitan Chen","submitted_at":"2022-04-14T17:59:31Z","abstract_excerpt":"We consider the problem of quantum state certification, where we are given the description of a mixed state $\\sigma \\in \\mathbb{C}^{d \\times d}$, $n$ copies of a mixed state $\\rho \\in \\mathbb{C}^{d \\times d}$, and $\\varepsilon > 0$, and we are asked to determine whether $\\rho = \\sigma$ or whether $\\| \\rho - \\sigma \\|_1 > \\varepsilon$. When $\\sigma$ is the maximally mixed state $\\frac{1}{d} I_d$, this is known as mixedness testing. We focus on algorithms which use incoherent measurements, i.e. which only measure one copy of $\\rho$ at a time. Unlike those that use entangled, multi-copy measureme"},"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":"2204.07155","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-04-14T17:59:31Z","cross_cats_sorted":["cs.CC","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"12bdb76f878ead9c39869adbdaf45412adc6f07e0345b010405ac3746f973f73","abstract_canon_sha256":"af8a53ddaad1ffcb53d273e6ff10871ac982218380874f6e3e686809b7adba42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:08:27.618752Z","signature_b64":"ucKqvzMDA/c1ZBNZd3FyUEd7NE1x0g1bwZFiRJMg6Z9rfxfHYbwhJz/0EPEgkMHglNVSK9Zi36Z6w3LTzJdHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dba4bc4df3f8e72cfee70efd04de84424a68ce7479fd783afcc024b17b5acdc","last_reissued_at":"2026-07-05T05:08:27.618350Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:08:27.618350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Bounds for Quantum State Certification with Incoherent Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","cs.LG","math.IT"],"primary_cat":"quant-ph","authors_text":"Allen Liu, Brice Huang, Jerry Li, Sitan Chen","submitted_at":"2022-04-14T17:59:31Z","abstract_excerpt":"We consider the problem of quantum state certification, where we are given the description of a mixed state $\\sigma \\in \\mathbb{C}^{d \\times d}$, $n$ copies of a mixed state $\\rho \\in \\mathbb{C}^{d \\times d}$, and $\\varepsilon > 0$, and we are asked to determine whether $\\rho = \\sigma$ or whether $\\| \\rho - \\sigma \\|_1 > \\varepsilon$. When $\\sigma$ is the maximally mixed state $\\frac{1}{d} I_d$, this is known as mixedness testing. We focus on algorithms which use incoherent measurements, i.e. which only measure one copy of $\\rho$ at a time. Unlike those that use entangled, multi-copy measureme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.07155","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/2204.07155/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":"2204.07155","created_at":"2026-07-05T05:08:27.618408+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.07155v2","created_at":"2026-07-05T05:08:27.618408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.07155","created_at":"2026-07-05T05:08:27.618408+00:00"},{"alias_kind":"pith_short_12","alias_value":"LW5EXRG7H6HH","created_at":"2026-07-05T05:08:27.618408+00:00"},{"alias_kind":"pith_short_16","alias_value":"LW5EXRG7H6HHFT7O","created_at":"2026-07-05T05:08:27.618408+00:00"},{"alias_kind":"pith_short_8","alias_value":"LW5EXRG7","created_at":"2026-07-05T05:08:27.618408+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22743","citing_title":"Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LW5EXRG7H6HHFT7OODX5ATPIIQ","json":"https://pith.science/pith/LW5EXRG7H6HHFT7OODX5ATPIIQ.json","graph_json":"https://pith.science/api/pith-number/LW5EXRG7H6HHFT7OODX5ATPIIQ/graph.json","events_json":"https://pith.science/api/pith-number/LW5EXRG7H6HHFT7OODX5ATPIIQ/events.json","paper":"https://pith.science/paper/LW5EXRG7"},"agent_actions":{"view_html":"https://pith.science/pith/LW5EXRG7H6HHFT7OODX5ATPIIQ","download_json":"https://pith.science/pith/LW5EXRG7H6HHFT7OODX5ATPIIQ.json","view_paper":"https://pith.science/paper/LW5EXRG7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.07155&json=true","fetch_graph":"https://pith.science/api/pith-number/LW5EXRG7H6HHFT7OODX5ATPIIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LW5EXRG7H6HHFT7OODX5ATPIIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LW5EXRG7H6HHFT7OODX5ATPIIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LW5EXRG7H6HHFT7OODX5ATPIIQ/action/storage_attestation","attest_author":"https://pith.science/pith/LW5EXRG7H6HHFT7OODX5ATPIIQ/action/author_attestation","sign_citation":"https://pith.science/pith/LW5EXRG7H6HHFT7OODX5ATPIIQ/action/citation_signature","submit_replication":"https://pith.science/pith/LW5EXRG7H6HHFT7OODX5ATPIIQ/action/replication_record"}},"created_at":"2026-07-05T05:08:27.618408+00:00","updated_at":"2026-07-05T05:08:27.618408+00:00"}