{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:E7LGYOCGXWX6K5TEWZKWJRCR26","short_pith_number":"pith:E7LGYOCG","schema_version":"1.0","canonical_sha256":"27d66c3846bdafe57664b65564c451d7acb9b2532e3c9afa61b7cefaec2decb7","source":{"kind":"arxiv","id":"2302.13555","version":4},"attestation_state":"computed","paper":{"title":"Implementing any Linear Combination of Unitaries on Intermediate-term Quantum Computers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Shantanav Chakraborty","submitted_at":"2023-02-27T07:15:14Z","abstract_excerpt":"We develop three new methods to implement any Linear Combination of Unitaries (LCU), a powerful quantum algorithmic tool with diverse applications. While the standard LCU procedure requires several ancilla qubits and sophisticated multi-qubit controlled operations, our methods consume significantly fewer quantum resources. The first method (Single-Ancilla LCU) estimates expectation values of observables with respect to any quantum state prepared by an LCU procedure while requiring only a single ancilla qubit, and no multi-qubit controlled operations. The second approach (Analog LCU) is a simpl"},"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":"2302.13555","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-02-27T07:15:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7c1a63ee79da6e8c1c1bb69c3ca5f568ff1e10c3783ae48147e8d39e826f3c38","abstract_canon_sha256":"66930a0a503c867fdaab1f3dba087cf783e1960133e20428ed8a7d1d3f953344"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:20:36.478394Z","signature_b64":"Of/Zg5oFa0kuPDJa+2laTjDgIu4BPCUa6Q/N1gDeBpv/1iAVDpYqc6lUW14Rg0gGqkPASq/J0a1jIoUL5yQ1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27d66c3846bdafe57664b65564c451d7acb9b2532e3c9afa61b7cefaec2decb7","last_reissued_at":"2026-07-05T09:20:36.477849Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:20:36.477849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Implementing any Linear Combination of Unitaries on Intermediate-term Quantum Computers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Shantanav Chakraborty","submitted_at":"2023-02-27T07:15:14Z","abstract_excerpt":"We develop three new methods to implement any Linear Combination of Unitaries (LCU), a powerful quantum algorithmic tool with diverse applications. While the standard LCU procedure requires several ancilla qubits and sophisticated multi-qubit controlled operations, our methods consume significantly fewer quantum resources. The first method (Single-Ancilla LCU) estimates expectation values of observables with respect to any quantum state prepared by an LCU procedure while requiring only a single ancilla qubit, and no multi-qubit controlled operations. The second approach (Analog LCU) is a simpl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.13555","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/2302.13555/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":"2302.13555","created_at":"2026-07-05T09:20:36.477907+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.13555v4","created_at":"2026-07-05T09:20:36.477907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.13555","created_at":"2026-07-05T09:20:36.477907+00:00"},{"alias_kind":"pith_short_12","alias_value":"E7LGYOCGXWX6","created_at":"2026-07-05T09:20:36.477907+00:00"},{"alias_kind":"pith_short_16","alias_value":"E7LGYOCGXWX6K5TE","created_at":"2026-07-05T09:20:36.477907+00:00"},{"alias_kind":"pith_short_8","alias_value":"E7LGYOCG","created_at":"2026-07-05T09:20:36.477907+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01733","citing_title":"Pauli-structured preconditioning for quantum linear system solvers","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E7LGYOCGXWX6K5TEWZKWJRCR26","json":"https://pith.science/pith/E7LGYOCGXWX6K5TEWZKWJRCR26.json","graph_json":"https://pith.science/api/pith-number/E7LGYOCGXWX6K5TEWZKWJRCR26/graph.json","events_json":"https://pith.science/api/pith-number/E7LGYOCGXWX6K5TEWZKWJRCR26/events.json","paper":"https://pith.science/paper/E7LGYOCG"},"agent_actions":{"view_html":"https://pith.science/pith/E7LGYOCGXWX6K5TEWZKWJRCR26","download_json":"https://pith.science/pith/E7LGYOCGXWX6K5TEWZKWJRCR26.json","view_paper":"https://pith.science/paper/E7LGYOCG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.13555&json=true","fetch_graph":"https://pith.science/api/pith-number/E7LGYOCGXWX6K5TEWZKWJRCR26/graph.json","fetch_events":"https://pith.science/api/pith-number/E7LGYOCGXWX6K5TEWZKWJRCR26/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E7LGYOCGXWX6K5TEWZKWJRCR26/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E7LGYOCGXWX6K5TEWZKWJRCR26/action/storage_attestation","attest_author":"https://pith.science/pith/E7LGYOCGXWX6K5TEWZKWJRCR26/action/author_attestation","sign_citation":"https://pith.science/pith/E7LGYOCGXWX6K5TEWZKWJRCR26/action/citation_signature","submit_replication":"https://pith.science/pith/E7LGYOCGXWX6K5TEWZKWJRCR26/action/replication_record"}},"created_at":"2026-07-05T09:20:36.477907+00:00","updated_at":"2026-07-05T09:20:36.477907+00:00"}