Variational Quantum Models for Knowledge Graph Embeddings on NISQ Devices

Variational Quantum Algorithms (VQAs) combine quantum circuits with classical optimization to tackle problems that may benefit from the capabilities of near-term quantum hardware. In knowledge graph embedding, recent proposals based on this approach follow a similar overall architecture but differ in the way they compute the score function and in the number of qubits they require. One design uses n+1 qubits and obtains the score through a switch test on an ancillary qubit, while another employs 2n+1 qubits and applies a swap test between two registers. In both cases, entities and relations are represented in a Hilbert space of dimension d = 2ⁿ, with comparable computational cost and the same mean squared error loss. This work introduces a unified framework that captures the two schemes and makes it possible to explore new variants. Within this setting, we propose an alternative that keeps the intuitive meaning of the score function while dispensing with ancillary qubits and entangled measurements. The result is a model better suited to current NISQ devices, reducing hardware demands without sacrificing interpretability.