67 citations · 134 across the 8 of their papers we have counts for
9 papers
Reusable QUBO-Derived Block-Schur Inverse Factors for Fixed-Operator Finite-Difference PDE Solvers
Arash Fath Lipaei, Özgür E. Müstecaplıoğlu, Özlem Salehi +1
Many simulations of partial differential equations require the repeated solution of linear systems whose matrix remains fixed while the righthand side changes. We present a hybrid…
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…
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…
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…
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…
Integer Factorization through Func-QAOA
Mostafa Atallah, Haemanth Velmurugan, Rohan Sharma +5
Integer factorization is a significant problem, with implications for the security of widely-used cryptographic schemes. No efficient classical algorithm for polynomial-time intege…
Error mitigation for variational quantum algorithms through mid-circuit measurements
Ludmila Botelho, Adam Glos, Akash Kundu +3
Noisy Intermediate-Scale Quantum (NISQ) algorithms require novel paradigms of error mitigation. To obtain noise-robust quantum computers, each logical qubit is equipped with hundre…
Cost-efficient QFA Algorithm for Quantum Computers
Özlem Salehi, Abuzer Yakaryılmaz
The study of quantum finite automata (QFAs) is one of the possible approaches in exploring quantum computers with finite memory. Despite being one of the most restricted models, Mo…
Unconstrained Binary Models of the Travelling Salesman Problem Variants for Quantum Optimization
Özlem Salehi, Adam Glos, Jarosław Adam Miszczak
Quantum computing is offering a novel perspective for solving combinatorial optimization problems. To fully explore the possibilities offered by quantum computers, the problems nee…