{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KWBQOYNG6HR4IDXFGV2LD5RXJ5","short_pith_number":"pith:KWBQOYNG","schema_version":"1.0","canonical_sha256":"55830761a6f1e3c40ee53574b1f6374f608d268e080b0992e704a7f687cbba0e","source":{"kind":"arxiv","id":"2407.01692","version":1},"attestation_state":"computed","paper":{"title":"Clifford Dressed Time-Dependent Variational Principle","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alessandro Santini, Antonio Francesco Mello, Guglielmo Lami, Jacopo De Nardis, Mario Collura","submitted_at":"2024-07-01T18:04:25Z","abstract_excerpt":"We propose an enhanced Time-Dependent Variational Principle (TDVP) algorithm for Matrix Product States (MPS) that integrates Clifford disentangling techniques to efficiently manage entanglement growth. By leveraging the Clifford group, which maps Pauli strings to other Pauli strings while maintaining low computational complexity, we introduce a Clifford dressed single-site 1-TDVP scheme. During the TDVP integration, we apply a global Clifford transformation as needed to reduce entanglement by iteratively sweeping over two-qubit Clifford unitaries that connect neighboring sites in a checkerboar"},"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":"2407.01692","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-07-01T18:04:25Z","cross_cats_sorted":[],"title_canon_sha256":"799d8c4b349fbfb4912503db899adf068d3e290cf99da2b24c1a07316c9f5019","abstract_canon_sha256":"5bfa871a4db1093b6ddbbfb5639bbba8d4ff6daae297323485c71bb55e45ff86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:49:45.272730Z","signature_b64":"DvpnN8ltlLxLN5gkhxiDzXFhHMvLDf712m3JXnEHKFawCqmQDHwj7/VaER5X54EEMhFoJLtHmnffMmXmgOQwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55830761a6f1e3c40ee53574b1f6374f608d268e080b0992e704a7f687cbba0e","last_reissued_at":"2026-07-05T10:49:45.272239Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:49:45.272239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clifford Dressed Time-Dependent Variational Principle","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alessandro Santini, Antonio Francesco Mello, Guglielmo Lami, Jacopo De Nardis, Mario Collura","submitted_at":"2024-07-01T18:04:25Z","abstract_excerpt":"We propose an enhanced Time-Dependent Variational Principle (TDVP) algorithm for Matrix Product States (MPS) that integrates Clifford disentangling techniques to efficiently manage entanglement growth. By leveraging the Clifford group, which maps Pauli strings to other Pauli strings while maintaining low computational complexity, we introduce a Clifford dressed single-site 1-TDVP scheme. During the TDVP integration, we apply a global Clifford transformation as needed to reduce entanglement by iteratively sweeping over two-qubit Clifford unitaries that connect neighboring sites in a checkerboar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.01692","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/2407.01692/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":"2407.01692","created_at":"2026-07-05T10:49:45.272297+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.01692v1","created_at":"2026-07-05T10:49:45.272297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.01692","created_at":"2026-07-05T10:49:45.272297+00:00"},{"alias_kind":"pith_short_12","alias_value":"KWBQOYNG6HR4","created_at":"2026-07-05T10:49:45.272297+00:00"},{"alias_kind":"pith_short_16","alias_value":"KWBQOYNG6HR4IDXF","created_at":"2026-07-05T10:49:45.272297+00:00"},{"alias_kind":"pith_short_8","alias_value":"KWBQOYNG","created_at":"2026-07-05T10:49:45.272297+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2412.17209","citing_title":"Classical simulability of Clifford+T circuits with Clifford-augmented matrix product states","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KWBQOYNG6HR4IDXFGV2LD5RXJ5","json":"https://pith.science/pith/KWBQOYNG6HR4IDXFGV2LD5RXJ5.json","graph_json":"https://pith.science/api/pith-number/KWBQOYNG6HR4IDXFGV2LD5RXJ5/graph.json","events_json":"https://pith.science/api/pith-number/KWBQOYNG6HR4IDXFGV2LD5RXJ5/events.json","paper":"https://pith.science/paper/KWBQOYNG"},"agent_actions":{"view_html":"https://pith.science/pith/KWBQOYNG6HR4IDXFGV2LD5RXJ5","download_json":"https://pith.science/pith/KWBQOYNG6HR4IDXFGV2LD5RXJ5.json","view_paper":"https://pith.science/paper/KWBQOYNG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.01692&json=true","fetch_graph":"https://pith.science/api/pith-number/KWBQOYNG6HR4IDXFGV2LD5RXJ5/graph.json","fetch_events":"https://pith.science/api/pith-number/KWBQOYNG6HR4IDXFGV2LD5RXJ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KWBQOYNG6HR4IDXFGV2LD5RXJ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KWBQOYNG6HR4IDXFGV2LD5RXJ5/action/storage_attestation","attest_author":"https://pith.science/pith/KWBQOYNG6HR4IDXFGV2LD5RXJ5/action/author_attestation","sign_citation":"https://pith.science/pith/KWBQOYNG6HR4IDXFGV2LD5RXJ5/action/citation_signature","submit_replication":"https://pith.science/pith/KWBQOYNG6HR4IDXFGV2LD5RXJ5/action/replication_record"}},"created_at":"2026-07-05T10:49:45.272297+00:00","updated_at":"2026-07-05T10:49:45.272297+00:00"}