{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:COVKHPOP5ZKQH56H6O5IOCYCEH","short_pith_number":"pith:COVKHPOP","schema_version":"1.0","canonical_sha256":"13aaa3bdcfee5503f7c7f3ba870b0221d066e556b05476ef6d4470ac3c7865b3","source":{"kind":"arxiv","id":"1811.09709","version":3},"attestation_state":"computed","paper":{"title":"Accrediting outputs of noisy intermediate-scale quantum computing devices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Animesh Datta, Samuele Ferracin, Theodoros Kapourniotis","submitted_at":"2018-11-23T21:52:33Z","abstract_excerpt":"We present an accreditation protocol for the outputs of noisy intermediate-scale quantum devices. By testing entire circuits rather than individual gates, our accreditation protocol can provide an upper-bound on the variation distance between noisy and noiseless probability distribution of the outputs of the target circuit of interest. Our accreditation protocol requires implementation of quantum circuits no larger than the target circuit, therefore it is practical in the near term and scalable in the long term. Inspired by trap-based protocols for the verification of quantum computations, our"},"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":"1811.09709","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-23T21:52:33Z","cross_cats_sorted":[],"title_canon_sha256":"beebf44a1a90011868539aff8ab70ff837da6fd438473e9477530319dec18c1f","abstract_canon_sha256":"9c63672d2b39829fab25b78556030432ff2e63b14027e7c61e389dc053e41b65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:20:42.533824Z","signature_b64":"hMqhXSi0E58zcEDxgGkqXW/X+Xn1HXQV83i6XmfMwXAiqvkyAXMBcOG/+IT+HOx5EpKgftDdM+uinIOSnkIdCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13aaa3bdcfee5503f7c7f3ba870b0221d066e556b05476ef6d4470ac3c7865b3","last_reissued_at":"2026-07-05T00:20:42.533431Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:20:42.533431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accrediting outputs of noisy intermediate-scale quantum computing devices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Animesh Datta, Samuele Ferracin, Theodoros Kapourniotis","submitted_at":"2018-11-23T21:52:33Z","abstract_excerpt":"We present an accreditation protocol for the outputs of noisy intermediate-scale quantum devices. By testing entire circuits rather than individual gates, our accreditation protocol can provide an upper-bound on the variation distance between noisy and noiseless probability distribution of the outputs of the target circuit of interest. Our accreditation protocol requires implementation of quantum circuits no larger than the target circuit, therefore it is practical in the near term and scalable in the long term. Inspired by trap-based protocols for the verification of quantum computations, our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09709","kind":"arxiv","version":3},"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/1811.09709/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":"1811.09709","created_at":"2026-07-05T00:20:42.533485+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.09709v3","created_at":"2026-07-05T00:20:42.533485+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09709","created_at":"2026-07-05T00:20:42.533485+00:00"},{"alias_kind":"pith_short_12","alias_value":"COVKHPOP5ZKQ","created_at":"2026-07-05T00:20:42.533485+00:00"},{"alias_kind":"pith_short_16","alias_value":"COVKHPOP5ZKQH56H","created_at":"2026-07-05T00:20:42.533485+00:00"},{"alias_kind":"pith_short_8","alias_value":"COVKHPOP","created_at":"2026-07-05T00:20:42.533485+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.00827","citing_title":"In situ characterization of linear-optical networks in randomized boson sampling","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/COVKHPOP5ZKQH56H6O5IOCYCEH","json":"https://pith.science/pith/COVKHPOP5ZKQH56H6O5IOCYCEH.json","graph_json":"https://pith.science/api/pith-number/COVKHPOP5ZKQH56H6O5IOCYCEH/graph.json","events_json":"https://pith.science/api/pith-number/COVKHPOP5ZKQH56H6O5IOCYCEH/events.json","paper":"https://pith.science/paper/COVKHPOP"},"agent_actions":{"view_html":"https://pith.science/pith/COVKHPOP5ZKQH56H6O5IOCYCEH","download_json":"https://pith.science/pith/COVKHPOP5ZKQH56H6O5IOCYCEH.json","view_paper":"https://pith.science/paper/COVKHPOP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.09709&json=true","fetch_graph":"https://pith.science/api/pith-number/COVKHPOP5ZKQH56H6O5IOCYCEH/graph.json","fetch_events":"https://pith.science/api/pith-number/COVKHPOP5ZKQH56H6O5IOCYCEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/COVKHPOP5ZKQH56H6O5IOCYCEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/COVKHPOP5ZKQH56H6O5IOCYCEH/action/storage_attestation","attest_author":"https://pith.science/pith/COVKHPOP5ZKQH56H6O5IOCYCEH/action/author_attestation","sign_citation":"https://pith.science/pith/COVKHPOP5ZKQH56H6O5IOCYCEH/action/citation_signature","submit_replication":"https://pith.science/pith/COVKHPOP5ZKQH56H6O5IOCYCEH/action/replication_record"}},"created_at":"2026-07-05T00:20:42.533485+00:00","updated_at":"2026-07-05T00:20:42.533485+00:00"}