{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:H5JKHXCIXDO475IP7VUQQKD5AK","short_pith_number":"pith:H5JKHXCI","schema_version":"1.0","canonical_sha256":"3f52a3dc48b8ddcff50ffd6908287d029cea0e66ff4f9164435ea9777d8e691e","source":{"kind":"arxiv","id":"0804.0272","version":1},"attestation_state":"computed","paper":{"title":"Quantum computing using shortcuts through higher dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A. Gilchrist, A. G. White, B. P. Lanyon, G. J. Pryde, J. L. O'Brien, K. J. Resch, M. Barbieri, M. P. Almeida, T. C. Ralph, T. Jennewein","submitted_at":"2008-04-02T00:16:03Z","abstract_excerpt":"Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have been demonstrated in several physical architectures. A serious obstacle to a full-scale implementation is the sheer number of these gates required to implement even small quantum algorithms. Here we present and demonstrate a general technique that harnesses higher dimensions of quantum systems to significantly reduce this number, allowing the construction of k"},"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":"0804.0272","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-04-02T00:16:03Z","cross_cats_sorted":[],"title_canon_sha256":"3a1d9da6dffb6d6b5a40270a5c36bf1c67186f860f40df7b2f6b8844a46a4832","abstract_canon_sha256":"15b7462539682f25c35263df60e7d2c21e1392ae83c5b67f8b9e1e686b484a3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:06.980000Z","signature_b64":"X94NQr3qgtYyzoGF4XWzKzBk9QrK7wrEcxE91NAXkeb34OFVp7xXPZEM4TXs9nV19W1F3s6hxxZWg/BWwfZEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f52a3dc48b8ddcff50ffd6908287d029cea0e66ff4f9164435ea9777d8e691e","last_reissued_at":"2026-05-18T04:07:06.979244Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:06.979244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum computing using shortcuts through higher dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A. Gilchrist, A. G. White, B. P. Lanyon, G. J. Pryde, J. L. O'Brien, K. J. Resch, M. Barbieri, M. P. Almeida, T. C. Ralph, T. Jennewein","submitted_at":"2008-04-02T00:16:03Z","abstract_excerpt":"Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have been demonstrated in several physical architectures. A serious obstacle to a full-scale implementation is the sheer number of these gates required to implement even small quantum algorithms. Here we present and demonstrate a general technique that harnesses higher dimensions of quantum systems to significantly reduce this number, allowing the construction of k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.0272","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":""},"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":"0804.0272","created_at":"2026-05-18T04:07:06.979379+00:00"},{"alias_kind":"arxiv_version","alias_value":"0804.0272v1","created_at":"2026-05-18T04:07:06.979379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.0272","created_at":"2026-05-18T04:07:06.979379+00:00"},{"alias_kind":"pith_short_12","alias_value":"H5JKHXCIXDO4","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"H5JKHXCIXDO475IP","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"H5JKHXCI","created_at":"2026-05-18T12:25:57.157939+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2309.13014","citing_title":"Completeness of qufinite ZXW calculus, a graphical language for finite-dimensional quantum theory","ref_index":53,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H5JKHXCIXDO475IP7VUQQKD5AK","json":"https://pith.science/pith/H5JKHXCIXDO475IP7VUQQKD5AK.json","graph_json":"https://pith.science/api/pith-number/H5JKHXCIXDO475IP7VUQQKD5AK/graph.json","events_json":"https://pith.science/api/pith-number/H5JKHXCIXDO475IP7VUQQKD5AK/events.json","paper":"https://pith.science/paper/H5JKHXCI"},"agent_actions":{"view_html":"https://pith.science/pith/H5JKHXCIXDO475IP7VUQQKD5AK","download_json":"https://pith.science/pith/H5JKHXCIXDO475IP7VUQQKD5AK.json","view_paper":"https://pith.science/paper/H5JKHXCI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0804.0272&json=true","fetch_graph":"https://pith.science/api/pith-number/H5JKHXCIXDO475IP7VUQQKD5AK/graph.json","fetch_events":"https://pith.science/api/pith-number/H5JKHXCIXDO475IP7VUQQKD5AK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H5JKHXCIXDO475IP7VUQQKD5AK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H5JKHXCIXDO475IP7VUQQKD5AK/action/storage_attestation","attest_author":"https://pith.science/pith/H5JKHXCIXDO475IP7VUQQKD5AK/action/author_attestation","sign_citation":"https://pith.science/pith/H5JKHXCIXDO475IP7VUQQKD5AK/action/citation_signature","submit_replication":"https://pith.science/pith/H5JKHXCIXDO475IP7VUQQKD5AK/action/replication_record"}},"created_at":"2026-05-18T04:07:06.979379+00:00","updated_at":"2026-05-18T04:07:06.979379+00:00"}