{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FY5CX7DHIHNKXRKOBV4ERUTI3D","short_pith_number":"pith:FY5CX7DH","schema_version":"1.0","canonical_sha256":"2e3a2bfc6741daabc54e0d7848d268d8e8f9dc7c6f8b3ca791d23ca46b0e6655","source":{"kind":"arxiv","id":"2506.13185","version":1},"attestation_state":"computed","paper":{"title":"Quantum Recurrent Embedding Neural Network","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Erdong Huang, Mingrui Jing, Shengyu Zhang, Xiao Shi, Xin Wang","submitted_at":"2025-06-16T07:50:31Z","abstract_excerpt":"Quantum neural networks have emerged as promising quantum machine learning models, leveraging the properties of quantum systems and classical optimization to solve complex problems in physics and beyond. However, previous studies have demonstrated inevitable trainability issues that severely limit their capabilities in the large-scale regime. In this work, we propose a quantum recurrent embedding neural network (QRENN) inspired by fast-track information pathways in ResNet and general quantum circuit architectures in quantum information theory. By employing dynamical Lie algebras, we provide 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":"2506.13185","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-16T07:50:31Z","cross_cats_sorted":[],"title_canon_sha256":"651c89b70b516262f8e2dc79e9c11e8883e97ac0b20c4c7377a519ebae22c838","abstract_canon_sha256":"f9039aa3355ac91ce6d1c402755dae3f43ab2634b3530ac1c20e11de054021f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:06.375228Z","signature_b64":"eDtjIBNKF4q+TSPYKQFqzX4P8YnsmY7iKnTILWaYaQpbGxsss48D3H89HT9Ite4jyIY5aYwhsQm+7K8P5kZcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e3a2bfc6741daabc54e0d7848d268d8e8f9dc7c6f8b3ca791d23ca46b0e6655","last_reissued_at":"2026-07-05T11:22:06.374702Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:06.374702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Recurrent Embedding Neural Network","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Erdong Huang, Mingrui Jing, Shengyu Zhang, Xiao Shi, Xin Wang","submitted_at":"2025-06-16T07:50:31Z","abstract_excerpt":"Quantum neural networks have emerged as promising quantum machine learning models, leveraging the properties of quantum systems and classical optimization to solve complex problems in physics and beyond. However, previous studies have demonstrated inevitable trainability issues that severely limit their capabilities in the large-scale regime. In this work, we propose a quantum recurrent embedding neural network (QRENN) inspired by fast-track information pathways in ResNet and general quantum circuit architectures in quantum information theory. By employing dynamical Lie algebras, we provide a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.13185","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/2506.13185/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":"2506.13185","created_at":"2026-07-05T11:22:06.374761+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.13185v1","created_at":"2026-07-05T11:22:06.374761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.13185","created_at":"2026-07-05T11:22:06.374761+00:00"},{"alias_kind":"pith_short_12","alias_value":"FY5CX7DHIHNK","created_at":"2026-07-05T11:22:06.374761+00:00"},{"alias_kind":"pith_short_16","alias_value":"FY5CX7DHIHNKXRKO","created_at":"2026-07-05T11:22:06.374761+00:00"},{"alias_kind":"pith_short_8","alias_value":"FY5CX7DH","created_at":"2026-07-05T11:22:06.374761+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06734","citing_title":"Gated QKAN-FWP: Scalable Quantum-inspired Sequence Learning","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13735","citing_title":"Reachability Constraints in Variational Quantum Circuits: Optimization within Polynomial Group Module","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FY5CX7DHIHNKXRKOBV4ERUTI3D","json":"https://pith.science/pith/FY5CX7DHIHNKXRKOBV4ERUTI3D.json","graph_json":"https://pith.science/api/pith-number/FY5CX7DHIHNKXRKOBV4ERUTI3D/graph.json","events_json":"https://pith.science/api/pith-number/FY5CX7DHIHNKXRKOBV4ERUTI3D/events.json","paper":"https://pith.science/paper/FY5CX7DH"},"agent_actions":{"view_html":"https://pith.science/pith/FY5CX7DHIHNKXRKOBV4ERUTI3D","download_json":"https://pith.science/pith/FY5CX7DHIHNKXRKOBV4ERUTI3D.json","view_paper":"https://pith.science/paper/FY5CX7DH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.13185&json=true","fetch_graph":"https://pith.science/api/pith-number/FY5CX7DHIHNKXRKOBV4ERUTI3D/graph.json","fetch_events":"https://pith.science/api/pith-number/FY5CX7DHIHNKXRKOBV4ERUTI3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FY5CX7DHIHNKXRKOBV4ERUTI3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FY5CX7DHIHNKXRKOBV4ERUTI3D/action/storage_attestation","attest_author":"https://pith.science/pith/FY5CX7DHIHNKXRKOBV4ERUTI3D/action/author_attestation","sign_citation":"https://pith.science/pith/FY5CX7DHIHNKXRKOBV4ERUTI3D/action/citation_signature","submit_replication":"https://pith.science/pith/FY5CX7DHIHNKXRKOBV4ERUTI3D/action/replication_record"}},"created_at":"2026-07-05T11:22:06.374761+00:00","updated_at":"2026-07-05T11:22:06.374761+00:00"}