{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:KPLIXBYPP2WGDBDOSADOEWZGTT","short_pith_number":"pith:KPLIXBYP","schema_version":"1.0","canonical_sha256":"53d68b870f7eac61846e9006e25b269ce01bf30730fd410da900ddff3edbfeaa","source":{"kind":"arxiv","id":"2301.07747","version":2},"attestation_state":"computed","paper":{"title":"An Automata-based Framework for Verification and Bug Hunting in Quantum Circuits (Technical Report)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Di-De Yen, Jyun-Ao Lin, Kai-Min Chung, Ond\\v{r}ej Leng\\'al, Wei-Lun Tsai, Yu-Fang Chen","submitted_at":"2023-01-18T19:26:01Z","abstract_excerpt":"We introduce a new paradigm for analysing and finding bugs in quantum circuits. In our approach, the problem is given by a triple $\\{P\\}\\,C\\,\\{Q\\}$ and the question is whether, given a set $P$ of quantum states on the input of a circuit $C$, the set of quantum states on the output is equal to (or included in) a set $Q$. While this is not suitable to specify, e.g., functional correctness of a quantum circuit, it is sufficient to detect many bugs in quantum circuits. We propose a technique based on tree automata to compactly represent sets of quantum states and develop transformers to implement "},"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":"2301.07747","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2023-01-18T19:26:01Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"fc07837cf84bedd62c08d72f53cb6100252d102dcf3c5d8078d14c980377b247","abstract_canon_sha256":"dab04a6edf9769c760de7372a0bec2ee357c681fea7bb6b0a3189a350634dfde"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:15:50.846788Z","signature_b64":"48ZHI/MiMv2AdGH0kivhSy2ezRLUG+7VepoYnnrO1OylMnPqY0B8CFrhzVHl+dSO1jV/w7mHIQo/u23BDc9bAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53d68b870f7eac61846e9006e25b269ce01bf30730fd410da900ddff3edbfeaa","last_reissued_at":"2026-07-05T07:15:50.846230Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:15:50.846230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Automata-based Framework for Verification and Bug Hunting in Quantum Circuits (Technical Report)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Di-De Yen, Jyun-Ao Lin, Kai-Min Chung, Ond\\v{r}ej Leng\\'al, Wei-Lun Tsai, Yu-Fang Chen","submitted_at":"2023-01-18T19:26:01Z","abstract_excerpt":"We introduce a new paradigm for analysing and finding bugs in quantum circuits. In our approach, the problem is given by a triple $\\{P\\}\\,C\\,\\{Q\\}$ and the question is whether, given a set $P$ of quantum states on the input of a circuit $C$, the set of quantum states on the output is equal to (or included in) a set $Q$. While this is not suitable to specify, e.g., functional correctness of a quantum circuit, it is sufficient to detect many bugs in quantum circuits. We propose a technique based on tree automata to compactly represent sets of quantum states and develop transformers to implement "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.07747","kind":"arxiv","version":2},"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/2301.07747/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":"2301.07747","created_at":"2026-07-05T07:15:50.846290+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.07747v2","created_at":"2026-07-05T07:15:50.846290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.07747","created_at":"2026-07-05T07:15:50.846290+00:00"},{"alias_kind":"pith_short_12","alias_value":"KPLIXBYPP2WG","created_at":"2026-07-05T07:15:50.846290+00:00"},{"alias_kind":"pith_short_16","alias_value":"KPLIXBYPP2WGDBDO","created_at":"2026-07-05T07:15:50.846290+00:00"},{"alias_kind":"pith_short_8","alias_value":"KPLIXBYP","created_at":"2026-07-05T07:15:50.846290+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/KPLIXBYPP2WGDBDOSADOEWZGTT","json":"https://pith.science/pith/KPLIXBYPP2WGDBDOSADOEWZGTT.json","graph_json":"https://pith.science/api/pith-number/KPLIXBYPP2WGDBDOSADOEWZGTT/graph.json","events_json":"https://pith.science/api/pith-number/KPLIXBYPP2WGDBDOSADOEWZGTT/events.json","paper":"https://pith.science/paper/KPLIXBYP"},"agent_actions":{"view_html":"https://pith.science/pith/KPLIXBYPP2WGDBDOSADOEWZGTT","download_json":"https://pith.science/pith/KPLIXBYPP2WGDBDOSADOEWZGTT.json","view_paper":"https://pith.science/paper/KPLIXBYP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.07747&json=true","fetch_graph":"https://pith.science/api/pith-number/KPLIXBYPP2WGDBDOSADOEWZGTT/graph.json","fetch_events":"https://pith.science/api/pith-number/KPLIXBYPP2WGDBDOSADOEWZGTT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KPLIXBYPP2WGDBDOSADOEWZGTT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KPLIXBYPP2WGDBDOSADOEWZGTT/action/storage_attestation","attest_author":"https://pith.science/pith/KPLIXBYPP2WGDBDOSADOEWZGTT/action/author_attestation","sign_citation":"https://pith.science/pith/KPLIXBYPP2WGDBDOSADOEWZGTT/action/citation_signature","submit_replication":"https://pith.science/pith/KPLIXBYPP2WGDBDOSADOEWZGTT/action/replication_record"}},"created_at":"2026-07-05T07:15:50.846290+00:00","updated_at":"2026-07-05T07:15:50.846290+00:00"}