{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:UI4IMK2XQCP5E4SPGF7T3YDKUB","short_pith_number":"pith:UI4IMK2X","schema_version":"1.0","canonical_sha256":"a238862b57809fd2724f317f3de06aa05949b969ca689c5f6af53d13421d3743","source":{"kind":"arxiv","id":"2205.07449","version":3},"attestation_state":"computed","paper":{"title":"Variational learning algorithms for quantum query complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bei Zeng, Chao Zhang, Lvzhou Li, Shi-yao Hou, Zipeng Wu","submitted_at":"2022-05-16T05:16:15Z","abstract_excerpt":"Quantum query complexity plays an important role in studying quantum algorithms, which captures the most known quantum algorithms, such as search and period finding. A query algorithm applies $U_tO_x\\cdots U_1O_xU_0$ to some input state, where $O_x$ is the oracle dependent on some input variable $x$, and $U_i$s are unitary operations that are independent of $x$, followed by some measurements for readout. In this work, we develop variational learning algorithms to study quantum query complexity, by formulating $U_i$s as parameterized quantum circuits and introducing a loss function that is dire"},"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":"2205.07449","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-05-16T05:16:15Z","cross_cats_sorted":[],"title_canon_sha256":"870882b7003422340cb0ee47d1be60ba10aa9734a50ffac63e7cf514d63fd850","abstract_canon_sha256":"daa5490f6221f8d17d70da6c97bf62d1a28feb29b515d7082e4ba87ee80a6d7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:56:13.462675Z","signature_b64":"Bn6jmx53nrXvzpktAkHPT5i2k6lZd8eUJ9YqDAcPfuBOw/8utLFkMe3ty3LTHGmVS2scWW5nV7tlIC9tUjOdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a238862b57809fd2724f317f3de06aa05949b969ca689c5f6af53d13421d3743","last_reissued_at":"2026-07-05T07:56:13.462294Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:56:13.462294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variational learning algorithms for quantum query complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bei Zeng, Chao Zhang, Lvzhou Li, Shi-yao Hou, Zipeng Wu","submitted_at":"2022-05-16T05:16:15Z","abstract_excerpt":"Quantum query complexity plays an important role in studying quantum algorithms, which captures the most known quantum algorithms, such as search and period finding. A query algorithm applies $U_tO_x\\cdots U_1O_xU_0$ to some input state, where $O_x$ is the oracle dependent on some input variable $x$, and $U_i$s are unitary operations that are independent of $x$, followed by some measurements for readout. In this work, we develop variational learning algorithms to study quantum query complexity, by formulating $U_i$s as parameterized quantum circuits and introducing a loss function that is dire"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.07449","kind":"arxiv","version":3},"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/2205.07449/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":"2205.07449","created_at":"2026-07-05T07:56:13.462361+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.07449v3","created_at":"2026-07-05T07:56:13.462361+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.07449","created_at":"2026-07-05T07:56:13.462361+00:00"},{"alias_kind":"pith_short_12","alias_value":"UI4IMK2XQCP5","created_at":"2026-07-05T07:56:13.462361+00:00"},{"alias_kind":"pith_short_16","alias_value":"UI4IMK2XQCP5E4SP","created_at":"2026-07-05T07:56:13.462361+00:00"},{"alias_kind":"pith_short_8","alias_value":"UI4IMK2X","created_at":"2026-07-05T07:56:13.462361+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/UI4IMK2XQCP5E4SPGF7T3YDKUB","json":"https://pith.science/pith/UI4IMK2XQCP5E4SPGF7T3YDKUB.json","graph_json":"https://pith.science/api/pith-number/UI4IMK2XQCP5E4SPGF7T3YDKUB/graph.json","events_json":"https://pith.science/api/pith-number/UI4IMK2XQCP5E4SPGF7T3YDKUB/events.json","paper":"https://pith.science/paper/UI4IMK2X"},"agent_actions":{"view_html":"https://pith.science/pith/UI4IMK2XQCP5E4SPGF7T3YDKUB","download_json":"https://pith.science/pith/UI4IMK2XQCP5E4SPGF7T3YDKUB.json","view_paper":"https://pith.science/paper/UI4IMK2X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.07449&json=true","fetch_graph":"https://pith.science/api/pith-number/UI4IMK2XQCP5E4SPGF7T3YDKUB/graph.json","fetch_events":"https://pith.science/api/pith-number/UI4IMK2XQCP5E4SPGF7T3YDKUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UI4IMK2XQCP5E4SPGF7T3YDKUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UI4IMK2XQCP5E4SPGF7T3YDKUB/action/storage_attestation","attest_author":"https://pith.science/pith/UI4IMK2XQCP5E4SPGF7T3YDKUB/action/author_attestation","sign_citation":"https://pith.science/pith/UI4IMK2XQCP5E4SPGF7T3YDKUB/action/citation_signature","submit_replication":"https://pith.science/pith/UI4IMK2XQCP5E4SPGF7T3YDKUB/action/replication_record"}},"created_at":"2026-07-05T07:56:13.462361+00:00","updated_at":"2026-07-05T07:56:13.462361+00:00"}