{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HAM3X7PHQKQPN46OF5XP5FZQ57","short_pith_number":"pith:HAM3X7PH","schema_version":"1.0","canonical_sha256":"3819bbfde782a0f6f3ce2f6efe9730efeafae8fb3ea9f7262cb5a9e07cb89294","source":{"kind":"arxiv","id":"2411.02751","version":1},"attestation_state":"computed","paper":{"title":"Expressivity of deterministic quantum computation with one qubit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Daniel K. Park, Yujin Kim","submitted_at":"2024-11-05T02:46:27Z","abstract_excerpt":"Deterministic quantum computation with one qubit (DQC1) is of significant theoretical and practical interest due to its computational advantages in certain problems, despite its subuniversality with limited quantum resources. In this work, we introduce parameterized DQC1 as a quantum machine learning model. We demonstrate that the gradient of the measurement outcome of a DQC1 circuit with respect to its gate parameters can be computed directly using the DQC1 protocol. This allows for gradient-based optimization of DQC1 circuits, positioning DQC1 as the sole quantum protocol for both training a"},"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":"2411.02751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-05T02:46:27Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0d5c50063f9323ee0863b7b5aeb2c7950a224fba979c167a141d9c081d77232b","abstract_canon_sha256":"f2777d69c0851c2fd840acc1c66178119674e7c7d8a7a71af0ec012d62cfc1a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:48:21.349574Z","signature_b64":"9dYPnHEISyWKrNbRjv7xnbGh/8p2Rc+1iZpZelnFlslvTxryqcGAIcj00v6IoktsQCUhja+LLGREQnhD/aBKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3819bbfde782a0f6f3ce2f6efe9730efeafae8fb3ea9f7262cb5a9e07cb89294","last_reissued_at":"2026-07-05T11:48:21.349072Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:48:21.349072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expressivity of deterministic quantum computation with one qubit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Daniel K. Park, Yujin Kim","submitted_at":"2024-11-05T02:46:27Z","abstract_excerpt":"Deterministic quantum computation with one qubit (DQC1) is of significant theoretical and practical interest due to its computational advantages in certain problems, despite its subuniversality with limited quantum resources. In this work, we introduce parameterized DQC1 as a quantum machine learning model. We demonstrate that the gradient of the measurement outcome of a DQC1 circuit with respect to its gate parameters can be computed directly using the DQC1 protocol. This allows for gradient-based optimization of DQC1 circuits, positioning DQC1 as the sole quantum protocol for both training a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.02751","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.02751/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":"2411.02751","created_at":"2026-07-05T11:48:21.349129+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.02751v1","created_at":"2026-07-05T11:48:21.349129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.02751","created_at":"2026-07-05T11:48:21.349129+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAM3X7PHQKQP","created_at":"2026-07-05T11:48:21.349129+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAM3X7PHQKQPN46O","created_at":"2026-07-05T11:48:21.349129+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAM3X7PH","created_at":"2026-07-05T11:48:21.349129+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.13185","citing_title":"Quantum Recurrent Embedding Neural Network","ref_index":99,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HAM3X7PHQKQPN46OF5XP5FZQ57","json":"https://pith.science/pith/HAM3X7PHQKQPN46OF5XP5FZQ57.json","graph_json":"https://pith.science/api/pith-number/HAM3X7PHQKQPN46OF5XP5FZQ57/graph.json","events_json":"https://pith.science/api/pith-number/HAM3X7PHQKQPN46OF5XP5FZQ57/events.json","paper":"https://pith.science/paper/HAM3X7PH"},"agent_actions":{"view_html":"https://pith.science/pith/HAM3X7PHQKQPN46OF5XP5FZQ57","download_json":"https://pith.science/pith/HAM3X7PHQKQPN46OF5XP5FZQ57.json","view_paper":"https://pith.science/paper/HAM3X7PH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.02751&json=true","fetch_graph":"https://pith.science/api/pith-number/HAM3X7PHQKQPN46OF5XP5FZQ57/graph.json","fetch_events":"https://pith.science/api/pith-number/HAM3X7PHQKQPN46OF5XP5FZQ57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAM3X7PHQKQPN46OF5XP5FZQ57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAM3X7PHQKQPN46OF5XP5FZQ57/action/storage_attestation","attest_author":"https://pith.science/pith/HAM3X7PHQKQPN46OF5XP5FZQ57/action/author_attestation","sign_citation":"https://pith.science/pith/HAM3X7PHQKQPN46OF5XP5FZQ57/action/citation_signature","submit_replication":"https://pith.science/pith/HAM3X7PHQKQPN46OF5XP5FZQ57/action/replication_record"}},"created_at":"2026-07-05T11:48:21.349129+00:00","updated_at":"2026-07-05T11:48:21.349129+00:00"}