{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:DXYAPKYCO5YUZKAR6O7DNBCTOD","short_pith_number":"pith:DXYAPKYC","schema_version":"1.0","canonical_sha256":"1df007ab0277714ca811f3be36845370fed631e22d4dc057113bbed753772029","source":{"kind":"arxiv","id":"quant-ph/0606106","version":3},"attestation_state":"computed","paper":{"title":"Computational approach to quantum encoder design for purity optimization","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Maryam Fazel, Naoki Yamamoto","submitted_at":"2006-06-13T03:45:55Z","abstract_excerpt":"In this paper, we address the problem of designing a quantum encoder that maximizes the minimum output purity of a given decohering channel, where the minimum is taken over all possible pure inputs. This problem is cast as a max-min optimization problem with a rank constraint on an appropriately defined matrix variable. The problem is computationally very hard because it is non-convex with respect to both the objective function (output purity) and the rank constraint. Despite this difficulty, we provide a tractable computational algorithm that produces the exact optimal solution for codespace "},"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":"quant-ph/0606106","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-06-13T03:45:55Z","cross_cats_sorted":[],"title_canon_sha256":"fb8f4196322615d60160f79ef78bd55cabc790f3daf86f3a312ae85bfde93a8d","abstract_canon_sha256":"cc6101ff71fc61982cdb2677356eff9e5267e7b431864e1c8e837266ba9debf2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:52.235730Z","signature_b64":"g/6OeULyVxvGKEYrPD5ie74/iN4ubCSsxpoCrz+pO+RXJRfCNES9aRMRvla5Wsf85Z4XwEc0kLZ1wCvPKzb/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1df007ab0277714ca811f3be36845370fed631e22d4dc057113bbed753772029","last_reissued_at":"2026-05-18T04:08:52.235297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:52.235297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational approach to quantum encoder design for purity optimization","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Maryam Fazel, Naoki Yamamoto","submitted_at":"2006-06-13T03:45:55Z","abstract_excerpt":"In this paper, we address the problem of designing a quantum encoder that maximizes the minimum output purity of a given decohering channel, where the minimum is taken over all possible pure inputs. This problem is cast as a max-min optimization problem with a rank constraint on an appropriately defined matrix variable. The problem is computationally very hard because it is non-convex with respect to both the objective function (output purity) and the rank constraint. Despite this difficulty, we provide a tractable computational algorithm that produces the exact optimal solution for codespace "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0606106","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"quant-ph/0606106","created_at":"2026-05-18T04:08:52.235370+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0606106v3","created_at":"2026-05-18T04:08:52.235370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0606106","created_at":"2026-05-18T04:08:52.235370+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXYAPKYCO5YU","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXYAPKYCO5YUZKAR","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXYAPKYC","created_at":"2026-05-18T12:25:53.939244+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/DXYAPKYCO5YUZKAR6O7DNBCTOD","json":"https://pith.science/pith/DXYAPKYCO5YUZKAR6O7DNBCTOD.json","graph_json":"https://pith.science/api/pith-number/DXYAPKYCO5YUZKAR6O7DNBCTOD/graph.json","events_json":"https://pith.science/api/pith-number/DXYAPKYCO5YUZKAR6O7DNBCTOD/events.json","paper":"https://pith.science/paper/DXYAPKYC"},"agent_actions":{"view_html":"https://pith.science/pith/DXYAPKYCO5YUZKAR6O7DNBCTOD","download_json":"https://pith.science/pith/DXYAPKYCO5YUZKAR6O7DNBCTOD.json","view_paper":"https://pith.science/paper/DXYAPKYC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0606106&json=true","fetch_graph":"https://pith.science/api/pith-number/DXYAPKYCO5YUZKAR6O7DNBCTOD/graph.json","fetch_events":"https://pith.science/api/pith-number/DXYAPKYCO5YUZKAR6O7DNBCTOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXYAPKYCO5YUZKAR6O7DNBCTOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXYAPKYCO5YUZKAR6O7DNBCTOD/action/storage_attestation","attest_author":"https://pith.science/pith/DXYAPKYCO5YUZKAR6O7DNBCTOD/action/author_attestation","sign_citation":"https://pith.science/pith/DXYAPKYCO5YUZKAR6O7DNBCTOD/action/citation_signature","submit_replication":"https://pith.science/pith/DXYAPKYCO5YUZKAR6O7DNBCTOD/action/replication_record"}},"created_at":"2026-05-18T04:08:52.235370+00:00","updated_at":"2026-05-18T04:08:52.235370+00:00"}