{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:T6E2PFMDJJKX4LTMIXGKTVK7QG","short_pith_number":"pith:T6E2PFMD","schema_version":"1.0","canonical_sha256":"9f89a795834a557e2e6c45cca9d55f819c1651fd19abadd2492f17772fa269f3","source":{"kind":"arxiv","id":"1904.03180","version":1},"attestation_state":"computed","paper":{"title":"Quantum algorithms for zero-sum games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andr\\'as Gily\\'en, Joran van Apeldoorn","submitted_at":"2019-04-05T17:58:44Z","abstract_excerpt":"We derive sublinear-time quantum algorithms for computing the Nash equilibrium of two-player zero-sum games, based on efficient Gibbs sampling methods. We are able to achieve speed-ups for both dense and sparse payoff matrices at the cost of a mildly increased dependence on the additive error compared to classical algorithms. In particular we can find $\\varepsilon$-approximate Nash equilibrium strategies in complexity $\\tilde{O}(\\sqrt{n+m}/\\varepsilon^3)$ and $\\tilde{O}(\\sqrt{s}/\\varepsilon^{3.5})$ respectively, where $n\\times m$ is the size of the matrix describing the game and $s$ is its spa"},"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":"1904.03180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-04-05T17:58:44Z","cross_cats_sorted":[],"title_canon_sha256":"81ec0466cffb7776fe05dcbc031332c8e1f05ff6efbd3093e701c12f5dd38ca2","abstract_canon_sha256":"7dfd1509932529514e2b089cb5eca76ea99b8fd7f7742fe6d59f447d0ffd24db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:18.330245Z","signature_b64":"KgS93RUbgUccoof59JKwnzvhksP1mtsGEy24i54wsoZouj/eJBakK/ZP22JWVvUV8zz1PPfk1u5T3OVkWEPLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f89a795834a557e2e6c45cca9d55f819c1651fd19abadd2492f17772fa269f3","last_reissued_at":"2026-05-17T23:49:18.329705Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:18.329705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum algorithms for zero-sum games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andr\\'as Gily\\'en, Joran van Apeldoorn","submitted_at":"2019-04-05T17:58:44Z","abstract_excerpt":"We derive sublinear-time quantum algorithms for computing the Nash equilibrium of two-player zero-sum games, based on efficient Gibbs sampling methods. We are able to achieve speed-ups for both dense and sparse payoff matrices at the cost of a mildly increased dependence on the additive error compared to classical algorithms. In particular we can find $\\varepsilon$-approximate Nash equilibrium strategies in complexity $\\tilde{O}(\\sqrt{n+m}/\\varepsilon^3)$ and $\\tilde{O}(\\sqrt{s}/\\varepsilon^{3.5})$ respectively, where $n\\times m$ is the size of the matrix describing the game and $s$ is its spa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03180","kind":"arxiv","version":1},"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":"1904.03180","created_at":"2026-05-17T23:49:18.329787+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.03180v1","created_at":"2026-05-17T23:49:18.329787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03180","created_at":"2026-05-17T23:49:18.329787+00:00"},{"alias_kind":"pith_short_12","alias_value":"T6E2PFMDJJKX","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"T6E2PFMDJJKX4LTM","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"T6E2PFMD","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.05475","citing_title":"Low-depth amplitude estimation via statistical eigengap estimation","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2604.11825","citing_title":"Quantum algorithms for Young measures: applications to nonlinear partial differential equations","ref_index":52,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T6E2PFMDJJKX4LTMIXGKTVK7QG","json":"https://pith.science/pith/T6E2PFMDJJKX4LTMIXGKTVK7QG.json","graph_json":"https://pith.science/api/pith-number/T6E2PFMDJJKX4LTMIXGKTVK7QG/graph.json","events_json":"https://pith.science/api/pith-number/T6E2PFMDJJKX4LTMIXGKTVK7QG/events.json","paper":"https://pith.science/paper/T6E2PFMD"},"agent_actions":{"view_html":"https://pith.science/pith/T6E2PFMDJJKX4LTMIXGKTVK7QG","download_json":"https://pith.science/pith/T6E2PFMDJJKX4LTMIXGKTVK7QG.json","view_paper":"https://pith.science/paper/T6E2PFMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.03180&json=true","fetch_graph":"https://pith.science/api/pith-number/T6E2PFMDJJKX4LTMIXGKTVK7QG/graph.json","fetch_events":"https://pith.science/api/pith-number/T6E2PFMDJJKX4LTMIXGKTVK7QG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T6E2PFMDJJKX4LTMIXGKTVK7QG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T6E2PFMDJJKX4LTMIXGKTVK7QG/action/storage_attestation","attest_author":"https://pith.science/pith/T6E2PFMDJJKX4LTMIXGKTVK7QG/action/author_attestation","sign_citation":"https://pith.science/pith/T6E2PFMDJJKX4LTMIXGKTVK7QG/action/citation_signature","submit_replication":"https://pith.science/pith/T6E2PFMDJJKX4LTMIXGKTVK7QG/action/replication_record"}},"created_at":"2026-05-17T23:49:18.329787+00:00","updated_at":"2026-05-17T23:49:18.329787+00:00"}