{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:42ZBM7PL233IS7PJN4ZRP5YQXK","short_pith_number":"pith:42ZBM7PL","schema_version":"1.0","canonical_sha256":"e6b2167debd6f6897de96f3317f710ba8c7b46d0cf47b61af3ac6195c1c0edaa","source":{"kind":"arxiv","id":"1608.00117","version":1},"attestation_state":"computed","paper":{"title":"Improved stochastic trace estimation using mutually unbiased bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.NA","quant-ph"],"primary_cat":"cs.NA","authors_text":"J. F. Fitzsimons, J. K. Fitzsimons, M. A. Osborne, S. J. Roberts","submitted_at":"2016-07-30T13:06:05Z","abstract_excerpt":"We examine the problem of estimating the trace of a matrix $A$ when given access to an oracle which computes $x^\\dagger A x$ for an input vector $x$. We make use of the basis vectors from a set of mutually unbiased bases, widely studied in the field of quantum information processing, in the selection of probing vectors $x$. This approach offers a new state of the art single shot sampling variance while requiring only $O(\\log(n))$ random bits to generate each vector. This significantly improves on traditional methods such as Hutchinson's and Gaussian estimators in terms of the number of random "},"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":"1608.00117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-07-30T13:06:05Z","cross_cats_sorted":["cs.DS","math.NA","quant-ph"],"title_canon_sha256":"1af328e8d246ae998dd52ddb9bf95f1b989f397ec3a4438ff017d2ab5c0103f2","abstract_canon_sha256":"4403c7b4cef2dbfff026020a39c8869934470eca8b5350d9006fa74261806cd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:13.772785Z","signature_b64":"anqalyqKQclaG61sd6Zw9f2VFENlTBLZTK2neAkt+X7yT9Lqo3df+cxFk2hvGa9T19vVKSa28DsJW8qrJbe3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6b2167debd6f6897de96f3317f710ba8c7b46d0cf47b61af3ac6195c1c0edaa","last_reissued_at":"2026-05-18T01:10:13.772362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:13.772362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved stochastic trace estimation using mutually unbiased bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.NA","quant-ph"],"primary_cat":"cs.NA","authors_text":"J. F. Fitzsimons, J. K. Fitzsimons, M. A. Osborne, S. J. Roberts","submitted_at":"2016-07-30T13:06:05Z","abstract_excerpt":"We examine the problem of estimating the trace of a matrix $A$ when given access to an oracle which computes $x^\\dagger A x$ for an input vector $x$. We make use of the basis vectors from a set of mutually unbiased bases, widely studied in the field of quantum information processing, in the selection of probing vectors $x$. This approach offers a new state of the art single shot sampling variance while requiring only $O(\\log(n))$ random bits to generate each vector. This significantly improves on traditional methods such as Hutchinson's and Gaussian estimators in terms of the number of random "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00117","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":"1608.00117","created_at":"2026-05-18T01:10:13.772428+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.00117v1","created_at":"2026-05-18T01:10:13.772428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00117","created_at":"2026-05-18T01:10:13.772428+00:00"},{"alias_kind":"pith_short_12","alias_value":"42ZBM7PL233I","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"42ZBM7PL233IS7PJ","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"42ZBM7PL","created_at":"2026-05-18T12:29:58.707656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2410.23997","citing_title":"Mutually Unbiased Bases in Composite Dimensions -- A Review","ref_index":146,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/42ZBM7PL233IS7PJN4ZRP5YQXK","json":"https://pith.science/pith/42ZBM7PL233IS7PJN4ZRP5YQXK.json","graph_json":"https://pith.science/api/pith-number/42ZBM7PL233IS7PJN4ZRP5YQXK/graph.json","events_json":"https://pith.science/api/pith-number/42ZBM7PL233IS7PJN4ZRP5YQXK/events.json","paper":"https://pith.science/paper/42ZBM7PL"},"agent_actions":{"view_html":"https://pith.science/pith/42ZBM7PL233IS7PJN4ZRP5YQXK","download_json":"https://pith.science/pith/42ZBM7PL233IS7PJN4ZRP5YQXK.json","view_paper":"https://pith.science/paper/42ZBM7PL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.00117&json=true","fetch_graph":"https://pith.science/api/pith-number/42ZBM7PL233IS7PJN4ZRP5YQXK/graph.json","fetch_events":"https://pith.science/api/pith-number/42ZBM7PL233IS7PJN4ZRP5YQXK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42ZBM7PL233IS7PJN4ZRP5YQXK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42ZBM7PL233IS7PJN4ZRP5YQXK/action/storage_attestation","attest_author":"https://pith.science/pith/42ZBM7PL233IS7PJN4ZRP5YQXK/action/author_attestation","sign_citation":"https://pith.science/pith/42ZBM7PL233IS7PJN4ZRP5YQXK/action/citation_signature","submit_replication":"https://pith.science/pith/42ZBM7PL233IS7PJN4ZRP5YQXK/action/replication_record"}},"created_at":"2026-05-18T01:10:13.772428+00:00","updated_at":"2026-05-18T01:10:13.772428+00:00"}