CyberIntel ⬡ News
★ Saved ◆ Cyber Reads
← Back ◌ Quantum Computing Apr 22, 2026

Lund Plane to Bloch (LP2B) Encoding for Object and Polarization Tagging with Quantum Jet Substructure

arXiv Quantum Archived Apr 22, 2026 ✓ Full text saved

arXiv:2604.18613v1 Announce Type: new Abstract: The application of quantum algorithms to jet substructure analysis is of growing interest as NISQ hardware continues to mature in qubit count and gate depth. Jet substructure remains essential for addressing demanding and complementary challenges at the LHC and beyond, notably object classification and polarization tagging. However, existing quantum machine learning approaches typically rely on data representations that suffer from infrared and col

Full text archived locally
✦ AI Summary · Claude Sonnet


    Quantum Physics [Submitted on 15 Apr 2026] Lund Plane to Bloch (LP2B) Encoding for Object and Polarization Tagging with Quantum Jet Substructure Fabrizio Napolitano, Luca Della Penna, Tommaso Tedeschi, Livio Fanò The application of quantum algorithms to jet substructure analysis is of growing interest as NISQ hardware continues to mature in qubit count and gate depth. Jet substructure remains essential for addressing demanding and complementary challenges at the LHC and beyond, notably object classification and polarization tagging. However, existing quantum machine learning approaches typically rely on data representations that suffer from infrared and collinear unsafety, sensitivity to non-perturbative effects, or poor scalability. In this work, we introduce the Lund Plane to Bloch (LP2B) encoding, designed to map a theoretically clean and robust representation of jet kinematics directly into qubit states. Leveraging this encoding, we implement a Quantum Tree-Topology Network (QTTN) that natively embeds the hierarchical structure of the Lund tree. We evaluate the QTTN across multiple benchmarks and observe that it matches the performance of large classical deep learning architectures, such as LundNet, on polarization tagging, while maintaining competitive accuracy for W boson and top quark tagging. The architecture demonstrates enhanced sensitivity compared to standard 1P1Q encodings on both polarization and W tagging, and pushes the Pareto front when compared against MLP of similar size and BDTs. Remarkably, the QTTN requires three orders of magnitude fewer parameters than LundNet, demonstrating promises for low-latency FPGA implementations in trigger systems. Furthermore, the QTTN outperforms classical methods in the low-data regime, making it suitable for low-yield, data-driven analyses. We also find that the quantum model is less susceptible to overfitting generator-specific parton shower and hadronization models than classical deep learning approaches, pointing toward potentially smaller systematic uncertainties. We validate the QTTN on real quantum hardware using a 3-qubit SpinQ device. Subjects: Quantum Physics (quant-ph); High Energy Physics - Experiment (hep-ex); Instrumentation and Detectors (physics.ins-det) Cite as: arXiv:2604.18613 [quant-ph]   (or arXiv:2604.18613v1 [quant-ph] for this version)   https://doi.org/10.48550/arXiv.2604.18613 Focus to learn more Submission history From: Fabrizio Napolitano [view email] [v1] Wed, 15 Apr 2026 13:57:22 UTC (7,911 KB) Access Paper: HTML (experimental) view license Current browse context: quant-ph < prev   |   next > new | recent | 2026-04 Change to browse by: hep-ex physics physics.ins-det References & Citations INSPIRE HEP NASA ADS Google Scholar Semantic Scholar Export BibTeX Citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Demos Related Papers About arXivLabs Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
    💬 Team Notes
    Article Info
    Source
    arXiv Quantum
    Category
    ◌ Quantum Computing
    Published
    Apr 22, 2026
    Archived
    Apr 22, 2026
    Full Text
    ✓ Saved locally
    Open Original ↗