{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:BN7TFAQ4AYFOW7ZI2GV7DXW3CD","short_pith_number":"pith:BN7TFAQ4","schema_version":"1.0","canonical_sha256":"0b7f32821c060aeb7f28d1abf1dedb10e4a675c3d6b039c7357d5a4589fde809","source":{"kind":"arxiv","id":"2207.05713","version":2},"attestation_state":"computed","paper":{"title":"Linear programming with unitary-equivariant constraints","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.OC","math.RT"],"primary_cat":"quant-ph","authors_text":"Dmitry Grinko, Maris Ozols","submitted_at":"2022-07-12T17:37:04Z","abstract_excerpt":"Unitary equivariance is a natural symmetry that occurs in many contexts in physics and mathematics. Optimization problems with such symmetry can often be formulated as semidefinite programs for a $d^{p+q}$-dimensional matrix variable that commutes with $U^{\\otimes p} \\otimes \\bar{U}^{\\otimes q}$, for all $U \\in \\mathrm{U}(d)$. Solving such problems naively can be prohibitively expensive even if $p+q$ is small but the local dimension $d$ is large. We show that, under additional symmetry assumptions, this problem reduces to a linear program that can be solved in time that does not scale in $d$, "},"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":"2207.05713","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2022-07-12T17:37:04Z","cross_cats_sorted":["math.OC","math.RT"],"title_canon_sha256":"7ad606a5151cd0f91419073a75975d7c22b4dc5b3428add3e62eff409d20c165","abstract_canon_sha256":"4a8e4bad2ad23cb8c395ba6e8490425cb1e046db5592d256571340ed1304d6b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:57:17.712664Z","signature_b64":"xU1XehVDx8X21G9hp807oX1oBzA57GsNsTBNtx1n6mnr0Dvk0rnV6/vgToc50SSHpaq4m2CuFS4m6hEACatbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b7f32821c060aeb7f28d1abf1dedb10e4a675c3d6b039c7357d5a4589fde809","last_reissued_at":"2026-07-05T09:57:17.712156Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:57:17.712156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear programming with unitary-equivariant constraints","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.OC","math.RT"],"primary_cat":"quant-ph","authors_text":"Dmitry Grinko, Maris Ozols","submitted_at":"2022-07-12T17:37:04Z","abstract_excerpt":"Unitary equivariance is a natural symmetry that occurs in many contexts in physics and mathematics. Optimization problems with such symmetry can often be formulated as semidefinite programs for a $d^{p+q}$-dimensional matrix variable that commutes with $U^{\\otimes p} \\otimes \\bar{U}^{\\otimes q}$, for all $U \\in \\mathrm{U}(d)$. Solving such problems naively can be prohibitively expensive even if $p+q$ is small but the local dimension $d$ is large. We show that, under additional symmetry assumptions, this problem reduces to a linear program that can be solved in time that does not scale in $d$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.05713","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.05713/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":"2207.05713","created_at":"2026-07-05T09:57:17.712216+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.05713v2","created_at":"2026-07-05T09:57:17.712216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.05713","created_at":"2026-07-05T09:57:17.712216+00:00"},{"alias_kind":"pith_short_12","alias_value":"BN7TFAQ4AYFO","created_at":"2026-07-05T09:57:17.712216+00:00"},{"alias_kind":"pith_short_16","alias_value":"BN7TFAQ4AYFOW7ZI","created_at":"2026-07-05T09:57:17.712216+00:00"},{"alias_kind":"pith_short_8","alias_value":"BN7TFAQ4","created_at":"2026-07-05T09:57:17.712216+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2409.10393","citing_title":"Multicopy quantum state teleportation with application to storage and retrieval of quantum programs","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BN7TFAQ4AYFOW7ZI2GV7DXW3CD","json":"https://pith.science/pith/BN7TFAQ4AYFOW7ZI2GV7DXW3CD.json","graph_json":"https://pith.science/api/pith-number/BN7TFAQ4AYFOW7ZI2GV7DXW3CD/graph.json","events_json":"https://pith.science/api/pith-number/BN7TFAQ4AYFOW7ZI2GV7DXW3CD/events.json","paper":"https://pith.science/paper/BN7TFAQ4"},"agent_actions":{"view_html":"https://pith.science/pith/BN7TFAQ4AYFOW7ZI2GV7DXW3CD","download_json":"https://pith.science/pith/BN7TFAQ4AYFOW7ZI2GV7DXW3CD.json","view_paper":"https://pith.science/paper/BN7TFAQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.05713&json=true","fetch_graph":"https://pith.science/api/pith-number/BN7TFAQ4AYFOW7ZI2GV7DXW3CD/graph.json","fetch_events":"https://pith.science/api/pith-number/BN7TFAQ4AYFOW7ZI2GV7DXW3CD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BN7TFAQ4AYFOW7ZI2GV7DXW3CD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BN7TFAQ4AYFOW7ZI2GV7DXW3CD/action/storage_attestation","attest_author":"https://pith.science/pith/BN7TFAQ4AYFOW7ZI2GV7DXW3CD/action/author_attestation","sign_citation":"https://pith.science/pith/BN7TFAQ4AYFOW7ZI2GV7DXW3CD/action/citation_signature","submit_replication":"https://pith.science/pith/BN7TFAQ4AYFOW7ZI2GV7DXW3CD/action/replication_record"}},"created_at":"2026-07-05T09:57:17.712216+00:00","updated_at":"2026-07-05T09:57:17.712216+00:00"}