{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BYDKWTTX4ICT44GWQEYW7YQDYZ","short_pith_number":"pith:BYDKWTTX","schema_version":"1.0","canonical_sha256":"0e06ab4e77e2053e70d681316fe203c64c34729d5b5e25feeb9aec64a8994437","source":{"kind":"arxiv","id":"2311.04093","version":2},"attestation_state":"computed","paper":{"title":"Krylov complexity is not a measure of distance between states or operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"hep-th","authors_text":"Andrew Rolph, Sergio E. Aguilar-Gutierrez","submitted_at":"2023-11-07T16:04:10Z","abstract_excerpt":"We ask whether Krylov complexity is mutually compatible with the circuit and Nielsen definitions of complexity. We show that the Krylov complexities between three states fail to satisfy the triangle inequality and so cannot be a measure of distance: there is no possible metric for which Krylov complexity is the length of the shortest path to the target state or operator. We show this explicitly in the simplest example, a single qubit, and in general."},"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":"2311.04093","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-th","submitted_at":"2023-11-07T16:04:10Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"3f114b8c588a9d363f6bb6ae696d748453ec18d385977a3b84ba230ba93e0c48","abstract_canon_sha256":"854c44a9960c33a22e77b67cfb679f64ca34d03cdf34b76acbadeb0f7531f112"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:57:45.768218Z","signature_b64":"9jVwNo+NKQbI96BtxHiHG8VSKZGviirTOU6Yt7RYXKgycZJOp12Gh0QgD7hNUiJJLD61tzKmN0AZb5Gc2rgIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e06ab4e77e2053e70d681316fe203c64c34729d5b5e25feeb9aec64a8994437","last_reissued_at":"2026-07-05T07:57:45.766622Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:57:45.766622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Krylov complexity is not a measure of distance between states or operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"hep-th","authors_text":"Andrew Rolph, Sergio E. Aguilar-Gutierrez","submitted_at":"2023-11-07T16:04:10Z","abstract_excerpt":"We ask whether Krylov complexity is mutually compatible with the circuit and Nielsen definitions of complexity. We show that the Krylov complexities between three states fail to satisfy the triangle inequality and so cannot be a measure of distance: there is no possible metric for which Krylov complexity is the length of the shortest path to the target state or operator. We show this explicitly in the simplest example, a single qubit, and in general."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.04093","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/2311.04093/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":"2311.04093","created_at":"2026-07-05T07:57:45.767737+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.04093v2","created_at":"2026-07-05T07:57:45.767737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.04093","created_at":"2026-07-05T07:57:45.767737+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYDKWTTX4ICT","created_at":"2026-07-05T07:57:45.767737+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYDKWTTX4ICT44GW","created_at":"2026-07-05T07:57:45.767737+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYDKWTTX","created_at":"2026-07-05T07:57:45.767737+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05303","citing_title":"Krylov Complexity: Flat bands and Carroll breaking deformations","ref_index":82,"is_internal_anchor":false},{"citing_arxiv_id":"2507.06286","citing_title":"Krylov Complexity","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2603.19359","citing_title":"Towards a Refinement of Krylov Complexity: Scrambling, Classical Operator Growth and Replicas","ref_index":100,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BYDKWTTX4ICT44GWQEYW7YQDYZ","json":"https://pith.science/pith/BYDKWTTX4ICT44GWQEYW7YQDYZ.json","graph_json":"https://pith.science/api/pith-number/BYDKWTTX4ICT44GWQEYW7YQDYZ/graph.json","events_json":"https://pith.science/api/pith-number/BYDKWTTX4ICT44GWQEYW7YQDYZ/events.json","paper":"https://pith.science/paper/BYDKWTTX"},"agent_actions":{"view_html":"https://pith.science/pith/BYDKWTTX4ICT44GWQEYW7YQDYZ","download_json":"https://pith.science/pith/BYDKWTTX4ICT44GWQEYW7YQDYZ.json","view_paper":"https://pith.science/paper/BYDKWTTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.04093&json=true","fetch_graph":"https://pith.science/api/pith-number/BYDKWTTX4ICT44GWQEYW7YQDYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/BYDKWTTX4ICT44GWQEYW7YQDYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYDKWTTX4ICT44GWQEYW7YQDYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYDKWTTX4ICT44GWQEYW7YQDYZ/action/storage_attestation","attest_author":"https://pith.science/pith/BYDKWTTX4ICT44GWQEYW7YQDYZ/action/author_attestation","sign_citation":"https://pith.science/pith/BYDKWTTX4ICT44GWQEYW7YQDYZ/action/citation_signature","submit_replication":"https://pith.science/pith/BYDKWTTX4ICT44GWQEYW7YQDYZ/action/replication_record"}},"created_at":"2026-07-05T07:57:45.767737+00:00","updated_at":"2026-07-05T07:57:45.767737+00:00"}