{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:WTLTVKRQ434UC77TUHH6EJSPTF","short_pith_number":"pith:WTLTVKRQ","schema_version":"1.0","canonical_sha256":"b4d73aaa30e6f9417ff3a1cfe2264f995cfd5b1e2e1ac2582c2af02ddc91a0dc","source":{"kind":"arxiv","id":"2011.07601","version":3},"attestation_state":"computed","paper":{"title":"Geometry of quantum complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"hep-th","authors_text":"Andrea Legramandi, G. Bruno De Luca, Giuseppe Nardelli, Nicol\\`o Zenoni, Roberto Auzzi, Stefano Baiguera","submitted_at":"2020-11-15T18:41:19Z","abstract_excerpt":"Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for $n$ qubits using Nielsen's geometrical approach. We investigate a choice of penalties which, compared to previous definitions, increases in a more progressive way with the number of qubits simultaneously entangled by a given operation. This choice turns out to be free from singularities. We also analyze the relation between operator and state complexities, framing the discussion "},"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":"2011.07601","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-th","submitted_at":"2020-11-15T18:41:19Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"de158f99432cf2b7a32f1345022bb13d9f09efde10ea1d561652d225d58b56b2","abstract_canon_sha256":"d09d8be862abf1569b121234b72679f70b31c15c252049e59d63a89f798e0ad6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:41:48.980413Z","signature_b64":"pO64o87bs4ZTRW0caBz3tdMNOp7MfV2tGDDMImyajL1MEs1cQ4VxT9TEe9wmOJu/xcPA+yVEUvVzdTMN0+GnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4d73aaa30e6f9417ff3a1cfe2264f995cfd5b1e2e1ac2582c2af02ddc91a0dc","last_reissued_at":"2026-07-05T02:41:48.979940Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:41:48.979940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometry of quantum complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"hep-th","authors_text":"Andrea Legramandi, G. Bruno De Luca, Giuseppe Nardelli, Nicol\\`o Zenoni, Roberto Auzzi, Stefano Baiguera","submitted_at":"2020-11-15T18:41:19Z","abstract_excerpt":"Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for $n$ qubits using Nielsen's geometrical approach. We investigate a choice of penalties which, compared to previous definitions, increases in a more progressive way with the number of qubits simultaneously entangled by a given operation. This choice turns out to be free from singularities. We also analyze the relation between operator and state complexities, framing the discussion "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.07601","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/2011.07601/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":"2011.07601","created_at":"2026-07-05T02:41:48.980000+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.07601v3","created_at":"2026-07-05T02:41:48.980000+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.07601","created_at":"2026-07-05T02:41:48.980000+00:00"},{"alias_kind":"pith_short_12","alias_value":"WTLTVKRQ434U","created_at":"2026-07-05T02:41:48.980000+00:00"},{"alias_kind":"pith_short_16","alias_value":"WTLTVKRQ434UC77T","created_at":"2026-07-05T02:41:48.980000+00:00"},{"alias_kind":"pith_short_8","alias_value":"WTLTVKRQ","created_at":"2026-07-05T02:41:48.980000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02817","citing_title":"Nielsen complexity with multiple cost factors","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WTLTVKRQ434UC77TUHH6EJSPTF","json":"https://pith.science/pith/WTLTVKRQ434UC77TUHH6EJSPTF.json","graph_json":"https://pith.science/api/pith-number/WTLTVKRQ434UC77TUHH6EJSPTF/graph.json","events_json":"https://pith.science/api/pith-number/WTLTVKRQ434UC77TUHH6EJSPTF/events.json","paper":"https://pith.science/paper/WTLTVKRQ"},"agent_actions":{"view_html":"https://pith.science/pith/WTLTVKRQ434UC77TUHH6EJSPTF","download_json":"https://pith.science/pith/WTLTVKRQ434UC77TUHH6EJSPTF.json","view_paper":"https://pith.science/paper/WTLTVKRQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.07601&json=true","fetch_graph":"https://pith.science/api/pith-number/WTLTVKRQ434UC77TUHH6EJSPTF/graph.json","fetch_events":"https://pith.science/api/pith-number/WTLTVKRQ434UC77TUHH6EJSPTF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WTLTVKRQ434UC77TUHH6EJSPTF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WTLTVKRQ434UC77TUHH6EJSPTF/action/storage_attestation","attest_author":"https://pith.science/pith/WTLTVKRQ434UC77TUHH6EJSPTF/action/author_attestation","sign_citation":"https://pith.science/pith/WTLTVKRQ434UC77TUHH6EJSPTF/action/citation_signature","submit_replication":"https://pith.science/pith/WTLTVKRQ434UC77TUHH6EJSPTF/action/replication_record"}},"created_at":"2026-07-05T02:41:48.980000+00:00","updated_at":"2026-07-05T02:41:48.980000+00:00"}