A modular two-qubit quantum circuit primitive is built to reproduce QCD gluon-splitting entanglement via concurrence, with parameters fitted to LHC data and validated on hardware for three-prong jets.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
MTQA embeds multiple NP-hard problems such as minimum vertex cover and graph partitioning into spatially distinct regions on quantum hardware, delivering comparable solution quality to single-task annealing with reduced time-to-solution.
citing papers explorer
-
Physics inspired quantum algorithm for QCD splitting functions
A modular two-qubit quantum circuit primitive is built to reproduce QCD gluon-splitting entanglement via concurrence, with parameters fitted to LHC data and validated on hardware for three-prong jets.
-
Multi-tasking through quantum annealing
MTQA embeds multiple NP-hard problems such as minimum vertex cover and graph partitioning into spatially distinct regions on quantum hardware, delivering comparable solution quality to single-task annealing with reduced time-to-solution.