{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TURF4MNQAGCDVAYFH3LU3XI7X7","short_pith_number":"pith:TURF4MNQ","schema_version":"1.0","canonical_sha256":"9d225e31b001843a83053ed74ddd1fbfd2da97358c6131c667cfaa980ef1ae16","source":{"kind":"arxiv","id":"2410.23618","version":1},"attestation_state":"computed","paper":{"title":"Learning quantum states prepared by shallow circuits in polynomial time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG"],"primary_cat":"quant-ph","authors_text":"Yunchao Liu, Zeph Landau","submitted_at":"2024-10-31T04:12:49Z","abstract_excerpt":"We give a polynomial time algorithm that, given copies of an unknown quantum state $\\vert\\psi\\rangle=U\\vert 0^n\\rangle$ that is prepared by an unknown constant depth circuit $U$ on a finite-dimensional lattice, learns a constant depth quantum circuit that prepares $\\vert\\psi\\rangle$. The algorithm extends to the case when the depth of $U$ is $\\mathrm{polylog}(n)$, with a quasi-polynomial run-time. The key new idea is a simple and general procedure that efficiently reconstructs the global state $\\vert\\psi\\rangle$ from its local reduced density matrices. As an application, we give an efficient a"},"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":"2410.23618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-31T04:12:49Z","cross_cats_sorted":["cs.CC","cs.LG"],"title_canon_sha256":"575531b984277a72da8cac6f324425073c7f42fe2a3dd8e2124a6362acee9547","abstract_canon_sha256":"546ee206de1321f67c32983b4ca651d9411f252533df131a622e50fb56ada41f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:33.116783Z","signature_b64":"fMDlkATa+m7atkUufVC3dDMLbaoOeT3j7sxtC0cG4wKFUs/TEgI20BKjkL3QljK1VAadFkqyICzgBIVrn2vGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d225e31b001843a83053ed74ddd1fbfd2da97358c6131c667cfaa980ef1ae16","last_reissued_at":"2026-07-05T11:22:33.116275Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:33.116275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning quantum states prepared by shallow circuits in polynomial time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG"],"primary_cat":"quant-ph","authors_text":"Yunchao Liu, Zeph Landau","submitted_at":"2024-10-31T04:12:49Z","abstract_excerpt":"We give a polynomial time algorithm that, given copies of an unknown quantum state $\\vert\\psi\\rangle=U\\vert 0^n\\rangle$ that is prepared by an unknown constant depth circuit $U$ on a finite-dimensional lattice, learns a constant depth quantum circuit that prepares $\\vert\\psi\\rangle$. The algorithm extends to the case when the depth of $U$ is $\\mathrm{polylog}(n)$, with a quasi-polynomial run-time. The key new idea is a simple and general procedure that efficiently reconstructs the global state $\\vert\\psi\\rangle$ from its local reduced density matrices. As an application, we give an efficient a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.23618","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.23618/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":"2410.23618","created_at":"2026-07-05T11:22:33.116340+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.23618v1","created_at":"2026-07-05T11:22:33.116340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.23618","created_at":"2026-07-05T11:22:33.116340+00:00"},{"alias_kind":"pith_short_12","alias_value":"TURF4MNQAGCD","created_at":"2026-07-05T11:22:33.116340+00:00"},{"alias_kind":"pith_short_16","alias_value":"TURF4MNQAGCDVAYF","created_at":"2026-07-05T11:22:33.116340+00:00"},{"alias_kind":"pith_short_8","alias_value":"TURF4MNQ","created_at":"2026-07-05T11:22:33.116340+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.17580","citing_title":"Certifying localizable quantum properties with constant sample complexity","ref_index":51,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TURF4MNQAGCDVAYFH3LU3XI7X7","json":"https://pith.science/pith/TURF4MNQAGCDVAYFH3LU3XI7X7.json","graph_json":"https://pith.science/api/pith-number/TURF4MNQAGCDVAYFH3LU3XI7X7/graph.json","events_json":"https://pith.science/api/pith-number/TURF4MNQAGCDVAYFH3LU3XI7X7/events.json","paper":"https://pith.science/paper/TURF4MNQ"},"agent_actions":{"view_html":"https://pith.science/pith/TURF4MNQAGCDVAYFH3LU3XI7X7","download_json":"https://pith.science/pith/TURF4MNQAGCDVAYFH3LU3XI7X7.json","view_paper":"https://pith.science/paper/TURF4MNQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.23618&json=true","fetch_graph":"https://pith.science/api/pith-number/TURF4MNQAGCDVAYFH3LU3XI7X7/graph.json","fetch_events":"https://pith.science/api/pith-number/TURF4MNQAGCDVAYFH3LU3XI7X7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TURF4MNQAGCDVAYFH3LU3XI7X7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TURF4MNQAGCDVAYFH3LU3XI7X7/action/storage_attestation","attest_author":"https://pith.science/pith/TURF4MNQAGCDVAYFH3LU3XI7X7/action/author_attestation","sign_citation":"https://pith.science/pith/TURF4MNQAGCDVAYFH3LU3XI7X7/action/citation_signature","submit_replication":"https://pith.science/pith/TURF4MNQAGCDVAYFH3LU3XI7X7/action/replication_record"}},"created_at":"2026-07-05T11:22:33.116340+00:00","updated_at":"2026-07-05T11:22:33.116340+00:00"}