{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:LRKMOTAUKI4JDX54QNY56G6RKD","short_pith_number":"pith:LRKMOTAU","schema_version":"1.0","canonical_sha256":"5c54c74c14523891dfbc8371df1bd150d486998f1732165b1192d3b6c65ae9e7","source":{"kind":"arxiv","id":"2009.02618","version":3},"attestation_state":"computed","paper":{"title":"A Tensor Network based Decision Diagram for Representation of Quantum Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Mingsheng Ying, Sanjiang Li, Xiangzhen Zhou, Xin Hong, Yuan Feng","submitted_at":"2020-09-06T00:12:31Z","abstract_excerpt":"Tensor networks have been successfully applied in simulation of quantum physical systems for decades. Recently, they have also been employed in classical simulation of quantum computing, in particular, random quantum circuits. This paper proposes a decision diagram style data structure, called TDD (Tensor Decision Diagram), for more principled and convenient applications of tensor networks. This new data structure provides a compact and canonical representation for quantum circuits. By exploiting circuit partition, the TDD of a quantum circuit can be computed efficiently. Furthermore, we show "},"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":"2009.02618","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-09-06T00:12:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"58dc6535776aa09e22fd4c1f3fb759c6a497eab01d6b7aafba0489ed2f768e55","abstract_canon_sha256":"d30e86c46d947c7b9813c3ec067fda33166b7a92070290dd4affb988552f1044"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:32:11.190918Z","signature_b64":"apYnyQyTgtGyl0NqkHYTBMFyw4m/egm9Oo5wCgOWLk7OFiO9MxPjxeRlcUQbhYP3rkcK2CiWV5NcHBAEgn1pBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c54c74c14523891dfbc8371df1bd150d486998f1732165b1192d3b6c65ae9e7","last_reissued_at":"2026-07-05T11:32:11.190491Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:32:11.190491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tensor Network based Decision Diagram for Representation of Quantum Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Mingsheng Ying, Sanjiang Li, Xiangzhen Zhou, Xin Hong, Yuan Feng","submitted_at":"2020-09-06T00:12:31Z","abstract_excerpt":"Tensor networks have been successfully applied in simulation of quantum physical systems for decades. Recently, they have also been employed in classical simulation of quantum computing, in particular, random quantum circuits. This paper proposes a decision diagram style data structure, called TDD (Tensor Decision Diagram), for more principled and convenient applications of tensor networks. This new data structure provides a compact and canonical representation for quantum circuits. By exploiting circuit partition, the TDD of a quantum circuit can be computed efficiently. Furthermore, we show "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.02618","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/2009.02618/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":"2009.02618","created_at":"2026-07-05T11:32:11.190550+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.02618v3","created_at":"2026-07-05T11:32:11.190550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.02618","created_at":"2026-07-05T11:32:11.190550+00:00"},{"alias_kind":"pith_short_12","alias_value":"LRKMOTAUKI4J","created_at":"2026-07-05T11:32:11.190550+00:00"},{"alias_kind":"pith_short_16","alias_value":"LRKMOTAUKI4JDX54","created_at":"2026-07-05T11:32:11.190550+00:00"},{"alias_kind":"pith_short_8","alias_value":"LRKMOTAU","created_at":"2026-07-05T11:32:11.190550+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.01930","citing_title":"A Matrix Product State Representation of Boolean Functions","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LRKMOTAUKI4JDX54QNY56G6RKD","json":"https://pith.science/pith/LRKMOTAUKI4JDX54QNY56G6RKD.json","graph_json":"https://pith.science/api/pith-number/LRKMOTAUKI4JDX54QNY56G6RKD/graph.json","events_json":"https://pith.science/api/pith-number/LRKMOTAUKI4JDX54QNY56G6RKD/events.json","paper":"https://pith.science/paper/LRKMOTAU"},"agent_actions":{"view_html":"https://pith.science/pith/LRKMOTAUKI4JDX54QNY56G6RKD","download_json":"https://pith.science/pith/LRKMOTAUKI4JDX54QNY56G6RKD.json","view_paper":"https://pith.science/paper/LRKMOTAU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.02618&json=true","fetch_graph":"https://pith.science/api/pith-number/LRKMOTAUKI4JDX54QNY56G6RKD/graph.json","fetch_events":"https://pith.science/api/pith-number/LRKMOTAUKI4JDX54QNY56G6RKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LRKMOTAUKI4JDX54QNY56G6RKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LRKMOTAUKI4JDX54QNY56G6RKD/action/storage_attestation","attest_author":"https://pith.science/pith/LRKMOTAUKI4JDX54QNY56G6RKD/action/author_attestation","sign_citation":"https://pith.science/pith/LRKMOTAUKI4JDX54QNY56G6RKD/action/citation_signature","submit_replication":"https://pith.science/pith/LRKMOTAUKI4JDX54QNY56G6RKD/action/replication_record"}},"created_at":"2026-07-05T11:32:11.190550+00:00","updated_at":"2026-07-05T11:32:11.190550+00:00"}