{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LLPHYTB7L6HGC7HZCB5AIEJBLH","short_pith_number":"pith:LLPHYTB7","schema_version":"1.0","canonical_sha256":"5ade7c4c3f5f8e617cf9107a04112159dbd2a7e4c9a9de6c131c952116d968c6","source":{"kind":"arxiv","id":"1711.08896","version":2},"attestation_state":"computed","paper":{"title":"Efficient quantum circuit for singular value thresholding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bojia Duan, Dan Li, Jiabin Yuan, Ying Liu","submitted_at":"2017-11-24T08:49:36Z","abstract_excerpt":"Singular value thresholding (SVT) operation is a fundamental core module in many mathematical models in computer vision and machine learning, particularly for many nuclear norm minimizing-based problems. We presented a quantum SVT (QSVT) algorithm which was used as a subroutine to address an image classification problem. This algorithm runs in $O\\left[\\log\\left(pq\\right)\\right]$, an exponential speed improvement over the classical algorithm which runs in $O\\left[poly\\left(pq\\right)\\right]$. In this study, we investigate this algorithm and design a scalable quantum circuit for QSVT. In the circ"},"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":"1711.08896","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-11-24T08:49:36Z","cross_cats_sorted":[],"title_canon_sha256":"67d8ebd2c8fce2236fd8b0a5c86bb0e340e3dae899d37a15b09aedec20965ef9","abstract_canon_sha256":"85c83011b26cbeaedf8e129ee5fe08e2c1630152ce91f5114a6de82fe491d2e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:59.791345Z","signature_b64":"WuBMZmq4C6LGXPUgzhSITtT5Ynz1gzv23qDr+p9L2v1AgM2aYni5vJxNnTRcyQpzAXsqTG+42v+GDn1L65EoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ade7c4c3f5f8e617cf9107a04112159dbd2a7e4c9a9de6c131c952116d968c6","last_reissued_at":"2026-05-17T23:55:59.790665Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:59.790665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient quantum circuit for singular value thresholding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bojia Duan, Dan Li, Jiabin Yuan, Ying Liu","submitted_at":"2017-11-24T08:49:36Z","abstract_excerpt":"Singular value thresholding (SVT) operation is a fundamental core module in many mathematical models in computer vision and machine learning, particularly for many nuclear norm minimizing-based problems. We presented a quantum SVT (QSVT) algorithm which was used as a subroutine to address an image classification problem. This algorithm runs in $O\\left[\\log\\left(pq\\right)\\right]$, an exponential speed improvement over the classical algorithm which runs in $O\\left[poly\\left(pq\\right)\\right]$. In this study, we investigate this algorithm and design a scalable quantum circuit for QSVT. In the circ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08896","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":"1711.08896","created_at":"2026-05-17T23:55:59.790795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08896v2","created_at":"2026-05-17T23:55:59.790795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08896","created_at":"2026-05-17T23:55:59.790795+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLPHYTB7L6HG","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLPHYTB7L6HGC7HZ","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLPHYTB7","created_at":"2026-05-18T12:31:28.150371+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/LLPHYTB7L6HGC7HZCB5AIEJBLH","json":"https://pith.science/pith/LLPHYTB7L6HGC7HZCB5AIEJBLH.json","graph_json":"https://pith.science/api/pith-number/LLPHYTB7L6HGC7HZCB5AIEJBLH/graph.json","events_json":"https://pith.science/api/pith-number/LLPHYTB7L6HGC7HZCB5AIEJBLH/events.json","paper":"https://pith.science/paper/LLPHYTB7"},"agent_actions":{"view_html":"https://pith.science/pith/LLPHYTB7L6HGC7HZCB5AIEJBLH","download_json":"https://pith.science/pith/LLPHYTB7L6HGC7HZCB5AIEJBLH.json","view_paper":"https://pith.science/paper/LLPHYTB7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08896&json=true","fetch_graph":"https://pith.science/api/pith-number/LLPHYTB7L6HGC7HZCB5AIEJBLH/graph.json","fetch_events":"https://pith.science/api/pith-number/LLPHYTB7L6HGC7HZCB5AIEJBLH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLPHYTB7L6HGC7HZCB5AIEJBLH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLPHYTB7L6HGC7HZCB5AIEJBLH/action/storage_attestation","attest_author":"https://pith.science/pith/LLPHYTB7L6HGC7HZCB5AIEJBLH/action/author_attestation","sign_citation":"https://pith.science/pith/LLPHYTB7L6HGC7HZCB5AIEJBLH/action/citation_signature","submit_replication":"https://pith.science/pith/LLPHYTB7L6HGC7HZCB5AIEJBLH/action/replication_record"}},"created_at":"2026-05-17T23:55:59.790795+00:00","updated_at":"2026-05-17T23:55:59.790795+00:00"}