{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UTWQT2ZFXLBRTUTBTVLFRVYRWI","short_pith_number":"pith:UTWQT2ZF","schema_version":"1.0","canonical_sha256":"a4ed09eb25bac319d2619d5658d711b2369f45b8f95c6035d466e1b97fcf06a6","source":{"kind":"arxiv","id":"1501.00742","version":1},"attestation_state":"computed","paper":{"title":"LEQA: Latency Estimation for a Quantum Algorithm Mapped to a Quantum Circuit Fabric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Massoud Pedram, Mohammad Javad Dousti","submitted_at":"2015-01-05T01:13:06Z","abstract_excerpt":"This paper presents LEQA, a fast latency estimation tool for evaluating the performance of a quantum algorithm mapped to a quantum fabric. The actual quantum algorithm latency can be computed by performing detailed scheduling, placement and routing of the quantum instructions and qubits in a quantum operation dependency graph on a quantum circuit fabric. This is, however, a very expensive proposition that requires large amounts of processing time. Instead, LEQA, which is based on computing the neighborhood population counts of qubits, can produce estimates of the circuit latency with good accu"},"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":"1501.00742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-01-05T01:13:06Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"ec2b188e9581326abeefb51f376de1bf36467c9192acf4b30e51b7df9aee48ea","abstract_canon_sha256":"b4fe1b0bb7f375b95c25722b849b1db65235882159cff97db49bc44029570eef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:01.898060Z","signature_b64":"AB4r3rF4HWDXdawM4SQRwTMHWdoyF8YU5uohrP64gF0TiSl6/0WoiSPZ6vx1ksI9hSbh1UAVL1D4n4AUfaKFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4ed09eb25bac319d2619d5658d711b2369f45b8f95c6035d466e1b97fcf06a6","last_reissued_at":"2026-05-18T02:30:01.897696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:01.897696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LEQA: Latency Estimation for a Quantum Algorithm Mapped to a Quantum Circuit Fabric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Massoud Pedram, Mohammad Javad Dousti","submitted_at":"2015-01-05T01:13:06Z","abstract_excerpt":"This paper presents LEQA, a fast latency estimation tool for evaluating the performance of a quantum algorithm mapped to a quantum fabric. The actual quantum algorithm latency can be computed by performing detailed scheduling, placement and routing of the quantum instructions and qubits in a quantum operation dependency graph on a quantum circuit fabric. This is, however, a very expensive proposition that requires large amounts of processing time. Instead, LEQA, which is based on computing the neighborhood population counts of qubits, can produce estimates of the circuit latency with good accu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00742","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":"1501.00742","created_at":"2026-05-18T02:30:01.897759+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00742v1","created_at":"2026-05-18T02:30:01.897759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00742","created_at":"2026-05-18T02:30:01.897759+00:00"},{"alias_kind":"pith_short_12","alias_value":"UTWQT2ZFXLBR","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UTWQT2ZFXLBRTUTB","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UTWQT2ZF","created_at":"2026-05-18T12:29:44.643036+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/UTWQT2ZFXLBRTUTBTVLFRVYRWI","json":"https://pith.science/pith/UTWQT2ZFXLBRTUTBTVLFRVYRWI.json","graph_json":"https://pith.science/api/pith-number/UTWQT2ZFXLBRTUTBTVLFRVYRWI/graph.json","events_json":"https://pith.science/api/pith-number/UTWQT2ZFXLBRTUTBTVLFRVYRWI/events.json","paper":"https://pith.science/paper/UTWQT2ZF"},"agent_actions":{"view_html":"https://pith.science/pith/UTWQT2ZFXLBRTUTBTVLFRVYRWI","download_json":"https://pith.science/pith/UTWQT2ZFXLBRTUTBTVLFRVYRWI.json","view_paper":"https://pith.science/paper/UTWQT2ZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00742&json=true","fetch_graph":"https://pith.science/api/pith-number/UTWQT2ZFXLBRTUTBTVLFRVYRWI/graph.json","fetch_events":"https://pith.science/api/pith-number/UTWQT2ZFXLBRTUTBTVLFRVYRWI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UTWQT2ZFXLBRTUTBTVLFRVYRWI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UTWQT2ZFXLBRTUTBTVLFRVYRWI/action/storage_attestation","attest_author":"https://pith.science/pith/UTWQT2ZFXLBRTUTBTVLFRVYRWI/action/author_attestation","sign_citation":"https://pith.science/pith/UTWQT2ZFXLBRTUTBTVLFRVYRWI/action/citation_signature","submit_replication":"https://pith.science/pith/UTWQT2ZFXLBRTUTBTVLFRVYRWI/action/replication_record"}},"created_at":"2026-05-18T02:30:01.897759+00:00","updated_at":"2026-05-18T02:30:01.897759+00:00"}