{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NWEK4MT2Y3CQXW6JLFUBBSCXL5","short_pith_number":"pith:NWEK4MT2","schema_version":"1.0","canonical_sha256":"6d88ae327ac6c50bdbc9596810c8575f5c4dde438365c03f9951ba2371a57ec0","source":{"kind":"arxiv","id":"2301.07730","version":2},"attestation_state":"computed","paper":{"title":"stateQIP = statePSPACE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Henry Yuen, Tony Metger","submitted_at":"2023-01-18T19:00:17Z","abstract_excerpt":"Complexity theory traditionally studies the hardness of solving classical computational problems. In the quantum setting, it is also natural to consider a different notion of complexity, namely the complexity of physically preparing a certain quantum state. We study the relation between two such state complexity classes: statePSPACE, which contains states that can be generated by space-uniform polynomial-space quantum circuits, and stateQIP, which contains states that a polynomial-time quantum verifier can generate by interacting with an all-powerful untrusted quantum prover. The latter class "},"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":"2301.07730","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-01-18T19:00:17Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"9835d61d316d77b9b67187bd8b268e34c2a86a4c72837b71ceba1345c68729a5","abstract_canon_sha256":"75042a69da153d103ed5478395a62068752329cdfe7020316faee6d4a136940e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:59:22.978697Z","signature_b64":"bu9/3bq0xsBjCDXjo6vUSB4+A9ItYRAoSNh5EpulzPH0yjJHDQpII3RiAi8idMsBNvHH7CAf7rnH20a7Gg5wCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d88ae327ac6c50bdbc9596810c8575f5c4dde438365c03f9951ba2371a57ec0","last_reissued_at":"2026-07-05T05:59:22.978183Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:59:22.978183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"stateQIP = statePSPACE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Henry Yuen, Tony Metger","submitted_at":"2023-01-18T19:00:17Z","abstract_excerpt":"Complexity theory traditionally studies the hardness of solving classical computational problems. In the quantum setting, it is also natural to consider a different notion of complexity, namely the complexity of physically preparing a certain quantum state. We study the relation between two such state complexity classes: statePSPACE, which contains states that can be generated by space-uniform polynomial-space quantum circuits, and stateQIP, which contains states that a polynomial-time quantum verifier can generate by interacting with an all-powerful untrusted quantum prover. The latter class "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.07730","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/2301.07730/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":"2301.07730","created_at":"2026-07-05T05:59:22.978245+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.07730v2","created_at":"2026-07-05T05:59:22.978245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.07730","created_at":"2026-07-05T05:59:22.978245+00:00"},{"alias_kind":"pith_short_12","alias_value":"NWEK4MT2Y3CQ","created_at":"2026-07-05T05:59:22.978245+00:00"},{"alias_kind":"pith_short_16","alias_value":"NWEK4MT2Y3CQXW6J","created_at":"2026-07-05T05:59:22.978245+00:00"},{"alias_kind":"pith_short_8","alias_value":"NWEK4MT2","created_at":"2026-07-05T05:59:22.978245+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.10674","citing_title":"Optimal fidelity estimation when one state is pure via algorithmic Uhlmann transform","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NWEK4MT2Y3CQXW6JLFUBBSCXL5","json":"https://pith.science/pith/NWEK4MT2Y3CQXW6JLFUBBSCXL5.json","graph_json":"https://pith.science/api/pith-number/NWEK4MT2Y3CQXW6JLFUBBSCXL5/graph.json","events_json":"https://pith.science/api/pith-number/NWEK4MT2Y3CQXW6JLFUBBSCXL5/events.json","paper":"https://pith.science/paper/NWEK4MT2"},"agent_actions":{"view_html":"https://pith.science/pith/NWEK4MT2Y3CQXW6JLFUBBSCXL5","download_json":"https://pith.science/pith/NWEK4MT2Y3CQXW6JLFUBBSCXL5.json","view_paper":"https://pith.science/paper/NWEK4MT2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.07730&json=true","fetch_graph":"https://pith.science/api/pith-number/NWEK4MT2Y3CQXW6JLFUBBSCXL5/graph.json","fetch_events":"https://pith.science/api/pith-number/NWEK4MT2Y3CQXW6JLFUBBSCXL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NWEK4MT2Y3CQXW6JLFUBBSCXL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NWEK4MT2Y3CQXW6JLFUBBSCXL5/action/storage_attestation","attest_author":"https://pith.science/pith/NWEK4MT2Y3CQXW6JLFUBBSCXL5/action/author_attestation","sign_citation":"https://pith.science/pith/NWEK4MT2Y3CQXW6JLFUBBSCXL5/action/citation_signature","submit_replication":"https://pith.science/pith/NWEK4MT2Y3CQXW6JLFUBBSCXL5/action/replication_record"}},"created_at":"2026-07-05T05:59:22.978245+00:00","updated_at":"2026-07-05T05:59:22.978245+00:00"}