{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BIIHHGF6FNN7YXT64L6JTV3DWO","short_pith_number":"pith:BIIHHGF6","schema_version":"1.0","canonical_sha256":"0a107398be2b5bfc5e7ee2fc99d763b3aff6a9b0f4d937a3d79b107deead170d","source":{"kind":"arxiv","id":"2102.04032","version":2},"attestation_state":"computed","paper":{"title":"One qubit as a Universal Approximant","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adri\\'an P\\'erez-Salinas, Artur Garc\\'ia-S\\'aez, David L\\'opez-N\\'u\\~nez, Jos\\'e I. Latorre, P. Forn-D\\'iaz","submitted_at":"2021-02-08T07:10:31Z","abstract_excerpt":"A single-qubit circuit can approximate any bounded complex function stored in the degrees of freedom defining its quantum gates. The single-qubit approximant presented in this work is operated through a series of gates that take as their parameterization the independent variable of the target function and an additional set of adjustable parameters. The independent variable is re-uploaded in every gate while the parameters are optimized for each target function. The output state of this quantum circuit becomes more accurate as the number of re-uploadings of the independent variable increases, i"},"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":"2102.04032","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-02-08T07:10:31Z","cross_cats_sorted":[],"title_canon_sha256":"56b2a1e0d9c75ebd553bcbf1ddd6a0936d3c395d38fa8d5a0df4e1576d7c7958","abstract_canon_sha256":"bcbf1073cad06a3cf9b286c87021159dc0e210d02920fb5f68cadd0a52f0956b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:57:14.766052Z","signature_b64":"uqY6+IdbbkTBgB+GLqLB+chJNZkZrkRBwy8yNS6awTP3i9d4IFXeobBV41QX/D/A6cbi9Vv5hO4FvzOX7ty+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a107398be2b5bfc5e7ee2fc99d763b3aff6a9b0f4d937a3d79b107deead170d","last_reissued_at":"2026-07-05T02:57:14.765579Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:57:14.765579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One qubit as a Universal Approximant","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adri\\'an P\\'erez-Salinas, Artur Garc\\'ia-S\\'aez, David L\\'opez-N\\'u\\~nez, Jos\\'e I. Latorre, P. Forn-D\\'iaz","submitted_at":"2021-02-08T07:10:31Z","abstract_excerpt":"A single-qubit circuit can approximate any bounded complex function stored in the degrees of freedom defining its quantum gates. The single-qubit approximant presented in this work is operated through a series of gates that take as their parameterization the independent variable of the target function and an additional set of adjustable parameters. The independent variable is re-uploaded in every gate while the parameters are optimized for each target function. The output state of this quantum circuit becomes more accurate as the number of re-uploadings of the independent variable increases, i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.04032","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.04032/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":"2102.04032","created_at":"2026-07-05T02:57:14.765638+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.04032v2","created_at":"2026-07-05T02:57:14.765638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.04032","created_at":"2026-07-05T02:57:14.765638+00:00"},{"alias_kind":"pith_short_12","alias_value":"BIIHHGF6FNN7","created_at":"2026-07-05T02:57:14.765638+00:00"},{"alias_kind":"pith_short_16","alias_value":"BIIHHGF6FNN7YXT6","created_at":"2026-07-05T02:57:14.765638+00:00"},{"alias_kind":"pith_short_8","alias_value":"BIIHHGF6","created_at":"2026-07-05T02:57:14.765638+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2402.09848","citing_title":"Parameterized quantum circuits as universal generative models for continuous multivariate distributions","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BIIHHGF6FNN7YXT64L6JTV3DWO","json":"https://pith.science/pith/BIIHHGF6FNN7YXT64L6JTV3DWO.json","graph_json":"https://pith.science/api/pith-number/BIIHHGF6FNN7YXT64L6JTV3DWO/graph.json","events_json":"https://pith.science/api/pith-number/BIIHHGF6FNN7YXT64L6JTV3DWO/events.json","paper":"https://pith.science/paper/BIIHHGF6"},"agent_actions":{"view_html":"https://pith.science/pith/BIIHHGF6FNN7YXT64L6JTV3DWO","download_json":"https://pith.science/pith/BIIHHGF6FNN7YXT64L6JTV3DWO.json","view_paper":"https://pith.science/paper/BIIHHGF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.04032&json=true","fetch_graph":"https://pith.science/api/pith-number/BIIHHGF6FNN7YXT64L6JTV3DWO/graph.json","fetch_events":"https://pith.science/api/pith-number/BIIHHGF6FNN7YXT64L6JTV3DWO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BIIHHGF6FNN7YXT64L6JTV3DWO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BIIHHGF6FNN7YXT64L6JTV3DWO/action/storage_attestation","attest_author":"https://pith.science/pith/BIIHHGF6FNN7YXT64L6JTV3DWO/action/author_attestation","sign_citation":"https://pith.science/pith/BIIHHGF6FNN7YXT64L6JTV3DWO/action/citation_signature","submit_replication":"https://pith.science/pith/BIIHHGF6FNN7YXT64L6JTV3DWO/action/replication_record"}},"created_at":"2026-07-05T02:57:14.765638+00:00","updated_at":"2026-07-05T02:57:14.765638+00:00"}