{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:ZHBFONZB7RZDC7SQRDOP5FVZT4","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":"3b0849ab23a74f7550ba1cc75bc5dce64706b91c9156eee676a572af65295ccb","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-02T08:03:13Z","title_canon_sha256":"b751fd95c910e8efc0f913db6803676ecdbc69376cdde47802af917f5b1838a2"},"schema_version":"1.0","source":{"id":"2110.00747","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.00747","created_at":"2026-07-05T03:19:47Z"},{"alias_kind":"arxiv_version","alias_value":"2110.00747v1","created_at":"2026-07-05T03:19:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.00747","created_at":"2026-07-05T03:19:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZHBFONZB7RZD","created_at":"2026-07-05T03:19:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZHBFONZB7RZDC7SQ","created_at":"2026-07-05T03:19:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZHBFONZB","created_at":"2026-07-05T03:19:47Z"}],"graph_snapshots":[{"event_id":"sha256:ab9eeb42434f4d22fda950b68ec6371634a308fba47ae3e704071e27b21d0fac","target":"graph","created_at":"2026-07-05T03:19:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2110.00747/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose an iterative algorithm that computes the maximum-likelihood estimate in quantum state tomography. The optimization error of the algorithm converges to zero at an $O ( ( 1 / k ) \\log D )$ rate, where $k$ denotes the number of iterations and $D$ denotes the dimension of the quantum state. The per-iteration computational complexity of the algorithm is $O ( D ^ 3 + N D ^2 )$, where $N$ denotes the number of measurement outcomes. The algorithm can be considered as a parameter-free correction of the $R \\rho R$ method [A. I. Lvovsky. Iterative maximum-likelihood reconstruction in quantum h","authors_text":"Chien-Ming Lin, Hao-Chung Cheng, Yen-Huan Li","cross_cats":["cs.IT","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-02T08:03:13Z","title":"Maximum-Likelihood Quantum State Tomography by Cover's Method with Non-Asymptotic Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.00747","kind":"arxiv","version":1},"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:fde387104cab556965ee7178a759975cc3442b66bc9c6c9f87061bda1bc553da","target":"record","created_at":"2026-07-05T03:19:47Z","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":"3b0849ab23a74f7550ba1cc75bc5dce64706b91c9156eee676a572af65295ccb","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-02T08:03:13Z","title_canon_sha256":"b751fd95c910e8efc0f913db6803676ecdbc69376cdde47802af917f5b1838a2"},"schema_version":"1.0","source":{"id":"2110.00747","kind":"arxiv","version":1}},"canonical_sha256":"c9c2573721fc72317e5088dcfe96b99f334a7f589793a7eaa6ad503c693a9030","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9c2573721fc72317e5088dcfe96b99f334a7f589793a7eaa6ad503c693a9030","first_computed_at":"2026-07-05T03:19:47.980801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:19:47.980801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ey+eYdD/ySpqErfyPcSp3ZdKmOAMOxKf9651wOQpthiauAi5tt2WV1/at7aDjnxCzYRw+HyRB4ev7QMWjdx/Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:19:47.981178Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.00747","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fde387104cab556965ee7178a759975cc3442b66bc9c6c9f87061bda1bc553da","sha256:ab9eeb42434f4d22fda950b68ec6371634a308fba47ae3e704071e27b21d0fac"],"state_sha256":"d01b6659bb67696918cd64095146982fa46917118424989a03926f53e5bee488"}