activity
20152026
most citedUnconstrained Binary Models of the Travelling Salesman Problem Variants for Quantum Optimization

67 citations · 388 across the 36 of their papers we have counts for

collaborators

37 papers

quant-ph2026

Scalable quantum circuit generation for iterative ground state approximation using Majorana Propagation

Rahul Chakraborty, Aaron Miller, Anton Nykänen +6

We introduce the Adaptive Derivative-Assembled Pseudo-Trotter ansatz Variational Majorana Propagation Eigensolver (ADAPT-VMPE), a quantum-inspired classical algorithm that exploits…

quant-ph2025★ 2 cited

Simulation of Fermionic circuits using Majorana Propagation

Aaron Miller, Joachim Favre, Zoë Holmes +6

We introduce Majorana Propagation, an algorithmic framework for the classical simulation of Fermionic circuits. Inspired by Pauli Propagation, Majorana Propagation operates by appl…

quant-ph2024

A generic multi-Pauli compilation framework for limited connectivity

Adam Glos, Özlem Salehi

Efficient and effective compilation of quantum circuits remains an important aspect of executing quantum programs. In this paper, we propose a generic compilation framework particu…

quant-ph2024★ 4 cited

Practical techniques for high-precision measurements on near-term quantum hardware and applications in molecular energy estimation

Keijo Korhonen, Hetta Vappula, Adam Glos +6

Achieving high-precision measurements on near-term quantum devices is critical for advancing quantum computing applications. Quantum computers suffer from high readout errors, maki…

quant-ph2024★ 1 cited

Treespilation: Architecture- and State-Optimised Fermion-to-Qubit Mappings

Aaron Miller, Adam Glos, Zoltán Zimborás

Quantum computers hold great promise for efficiently simulating Fermionic systems, benefiting fields like quantum chemistry and materials science. To achieve this, algorithms typic…

quant-ph2023★ 1 cited

Classification and transformations of quantum circuit decompositions for permutation operations

Ankit Khandelwal, Handy Kurniawan, Shraddha Aangiras +2

Efficient decomposition of permutation unitaries is vital as they frequently appear in quantum computing. In this paper, we identify the key properties that impact the decompositio…