{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:G3PVEJGI6QSFIZR52ZCPEZLOZE","short_pith_number":"pith:G3PVEJGI","schema_version":"1.0","canonical_sha256":"36df5224c8f42454663dd644f2656ec92d8a44ac49b752f067d8e105afb587c3","source":{"kind":"arxiv","id":"quant-ph/0406216","version":1},"attestation_state":"computed","paper":{"title":"New quantum algorithm for studying NP-complete problems","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Igor V. Volovich, Masanori Ohya","submitted_at":"2004-06-29T10:49:01Z","abstract_excerpt":"Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems. In this paper we study a new approach to quantum algorithm which is a combination of the ordinary quantum algorithm with a chaotic dynamical system. We consider the satisfiability problem as an example of NP-complete problems and argue that the problem, in principle, can be solved in polynomial time by using our new quantum algorithm."},"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":"quant-ph/0406216","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-06-29T10:49:01Z","cross_cats_sorted":[],"title_canon_sha256":"4cf7c8609a894929d502980720b2308684880abf6af8468884e41cb6cd29e2ef","abstract_canon_sha256":"4c4f62d45f6057858727031417b564b5c86e997cb1af8c768500189748e7b0f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:58.523285Z","signature_b64":"vF0Y41+XzwyOvrBQ9lPglWGvORPD+ECml6N1bTdj4ghDNgzyShq6kr/ml/i4chFqxfG3Y8o0hW+F9TyAl8FTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36df5224c8f42454663dd644f2656ec92d8a44ac49b752f067d8e105afb587c3","last_reissued_at":"2026-05-18T01:37:58.522631Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:58.522631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New quantum algorithm for studying NP-complete problems","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Igor V. Volovich, Masanori Ohya","submitted_at":"2004-06-29T10:49:01Z","abstract_excerpt":"Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems. In this paper we study a new approach to quantum algorithm which is a combination of the ordinary quantum algorithm with a chaotic dynamical system. We consider the satisfiability problem as an example of NP-complete problems and argue that the problem, in principle, can be solved in polynomial time by using our new quantum algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0406216","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":"quant-ph/0406216","created_at":"2026-05-18T01:37:58.522756+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0406216v1","created_at":"2026-05-18T01:37:58.522756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0406216","created_at":"2026-05-18T01:37:58.522756+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3PVEJGI6QSF","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3PVEJGI6QSFIZR5","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3PVEJGI","created_at":"2026-05-18T12:25:52.687210+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/G3PVEJGI6QSFIZR52ZCPEZLOZE","json":"https://pith.science/pith/G3PVEJGI6QSFIZR52ZCPEZLOZE.json","graph_json":"https://pith.science/api/pith-number/G3PVEJGI6QSFIZR52ZCPEZLOZE/graph.json","events_json":"https://pith.science/api/pith-number/G3PVEJGI6QSFIZR52ZCPEZLOZE/events.json","paper":"https://pith.science/paper/G3PVEJGI"},"agent_actions":{"view_html":"https://pith.science/pith/G3PVEJGI6QSFIZR52ZCPEZLOZE","download_json":"https://pith.science/pith/G3PVEJGI6QSFIZR52ZCPEZLOZE.json","view_paper":"https://pith.science/paper/G3PVEJGI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0406216&json=true","fetch_graph":"https://pith.science/api/pith-number/G3PVEJGI6QSFIZR52ZCPEZLOZE/graph.json","fetch_events":"https://pith.science/api/pith-number/G3PVEJGI6QSFIZR52ZCPEZLOZE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3PVEJGI6QSFIZR52ZCPEZLOZE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3PVEJGI6QSFIZR52ZCPEZLOZE/action/storage_attestation","attest_author":"https://pith.science/pith/G3PVEJGI6QSFIZR52ZCPEZLOZE/action/author_attestation","sign_citation":"https://pith.science/pith/G3PVEJGI6QSFIZR52ZCPEZLOZE/action/citation_signature","submit_replication":"https://pith.science/pith/G3PVEJGI6QSFIZR52ZCPEZLOZE/action/replication_record"}},"created_at":"2026-05-18T01:37:58.522756+00:00","updated_at":"2026-05-18T01:37:58.522756+00:00"}