{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:RH6U4UUCQGMDCJL6ZHCGNVZIGF","short_pith_number":"pith:RH6U4UUC","schema_version":"1.0","canonical_sha256":"89fd4e5282819831257ec9c466d72831480c4712080fd571a8cb3677932cee60","source":{"kind":"arxiv","id":"2103.09076","version":2},"attestation_state":"computed","paper":{"title":"Quantum Algorithm for Fidelity Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ji Guan, Junyi Liu, Kean Chen, Mingsheng Ying, Qisheng Wang, Wang Fang, Zhicheng Zhang","submitted_at":"2021-03-16T13:57:01Z","abstract_excerpt":"For two unknown mixed quantum states $\\rho$ and $\\sigma$ in an $N$-dimensional Hilbert space, computing their fidelity $F(\\rho,\\sigma)$ is a basic problem with many important applications in quantum computing and quantum information, for example verification and characterization of the outputs of a quantum computer, and design and analysis of quantum algorithms. In this paper, we propose a quantum algorithm that solves this problem in $\\operatorname{poly}(\\log (N), r, 1/\\varepsilon)$ time, where $r$ is the lower rank of $\\rho$ and $\\sigma$, and $\\varepsilon$ is the desired precision, provided "},"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":"2103.09076","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-03-16T13:57:01Z","cross_cats_sorted":[],"title_canon_sha256":"c044e51268218a40bca523a3b422e773238f167de654f390530aa28d7e925ed6","abstract_canon_sha256":"8eea5b81a675848ba627905a6ed505a2c12ce93b91b785214a33720e43b8e461"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:29:51.128588Z","signature_b64":"WJEFlbtMG2LRrQHwA1qCI/kz9gfBurou/S3SoERo7TqCIVeDkl1ft50YiqfHmgpRaa+MP5A/NLFY8VwlZ8SMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89fd4e5282819831257ec9c466d72831480c4712080fd571a8cb3677932cee60","last_reissued_at":"2026-07-05T05:29:51.128079Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:29:51.128079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Algorithm for Fidelity Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ji Guan, Junyi Liu, Kean Chen, Mingsheng Ying, Qisheng Wang, Wang Fang, Zhicheng Zhang","submitted_at":"2021-03-16T13:57:01Z","abstract_excerpt":"For two unknown mixed quantum states $\\rho$ and $\\sigma$ in an $N$-dimensional Hilbert space, computing their fidelity $F(\\rho,\\sigma)$ is a basic problem with many important applications in quantum computing and quantum information, for example verification and characterization of the outputs of a quantum computer, and design and analysis of quantum algorithms. In this paper, we propose a quantum algorithm that solves this problem in $\\operatorname{poly}(\\log (N), r, 1/\\varepsilon)$ time, where $r$ is the lower rank of $\\rho$ and $\\sigma$, and $\\varepsilon$ is the desired precision, provided "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.09076","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/2103.09076/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":"2103.09076","created_at":"2026-07-05T05:29:51.128147+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.09076v2","created_at":"2026-07-05T05:29:51.128147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.09076","created_at":"2026-07-05T05:29:51.128147+00:00"},{"alias_kind":"pith_short_12","alias_value":"RH6U4UUCQGMD","created_at":"2026-07-05T05:29:51.128147+00:00"},{"alias_kind":"pith_short_16","alias_value":"RH6U4UUCQGMDCJL6","created_at":"2026-07-05T05:29:51.128147+00:00"},{"alias_kind":"pith_short_8","alias_value":"RH6U4UUC","created_at":"2026-07-05T05:29:51.128147+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.06325","citing_title":"Probabilistic and approximate universal quantum purification machines","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RH6U4UUCQGMDCJL6ZHCGNVZIGF","json":"https://pith.science/pith/RH6U4UUCQGMDCJL6ZHCGNVZIGF.json","graph_json":"https://pith.science/api/pith-number/RH6U4UUCQGMDCJL6ZHCGNVZIGF/graph.json","events_json":"https://pith.science/api/pith-number/RH6U4UUCQGMDCJL6ZHCGNVZIGF/events.json","paper":"https://pith.science/paper/RH6U4UUC"},"agent_actions":{"view_html":"https://pith.science/pith/RH6U4UUCQGMDCJL6ZHCGNVZIGF","download_json":"https://pith.science/pith/RH6U4UUCQGMDCJL6ZHCGNVZIGF.json","view_paper":"https://pith.science/paper/RH6U4UUC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.09076&json=true","fetch_graph":"https://pith.science/api/pith-number/RH6U4UUCQGMDCJL6ZHCGNVZIGF/graph.json","fetch_events":"https://pith.science/api/pith-number/RH6U4UUCQGMDCJL6ZHCGNVZIGF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RH6U4UUCQGMDCJL6ZHCGNVZIGF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RH6U4UUCQGMDCJL6ZHCGNVZIGF/action/storage_attestation","attest_author":"https://pith.science/pith/RH6U4UUCQGMDCJL6ZHCGNVZIGF/action/author_attestation","sign_citation":"https://pith.science/pith/RH6U4UUCQGMDCJL6ZHCGNVZIGF/action/citation_signature","submit_replication":"https://pith.science/pith/RH6U4UUCQGMDCJL6ZHCGNVZIGF/action/replication_record"}},"created_at":"2026-07-05T05:29:51.128147+00:00","updated_at":"2026-07-05T05:29:51.128147+00:00"}