{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7NAPSMAF7BLTUPFCZDWZDB73XK","short_pith_number":"pith:7NAPSMAF","schema_version":"1.0","canonical_sha256":"fb40f93005f8573a3ca2c8ed9187fbbaa86c2f582b4b1c653e6c52d68a8df512","source":{"kind":"arxiv","id":"1108.1052","version":1},"attestation_state":"computed","paper":{"title":"Testing quantum circuits and detecting insecure encryption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bill Rosgen","submitted_at":"2011-08-04T11:53:50Z","abstract_excerpt":"We show that computational problem of testing the behaviour of quantum circuits is hard for the class of problems known as QMA that can be verified efficiently with a quantum computer. This result is a generalization of the techniques previously used to prove the hardness of other problem on quantum circuits. We use this result to show the QMA-hardness of a weak version of the problem of detecting the insecurity of a symmetric-key quantum encryption system, or alternately the problem of determining when a quantum channel is not private. We also give a QMA protocol for the problem of detecting "},"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":"1108.1052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-08-04T11:53:50Z","cross_cats_sorted":[],"title_canon_sha256":"f20687e5037fa1cea9b46e466a2e0e3d376bef2e11b3dae13e463ea0b69dc805","abstract_canon_sha256":"adbbaf7f43cfde0db4ca8eceabbca0752392c0b94482ffdba827cafb5d5ac357"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:12.772930Z","signature_b64":"+bTw1Bx2qVnUsVOyS7OsZ5q2PpVCgymlka6EL7RLZBuygpSpNC8SV5Xm/mq0YW4IGPTIa/8HxnOXQen1LiuCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb40f93005f8573a3ca2c8ed9187fbbaa86c2f582b4b1c653e6c52d68a8df512","last_reissued_at":"2026-05-18T04:16:12.772347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:12.772347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Testing quantum circuits and detecting insecure encryption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bill Rosgen","submitted_at":"2011-08-04T11:53:50Z","abstract_excerpt":"We show that computational problem of testing the behaviour of quantum circuits is hard for the class of problems known as QMA that can be verified efficiently with a quantum computer. This result is a generalization of the techniques previously used to prove the hardness of other problem on quantum circuits. We use this result to show the QMA-hardness of a weak version of the problem of detecting the insecurity of a symmetric-key quantum encryption system, or alternately the problem of determining when a quantum channel is not private. We also give a QMA protocol for the problem of detecting "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1052","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":"1108.1052","created_at":"2026-05-18T04:16:12.772443+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.1052v1","created_at":"2026-05-18T04:16:12.772443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1052","created_at":"2026-05-18T04:16:12.772443+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NAPSMAF7BLT","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NAPSMAF7BLTUPFC","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NAPSMAF","created_at":"2026-05-18T12:26:22.705136+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/7NAPSMAF7BLTUPFCZDWZDB73XK","json":"https://pith.science/pith/7NAPSMAF7BLTUPFCZDWZDB73XK.json","graph_json":"https://pith.science/api/pith-number/7NAPSMAF7BLTUPFCZDWZDB73XK/graph.json","events_json":"https://pith.science/api/pith-number/7NAPSMAF7BLTUPFCZDWZDB73XK/events.json","paper":"https://pith.science/paper/7NAPSMAF"},"agent_actions":{"view_html":"https://pith.science/pith/7NAPSMAF7BLTUPFCZDWZDB73XK","download_json":"https://pith.science/pith/7NAPSMAF7BLTUPFCZDWZDB73XK.json","view_paper":"https://pith.science/paper/7NAPSMAF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.1052&json=true","fetch_graph":"https://pith.science/api/pith-number/7NAPSMAF7BLTUPFCZDWZDB73XK/graph.json","fetch_events":"https://pith.science/api/pith-number/7NAPSMAF7BLTUPFCZDWZDB73XK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NAPSMAF7BLTUPFCZDWZDB73XK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NAPSMAF7BLTUPFCZDWZDB73XK/action/storage_attestation","attest_author":"https://pith.science/pith/7NAPSMAF7BLTUPFCZDWZDB73XK/action/author_attestation","sign_citation":"https://pith.science/pith/7NAPSMAF7BLTUPFCZDWZDB73XK/action/citation_signature","submit_replication":"https://pith.science/pith/7NAPSMAF7BLTUPFCZDWZDB73XK/action/replication_record"}},"created_at":"2026-05-18T04:16:12.772443+00:00","updated_at":"2026-05-18T04:16:12.772443+00:00"}