{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:GBCECD7FIKXSFCFWGA56UVDMIB","short_pith_number":"pith:GBCECD7F","schema_version":"1.0","canonical_sha256":"3044410fe542af2288b6303bea546c4056929254cf851dcb6aa09678295cb09b","source":{"kind":"arxiv","id":"2208.07851","version":2},"attestation_state":"computed","paper":{"title":"Optimal algorithms for learning quantum phase states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Arkopal Dutt, Sergey Bravyi, Srinivasan Arunachalam, Theodore J. Yoder","submitted_at":"2022-08-16T17:15:06Z","abstract_excerpt":"We analyze the complexity of learning $n$-qubit quantum phase states. A degree-$d$ phase state is defined as a superposition of all $2^n$ basis vectors $x$ with amplitudes proportional to $(-1)^{f(x)}$, where $f$ is a degree-$d$ Boolean polynomial over $n$ variables. We show that the sample complexity of learning an unknown degree-$d$ phase state is $\\Theta(n^d)$ if we allow separable measurements and $\\Theta(n^{d-1})$ if we allow entangled measurements. Our learning algorithm based on separable measurements has runtime $\\textsf{poly}(n)$ (for constant $d$) and is well-suited for near-term dem"},"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":"2208.07851","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-08-16T17:15:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"67967044067aa8e17baa38bd5da23252be768be23536f00e2a032a40ce9474a4","abstract_canon_sha256":"28e95ddc81332a3e029175a11ca8d028b3c5c03c065eeda60b3666d9ee5756be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:06:40.817826Z","signature_b64":"dgvgD57Ox5NsH/HVFKdTzLmPA98bqcNqErIDfCK2Kb5Vc8USaHDR/QDTGK67p7VA7cznAUaMParrfDqrmJmWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3044410fe542af2288b6303bea546c4056929254cf851dcb6aa09678295cb09b","last_reissued_at":"2026-07-05T06:06:40.817340Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:06:40.817340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal algorithms for learning quantum phase states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Arkopal Dutt, Sergey Bravyi, Srinivasan Arunachalam, Theodore J. Yoder","submitted_at":"2022-08-16T17:15:06Z","abstract_excerpt":"We analyze the complexity of learning $n$-qubit quantum phase states. A degree-$d$ phase state is defined as a superposition of all $2^n$ basis vectors $x$ with amplitudes proportional to $(-1)^{f(x)}$, where $f$ is a degree-$d$ Boolean polynomial over $n$ variables. We show that the sample complexity of learning an unknown degree-$d$ phase state is $\\Theta(n^d)$ if we allow separable measurements and $\\Theta(n^{d-1})$ if we allow entangled measurements. Our learning algorithm based on separable measurements has runtime $\\textsf{poly}(n)$ (for constant $d$) and is well-suited for near-term dem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.07851","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/2208.07851/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":"2208.07851","created_at":"2026-07-05T06:06:40.817394+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.07851v2","created_at":"2026-07-05T06:06:40.817394+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.07851","created_at":"2026-07-05T06:06:40.817394+00:00"},{"alias_kind":"pith_short_12","alias_value":"GBCECD7FIKXS","created_at":"2026-07-05T06:06:40.817394+00:00"},{"alias_kind":"pith_short_16","alias_value":"GBCECD7FIKXSFCFW","created_at":"2026-07-05T06:06:40.817394+00:00"},{"alias_kind":"pith_short_8","alias_value":"GBCECD7F","created_at":"2026-07-05T06:06:40.817394+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02122","citing_title":"Can scrambling protect quantum state distinguishability under noise?","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2602.09710","citing_title":"Sample- and Hardware-Efficient Fidelity Estimation by Stripping Phase-Dominated Magic","ref_index":48,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24099","citing_title":"Single-copy stabilizer learning: average case and worst case","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GBCECD7FIKXSFCFWGA56UVDMIB","json":"https://pith.science/pith/GBCECD7FIKXSFCFWGA56UVDMIB.json","graph_json":"https://pith.science/api/pith-number/GBCECD7FIKXSFCFWGA56UVDMIB/graph.json","events_json":"https://pith.science/api/pith-number/GBCECD7FIKXSFCFWGA56UVDMIB/events.json","paper":"https://pith.science/paper/GBCECD7F"},"agent_actions":{"view_html":"https://pith.science/pith/GBCECD7FIKXSFCFWGA56UVDMIB","download_json":"https://pith.science/pith/GBCECD7FIKXSFCFWGA56UVDMIB.json","view_paper":"https://pith.science/paper/GBCECD7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.07851&json=true","fetch_graph":"https://pith.science/api/pith-number/GBCECD7FIKXSFCFWGA56UVDMIB/graph.json","fetch_events":"https://pith.science/api/pith-number/GBCECD7FIKXSFCFWGA56UVDMIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GBCECD7FIKXSFCFWGA56UVDMIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GBCECD7FIKXSFCFWGA56UVDMIB/action/storage_attestation","attest_author":"https://pith.science/pith/GBCECD7FIKXSFCFWGA56UVDMIB/action/author_attestation","sign_citation":"https://pith.science/pith/GBCECD7FIKXSFCFWGA56UVDMIB/action/citation_signature","submit_replication":"https://pith.science/pith/GBCECD7FIKXSFCFWGA56UVDMIB/action/replication_record"}},"created_at":"2026-07-05T06:06:40.817394+00:00","updated_at":"2026-07-05T06:06:40.817394+00:00"}