{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DTZHBR2O2O6NTXSF6A3BR4I4ZE","short_pith_number":"pith:DTZHBR2O","schema_version":"1.0","canonical_sha256":"1cf270c74ed3bcd9de45f03618f11cc927260adc32d56694218d5e24e690f4b6","source":{"kind":"arxiv","id":"1305.5941","version":3},"attestation_state":"computed","paper":{"title":"Computing quantum discord is NP-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Yichen Huang","submitted_at":"2013-05-25T15:54:58Z","abstract_excerpt":"We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running time of any algorithm for computing quantum discord is believed to grow exponentially with the dimension of the Hilbert space so that computing quantum discord in a quantum system of moderate size is not possible in practice. As by-products, some entanglement measures (namely entanglement cost, entanglement of formation, relative entropy of entanglement, sq"},"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":"1305.5941","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-05-25T15:54:58Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"dff65b78576ecdb4f325f4c710de8a856485f087b6fdead78fe9f474edb805f2","abstract_canon_sha256":"0d2031f10aab9fa3d614e8889686dd73e2ee035c1eb9be5a15b2ddcb50e21083"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:20.619303Z","signature_b64":"KGHU20HgTIeLLFU/P8wZ9jhdDSRU/fg6Pw2gr9qKs7fKc6mF0RrdFOOghVyVv1CHpPHhPHOY6PCQNGCds/McDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cf270c74ed3bcd9de45f03618f11cc927260adc32d56694218d5e24e690f4b6","last_reissued_at":"2026-05-18T02:55:20.618804Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:20.618804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing quantum discord is NP-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Yichen Huang","submitted_at":"2013-05-25T15:54:58Z","abstract_excerpt":"We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running time of any algorithm for computing quantum discord is believed to grow exponentially with the dimension of the Hilbert space so that computing quantum discord in a quantum system of moderate size is not possible in practice. As by-products, some entanglement measures (namely entanglement cost, entanglement of formation, relative entropy of entanglement, sq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5941","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":"1305.5941","created_at":"2026-05-18T02:55:20.618874+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.5941v3","created_at":"2026-05-18T02:55:20.618874+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5941","created_at":"2026-05-18T02:55:20.618874+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTZHBR2O2O6N","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTZHBR2O2O6NTXSF","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTZHBR2O","created_at":"2026-05-18T12:27:43.054852+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/DTZHBR2O2O6NTXSF6A3BR4I4ZE","json":"https://pith.science/pith/DTZHBR2O2O6NTXSF6A3BR4I4ZE.json","graph_json":"https://pith.science/api/pith-number/DTZHBR2O2O6NTXSF6A3BR4I4ZE/graph.json","events_json":"https://pith.science/api/pith-number/DTZHBR2O2O6NTXSF6A3BR4I4ZE/events.json","paper":"https://pith.science/paper/DTZHBR2O"},"agent_actions":{"view_html":"https://pith.science/pith/DTZHBR2O2O6NTXSF6A3BR4I4ZE","download_json":"https://pith.science/pith/DTZHBR2O2O6NTXSF6A3BR4I4ZE.json","view_paper":"https://pith.science/paper/DTZHBR2O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.5941&json=true","fetch_graph":"https://pith.science/api/pith-number/DTZHBR2O2O6NTXSF6A3BR4I4ZE/graph.json","fetch_events":"https://pith.science/api/pith-number/DTZHBR2O2O6NTXSF6A3BR4I4ZE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTZHBR2O2O6NTXSF6A3BR4I4ZE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTZHBR2O2O6NTXSF6A3BR4I4ZE/action/storage_attestation","attest_author":"https://pith.science/pith/DTZHBR2O2O6NTXSF6A3BR4I4ZE/action/author_attestation","sign_citation":"https://pith.science/pith/DTZHBR2O2O6NTXSF6A3BR4I4ZE/action/citation_signature","submit_replication":"https://pith.science/pith/DTZHBR2O2O6NTXSF6A3BR4I4ZE/action/replication_record"}},"created_at":"2026-05-18T02:55:20.618874+00:00","updated_at":"2026-05-18T02:55:20.618874+00:00"}