{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Z27BEEKJ4UORZ6ODLSYTZ3J6ZH","short_pith_number":"pith:Z27BEEKJ","schema_version":"1.0","canonical_sha256":"cebe121149e51d1cf9c35cb13ced3ec9ecd5e28a5a365f55479e40d2136a6dc7","source":{"kind":"arxiv","id":"1908.04229","version":2},"attestation_state":"computed","paper":{"title":"Simulating Quantum Algorithms Using Fidelity and Coherence Time as Principle Models for Error","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Avery Torrance, Daniel Koch, David Kinghorn, Laura Wessing, Paul M. Alsing, Saahil Patel","submitted_at":"2019-08-12T16:28:43Z","abstract_excerpt":"As various quantum computing technologies continue to compete for quantum supremacy, several parameters have emerged as benchmarks for the quality of qubits. These include fidelity, coherence times, connectivity, and a few others. In this paper, we aim to study the importance of these parameters and their impact on quantum algorithms. We propose a realistic connectivity geometry and form quantum circuits for the Bernstein-Vazirani, QFT, and Grover Algorithms based on the limitations of the chosen geometry. We then simulate these algorithms using error models to study the impact of gate fidelit"},"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":"1908.04229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-12T16:28:43Z","cross_cats_sorted":[],"title_canon_sha256":"d30e4d6549ffae1441bd73d8d63bbe4703d8af2a963cd1f7e8eaf31508e35d70","abstract_canon_sha256":"c119c89ae31b8eb5c2908ae4061120090bc892e14702215811e3253ff8ba6c43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:45:08.442062Z","signature_b64":"iT3SkH8wJuVLZ4ec9ld+lXoor5xyxUa8uaf+++LZBlDyzjN6l8w80581UG7DgZ/aBOUTqIWY6rQhglxW8N5oAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cebe121149e51d1cf9c35cb13ced3ec9ecd5e28a5a365f55479e40d2136a6dc7","last_reissued_at":"2026-07-05T00:45:08.441581Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:45:08.441581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simulating Quantum Algorithms Using Fidelity and Coherence Time as Principle Models for Error","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Avery Torrance, Daniel Koch, David Kinghorn, Laura Wessing, Paul M. Alsing, Saahil Patel","submitted_at":"2019-08-12T16:28:43Z","abstract_excerpt":"As various quantum computing technologies continue to compete for quantum supremacy, several parameters have emerged as benchmarks for the quality of qubits. These include fidelity, coherence times, connectivity, and a few others. In this paper, we aim to study the importance of these parameters and their impact on quantum algorithms. We propose a realistic connectivity geometry and form quantum circuits for the Bernstein-Vazirani, QFT, and Grover Algorithms based on the limitations of the chosen geometry. We then simulate these algorithms using error models to study the impact of gate fidelit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04229","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/1908.04229/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":"1908.04229","created_at":"2026-07-05T00:45:08.441643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04229v2","created_at":"2026-07-05T00:45:08.441643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04229","created_at":"2026-07-05T00:45:08.441643+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z27BEEKJ4UOR","created_at":"2026-07-05T00:45:08.441643+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z27BEEKJ4UORZ6OD","created_at":"2026-07-05T00:45:08.441643+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z27BEEKJ","created_at":"2026-07-05T00:45:08.441643+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.13910","citing_title":"Tsallis relative $\\alpha$ entropy of coherence dynamics in Grover's search algorithm","ref_index":62,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z27BEEKJ4UORZ6ODLSYTZ3J6ZH","json":"https://pith.science/pith/Z27BEEKJ4UORZ6ODLSYTZ3J6ZH.json","graph_json":"https://pith.science/api/pith-number/Z27BEEKJ4UORZ6ODLSYTZ3J6ZH/graph.json","events_json":"https://pith.science/api/pith-number/Z27BEEKJ4UORZ6ODLSYTZ3J6ZH/events.json","paper":"https://pith.science/paper/Z27BEEKJ"},"agent_actions":{"view_html":"https://pith.science/pith/Z27BEEKJ4UORZ6ODLSYTZ3J6ZH","download_json":"https://pith.science/pith/Z27BEEKJ4UORZ6ODLSYTZ3J6ZH.json","view_paper":"https://pith.science/paper/Z27BEEKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04229&json=true","fetch_graph":"https://pith.science/api/pith-number/Z27BEEKJ4UORZ6ODLSYTZ3J6ZH/graph.json","fetch_events":"https://pith.science/api/pith-number/Z27BEEKJ4UORZ6ODLSYTZ3J6ZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z27BEEKJ4UORZ6ODLSYTZ3J6ZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z27BEEKJ4UORZ6ODLSYTZ3J6ZH/action/storage_attestation","attest_author":"https://pith.science/pith/Z27BEEKJ4UORZ6ODLSYTZ3J6ZH/action/author_attestation","sign_citation":"https://pith.science/pith/Z27BEEKJ4UORZ6ODLSYTZ3J6ZH/action/citation_signature","submit_replication":"https://pith.science/pith/Z27BEEKJ4UORZ6ODLSYTZ3J6ZH/action/replication_record"}},"created_at":"2026-07-05T00:45:08.441643+00:00","updated_at":"2026-07-05T00:45:08.441643+00:00"}