{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N2DM4TONAO65THDBW2H45WI4FA","short_pith_number":"pith:N2DM4TON","schema_version":"1.0","canonical_sha256":"6e86ce4dcd03bdd99c61b68fced91c282e75a3f6f801ff6deea4fed9959c4ad0","source":{"kind":"arxiv","id":"1803.04114","version":2},"attestation_state":"computed","paper":{"title":"Learning the quantum algorithm for state overlap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew T. Sornborger, Lukasz Cincio, Patrick J. Coles, Yi\\u{g}it Suba\\c{s}{\\i}","submitted_at":"2018-03-12T05:09:41Z","abstract_excerpt":"Short-depth algorithms are crucial for reducing computational error on near-term quantum computers, for which decoherence and gate infidelity remain important issues. Here we present a machine-learning approach for discovering such algorithms. We apply our method to a ubiquitous primitive: computing the overlap ${\\rm Tr}(\\rho\\sigma)$ between two quantum states $\\rho$ and $\\sigma$. The standard algorithm for this task, known as the Swap Test, is used in many applications such as quantum support vector machines, and, when specialized to $\\rho = \\sigma$, quantifies the Renyi entanglement. Here, w"},"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":"1803.04114","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-03-12T05:09:41Z","cross_cats_sorted":[],"title_canon_sha256":"e1b387f7ef35f8a25fcc87423a8768551d29c3096c93849a0becbcd2762a8321","abstract_canon_sha256":"7e6adf299f150c9abaf464e9027e095809d74416d585c01c5c768cd884f97b94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:30.585380Z","signature_b64":"iVv6sbUjFvHqzBYs6sfFAHgXoGgcT8W0e6S4e9Ao8mb/bzwJp0D75No2wn7ytjeS5drHM4LTepxA9auynulkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e86ce4dcd03bdd99c61b68fced91c282e75a3f6f801ff6deea4fed9959c4ad0","last_reissued_at":"2026-05-18T00:00:30.584752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:30.584752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning the quantum algorithm for state overlap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew T. Sornborger, Lukasz Cincio, Patrick J. Coles, Yi\\u{g}it Suba\\c{s}{\\i}","submitted_at":"2018-03-12T05:09:41Z","abstract_excerpt":"Short-depth algorithms are crucial for reducing computational error on near-term quantum computers, for which decoherence and gate infidelity remain important issues. Here we present a machine-learning approach for discovering such algorithms. We apply our method to a ubiquitous primitive: computing the overlap ${\\rm Tr}(\\rho\\sigma)$ between two quantum states $\\rho$ and $\\sigma$. The standard algorithm for this task, known as the Swap Test, is used in many applications such as quantum support vector machines, and, when specialized to $\\rho = \\sigma$, quantifies the Renyi entanglement. Here, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04114","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":""},"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":"1803.04114","created_at":"2026-05-18T00:00:30.584848+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.04114v2","created_at":"2026-05-18T00:00:30.584848+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04114","created_at":"2026-05-18T00:00:30.584848+00:00"},{"alias_kind":"pith_short_12","alias_value":"N2DM4TONAO65","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"N2DM4TONAO65THDB","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"N2DM4TON","created_at":"2026-05-18T12:32:40.477152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.27648","citing_title":"Effective Noise Mitigation via Quantum Circuit Learning in Quantum Simulation of Integrable Spin Chains","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N2DM4TONAO65THDBW2H45WI4FA","json":"https://pith.science/pith/N2DM4TONAO65THDBW2H45WI4FA.json","graph_json":"https://pith.science/api/pith-number/N2DM4TONAO65THDBW2H45WI4FA/graph.json","events_json":"https://pith.science/api/pith-number/N2DM4TONAO65THDBW2H45WI4FA/events.json","paper":"https://pith.science/paper/N2DM4TON"},"agent_actions":{"view_html":"https://pith.science/pith/N2DM4TONAO65THDBW2H45WI4FA","download_json":"https://pith.science/pith/N2DM4TONAO65THDBW2H45WI4FA.json","view_paper":"https://pith.science/paper/N2DM4TON","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.04114&json=true","fetch_graph":"https://pith.science/api/pith-number/N2DM4TONAO65THDBW2H45WI4FA/graph.json","fetch_events":"https://pith.science/api/pith-number/N2DM4TONAO65THDBW2H45WI4FA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N2DM4TONAO65THDBW2H45WI4FA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N2DM4TONAO65THDBW2H45WI4FA/action/storage_attestation","attest_author":"https://pith.science/pith/N2DM4TONAO65THDBW2H45WI4FA/action/author_attestation","sign_citation":"https://pith.science/pith/N2DM4TONAO65THDBW2H45WI4FA/action/citation_signature","submit_replication":"https://pith.science/pith/N2DM4TONAO65THDBW2H45WI4FA/action/replication_record"}},"created_at":"2026-05-18T00:00:30.584848+00:00","updated_at":"2026-05-18T00:00:30.584848+00:00"}