activity
20212026
most citedAn evolving objective function for improved variational quantum optimisation

24 citations · 42 across the 7 of their papers we have counts for

collaborators

8 papers

quant-ph2026

A quantum double-bracket algorithm for imaginary-time evolution with exponentially shorter depth

Ioannis Kolotouros, Raul Garcia-Patron

Imaginary-time evolution (ITE) is a widely used technique for preparing the ground state of a target Hamiltonian. Building on the recently proposed framework of Double-Bracket quan…

quant-ph2026

Quantum Elastic Network Models and their Application to Graphene

Ioannis Kolotouros, Adithya Sireesh, Stuart Ferguson +3

Molecular dynamics simulations are a central computational methodology in materials design for relating atomic composition to mechanical properties. However, simulating materials w…

quant-ph2025

Adiabatic-Inspired Hybrid Quantum-Classical Methods for Molecular Ground State Preparation

Sean Thrasher, Ioannis Kolotouros, Julien Michel +1

Quantum computing promises to efficiently and accurately solve many important problems in quantum chemistry which elude classical solvers, such as the electronic structure problem…

quant-ph2024★ 8 cited

Accelerating quantum imaginary-time evolution with random measurements

Ioannis Kolotouros, David Joseph, Anand Kumar Narayanan

Quantum imaginary-time evolution (QITE) is a promising tool to prepare thermal or ground states of Hamiltonians, as convergence is guaranteed when the evolved state overlaps with t…

quant-ph2024★ 2 cited

Big data applications on small quantum computers

Boniface Yogendran, Daniel Charlton, Miriam Beddig +2

Current quantum hardware prohibits any direct use of large classical datasets. Coresets allow for a succinct description of these large datasets and their solution in a computation…

quant-ph2023★ 6 cited

Random Natural Gradient

Ioannis Kolotouros, Petros Wallden

Hybrid quantum-classical algorithms appear to be the most promising approach for near-term quantum applications. An important bottleneck is the classical optimization loop, where t…

quant-ph2022★ 2 cited

Adiabatic quantum computing with parameterized quantum circuits

Ioannis Kolotouros, Ioannis Petrongonas, Miloš Prokop +1

Adiabatic quantum computing is a universal model for quantum computing whose implementation using a gate-based quantum computer requires depths that are unreachable in the early fa…

quant-ph2021★ 24 cited

An evolving objective function for improved variational quantum optimisation

Ioannis Kolotouros, Petros Wallden

A promising approach to useful computational quantum advantage is to use variational quantum algorithms for optimisation problems. Crucial for the performance of these algorithms i…