{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WRQSD6GPKR3LJI5GCALJBRZLHO","short_pith_number":"pith:WRQSD6GP","schema_version":"1.0","canonical_sha256":"b46121f8cf5476b4a3a6101690c72b3ba69399c21ff310177b7eab08e26394d5","source":{"kind":"arxiv","id":"2304.01751","version":2},"attestation_state":"computed","paper":{"title":"Simulating the quantum Fourier transform, Grover's algorithm, and the quantum counting algorithm with limited entanglement using tensor-networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.other"],"primary_cat":"quant-ph","authors_text":"Christian Flindt, Jose L. Lado, Marcel Niedermeier","submitted_at":"2023-04-04T12:42:18Z","abstract_excerpt":"Quantum algorithms reformulate computational problems as quantum evolutions in a large Hilbert space. Most quantum algorithms assume that the time-evolution is perfectly unitary and that the full Hilbert space is available. However, in practice, the available entanglement may be limited, leading to a reduced fidelity of the quantum algorithms. To simulate the execution of quantum algorithms with limited entanglement, tensor-network methods provide a useful framework, since they allow us to restrict the entanglement in a quantum circuit. Thus, we here use tensor-networks to analyze the fidelity"},"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":"2304.01751","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-04-04T12:42:18Z","cross_cats_sorted":["cond-mat.other"],"title_canon_sha256":"75bd475959a354822866bf9a4c7e32ce5257179a1cbfddd53b4a85795a98edf4","abstract_canon_sha256":"a2c288b64330c3dbeab8663555c40b80428598cf8f7b89ab81b5cf2cfb275697"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:11:20.655518Z","signature_b64":"LI5TP9sTaeHuIMBveqe4e+PSNYtpoBnZN+N5Ys9OqEdAPCj7Y2KWGnpM+2AT9jA6pSmQk+Jy2tBl4Vmmfsn+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b46121f8cf5476b4a3a6101690c72b3ba69399c21ff310177b7eab08e26394d5","last_reissued_at":"2026-07-05T09:11:20.654933Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:11:20.654933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simulating the quantum Fourier transform, Grover's algorithm, and the quantum counting algorithm with limited entanglement using tensor-networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.other"],"primary_cat":"quant-ph","authors_text":"Christian Flindt, Jose L. Lado, Marcel Niedermeier","submitted_at":"2023-04-04T12:42:18Z","abstract_excerpt":"Quantum algorithms reformulate computational problems as quantum evolutions in a large Hilbert space. Most quantum algorithms assume that the time-evolution is perfectly unitary and that the full Hilbert space is available. However, in practice, the available entanglement may be limited, leading to a reduced fidelity of the quantum algorithms. To simulate the execution of quantum algorithms with limited entanglement, tensor-network methods provide a useful framework, since they allow us to restrict the entanglement in a quantum circuit. Thus, we here use tensor-networks to analyze the fidelity"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.01751","kind":"arxiv","version":2},"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/2304.01751/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":"2304.01751","created_at":"2026-07-05T09:11:20.655021+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.01751v2","created_at":"2026-07-05T09:11:20.655021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.01751","created_at":"2026-07-05T09:11:20.655021+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRQSD6GPKR3L","created_at":"2026-07-05T09:11:20.655021+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRQSD6GPKR3LJI5G","created_at":"2026-07-05T09:11:20.655021+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRQSD6GP","created_at":"2026-07-05T09:11:20.655021+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/WRQSD6GPKR3LJI5GCALJBRZLHO","json":"https://pith.science/pith/WRQSD6GPKR3LJI5GCALJBRZLHO.json","graph_json":"https://pith.science/api/pith-number/WRQSD6GPKR3LJI5GCALJBRZLHO/graph.json","events_json":"https://pith.science/api/pith-number/WRQSD6GPKR3LJI5GCALJBRZLHO/events.json","paper":"https://pith.science/paper/WRQSD6GP"},"agent_actions":{"view_html":"https://pith.science/pith/WRQSD6GPKR3LJI5GCALJBRZLHO","download_json":"https://pith.science/pith/WRQSD6GPKR3LJI5GCALJBRZLHO.json","view_paper":"https://pith.science/paper/WRQSD6GP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.01751&json=true","fetch_graph":"https://pith.science/api/pith-number/WRQSD6GPKR3LJI5GCALJBRZLHO/graph.json","fetch_events":"https://pith.science/api/pith-number/WRQSD6GPKR3LJI5GCALJBRZLHO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRQSD6GPKR3LJI5GCALJBRZLHO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRQSD6GPKR3LJI5GCALJBRZLHO/action/storage_attestation","attest_author":"https://pith.science/pith/WRQSD6GPKR3LJI5GCALJBRZLHO/action/author_attestation","sign_citation":"https://pith.science/pith/WRQSD6GPKR3LJI5GCALJBRZLHO/action/citation_signature","submit_replication":"https://pith.science/pith/WRQSD6GPKR3LJI5GCALJBRZLHO/action/replication_record"}},"created_at":"2026-07-05T09:11:20.655021+00:00","updated_at":"2026-07-05T09:11:20.655021+00:00"}