{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2001:4OOSDVEXUZCNOOQDDI5LK6I7NF","short_pith_number":"pith:4OOSDVEX","schema_version":"1.0","canonical_sha256":"e39d21d497a644d73a031a3ab5791f696928cc3023bd42aed11ed7ef0c15c4e3","source":{"kind":"arxiv","id":"quant-ph/0109155","version":2},"attestation_state":"computed","paper":{"title":"Optimizing Completely Positive Maps using Semidefinite Programming","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"B. De Moor, K. Audenaert","submitted_at":"2001-09-28T13:54:56Z","abstract_excerpt":"Recently, a lot of attention has been devoted to finding physically realisable operations that realise as closely as possible certain desired transformations between quantum states, e.g. quantum cloning, teleportation, quantum gates, etc. Mathematically, this problem boils down to finding a completely positive trace-preserving (CPTP) linear map that maximizes the (mean) fidelity between the map itself and the desired transformation. In this note we want to draw attention to the fact that this problem belongs to the class of so-called semidefinite programming (SDP) problems. As SDP problems are"},"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/0109155","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2001-09-28T13:54:56Z","cross_cats_sorted":[],"title_canon_sha256":"3d76b66f79d64383d825a485a489d678bd9d378b0c1ae5065e4af6ff754bccb1","abstract_canon_sha256":"43c7e9741eb60825b385187ffc7e923d1ed214505d8a229efff389cfdb0a2f9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:12.264509Z","signature_b64":"wWwzkVdiSGvR4myDSBIm36Tyi66hTtKb14/Vz/2c2uW5IcU6fH6iyPljKb3tNP5qdH0syXkTIy8WhobxNud7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e39d21d497a644d73a031a3ab5791f696928cc3023bd42aed11ed7ef0c15c4e3","last_reissued_at":"2026-05-18T03:27:12.263658Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:12.263658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Completely Positive Maps using Semidefinite Programming","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"B. De Moor, K. Audenaert","submitted_at":"2001-09-28T13:54:56Z","abstract_excerpt":"Recently, a lot of attention has been devoted to finding physically realisable operations that realise as closely as possible certain desired transformations between quantum states, e.g. quantum cloning, teleportation, quantum gates, etc. Mathematically, this problem boils down to finding a completely positive trace-preserving (CPTP) linear map that maximizes the (mean) fidelity between the map itself and the desired transformation. In this note we want to draw attention to the fact that this problem belongs to the class of so-called semidefinite programming (SDP) problems. As SDP problems are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0109155","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":""},"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/0109155","created_at":"2026-05-18T03:27:12.263791+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0109155v2","created_at":"2026-05-18T03:27:12.263791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0109155","created_at":"2026-05-18T03:27:12.263791+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OOSDVEXUZCN","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OOSDVEXUZCNOOQD","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OOSDVEX","created_at":"2026-05-18T12:25:50.254431+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/4OOSDVEXUZCNOOQDDI5LK6I7NF","json":"https://pith.science/pith/4OOSDVEXUZCNOOQDDI5LK6I7NF.json","graph_json":"https://pith.science/api/pith-number/4OOSDVEXUZCNOOQDDI5LK6I7NF/graph.json","events_json":"https://pith.science/api/pith-number/4OOSDVEXUZCNOOQDDI5LK6I7NF/events.json","paper":"https://pith.science/paper/4OOSDVEX"},"agent_actions":{"view_html":"https://pith.science/pith/4OOSDVEXUZCNOOQDDI5LK6I7NF","download_json":"https://pith.science/pith/4OOSDVEXUZCNOOQDDI5LK6I7NF.json","view_paper":"https://pith.science/paper/4OOSDVEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0109155&json=true","fetch_graph":"https://pith.science/api/pith-number/4OOSDVEXUZCNOOQDDI5LK6I7NF/graph.json","fetch_events":"https://pith.science/api/pith-number/4OOSDVEXUZCNOOQDDI5LK6I7NF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OOSDVEXUZCNOOQDDI5LK6I7NF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OOSDVEXUZCNOOQDDI5LK6I7NF/action/storage_attestation","attest_author":"https://pith.science/pith/4OOSDVEXUZCNOOQDDI5LK6I7NF/action/author_attestation","sign_citation":"https://pith.science/pith/4OOSDVEXUZCNOOQDDI5LK6I7NF/action/citation_signature","submit_replication":"https://pith.science/pith/4OOSDVEXUZCNOOQDDI5LK6I7NF/action/replication_record"}},"created_at":"2026-05-18T03:27:12.263791+00:00","updated_at":"2026-05-18T03:27:12.263791+00:00"}