{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HDTBBKZCG4J4ZYOVUBWK46Y6SM","short_pith_number":"pith:HDTBBKZC","schema_version":"1.0","canonical_sha256":"38e610ab223713cce1d5a06cae7b1e930249dec3be2cb285ae3216c3500d4895","source":{"kind":"arxiv","id":"2308.03399","version":1},"attestation_state":"computed","paper":{"title":"Efficient techniques to GPU Accelerations of Multi-Shot Quantum Computing Simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"quant-ph","authors_text":"Christopher Wood, Hiroshi Horii, Jun Doi","submitted_at":"2023-08-07T08:32:36Z","abstract_excerpt":"Quantum computers are becoming practical for computing numerous applications. However, simulating quantum computing on classical computers is still demanding yet useful because current quantum computers are limited because of computer resources, hardware limits, instability, and noises. Improving quantum computing simulation performance in classical computers will contribute to the development of quantum computers and their algorithms. Quantum computing simulations on classical computers require long performance times, especially for quantum circuits with a large number of qubits or when simul"},"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":"2308.03399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-07T08:32:36Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7bffa51789438e76600581134e19a42cf81d2a972717f33a36df5d90cba9e29e","abstract_canon_sha256":"f36423953a8c0d4459726327077520e5ec2ca850160fe4412227e99929ac99bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:38:16.450260Z","signature_b64":"SwFBaB8MpB2TdZgyOpuSLnSUCeInZ19M/L/J0z8WQhh6pZ9VpKeHIsGyPpoJdMV/FQE4fUSGIgwUH00imu3uCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38e610ab223713cce1d5a06cae7b1e930249dec3be2cb285ae3216c3500d4895","last_reissued_at":"2026-07-05T06:38:16.449816Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:38:16.449816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient techniques to GPU Accelerations of Multi-Shot Quantum Computing Simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"quant-ph","authors_text":"Christopher Wood, Hiroshi Horii, Jun Doi","submitted_at":"2023-08-07T08:32:36Z","abstract_excerpt":"Quantum computers are becoming practical for computing numerous applications. However, simulating quantum computing on classical computers is still demanding yet useful because current quantum computers are limited because of computer resources, hardware limits, instability, and noises. Improving quantum computing simulation performance in classical computers will contribute to the development of quantum computers and their algorithms. Quantum computing simulations on classical computers require long performance times, especially for quantum circuits with a large number of qubits or when simul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.03399","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/2308.03399/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":"2308.03399","created_at":"2026-07-05T06:38:16.449872+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.03399v1","created_at":"2026-07-05T06:38:16.449872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.03399","created_at":"2026-07-05T06:38:16.449872+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDTBBKZCG4J4","created_at":"2026-07-05T06:38:16.449872+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDTBBKZCG4J4ZYOV","created_at":"2026-07-05T06:38:16.449872+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDTBBKZC","created_at":"2026-07-05T06:38:16.449872+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.21036","citing_title":"Who Defines Fairness? Target-Based Prompting for Demographic Representation in Generative Models","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08467","citing_title":"Accelerating Quantum Tensor Network Simulations with Unified Path Variations and Non-Degenerate Batched Sampling","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2405.08810","citing_title":"Quantum computing with Qiskit","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HDTBBKZCG4J4ZYOVUBWK46Y6SM","json":"https://pith.science/pith/HDTBBKZCG4J4ZYOVUBWK46Y6SM.json","graph_json":"https://pith.science/api/pith-number/HDTBBKZCG4J4ZYOVUBWK46Y6SM/graph.json","events_json":"https://pith.science/api/pith-number/HDTBBKZCG4J4ZYOVUBWK46Y6SM/events.json","paper":"https://pith.science/paper/HDTBBKZC"},"agent_actions":{"view_html":"https://pith.science/pith/HDTBBKZCG4J4ZYOVUBWK46Y6SM","download_json":"https://pith.science/pith/HDTBBKZCG4J4ZYOVUBWK46Y6SM.json","view_paper":"https://pith.science/paper/HDTBBKZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.03399&json=true","fetch_graph":"https://pith.science/api/pith-number/HDTBBKZCG4J4ZYOVUBWK46Y6SM/graph.json","fetch_events":"https://pith.science/api/pith-number/HDTBBKZCG4J4ZYOVUBWK46Y6SM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDTBBKZCG4J4ZYOVUBWK46Y6SM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDTBBKZCG4J4ZYOVUBWK46Y6SM/action/storage_attestation","attest_author":"https://pith.science/pith/HDTBBKZCG4J4ZYOVUBWK46Y6SM/action/author_attestation","sign_citation":"https://pith.science/pith/HDTBBKZCG4J4ZYOVUBWK46Y6SM/action/citation_signature","submit_replication":"https://pith.science/pith/HDTBBKZCG4J4ZYOVUBWK46Y6SM/action/replication_record"}},"created_at":"2026-07-05T06:38:16.449872+00:00","updated_at":"2026-07-05T06:38:16.449872+00:00"}