Pith. sign in

REVIEW 2 cited by

Quantum Recurrent Embedding Neural Network

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2506.13185 v1 pith:FY5CX7DH submitted 2025-06-16 quant-ph

classification quant-ph
keywords quantumneuralqrennembeddinglearningnetworkrecurrentcircuits
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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 rigorous proof of the trainability of QRENN circuits, demonstrating that this deep quantum neural network can avoid barren plateaus. Notably, the general QRENN architecture resists classical simulation as it encompasses powerful quantum circuits such as QSP, QSVT, and DQC1, which are widely believed to be classically intractable. Building on this theoretical foundation, we apply our QRENN to accurately classify quantum Hamiltonians and detect symmetry-protected topological phases, demonstrating its applicability in quantum supervised learning. Our results highlight the power of recurrent data embedding in quantum neural networks and the potential for scalable quantum supervised learning in predicting physical properties and solving complex problems.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Gated QKAN-FWP: Scalable Quantum-inspired Sequence Learning

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    Gated QKAN-FWP combines fast weight programming with quantum-inspired Kolmogorov-Arnold networks via single-qubit DARUAN activations and gated updates to deliver a 12.5k-parameter model that outperforms larger classic...

  2. Reachability Constraints in Variational Quantum Circuits: Optimization within Polynomial Group Module

    quant-ph 2026-04 unverdicted novelty 6.0 of 10

    A necessary condition for variational quantum circuits to reach exact ground states requires matching module projection norms between input and solution, enabling classical O(n^5) exact solvers for problems like MaxCut.

Pith tools