7 citations · 8 across the 2 of their papers we have counts for
2 papers
quant-ph2024★ 7 cited
Efficient Encodings of the Travelling Salesperson Problem for Variational Quantum Algorithms
Manuel Schnaus, Lilly Palackal, Benedikt Poggel +4
Routing problems are a common optimization problem in industrial applications, which occur on a large scale in supply chain planning. Due to classical limitations for solving NP-ha…
quant-ph2023★ 1 cited
Efficient learning of Sparse Pauli Lindblad models for fully connected qubit topology
Jose Este Jaloveckas, Minh Tham Pham Nguyen, Lilly Palackal +2
The challenge to achieve practical quantum computing considering current hardware size and gate fidelity is the sensitivity to errors and noise. Recent work has shown that by learn…