{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NLIWTTOQNVCPAOXAV37U277WVJ","short_pith_number":"pith:NLIWTTOQ","schema_version":"1.0","canonical_sha256":"6ad169cdd06d44f03ae0aeff4d7ff6aa4d410518652917bc2b2aac89d931b586","source":{"kind":"arxiv","id":"1804.08783","version":1},"attestation_state":"computed","paper":{"title":"Local Gradient Optimization of Modular Entangling Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Arman A. Setser, Jason P. Kestner, Michael H. Goerz","submitted_at":"2018-04-24T00:02:03Z","abstract_excerpt":"Implementation of logical entangling gates is an important step towards realizing a quantum computer. We use a gradient-based optimization approach to find single-qubit rotations which can be interleaved between applications of a noisy nonlocal gate to dramatically suppress arbitrary logical errors, while steering the evolution operator towards the perfectly entangling subset of SU(4) gates. The modularity of the approach allows for application to any two-qubit system, regardless of the Hamiltonian or details of the experimental implementation. This approach is effective for both quasi-static "},"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":"1804.08783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-04-24T00:02:03Z","cross_cats_sorted":[],"title_canon_sha256":"37dbd75107e67339dff1cb256da1ff73b0ab123a18d947b8a1827b9ad3996b3e","abstract_canon_sha256":"c1fdba6d288afb1f50ccf7eb6ec9fb211f14d021005d301d0a118b8c626ee074"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:13.610385Z","signature_b64":"4/TO+a/YntaCNvH6QM+0TalUmNI3RL1M4CZgG8aXNcoilnCY2Qu9EEkMQAP0Ozt3eDxrYncPNFwJ96U/2uuAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ad169cdd06d44f03ae0aeff4d7ff6aa4d410518652917bc2b2aac89d931b586","last_reissued_at":"2026-05-18T00:12:13.609659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:13.609659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Gradient Optimization of Modular Entangling Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Arman A. Setser, Jason P. Kestner, Michael H. Goerz","submitted_at":"2018-04-24T00:02:03Z","abstract_excerpt":"Implementation of logical entangling gates is an important step towards realizing a quantum computer. We use a gradient-based optimization approach to find single-qubit rotations which can be interleaved between applications of a noisy nonlocal gate to dramatically suppress arbitrary logical errors, while steering the evolution operator towards the perfectly entangling subset of SU(4) gates. The modularity of the approach allows for application to any two-qubit system, regardless of the Hamiltonian or details of the experimental implementation. This approach is effective for both quasi-static "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08783","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":"1804.08783","created_at":"2026-05-18T00:12:13.609724+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.08783v1","created_at":"2026-05-18T00:12:13.609724+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08783","created_at":"2026-05-18T00:12:13.609724+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLIWTTOQNVCP","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLIWTTOQNVCPAOXA","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLIWTTOQ","created_at":"2026-05-18T12:32:40.477152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NLIWTTOQNVCPAOXAV37U277WVJ","json":"https://pith.science/pith/NLIWTTOQNVCPAOXAV37U277WVJ.json","graph_json":"https://pith.science/api/pith-number/NLIWTTOQNVCPAOXAV37U277WVJ/graph.json","events_json":"https://pith.science/api/pith-number/NLIWTTOQNVCPAOXAV37U277WVJ/events.json","paper":"https://pith.science/paper/NLIWTTOQ"},"agent_actions":{"view_html":"https://pith.science/pith/NLIWTTOQNVCPAOXAV37U277WVJ","download_json":"https://pith.science/pith/NLIWTTOQNVCPAOXAV37U277WVJ.json","view_paper":"https://pith.science/paper/NLIWTTOQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.08783&json=true","fetch_graph":"https://pith.science/api/pith-number/NLIWTTOQNVCPAOXAV37U277WVJ/graph.json","fetch_events":"https://pith.science/api/pith-number/NLIWTTOQNVCPAOXAV37U277WVJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLIWTTOQNVCPAOXAV37U277WVJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLIWTTOQNVCPAOXAV37U277WVJ/action/storage_attestation","attest_author":"https://pith.science/pith/NLIWTTOQNVCPAOXAV37U277WVJ/action/author_attestation","sign_citation":"https://pith.science/pith/NLIWTTOQNVCPAOXAV37U277WVJ/action/citation_signature","submit_replication":"https://pith.science/pith/NLIWTTOQNVCPAOXAV37U277WVJ/action/replication_record"}},"created_at":"2026-05-18T00:12:13.609724+00:00","updated_at":"2026-05-18T00:12:13.609724+00:00"}