{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:Z3MQM2WSYHZTJMG2IA7SMK4JVL","short_pith_number":"pith:Z3MQM2WS","schema_version":"1.0","canonical_sha256":"ced9066ad2c1f334b0da403f262b89aac4ec03b14d888fa352f061bde5cb0193","source":{"kind":"arxiv","id":"quant-ph/0303039","version":4},"attestation_state":"computed","paper":{"title":"Smaller Circuits for Arbitrary n-qubit Diagonal Computations","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Igor L. Markov, Stephen S. Bullock","submitted_at":"2003-03-07T21:58:22Z","abstract_excerpt":"A unitary operator U=\\sum u_{j,k} |k><j| is called diagonal when u_{j,k}=0 unless j=k. The definition extends to quantum computations, where j and k vary over the 2^n binary expressions for integers 0,1 ..., 2^n-1, given n qubits. Such operators do not affect outcomes of the projective measurement {<j| ; 0 <= j <= 2^n-1} but rather create arbitrary relative phases among the computational basis states {|j> ; 0 <= j <= 2^n-1}. These relative phases are often required in applications.\n  Constructing quantum circuits for diagonal computations using standard techniques requires either O(n^2 2^n) co"},"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/0303039","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-03-07T21:58:22Z","cross_cats_sorted":[],"title_canon_sha256":"7b3c6e3fd5438deb89dda219bd89bd9afa9b7d73892a2ccf76f03ba4de03d6e9","abstract_canon_sha256":"fbc740c549c41391aff71cf343cde5271efdab4c48705eb704af16e73c4725e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:08.080932Z","signature_b64":"sbXHVY8f2zwH4nAzpxFlEdSnMSNxRXrsLEEs1B2xXxXXQ6ObujT3noh3NvIoG5mTpIuFB3kTqvOfTF4C2c8yDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ced9066ad2c1f334b0da403f262b89aac4ec03b14d888fa352f061bde5cb0193","last_reissued_at":"2026-07-04T14:46:08.080585Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:08.080585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smaller Circuits for Arbitrary n-qubit Diagonal Computations","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Igor L. Markov, Stephen S. Bullock","submitted_at":"2003-03-07T21:58:22Z","abstract_excerpt":"A unitary operator U=\\sum u_{j,k} |k><j| is called diagonal when u_{j,k}=0 unless j=k. The definition extends to quantum computations, where j and k vary over the 2^n binary expressions for integers 0,1 ..., 2^n-1, given n qubits. Such operators do not affect outcomes of the projective measurement {<j| ; 0 <= j <= 2^n-1} but rather create arbitrary relative phases among the computational basis states {|j> ; 0 <= j <= 2^n-1}. These relative phases are often required in applications.\n  Constructing quantum circuits for diagonal computations using standard techniques requires either O(n^2 2^n) co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0303039","kind":"arxiv","version":4},"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/0303039/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/0303039","created_at":"2026-07-04T14:46:08.080643+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0303039v4","created_at":"2026-07-04T14:46:08.080643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0303039","created_at":"2026-07-04T14:46:08.080643+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3MQM2WSYHZT","created_at":"2026-07-04T14:46:08.080643+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3MQM2WSYHZTJMG2","created_at":"2026-07-04T14:46:08.080643+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3MQM2WS","created_at":"2026-07-04T14:46:08.080643+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.05841","citing_title":"Non-Abelian String-Breaking Dynamics on a Qudit Quantum Computer","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z3MQM2WSYHZTJMG2IA7SMK4JVL","json":"https://pith.science/pith/Z3MQM2WSYHZTJMG2IA7SMK4JVL.json","graph_json":"https://pith.science/api/pith-number/Z3MQM2WSYHZTJMG2IA7SMK4JVL/graph.json","events_json":"https://pith.science/api/pith-number/Z3MQM2WSYHZTJMG2IA7SMK4JVL/events.json","paper":"https://pith.science/paper/Z3MQM2WS"},"agent_actions":{"view_html":"https://pith.science/pith/Z3MQM2WSYHZTJMG2IA7SMK4JVL","download_json":"https://pith.science/pith/Z3MQM2WSYHZTJMG2IA7SMK4JVL.json","view_paper":"https://pith.science/paper/Z3MQM2WS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0303039&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3MQM2WSYHZTJMG2IA7SMK4JVL/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3MQM2WSYHZTJMG2IA7SMK4JVL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3MQM2WSYHZTJMG2IA7SMK4JVL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3MQM2WSYHZTJMG2IA7SMK4JVL/action/storage_attestation","attest_author":"https://pith.science/pith/Z3MQM2WSYHZTJMG2IA7SMK4JVL/action/author_attestation","sign_citation":"https://pith.science/pith/Z3MQM2WSYHZTJMG2IA7SMK4JVL/action/citation_signature","submit_replication":"https://pith.science/pith/Z3MQM2WSYHZTJMG2IA7SMK4JVL/action/replication_record"}},"created_at":"2026-07-04T14:46:08.080643+00:00","updated_at":"2026-07-04T14:46:08.080643+00:00"}