activity
20222026
most citedQuantum Natural Language Processing

24 citations · 29 across the 17 of their papers we have counts for

collaborators

17 papers

quant-ph2026

Measuring what matters: A scalable framework for application-level quantum benchmarking

Willie Aboumrad, Claudio Girotto, Joshua Goings +16

As quantum computing systems continue to mature, there is an increasing need for benchmarking methodologies that capture performance in terms of meaningful, application-level metri…

quant-ph2026

Hybrid Quantum-Classical Optimization Workflows for the Shipment Selection Problem

Miguel Angel Lopez-Ruiz, Daiwei Zhu, Jonas Hatzenbuhler +8

We present a quantum optimization framework for the Shipment Selection Problem (SSP) in electric freight logistics, developed jointly by IonQ and Einride. Idle gaps arising from st…

quant-ph2026

End-to-end performance of quantum-accelerated large-scale linear algebra workflows

Daiwei Zhu, Miguel Angel Lopez-Ruiz, François-Henry Rouet +5

Solving large-scale sparse linear systems is a challenging computational task due to the introduction of non-zero elements, or "fill-in". The Graph Partitioning Problem (GPP) arise…

quant-ph2026

Large-scale portfolio optimization on a trapped-ion quantum computer

Alejandro Gomez Cadavid, Ananth Kaushik, Pranav Chandarana +10

We present an end-to-end pipeline for large-scale portfolio selection with cardinality constraints and experimentally demonstrate it on trapped-ion quantum processors using hardwar…

quant-ph2025★ 1 cited

Quantum-Classical Auxiliary Field Quantum Monte Carlo with Matchgate Shadows on Trapped Ion Quantum Computers

Luning Zhao, Joshua J. Goings, Willie Aboumrad +38

We demonstrate an end-to-end workflow to model chemical reaction barriers with the quantum-classical auxiliary field quantum Monte Carlo (QC-AFQMC) algorithm with quantum tomograph…

quant-ph2025

A New Hybrid Quantum-Classical Algorithm for Solving the Unit Commitment Problem

Willie Aboumrad, Phani R V Marthi, Suman Debnath +2

Solving problems related to planning and operations of large-scale power systems is challenging on classical computers due to their inherent nature as mixed-integer and nonlinear p…

quant-ph2025

Accelerating large-scale linear algebra using variational quantum imaginary time evolution

Willie Aboumrad, Daiwei Zhu, Claudio Girotto +6

The solution of large sparse linear systems via factorization methods such as LU or Cholesky decomposition, can be computationally expensive due to the introduction of non-zero ele…

quant-ph2025

Quantum Computing for Optimizing Aircraft Loading

Ananth Kaushik, Sang Hyub Kim, Willie Aboumrad +3

The aircraft loading optimization problem is a computationally hard problem with the best known classical algorithm scaling exponentially with the number of objects. We propose a q…

hep-ph2024★ 1 cited

Hybrid quantum-classical approach for combinatorial problems at hadron colliders

Jacob L. Scott, Zhongtian Dong, Taejoon Kim +6

In recent years, quantum computing has drawn significant interest within the field of high-energy physics. We explore the potential of quantum algorithms to resolve the combinatori…

quant-ph2024★ 24 cited

Quantum Natural Language Processing

Dominic Widdows, Willie Aboumrad, Dohun Kim +2

Language processing is at the heart of current developments in artificial intelligence, and quantum computers are becoming available at the same time. This has led to great interes…

quant-ph2023

Mod2VQLS: a Variational Quantum Algorithm for Solving Systems of Linear Equations Modulo 2

Willie Aboumrad, Dominic Widdows

This paper presents a system for solving binary-valued linear equations using quantum computers. The system is called Mod2VQLS, which stands for Modulo2 Variational Quantum Linear…

quant-ph2023

Quantum and Classical Combinatorial Optimizations Applied to Lattice-Based Factorization

Willie Aboumrad, Dominic Widdows, Ananth Kaushik

The availability of working quantum computers has led to several proposals and claims of quantum advantage. In 2023, this has included claims that quantum computers can successfull…

math.QA2022★ 1 cited

On the structure and representation theory of -deformed Clifford algebras

Willie Aboumrad, Travis Scrimshaw

We provide a generalized definition for the quantized Clifford algebra introduced by Hayashi using another parameter that we call the twist. For a field of characteristic not e…

math.QA2022

The ribbon category framework for topological quantum computing

Willie Aboumrad

This expository article supplies the mathematical background underpinning the braid representation calculator introduced in arXiv:2212.00831; those representations describe the set…

math.QA2022

Quantum computing with anyons: an -matrix and braid calculator

Willie Aboumrad

We introduce a pentagon equation solver, available as part of SageMath, and use it to construct braid group representations associated to certain anyon systems. We recall the categ…

math.QA2022★ 1 cited

Skew Howe duality for Types via -Clifford algebras

Willie Aboumrad

We extend a quantized skew Howe duality result for Type algebras to orthogonal types via a seesaw. We develop an operator commutant version of the First Fundamental Th…

math.QA2022★ 1 cited

Skew Howe duality for via quantized Clifford algebras

Willie Aboumrad

We develop an operator commutant version of the First Fundamental Theorem of invariant theory for the general linear quantum group by using a double centrali…