{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:LASEHB4JCM7N77PW3MM7WLUI7Y","short_pith_number":"pith:LASEHB4J","schema_version":"1.0","canonical_sha256":"5824438789133edffdf6db19fb2e88fe3e3444b6dab3dfb525b8dce0c0d8e7d7","source":{"kind":"arxiv","id":"quant-ph/0603161","version":2},"attestation_state":"computed","paper":{"title":"Quantum Computation as Geometry","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew C. Doherty, Mark R. Dowling, Michael A. Nielsen, Mile Gu","submitted_at":"2006-03-19T02:36:28Z","abstract_excerpt":"Quantum computers hold great promise, but it remains a challenge to find efficient quantum circuits that solve interesting computational problems. We show that finding optimal quantum circuits is essentially equivalent to finding the shortest path between two points in a certain curved geometry. By recasting the problem of finding quantum circuits as a geometric problem, we open up the possibility of using the mathematical techniques of Riemannian geometry to suggest new quantum algorithms, or to prove limitations on the power of quantum computers."},"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":"quant-ph/0603161","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-03-19T02:36:28Z","cross_cats_sorted":[],"title_canon_sha256":"b848ecf7341ab2ae3a030f57e250703c81378f146697075e95c82ed8d12a43a6","abstract_canon_sha256":"cbec04e0c862370b5b720437ba5ca14da1f077e75b8f9ea17dfba666649bf328"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:02:58.144680Z","signature_b64":"DAXxVed9NsZiOT1em+67L0yt6jKtX/Ucb//mz5gOqB8FozoMv637ZstYvVGfzU1I/7eJ0jvT1XMPiLPHSCTkCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5824438789133edffdf6db19fb2e88fe3e3444b6dab3dfb525b8dce0c0d8e7d7","last_reissued_at":"2026-07-04T17:02:58.144192Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:02:58.144192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Computation as Geometry","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew C. Doherty, Mark R. Dowling, Michael A. Nielsen, Mile Gu","submitted_at":"2006-03-19T02:36:28Z","abstract_excerpt":"Quantum computers hold great promise, but it remains a challenge to find efficient quantum circuits that solve interesting computational problems. We show that finding optimal quantum circuits is essentially equivalent to finding the shortest path between two points in a certain curved geometry. By recasting the problem of finding quantum circuits as a geometric problem, we open up the possibility of using the mathematical techniques of Riemannian geometry to suggest new quantum algorithms, or to prove limitations on the power of quantum computers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0603161","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/quant-ph/0603161/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":"quant-ph/0603161","created_at":"2026-07-04T17:02:58.144268+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0603161v2","created_at":"2026-07-04T17:02:58.144268+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0603161","created_at":"2026-07-04T17:02:58.144268+00:00"},{"alias_kind":"pith_short_12","alias_value":"LASEHB4JCM7N","created_at":"2026-07-04T17:02:58.144268+00:00"},{"alias_kind":"pith_short_16","alias_value":"LASEHB4JCM7N77PW","created_at":"2026-07-04T17:02:58.144268+00:00"},{"alias_kind":"pith_short_8","alias_value":"LASEHB4J","created_at":"2026-07-04T17:02:58.144268+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":8,"sample":[{"citing_arxiv_id":"2607.08411","citing_title":"The Geometry of Quantum Complexity in Open Systems","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2606.20790","citing_title":"Complexity Inequalities for Quantum Subsystems","ref_index":70,"is_internal_anchor":true},{"citing_arxiv_id":"2606.17251","citing_title":"Post-Selection Probability and Fidelity of Bidirectional Teleportation","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2606.02817","citing_title":"Nielsen complexity with multiple cost factors","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2606.20790","citing_title":"Complexity Inequalities for Quantum Subsystems","ref_index":72,"is_internal_anchor":true},{"citing_arxiv_id":"2311.18804","citing_title":"Holographic complexity of the Klebanov-Strassler background","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2412.08925","citing_title":"Generalized CV Conjecture and Krylov Complexity in Two-Mode Hermitian Systems via Information Geometry","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2505.11553","citing_title":"Holographic entanglement entropy and complexity for the cosmological braneworld model","ref_index":50,"is_internal_anchor":true},{"citing_arxiv_id":"2604.21408","citing_title":"Holographic complexity of conformal fields in global de Sitter spacetime","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14275","citing_title":"Generalized Complexity Distances and Non-Invertible Symmetries","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LASEHB4JCM7N77PW3MM7WLUI7Y","json":"https://pith.science/pith/LASEHB4JCM7N77PW3MM7WLUI7Y.json","graph_json":"https://pith.science/api/pith-number/LASEHB4JCM7N77PW3MM7WLUI7Y/graph.json","events_json":"https://pith.science/api/pith-number/LASEHB4JCM7N77PW3MM7WLUI7Y/events.json","paper":"https://pith.science/paper/LASEHB4J"},"agent_actions":{"view_html":"https://pith.science/pith/LASEHB4JCM7N77PW3MM7WLUI7Y","download_json":"https://pith.science/pith/LASEHB4JCM7N77PW3MM7WLUI7Y.json","view_paper":"https://pith.science/paper/LASEHB4J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0603161&json=true","fetch_graph":"https://pith.science/api/pith-number/LASEHB4JCM7N77PW3MM7WLUI7Y/graph.json","fetch_events":"https://pith.science/api/pith-number/LASEHB4JCM7N77PW3MM7WLUI7Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LASEHB4JCM7N77PW3MM7WLUI7Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LASEHB4JCM7N77PW3MM7WLUI7Y/action/storage_attestation","attest_author":"https://pith.science/pith/LASEHB4JCM7N77PW3MM7WLUI7Y/action/author_attestation","sign_citation":"https://pith.science/pith/LASEHB4JCM7N77PW3MM7WLUI7Y/action/citation_signature","submit_replication":"https://pith.science/pith/LASEHB4JCM7N77PW3MM7WLUI7Y/action/replication_record"}},"created_at":"2026-07-04T17:02:58.144268+00:00","updated_at":"2026-07-04T17:02:58.144268+00:00"}