{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JEJ5N5QVPZZ2THEMK5TOH22TEB","short_pith_number":"pith:JEJ5N5QV","schema_version":"1.0","canonical_sha256":"4913d6f6157e73a99c8c5766e3eb53206848509057eb779cf7d32d4c6aae50a2","source":{"kind":"arxiv","id":"1910.05729","version":1},"attestation_state":"computed","paper":{"title":"Efficient simulation of random states and random unitaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Alexander Russell, Christian Majenz, Gorjan Alagic","submitted_at":"2019-10-13T10:57:04Z","abstract_excerpt":"We consider the problem of efficiently simulating random quantum states and random unitary operators, in a manner which is convincing to unbounded adversaries with black-box oracle access.\n  This problem has previously only been considered for restricted adversaries. Against adversaries with an a priori bound on the number of queries, it is well-known that $t$-designs suffice. Against polynomial-time adversaries, one can use pseudorandom states (PRS) and pseudorandom unitaries (PRU), as defined in a recent work of Ji, Liu, and Song; unfortunately, no provably secure construction is known for P"},"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":"1910.05729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-10-13T10:57:04Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"97f2a930396c86dbfb2122389b0a9bbd8dbcc542059a6164477cccffb4566832","abstract_canon_sha256":"0e9412e4c1df39127115ad64b4783de2a33fa51be749379adbf709c568f3b205"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:10:28.966751Z","signature_b64":"HUTfjy8ZXB4by244hCSzp7A22O2HhDClz1/jyaZAE2urjncepB7xENllYreUTiqhZZIZjulchtfdBsssZru+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4913d6f6157e73a99c8c5766e3eb53206848509057eb779cf7d32d4c6aae50a2","last_reissued_at":"2026-07-05T01:10:28.966106Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:10:28.966106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient simulation of random states and random unitaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Alexander Russell, Christian Majenz, Gorjan Alagic","submitted_at":"2019-10-13T10:57:04Z","abstract_excerpt":"We consider the problem of efficiently simulating random quantum states and random unitary operators, in a manner which is convincing to unbounded adversaries with black-box oracle access.\n  This problem has previously only been considered for restricted adversaries. Against adversaries with an a priori bound on the number of queries, it is well-known that $t$-designs suffice. Against polynomial-time adversaries, one can use pseudorandom states (PRS) and pseudorandom unitaries (PRU), as defined in a recent work of Ji, Liu, and Song; unfortunately, no provably secure construction is known for P"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.05729","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/1910.05729/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":"1910.05729","created_at":"2026-07-05T01:10:28.966186+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.05729v1","created_at":"2026-07-05T01:10:28.966186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.05729","created_at":"2026-07-05T01:10:28.966186+00:00"},{"alias_kind":"pith_short_12","alias_value":"JEJ5N5QVPZZ2","created_at":"2026-07-05T01:10:28.966186+00:00"},{"alias_kind":"pith_short_16","alias_value":"JEJ5N5QVPZZ2THEM","created_at":"2026-07-05T01:10:28.966186+00:00"},{"alias_kind":"pith_short_8","alias_value":"JEJ5N5QV","created_at":"2026-07-05T01:10:28.966186+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JEJ5N5QVPZZ2THEMK5TOH22TEB","json":"https://pith.science/pith/JEJ5N5QVPZZ2THEMK5TOH22TEB.json","graph_json":"https://pith.science/api/pith-number/JEJ5N5QVPZZ2THEMK5TOH22TEB/graph.json","events_json":"https://pith.science/api/pith-number/JEJ5N5QVPZZ2THEMK5TOH22TEB/events.json","paper":"https://pith.science/paper/JEJ5N5QV"},"agent_actions":{"view_html":"https://pith.science/pith/JEJ5N5QVPZZ2THEMK5TOH22TEB","download_json":"https://pith.science/pith/JEJ5N5QVPZZ2THEMK5TOH22TEB.json","view_paper":"https://pith.science/paper/JEJ5N5QV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.05729&json=true","fetch_graph":"https://pith.science/api/pith-number/JEJ5N5QVPZZ2THEMK5TOH22TEB/graph.json","fetch_events":"https://pith.science/api/pith-number/JEJ5N5QVPZZ2THEMK5TOH22TEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JEJ5N5QVPZZ2THEMK5TOH22TEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JEJ5N5QVPZZ2THEMK5TOH22TEB/action/storage_attestation","attest_author":"https://pith.science/pith/JEJ5N5QVPZZ2THEMK5TOH22TEB/action/author_attestation","sign_citation":"https://pith.science/pith/JEJ5N5QVPZZ2THEMK5TOH22TEB/action/citation_signature","submit_replication":"https://pith.science/pith/JEJ5N5QVPZZ2THEMK5TOH22TEB/action/replication_record"}},"created_at":"2026-07-05T01:10:28.966186+00:00","updated_at":"2026-07-05T01:10:28.966186+00:00"}