From quantum to quantum-inspired: the LogQ algorithm as a non-linear continuous relaxation of variables method
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914472473395200 |
|---|---|
| author | Messud, Jérémie Chatterjee, Yagnik |
| author_facet | Messud, Jérémie Chatterjee, Yagnik |
| contents | The LogQ algorithm encodes Quadratic Unconstrained Binary Optimization (QUBO) problems, which are often encountered in the industry (portfolio optimization, fleet optimization, charging stations, etc.). It was developed within the framework of quantum computing, designed as a pragmatic approach to quantum combinatorial optimization that drastically reduces the number of required qubits and quantum circuit depth. While LogQ has recently been made compliant with gradient-inspired methods, greatly improving parameter optimization efficiency, it still faced hurdles regarding Pauli decomposition and measurement overhead. We here demonstrate that LogQ can be fully reformulated within a classical framework, which effectively eliminates the need for Pauli decomposition and bypasses the measurement challenges altogether. This finally leads to a classical heuristic based on a non-linear continuous relaxation of variables and is, to the best of our knowledge, novel. The LogQ story illustrates how quantum computing can inspire classical algorithms, leading to so-called "quantum-inspired" methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_12925 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | From quantum to quantum-inspired: the LogQ algorithm as a non-linear continuous relaxation of variables method Messud, Jérémie Chatterjee, Yagnik Optimization and Control The LogQ algorithm encodes Quadratic Unconstrained Binary Optimization (QUBO) problems, which are often encountered in the industry (portfolio optimization, fleet optimization, charging stations, etc.). It was developed within the framework of quantum computing, designed as a pragmatic approach to quantum combinatorial optimization that drastically reduces the number of required qubits and quantum circuit depth. While LogQ has recently been made compliant with gradient-inspired methods, greatly improving parameter optimization efficiency, it still faced hurdles regarding Pauli decomposition and measurement overhead. We here demonstrate that LogQ can be fully reformulated within a classical framework, which effectively eliminates the need for Pauli decomposition and bypasses the measurement challenges altogether. This finally leads to a classical heuristic based on a non-linear continuous relaxation of variables and is, to the best of our knowledge, novel. The LogQ story illustrates how quantum computing can inspire classical algorithms, leading to so-called "quantum-inspired" methods. |
| title | From quantum to quantum-inspired: the LogQ algorithm as a non-linear continuous relaxation of variables method |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2604.12925 |