6 papers
Efficiently Simulable Pauli Correlation Encoding
Daniele Lizzio Bosco, Gabriel Matos, Chen-Yu Liu +4
Pauli Correlation Encoding (PCE) is a heuristic framework for binary optimisation that encodes classical variables into many-body Pauli observables. While PCE requires fewer qubits…
Automated near-term quantum algorithm discovery for molecular ground states
Fabian Finger, Frederic Rapp, Pranav Kalidindi +10
Designing quantum algorithms is a complex and counterintuitive task, making it an ideal candidate for AI-driven algorithm discovery. To this end, we employ the Hive, an AI platform…
Formal Framework for Quantum Advantage
Harry Buhrman, Niklas Galke, Konstantinos Meichanetzidis
Motivated by notions of quantum heuristics and by average-case rather than worst-case algorithmic analysis, we define quantum computational advantage in terms of individual problem…
Estimating the Jones polynomial for Ising anyons on noisy quantum computers
Chris N. Self, Sofyan Iblisdir, Gavin K. Brennen +1
The evaluation of the Jones polynomial at roots of unity is a paradigmatic problem for quantum computers. In this work we present experimental results obtained from existing noisy…
End-to-End Quantum Algorithms for the Jones Polynomial
Tuomas Laakkonen, Enrico Rinaldi, Chris N. Self +6
We present an end-to-end algorithmic pipeline where a noisy digital quantum computer is used to approximate the value of the Jones polynomial at the fifth root of unity for any inp…
Learning Complex Word Embeddings in Classical and Quantum Spaces
Carys Harvey, Stephen Clark, Douglas Brown +1
We present a variety of methods for training complex-valued word embeddings, based on the classical Skip-gram model, with a straightforward adaptation simply replacing the real-val…