{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KZOPYX35PTH47C2D42TITI33UG","short_pith_number":"pith:KZOPYX35","schema_version":"1.0","canonical_sha256":"565cfc5f7d7ccfcf8b43e6a689a37ba1b77b47467ea3c8edef8f81cf8f93a46c","source":{"kind":"arxiv","id":"2501.00135","version":4},"attestation_state":"computed","paper":{"title":"GroverGPT: A Large Language Model with 8 Billion Parameters for Quantum Searching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"quant-ph","authors_text":"Haoran Wang, Jinglei Cheng, Junyu Liu, Min Chen, Pingzhi Li, Tianlong Chen","submitted_at":"2024-12-30T20:23:10Z","abstract_excerpt":"Quantum computing is an exciting non-Von Neumann paradigm, offering provable speedups over classical computing for specific problems. However, the practical limits of classical simulatability for quantum circuits remain unclear, especially with current noisy quantum devices. In this work, we explore the potential of leveraging Large Language Models (LLMs) to simulate the output of a quantum Turing machine using Grover's quantum circuits, known to provide quadratic speedups over classical counterparts. To this end, we developed GroverGPT, a specialized model based on LLaMA's 8-billion-parameter"},"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":"2501.00135","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-12-30T20:23:10Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"3343c4cb3366310ff95f17cdc42100dc2d13d1b681ba289e24eae2ec81b807b2","abstract_canon_sha256":"23a6fcc16a31bc4a88c15e58607c2167eb8b8a51a7e52c7b6f25f86ced7fd273"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:14:08.011968Z","signature_b64":"xd86XZfbtMalj6pih04LaMy4pNHvZ9bqHVPpaT6+0QfJ4+ro74La7qU2+PmK3t+3ZvJWYLlNRnBHSMWQyAkRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"565cfc5f7d7ccfcf8b43e6a689a37ba1b77b47467ea3c8edef8f81cf8f93a46c","last_reissued_at":"2026-07-05T10:14:08.011475Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:14:08.011475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GroverGPT: A Large Language Model with 8 Billion Parameters for Quantum Searching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"quant-ph","authors_text":"Haoran Wang, Jinglei Cheng, Junyu Liu, Min Chen, Pingzhi Li, Tianlong Chen","submitted_at":"2024-12-30T20:23:10Z","abstract_excerpt":"Quantum computing is an exciting non-Von Neumann paradigm, offering provable speedups over classical computing for specific problems. However, the practical limits of classical simulatability for quantum circuits remain unclear, especially with current noisy quantum devices. In this work, we explore the potential of leveraging Large Language Models (LLMs) to simulate the output of a quantum Turing machine using Grover's quantum circuits, known to provide quadratic speedups over classical counterparts. To this end, we developed GroverGPT, a specialized model based on LLaMA's 8-billion-parameter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.00135","kind":"arxiv","version":4},"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/2501.00135/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":"2501.00135","created_at":"2026-07-05T10:14:08.011534+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.00135v4","created_at":"2026-07-05T10:14:08.011534+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.00135","created_at":"2026-07-05T10:14:08.011534+00:00"},{"alias_kind":"pith_short_12","alias_value":"KZOPYX35PTH4","created_at":"2026-07-05T10:14:08.011534+00:00"},{"alias_kind":"pith_short_16","alias_value":"KZOPYX35PTH47C2D","created_at":"2026-07-05T10:14:08.011534+00:00"},{"alias_kind":"pith_short_8","alias_value":"KZOPYX35","created_at":"2026-07-05T10:14:08.011534+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21974","citing_title":"Fine-Tuning Large Language Models for Quantum Reasoning","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KZOPYX35PTH47C2D42TITI33UG","json":"https://pith.science/pith/KZOPYX35PTH47C2D42TITI33UG.json","graph_json":"https://pith.science/api/pith-number/KZOPYX35PTH47C2D42TITI33UG/graph.json","events_json":"https://pith.science/api/pith-number/KZOPYX35PTH47C2D42TITI33UG/events.json","paper":"https://pith.science/paper/KZOPYX35"},"agent_actions":{"view_html":"https://pith.science/pith/KZOPYX35PTH47C2D42TITI33UG","download_json":"https://pith.science/pith/KZOPYX35PTH47C2D42TITI33UG.json","view_paper":"https://pith.science/paper/KZOPYX35","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.00135&json=true","fetch_graph":"https://pith.science/api/pith-number/KZOPYX35PTH47C2D42TITI33UG/graph.json","fetch_events":"https://pith.science/api/pith-number/KZOPYX35PTH47C2D42TITI33UG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KZOPYX35PTH47C2D42TITI33UG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KZOPYX35PTH47C2D42TITI33UG/action/storage_attestation","attest_author":"https://pith.science/pith/KZOPYX35PTH47C2D42TITI33UG/action/author_attestation","sign_citation":"https://pith.science/pith/KZOPYX35PTH47C2D42TITI33UG/action/citation_signature","submit_replication":"https://pith.science/pith/KZOPYX35PTH47C2D42TITI33UG/action/replication_record"}},"created_at":"2026-07-05T10:14:08.011534+00:00","updated_at":"2026-07-05T10:14:08.011534+00:00"}