{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:A6AG2H2V3WSSJV4HUDMFGT5R3F","short_pith_number":"pith:A6AG2H2V","schema_version":"1.0","canonical_sha256":"07806d1f55dda524d787a0d8534fb1d95dafca219250381a24e151a06d7c3269","source":{"kind":"arxiv","id":"2306.16701","version":1},"attestation_state":"computed","paper":{"title":"TrojanNet: Detecting Trojans in Quantum Circuits using Machine Learning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Subrata Das, Swaroop Ghosh","submitted_at":"2023-06-29T05:56:05Z","abstract_excerpt":"Quantum computing holds tremendous potential for various applications, but its security remains a crucial concern. Quantum circuits need high-quality compilers to optimize the depth and gate count to boost the success probability on current noisy quantum computers. There is a rise of efficient but unreliable/untrusted compilers; however, they present a risk of tampering such as Trojan insertion. We propose TrojanNet, a novel approach to enhance the security of quantum circuits by detecting and classifying Trojan-inserted circuits. In particular, we focus on the Quantum Approximate Optimization"},"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":"2306.16701","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2023-06-29T05:56:05Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"68da7a2f3b3c2669071e39160cf445c78930d8d75c0651c6f50a6195a67c2dfb","abstract_canon_sha256":"265f282cf626bf2fcd238afb9f24881f2547a16f018ec9e9c6ea3af831e6c082"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:26:08.477123Z","signature_b64":"tARzf0NYgas7Se8638Ty4mA6OUqHBq3rbY1WyAkWruTsdfTT6MBo4GS9mqF1JCyV3HExwrxo1WbSNHWrtJ3ZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07806d1f55dda524d787a0d8534fb1d95dafca219250381a24e151a06d7c3269","last_reissued_at":"2026-07-05T06:26:08.476666Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:26:08.476666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TrojanNet: Detecting Trojans in Quantum Circuits using Machine Learning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Subrata Das, Swaroop Ghosh","submitted_at":"2023-06-29T05:56:05Z","abstract_excerpt":"Quantum computing holds tremendous potential for various applications, but its security remains a crucial concern. Quantum circuits need high-quality compilers to optimize the depth and gate count to boost the success probability on current noisy quantum computers. There is a rise of efficient but unreliable/untrusted compilers; however, they present a risk of tampering such as Trojan insertion. We propose TrojanNet, a novel approach to enhance the security of quantum circuits by detecting and classifying Trojan-inserted circuits. In particular, we focus on the Quantum Approximate Optimization"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.16701","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/2306.16701/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":"2306.16701","created_at":"2026-07-05T06:26:08.476723+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.16701v1","created_at":"2026-07-05T06:26:08.476723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.16701","created_at":"2026-07-05T06:26:08.476723+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6AG2H2V3WSS","created_at":"2026-07-05T06:26:08.476723+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6AG2H2V3WSSJV4H","created_at":"2026-07-05T06:26:08.476723+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6AG2H2V","created_at":"2026-07-05T06:26:08.476723+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.18821","citing_title":"Quantum Adversarial Machine Learning: From Classical Adaptations to Quantum-Native Methods","ref_index":69,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A6AG2H2V3WSSJV4HUDMFGT5R3F","json":"https://pith.science/pith/A6AG2H2V3WSSJV4HUDMFGT5R3F.json","graph_json":"https://pith.science/api/pith-number/A6AG2H2V3WSSJV4HUDMFGT5R3F/graph.json","events_json":"https://pith.science/api/pith-number/A6AG2H2V3WSSJV4HUDMFGT5R3F/events.json","paper":"https://pith.science/paper/A6AG2H2V"},"agent_actions":{"view_html":"https://pith.science/pith/A6AG2H2V3WSSJV4HUDMFGT5R3F","download_json":"https://pith.science/pith/A6AG2H2V3WSSJV4HUDMFGT5R3F.json","view_paper":"https://pith.science/paper/A6AG2H2V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.16701&json=true","fetch_graph":"https://pith.science/api/pith-number/A6AG2H2V3WSSJV4HUDMFGT5R3F/graph.json","fetch_events":"https://pith.science/api/pith-number/A6AG2H2V3WSSJV4HUDMFGT5R3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6AG2H2V3WSSJV4HUDMFGT5R3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6AG2H2V3WSSJV4HUDMFGT5R3F/action/storage_attestation","attest_author":"https://pith.science/pith/A6AG2H2V3WSSJV4HUDMFGT5R3F/action/author_attestation","sign_citation":"https://pith.science/pith/A6AG2H2V3WSSJV4HUDMFGT5R3F/action/citation_signature","submit_replication":"https://pith.science/pith/A6AG2H2V3WSSJV4HUDMFGT5R3F/action/replication_record"}},"created_at":"2026-07-05T06:26:08.476723+00:00","updated_at":"2026-07-05T06:26:08.476723+00:00"}