{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VJ7RFCXZE3BBATLUMAYYIU2FQP","short_pith_number":"pith:VJ7RFCXZ","schema_version":"1.0","canonical_sha256":"aa7f128af926c2104d74603184534583f55b470273bfa6c70888820db0b97b42","source":{"kind":"arxiv","id":"2311.16505","version":1},"attestation_state":"computed","paper":{"title":"Simulating Quantum Computations on Classical Machines: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ali Ebnenasir, Kieran Young, Marcus Scese","submitted_at":"2023-11-28T04:48:15Z","abstract_excerpt":"We present a comprehensive study of quantum simulation methods and quantum simulators for classical computers. We first study an exhaustive set of 150+ simulators and quantum libraries. Then, we short-list the simulators that are actively maintained and enable simulation of quantum algorithms for more than 10 qubits. As a result, we realize that most efficient and actively maintained simulators have been developed after 2010. We also provide a taxonomy of the most important simulation methods, namely Schrodinger-based, Feynman path integrals, Heisenberg-based, and hybrid methods. We observe th"},"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":"2311.16505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-11-28T04:48:15Z","cross_cats_sorted":[],"title_canon_sha256":"4ca65521494527c707401056caa73a96cf9f951a5de240236af73dc264f98e3e","abstract_canon_sha256":"f45acda230763f65539a2915d88082b10fcad264ed3a567f1dcd6e026ffe905a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:17:42.742194Z","signature_b64":"lhhOuU91vtYKQO7paj+inoRzlKUsAb/PXeS/J/7xPbKB4tLRVz5cbvYkHWTni8BocLII9UY3YBNSDNEh18BsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa7f128af926c2104d74603184534583f55b470273bfa6c70888820db0b97b42","last_reissued_at":"2026-07-05T07:17:42.741705Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:17:42.741705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simulating Quantum Computations on Classical Machines: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ali Ebnenasir, Kieran Young, Marcus Scese","submitted_at":"2023-11-28T04:48:15Z","abstract_excerpt":"We present a comprehensive study of quantum simulation methods and quantum simulators for classical computers. We first study an exhaustive set of 150+ simulators and quantum libraries. Then, we short-list the simulators that are actively maintained and enable simulation of quantum algorithms for more than 10 qubits. As a result, we realize that most efficient and actively maintained simulators have been developed after 2010. We also provide a taxonomy of the most important simulation methods, namely Schrodinger-based, Feynman path integrals, Heisenberg-based, and hybrid methods. We observe th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.16505","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/2311.16505/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":"2311.16505","created_at":"2026-07-05T07:17:42.741764+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.16505v1","created_at":"2026-07-05T07:17:42.741764+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.16505","created_at":"2026-07-05T07:17:42.741764+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJ7RFCXZE3BB","created_at":"2026-07-05T07:17:42.741764+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJ7RFCXZE3BBATLU","created_at":"2026-07-05T07:17:42.741764+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJ7RFCXZ","created_at":"2026-07-05T07:17:42.741764+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.18285","citing_title":"EQE-QAOA: An Equivalence-Preserving Qubit Efficient Framework for Combinatorial Optimization","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15775","citing_title":"Federated Learning with Quantum Enhanced LSTM for Applications in High Energy Physics","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15765","citing_title":"Orkan: Cache-friendly simulation of quantum operations on hermitian operators","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VJ7RFCXZE3BBATLUMAYYIU2FQP","json":"https://pith.science/pith/VJ7RFCXZE3BBATLUMAYYIU2FQP.json","graph_json":"https://pith.science/api/pith-number/VJ7RFCXZE3BBATLUMAYYIU2FQP/graph.json","events_json":"https://pith.science/api/pith-number/VJ7RFCXZE3BBATLUMAYYIU2FQP/events.json","paper":"https://pith.science/paper/VJ7RFCXZ"},"agent_actions":{"view_html":"https://pith.science/pith/VJ7RFCXZE3BBATLUMAYYIU2FQP","download_json":"https://pith.science/pith/VJ7RFCXZE3BBATLUMAYYIU2FQP.json","view_paper":"https://pith.science/paper/VJ7RFCXZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.16505&json=true","fetch_graph":"https://pith.science/api/pith-number/VJ7RFCXZE3BBATLUMAYYIU2FQP/graph.json","fetch_events":"https://pith.science/api/pith-number/VJ7RFCXZE3BBATLUMAYYIU2FQP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJ7RFCXZE3BBATLUMAYYIU2FQP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJ7RFCXZE3BBATLUMAYYIU2FQP/action/storage_attestation","attest_author":"https://pith.science/pith/VJ7RFCXZE3BBATLUMAYYIU2FQP/action/author_attestation","sign_citation":"https://pith.science/pith/VJ7RFCXZE3BBATLUMAYYIU2FQP/action/citation_signature","submit_replication":"https://pith.science/pith/VJ7RFCXZE3BBATLUMAYYIU2FQP/action/replication_record"}},"created_at":"2026-07-05T07:17:42.741764+00:00","updated_at":"2026-07-05T07:17:42.741764+00:00"}