105 citations · 439 across the 33 of their papers we have counts for
34 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…
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…
Scalable and interpretable quantum natural language processing: an implementation on trapped ions
Tiffany Duneau, Saskia Bruhn, Gabriel Matos +5
We present the first implementation of text-level quantum natural language processing, a field where quantum computing and AI have found a fruitful intersection. We focus on the QD…
Quantum Algorithms for Compositional Text Processing
Tuomas Laakkonen, Konstantinos Meichanetzidis, Bob Coecke
Quantum computing and AI have found a fruitful intersection in the field of natural language processing. We focus on the recently proposed DisCoCirc framework for natural language,…
Quantum Circuit Optimization with AlphaTensor
Francisco J. R. Ruiz, Tuomas Laakkonen, Johannes Bausch +10
A key challenge in realizing fault-tolerant quantum computers is circuit optimization. Focusing on the most expensive gates in fault-tolerant quantum computation (namely, the T gat…
Peptide Binding Classification on Quantum Computers
Charles London, Douglas Brown, Wenduan Xu +5
We conduct an extensive study on using near-term quantum computers for a task in the domain of computational biology. By constructing quantum models based on parameterised quantum…
Sequence Processing with Quantum Tensor Networks
Carys Harvey, Richie Yeung, Konstantinos Meichanetzidis
We introduce complex-valued tensor network models for sequence processing motivated by correspondence to probabilistic graphical models, interpretability and resource compression.…
Picturing Counting Reductions with the ZH-Calculus
Tuomas Laakkonen, Konstantinos Meichanetzidis, John van de Wetering
Counting the solutions to Boolean formulae defines the problem #SAT, which is complete for the complexity class #P. We use the ZH-calculus, a universal and complete graphical langu…
A Graphical #SAT Algorithm for Formulae with Small Clause Density
Tuomas Laakkonen, Konstantinos Meichanetzidis, John van de Wetering
We study the counting version of the Boolean satisfiability problem #SAT using the ZH-calculus, a graphical language originally introduced to reason about quantum circuits. Using t…
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…
Characterization of variational quantum algorithms using free fermions
Gabriel Matos, Chris N. Self, Zlatko Papić +2
We study variational quantum algorithms from the perspective of free fermions. By deriving the explicit structure of the associated Lie algebras, we show that the Quantum Approxima…
A Quantum Natural Language Processing Approach to Musical Intelligence
Eduardo Reck Miranda, Richie Yeung, Anna Pearson +2
There has been tremendous progress in Artificial Intelligence (AI) for music, in particular for musical composition and access to large databases for commercialisation through the…
Equivariant Quantum Graph Circuits
Péter Mernyei, Konstantinos Meichanetzidis, İsmail İlkan Ceylan
We investigate quantum circuits for graph representation learning, and propose equivariant quantum graph circuits (EQGCs), as a class of parameterized quantum circuits with strong…
lambeq: An Efficient High-Level Python Library for Quantum NLP
Dimitri Kartsaklis, Ian Fan, Richie Yeung +7
We present lambeq, the first high-level Python library for Quantum Natural Language Processing (QNLP). The open-source toolkit offers a detailed hierarchy of modules and classes im…
How to make qubits speak
Bob Coecke, Giovanni de Felice, Konstantinos Meichanetzidis +1
This is a story about making quantum computers speak, and doing so in a quantum-native, compositional and meaning-aware manner. Recently we did question-answering with an actual qu…
Simplification Strategies for the Qutrit ZX-Calculus
Alex Townsend-Teague, Konstantinos Meichanetzidis
The ZX-calculus is a graphical language for suitably represented tensor networks, called ZX-diagrams. Calculations are performed by transforming ZX-diagrams with rewrite rules. The…
QNLP in Practice: Running Compositional Models of Meaning on a Quantum Computer
Robin Lorenz, Anna Pearson, Konstantinos Meichanetzidis +2
Quantum Natural Language Processing (QNLP) deals with the design and implementation of NLP models intended to be run on quantum hardware. In this paper, we present results on the f…
Foundations for Near-Term Quantum Natural Language Processing
Bob Coecke, Giovanni de Felice, Konstantinos Meichanetzidis +1
We provide conceptual and mathematical foundations for near-term quantum natural language processing (QNLP), and do so in quantum computer scientist friendly terms. We opted for an…
Grammar-aware sentence classification on quantum computers
Konstantinos Meichanetzidis, Alexis Toumi, Giovanni de Felice +1
Natural language processing (NLP) is at the forefront of great advances in contemporary AI, and it is arguably one of the most challenging areas of the field. At the same time, in…
Quantum Natural Language Processing on Near-Term Quantum Computers
Konstantinos Meichanetzidis, Stefano Gogioso, Giovanni de Felice +3
In this work, we describe a full-stack pipeline for natural language processing on near-term quantum computers, aka QNLP. The language-modelling framework we employ is that of comp…
Tensor Network Rewriting Strategies for Satisfiability and Counting
Niel de Beaudrap, Aleks Kissinger, Konstantinos Meichanetzidis
We provide a graphical treatment of SAT and #SAT on equal footing. Instances of #SAT can be represented as tensor networks in a standard way. These tensor networks are interpreted…