{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4QT6EW4VWGCWHTNYGTFPLA7J3C","short_pith_number":"pith:4QT6EW4V","schema_version":"1.0","canonical_sha256":"e427e25b95b18563cdb834caf583e9d88023844ebef775172fb4a41ca7b8394f","source":{"kind":"arxiv","id":"1902.03164","version":3},"attestation_state":"computed","paper":{"title":"Detecting mixed-unitary quantum channels is NP-hard","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Colin Do-Yan Lee, John Watrous","submitted_at":"2019-02-08T16:09:45Z","abstract_excerpt":"A quantum channel is said to be a mixed-unitary channel if it can be expressed as a convex combination of unitary channels. We prove that, given the Choi representation of a quantum channel, it is NP-hard with respect to polynomial-time Turing reductions to determine whether or not that channel is a mixed-unitary channel. This hardness result holds even under the assumption that the channel is not within an inverse-polynomial distance (in the dimension of the space upon which it acts) of the boundary of the mixed-unitary channels."},"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":"1902.03164","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2019-02-08T16:09:45Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"b87cb0bb6770c8796b79480f2d56c20dcb9e3f8e9bfae1f8eeb5af073937a699","abstract_canon_sha256":"5a0f32b7f485219a9e2bd7a25418bf2d2342398cd8ccf99d6faf8609ba0c109a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:57:03.939778Z","signature_b64":"eZQBWnnCOlYeK4RdXUSIZEHCJdVQu2zPVtqDXNftFSGSP8HOqP0Q08WsxxSNXpBgUuTHBX+tOeEgzIxu5D8CAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e427e25b95b18563cdb834caf583e9d88023844ebef775172fb4a41ca7b8394f","last_reissued_at":"2026-07-05T00:57:03.939387Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:57:03.939387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Detecting mixed-unitary quantum channels is NP-hard","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Colin Do-Yan Lee, John Watrous","submitted_at":"2019-02-08T16:09:45Z","abstract_excerpt":"A quantum channel is said to be a mixed-unitary channel if it can be expressed as a convex combination of unitary channels. We prove that, given the Choi representation of a quantum channel, it is NP-hard with respect to polynomial-time Turing reductions to determine whether or not that channel is a mixed-unitary channel. This hardness result holds even under the assumption that the channel is not within an inverse-polynomial distance (in the dimension of the space upon which it acts) of the boundary of the mixed-unitary channels."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03164","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1902.03164/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":"1902.03164","created_at":"2026-07-05T00:57:03.939443+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.03164v3","created_at":"2026-07-05T00:57:03.939443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03164","created_at":"2026-07-05T00:57:03.939443+00:00"},{"alias_kind":"pith_short_12","alias_value":"4QT6EW4VWGCW","created_at":"2026-07-05T00:57:03.939443+00:00"},{"alias_kind":"pith_short_16","alias_value":"4QT6EW4VWGCWHTNY","created_at":"2026-07-05T00:57:03.939443+00:00"},{"alias_kind":"pith_short_8","alias_value":"4QT6EW4V","created_at":"2026-07-05T00:57:03.939443+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.09339","citing_title":"Pretty-good simulation of all quantum measurements by projective measurements","ref_index":93,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4QT6EW4VWGCWHTNYGTFPLA7J3C","json":"https://pith.science/pith/4QT6EW4VWGCWHTNYGTFPLA7J3C.json","graph_json":"https://pith.science/api/pith-number/4QT6EW4VWGCWHTNYGTFPLA7J3C/graph.json","events_json":"https://pith.science/api/pith-number/4QT6EW4VWGCWHTNYGTFPLA7J3C/events.json","paper":"https://pith.science/paper/4QT6EW4V"},"agent_actions":{"view_html":"https://pith.science/pith/4QT6EW4VWGCWHTNYGTFPLA7J3C","download_json":"https://pith.science/pith/4QT6EW4VWGCWHTNYGTFPLA7J3C.json","view_paper":"https://pith.science/paper/4QT6EW4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.03164&json=true","fetch_graph":"https://pith.science/api/pith-number/4QT6EW4VWGCWHTNYGTFPLA7J3C/graph.json","fetch_events":"https://pith.science/api/pith-number/4QT6EW4VWGCWHTNYGTFPLA7J3C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4QT6EW4VWGCWHTNYGTFPLA7J3C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4QT6EW4VWGCWHTNYGTFPLA7J3C/action/storage_attestation","attest_author":"https://pith.science/pith/4QT6EW4VWGCWHTNYGTFPLA7J3C/action/author_attestation","sign_citation":"https://pith.science/pith/4QT6EW4VWGCWHTNYGTFPLA7J3C/action/citation_signature","submit_replication":"https://pith.science/pith/4QT6EW4VWGCWHTNYGTFPLA7J3C/action/replication_record"}},"created_at":"2026-07-05T00:57:03.939443+00:00","updated_at":"2026-07-05T00:57:03.939443+00:00"}