{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:OXDRPILSWGHGR5BBLE6B4WH7OS","short_pith_number":"pith:OXDRPILS","schema_version":"1.0","canonical_sha256":"75c717a172b18e68f421593c1e58ff749e502d5a7edaae0995d93a3603176264","source":{"kind":"arxiv","id":"2203.15993","version":1},"attestation_state":"computed","paper":{"title":"Improved Quantum Algorithms for Fidelity Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Poremba, Andr\\'as Gily\\'en","submitted_at":"2022-03-30T02:02:16Z","abstract_excerpt":"Fidelity is a fundamental measure for the closeness of two quantum states, which is important both from a theoretical and a practical point of view. Yet, in general, it is difficult to give good estimates of fidelity, especially when one works with mixed states over Hilbert spaces of very high dimension. Although, there has been some progress on fidelity estimation, all prior work either requires a large number of identical copies of the relevant states, or relies on unproven heuristics. In this work, we improve on both of these aspects by developing new and efficient quantum algorithms for fi"},"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":"2203.15993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-30T02:02:16Z","cross_cats_sorted":[],"title_canon_sha256":"f4f978d293ab50154df755e27044db016cdee34f5c7bb4e5c336098c5b43b895","abstract_canon_sha256":"a354370b13093e43b4978ceeb0e0996cbc962a287cf19390ae72311f8ee0851c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:10:06.051504Z","signature_b64":"gFVlKfj0Bi2KGMimr2fGnBy+WprnasuTnwSYaxazousEXQyj3fQoD1xw4FnMt3YRodiQ7VzKf3fxfKgvwJNNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75c717a172b18e68f421593c1e58ff749e502d5a7edaae0995d93a3603176264","last_reissued_at":"2026-07-05T04:10:06.050868Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:10:06.050868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Quantum Algorithms for Fidelity Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Poremba, Andr\\'as Gily\\'en","submitted_at":"2022-03-30T02:02:16Z","abstract_excerpt":"Fidelity is a fundamental measure for the closeness of two quantum states, which is important both from a theoretical and a practical point of view. Yet, in general, it is difficult to give good estimates of fidelity, especially when one works with mixed states over Hilbert spaces of very high dimension. Although, there has been some progress on fidelity estimation, all prior work either requires a large number of identical copies of the relevant states, or relies on unproven heuristics. In this work, we improve on both of these aspects by developing new and efficient quantum algorithms for fi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.15993","kind":"arxiv","version":1},"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/2203.15993/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":"2203.15993","created_at":"2026-07-05T04:10:06.050940+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.15993v1","created_at":"2026-07-05T04:10:06.050940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.15993","created_at":"2026-07-05T04:10:06.050940+00:00"},{"alias_kind":"pith_short_12","alias_value":"OXDRPILSWGHG","created_at":"2026-07-05T04:10:06.050940+00:00"},{"alias_kind":"pith_short_16","alias_value":"OXDRPILSWGHGR5BB","created_at":"2026-07-05T04:10:06.050940+00:00"},{"alias_kind":"pith_short_8","alias_value":"OXDRPILS","created_at":"2026-07-05T04:10:06.050940+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07540","citing_title":"Towards Minimax Estimation of High-Order Functionals by Quantum Arguments","ref_index":42,"is_internal_anchor":true},{"citing_arxiv_id":"2606.10994","citing_title":"Adaptive identification of low-degree polynomials in quantum singular value transformation: application to nonlinear quantum properties estimation","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2410.02332","citing_title":"Polynomial time constructive decision algorithm for multivariable quantum signal processing","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2410.04435","citing_title":"QKAN: quantum Kolmogorov-Arnold networks with applications in machine learning and multivariate state preparation","ref_index":60,"is_internal_anchor":false},{"citing_arxiv_id":"2511.19289","citing_title":"Performance Guarantees for Quantum Neural Estimation of Entropies","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12615","citing_title":"Quantum state isomorphism problems for groups","ref_index":48,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OXDRPILSWGHGR5BBLE6B4WH7OS","json":"https://pith.science/pith/OXDRPILSWGHGR5BBLE6B4WH7OS.json","graph_json":"https://pith.science/api/pith-number/OXDRPILSWGHGR5BBLE6B4WH7OS/graph.json","events_json":"https://pith.science/api/pith-number/OXDRPILSWGHGR5BBLE6B4WH7OS/events.json","paper":"https://pith.science/paper/OXDRPILS"},"agent_actions":{"view_html":"https://pith.science/pith/OXDRPILSWGHGR5BBLE6B4WH7OS","download_json":"https://pith.science/pith/OXDRPILSWGHGR5BBLE6B4WH7OS.json","view_paper":"https://pith.science/paper/OXDRPILS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.15993&json=true","fetch_graph":"https://pith.science/api/pith-number/OXDRPILSWGHGR5BBLE6B4WH7OS/graph.json","fetch_events":"https://pith.science/api/pith-number/OXDRPILSWGHGR5BBLE6B4WH7OS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OXDRPILSWGHGR5BBLE6B4WH7OS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OXDRPILSWGHGR5BBLE6B4WH7OS/action/storage_attestation","attest_author":"https://pith.science/pith/OXDRPILSWGHGR5BBLE6B4WH7OS/action/author_attestation","sign_citation":"https://pith.science/pith/OXDRPILSWGHGR5BBLE6B4WH7OS/action/citation_signature","submit_replication":"https://pith.science/pith/OXDRPILSWGHGR5BBLE6B4WH7OS/action/replication_record"}},"created_at":"2026-07-05T04:10:06.050940+00:00","updated_at":"2026-07-05T04:10:06.050940+00:00"}