{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:PIKV43ZAHAQRS6D3S66DEJAOT6","short_pith_number":"pith:PIKV43ZA","canonical_record":{"source":{"id":"2406.09450","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"physics.gen-ph","submitted_at":"2024-06-12T14:54:44Z","cross_cats_sorted":[],"title_canon_sha256":"76ae986778627c46e64977ec6678e96e231e7a74b08828bf7c602e841499fb21","abstract_canon_sha256":"858183248f836b48a44492724a1807751f07933891a89942e08605a3defa7b27"},"schema_version":"1.0"},"canonical_sha256":"7a155e6f20382119787b97bc32240e9f9eae8e3c2fb10802afb60cc3f962b838","source":{"kind":"arxiv","id":"2406.09450","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.09450","created_at":"2026-07-05T09:23:07Z"},{"alias_kind":"arxiv_version","alias_value":"2406.09450v3","created_at":"2026-07-05T09:23:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.09450","created_at":"2026-07-05T09:23:07Z"},{"alias_kind":"pith_short_12","alias_value":"PIKV43ZAHAQR","created_at":"2026-07-05T09:23:07Z"},{"alias_kind":"pith_short_16","alias_value":"PIKV43ZAHAQRS6D3","created_at":"2026-07-05T09:23:07Z"},{"alias_kind":"pith_short_8","alias_value":"PIKV43ZA","created_at":"2026-07-05T09:23:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:PIKV43ZAHAQRS6D3S66DEJAOT6","target":"record","payload":{"canonical_record":{"source":{"id":"2406.09450","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"physics.gen-ph","submitted_at":"2024-06-12T14:54:44Z","cross_cats_sorted":[],"title_canon_sha256":"76ae986778627c46e64977ec6678e96e231e7a74b08828bf7c602e841499fb21","abstract_canon_sha256":"858183248f836b48a44492724a1807751f07933891a89942e08605a3defa7b27"},"schema_version":"1.0"},"canonical_sha256":"7a155e6f20382119787b97bc32240e9f9eae8e3c2fb10802afb60cc3f962b838","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:23:07.050152Z","signature_b64":"xwufctcq65aVcWtwqwbE8s6UTvlAD1B7n+yexa/+FZLMpvyyD9YBluN/ohvZA80tF4BHqVBZASJpE45+r1vhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a155e6f20382119787b97bc32240e9f9eae8e3c2fb10802afb60cc3f962b838","last_reissued_at":"2026-07-05T09:23:07.049668Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:23:07.049668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.09450","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:23:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gpD6G1ZZyUyuzOHzviGdxIJjxA4INGFPg2AZHyKSbTORc9uKx+pl23tZU6W4DhoV8bP8wSf1k23WPDJcHPTIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:55:14.191873Z"},"content_sha256":"09786ce6c411147da496f667ad7ef2ae435ad7a3ce58d1c73e6308065b5c96e4","schema_version":"1.0","event_id":"sha256:09786ce6c411147da496f667ad7ef2ae435ad7a3ce58d1c73e6308065b5c96e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:PIKV43ZAHAQRS6D3S66DEJAOT6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Grover's algorithm on two-way quantum computer","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"physics.gen-ph","authors_text":"Dev Rishi Verma, Govind Wanjalkar, Grzegorz Czelusta","submitted_at":"2024-06-12T14:54:44Z","abstract_excerpt":"Two-way quantum computing (2WQC) represents a novel approach to quantum computing that introduces a CPT version of state preparation. This paper analyses the influence of this approach on Grover's algorithm and compares the behaviour of typical Grover and its 2WQC version in the presence of noise in the system. Our findings indicate that, in an ideal scenario without noise, the 2WQC Grover algorithm exhibits a constant complexity of $\\mathcal{O}(1)$. In the presence of noise, the 2WQC Grover algorithm demonstrates greater resilience to different noise models than the standard Grover's algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.09450","kind":"arxiv","version":3},"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/2406.09450/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:23:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yrkqx/WeJMjG157zeZxRu2HRw/RfxaYlkpQg+kZTndAJQNxoV/N+qpYht8hYEgBs0I0r3jFuvkgOvRjfiGMpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:55:14.192251Z"},"content_sha256":"df8ede085e0ebfb3bce74baced6cc2d5ca1ecfc3093b99baa4ce6c79b5858b18","schema_version":"1.0","event_id":"sha256:df8ede085e0ebfb3bce74baced6cc2d5ca1ecfc3093b99baa4ce6c79b5858b18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PIKV43ZAHAQRS6D3S66DEJAOT6/bundle.json","state_url":"https://pith.science/pith/PIKV43ZAHAQRS6D3S66DEJAOT6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PIKV43ZAHAQRS6D3S66DEJAOT6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-03T15:55:14Z","links":{"resolver":"https://pith.science/pith/PIKV43ZAHAQRS6D3S66DEJAOT6","bundle":"https://pith.science/pith/PIKV43ZAHAQRS6D3S66DEJAOT6/bundle.json","state":"https://pith.science/pith/PIKV43ZAHAQRS6D3S66DEJAOT6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PIKV43ZAHAQRS6D3S66DEJAOT6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:PIKV43ZAHAQRS6D3S66DEJAOT6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"858183248f836b48a44492724a1807751f07933891a89942e08605a3defa7b27","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"physics.gen-ph","submitted_at":"2024-06-12T14:54:44Z","title_canon_sha256":"76ae986778627c46e64977ec6678e96e231e7a74b08828bf7c602e841499fb21"},"schema_version":"1.0","source":{"id":"2406.09450","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.09450","created_at":"2026-07-05T09:23:07Z"},{"alias_kind":"arxiv_version","alias_value":"2406.09450v3","created_at":"2026-07-05T09:23:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.09450","created_at":"2026-07-05T09:23:07Z"},{"alias_kind":"pith_short_12","alias_value":"PIKV43ZAHAQR","created_at":"2026-07-05T09:23:07Z"},{"alias_kind":"pith_short_16","alias_value":"PIKV43ZAHAQRS6D3","created_at":"2026-07-05T09:23:07Z"},{"alias_kind":"pith_short_8","alias_value":"PIKV43ZA","created_at":"2026-07-05T09:23:07Z"}],"graph_snapshots":[{"event_id":"sha256:df8ede085e0ebfb3bce74baced6cc2d5ca1ecfc3093b99baa4ce6c79b5858b18","target":"graph","created_at":"2026-07-05T09:23:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2406.09450/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Two-way quantum computing (2WQC) represents a novel approach to quantum computing that introduces a CPT version of state preparation. This paper analyses the influence of this approach on Grover's algorithm and compares the behaviour of typical Grover and its 2WQC version in the presence of noise in the system. Our findings indicate that, in an ideal scenario without noise, the 2WQC Grover algorithm exhibits a constant complexity of $\\mathcal{O}(1)$. In the presence of noise, the 2WQC Grover algorithm demonstrates greater resilience to different noise models than the standard Grover's algorith","authors_text":"Dev Rishi Verma, Govind Wanjalkar, Grzegorz Czelusta","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"physics.gen-ph","submitted_at":"2024-06-12T14:54:44Z","title":"Grover's algorithm on two-way quantum computer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.09450","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:09786ce6c411147da496f667ad7ef2ae435ad7a3ce58d1c73e6308065b5c96e4","target":"record","created_at":"2026-07-05T09:23:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"858183248f836b48a44492724a1807751f07933891a89942e08605a3defa7b27","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"physics.gen-ph","submitted_at":"2024-06-12T14:54:44Z","title_canon_sha256":"76ae986778627c46e64977ec6678e96e231e7a74b08828bf7c602e841499fb21"},"schema_version":"1.0","source":{"id":"2406.09450","kind":"arxiv","version":3}},"canonical_sha256":"7a155e6f20382119787b97bc32240e9f9eae8e3c2fb10802afb60cc3f962b838","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a155e6f20382119787b97bc32240e9f9eae8e3c2fb10802afb60cc3f962b838","first_computed_at":"2026-07-05T09:23:07.049668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:23:07.049668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xwufctcq65aVcWtwqwbE8s6UTvlAD1B7n+yexa/+FZLMpvyyD9YBluN/ohvZA80tF4BHqVBZASJpE45+r1vhDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:23:07.050152Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.09450","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09786ce6c411147da496f667ad7ef2ae435ad7a3ce58d1c73e6308065b5c96e4","sha256:df8ede085e0ebfb3bce74baced6cc2d5ca1ecfc3093b99baa4ce6c79b5858b18"],"state_sha256":"d16b6a4ee2a9bece5c943d728a13fd5a232dcca25a4ccf2fa84dc7f172366a6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lql14NcQ2tahx1WYnGprLnLTsPzht31GW4XBvdfc5up4UyYZAoRZ7/jT2rW/82XtNM3rwglKUl0WSbtt+p72Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T15:55:14.195040Z","bundle_sha256":"611beba503b37f73e579114ef6cdd47989146323a6a13b124933db4d93f4bd88"}}