{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:44SOS5JLEOZ4ZAYLHJYUG6DGFL","short_pith_number":"pith:44SOS5JL","schema_version":"1.0","canonical_sha256":"e724e9752b23b3cc830b3a714378662aebd61e5de3079de8715d042d6dba8424","source":{"kind":"arxiv","id":"2506.20570","version":1},"attestation_state":"computed","paper":{"title":"Efficient Inversion of Unknown Unitary Operations with Structured Hamiltonians","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Tengxiang Lin, Xin Wang, Yin Mo","submitted_at":"2025-06-25T16:06:55Z","abstract_excerpt":"Unknown unitary inversion is a fundamental primitive in quantum computing and physics. Although recent work has demonstrated that quantum algorithms can invert arbitrary unknown unitaries without accessing their classical descriptions, improving the efficiency of such protocols remains an open question. In this work, we present efficient quantum algorithms for inverting unitaries with specific Hamiltonian structures, achieving significant reductions in both ancilla qubit requirements and unitary query complexity. We identify cases where unitaries encoding exponentially many parameters can be i"},"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":"2506.20570","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-25T16:06:55Z","cross_cats_sorted":[],"title_canon_sha256":"53ed956a3bb8389ba7013231a9f00f44c80097996ea1756b996f8db0470979e6","abstract_canon_sha256":"b4f6dab6a39a5f3303916e226fb691ff20e3213a4f0d5f5fc9132841ad4d2f0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:27:08.059803Z","signature_b64":"LA0NsZt7yt0MvrxN9yj4+vq2jSiHTi270btgR3p1mWtEYm6vw6c/Y2KSjSc/Q7yc4SQXYodWcxiHyGa/kEBACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e724e9752b23b3cc830b3a714378662aebd61e5de3079de8715d042d6dba8424","last_reissued_at":"2026-07-05T11:27:08.059331Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:27:08.059331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Inversion of Unknown Unitary Operations with Structured Hamiltonians","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Tengxiang Lin, Xin Wang, Yin Mo","submitted_at":"2025-06-25T16:06:55Z","abstract_excerpt":"Unknown unitary inversion is a fundamental primitive in quantum computing and physics. Although recent work has demonstrated that quantum algorithms can invert arbitrary unknown unitaries without accessing their classical descriptions, improving the efficiency of such protocols remains an open question. In this work, we present efficient quantum algorithms for inverting unitaries with specific Hamiltonian structures, achieving significant reductions in both ancilla qubit requirements and unitary query complexity. We identify cases where unitaries encoding exponentially many parameters can be i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.20570","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/2506.20570/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":"2506.20570","created_at":"2026-07-05T11:27:08.059388+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.20570v1","created_at":"2026-07-05T11:27:08.059388+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.20570","created_at":"2026-07-05T11:27:08.059388+00:00"},{"alias_kind":"pith_short_12","alias_value":"44SOS5JLEOZ4","created_at":"2026-07-05T11:27:08.059388+00:00"},{"alias_kind":"pith_short_16","alias_value":"44SOS5JLEOZ4ZAYL","created_at":"2026-07-05T11:27:08.059388+00:00"},{"alias_kind":"pith_short_8","alias_value":"44SOS5JL","created_at":"2026-07-05T11:27:08.059388+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.29382","citing_title":"Algebraic Speedups for Exact Inversion of Hamiltonian Evolutions","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/44SOS5JLEOZ4ZAYLHJYUG6DGFL","json":"https://pith.science/pith/44SOS5JLEOZ4ZAYLHJYUG6DGFL.json","graph_json":"https://pith.science/api/pith-number/44SOS5JLEOZ4ZAYLHJYUG6DGFL/graph.json","events_json":"https://pith.science/api/pith-number/44SOS5JLEOZ4ZAYLHJYUG6DGFL/events.json","paper":"https://pith.science/paper/44SOS5JL"},"agent_actions":{"view_html":"https://pith.science/pith/44SOS5JLEOZ4ZAYLHJYUG6DGFL","download_json":"https://pith.science/pith/44SOS5JLEOZ4ZAYLHJYUG6DGFL.json","view_paper":"https://pith.science/paper/44SOS5JL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.20570&json=true","fetch_graph":"https://pith.science/api/pith-number/44SOS5JLEOZ4ZAYLHJYUG6DGFL/graph.json","fetch_events":"https://pith.science/api/pith-number/44SOS5JLEOZ4ZAYLHJYUG6DGFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/44SOS5JLEOZ4ZAYLHJYUG6DGFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/44SOS5JLEOZ4ZAYLHJYUG6DGFL/action/storage_attestation","attest_author":"https://pith.science/pith/44SOS5JLEOZ4ZAYLHJYUG6DGFL/action/author_attestation","sign_citation":"https://pith.science/pith/44SOS5JLEOZ4ZAYLHJYUG6DGFL/action/citation_signature","submit_replication":"https://pith.science/pith/44SOS5JLEOZ4ZAYLHJYUG6DGFL/action/replication_record"}},"created_at":"2026-07-05T11:27:08.059388+00:00","updated_at":"2026-07-05T11:27:08.059388+00:00"}