{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZU6GKD3HZHQSAZ2ZHN3HVCAG3K","short_pith_number":"pith:ZU6GKD3H","schema_version":"1.0","canonical_sha256":"cd3c650f67c9e12067593b767a8806daaea7eaab7263ef2ba933bc3f63af128a","source":{"kind":"arxiv","id":"2506.21455","version":1},"attestation_state":"computed","paper":{"title":"An Iterative Methodology for Unitary Quantum Channel Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","quant-ph"],"primary_cat":"math.NA","authors_text":"Bing-Ze Lu, Hao-Wei Huang, Matthew M. Lin","submitted_at":"2025-06-26T16:35:28Z","abstract_excerpt":"In this paper, we propose an iterative algorithm using polar decomposition to approximate a channel characterized by a single unitary matrix based on input-output quantum state pairs. In limited data, we state and prove that the optimal solution obtained from our method using one pair with a specific structure will generate an equivalent class, significantly reducing the dimension of the searching space. Furthermore, we prove that the unitary matrices describing the same channel differ by a complex number with modulus 1. We rigorously prove our proposed algorithm can ultimately identify a crit"},"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.21455","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-06-26T16:35:28Z","cross_cats_sorted":["cs.NA","quant-ph"],"title_canon_sha256":"4a2a7f84f1bc3924fed2d6c7852cb1d4eb92f06bcccedf7493e9bfbdf07ee3bc","abstract_canon_sha256":"ca3c629dfabaf5a071576fe6ac142ee06cc392f6268d1547a011668273d41313"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:17:12.875430Z","signature_b64":"Oe8Zxgkftvxrb0akMQpLGGJZ8bhR4YIKNRZgXtqlcV6es++ADTJ29mkpFc6W7oxrr1/ZYUqudV5+1FJiJE1ADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd3c650f67c9e12067593b767a8806daaea7eaab7263ef2ba933bc3f63af128a","last_reissued_at":"2026-07-02T01:17:12.874992Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:17:12.874992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Iterative Methodology for Unitary Quantum Channel Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","quant-ph"],"primary_cat":"math.NA","authors_text":"Bing-Ze Lu, Hao-Wei Huang, Matthew M. Lin","submitted_at":"2025-06-26T16:35:28Z","abstract_excerpt":"In this paper, we propose an iterative algorithm using polar decomposition to approximate a channel characterized by a single unitary matrix based on input-output quantum state pairs. In limited data, we state and prove that the optimal solution obtained from our method using one pair with a specific structure will generate an equivalent class, significantly reducing the dimension of the searching space. Furthermore, we prove that the unitary matrices describing the same channel differ by a complex number with modulus 1. We rigorously prove our proposed algorithm can ultimately identify a crit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.21455","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.21455/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.21455","created_at":"2026-07-02T01:17:12.875048+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.21455v1","created_at":"2026-07-02T01:17:12.875048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.21455","created_at":"2026-07-02T01:17:12.875048+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZU6GKD3HZHQS","created_at":"2026-07-02T01:17:12.875048+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZU6GKD3HZHQSAZ2Z","created_at":"2026-07-02T01:17:12.875048+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZU6GKD3H","created_at":"2026-07-02T01:17:12.875048+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZU6GKD3HZHQSAZ2ZHN3HVCAG3K","json":"https://pith.science/pith/ZU6GKD3HZHQSAZ2ZHN3HVCAG3K.json","graph_json":"https://pith.science/api/pith-number/ZU6GKD3HZHQSAZ2ZHN3HVCAG3K/graph.json","events_json":"https://pith.science/api/pith-number/ZU6GKD3HZHQSAZ2ZHN3HVCAG3K/events.json","paper":"https://pith.science/paper/ZU6GKD3H"},"agent_actions":{"view_html":"https://pith.science/pith/ZU6GKD3HZHQSAZ2ZHN3HVCAG3K","download_json":"https://pith.science/pith/ZU6GKD3HZHQSAZ2ZHN3HVCAG3K.json","view_paper":"https://pith.science/paper/ZU6GKD3H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.21455&json=true","fetch_graph":"https://pith.science/api/pith-number/ZU6GKD3HZHQSAZ2ZHN3HVCAG3K/graph.json","fetch_events":"https://pith.science/api/pith-number/ZU6GKD3HZHQSAZ2ZHN3HVCAG3K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZU6GKD3HZHQSAZ2ZHN3HVCAG3K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZU6GKD3HZHQSAZ2ZHN3HVCAG3K/action/storage_attestation","attest_author":"https://pith.science/pith/ZU6GKD3HZHQSAZ2ZHN3HVCAG3K/action/author_attestation","sign_citation":"https://pith.science/pith/ZU6GKD3HZHQSAZ2ZHN3HVCAG3K/action/citation_signature","submit_replication":"https://pith.science/pith/ZU6GKD3HZHQSAZ2ZHN3HVCAG3K/action/replication_record"}},"created_at":"2026-07-02T01:17:12.875048+00:00","updated_at":"2026-07-02T01:17:12.875048+00:00"}