activity
20232026
most citedPathfinding Quantum Simulations of Neutrinoless Double-Beta Decay

2 citations · 5 across the 13 of their papers we have counts for

collaborators
Showing 2025Show all

6 papers · 1 filter

quant-ph2025

A Non-Variational Quantum Approach to the Job Shop Scheduling Problem

Miguel Angel Lopez-Ruiz, Emily L. Tucker, Emma M. Arnold +3

Quantum heuristics offer a potential advantage for combinatorial optimization but are constrained by near-term hardware limitations. We introduce Iterative-QAOA, a variant of QAOA…

quant-ph2025

Guided sampling ansätzes for variational quantum computing

Daniel Gunlycke, John P. T. Stenger, Andrii Maksymov +3

Quantum computing is a promising technology because of the ability of quantum computers to process vector spaces with dimensions that increase exponentially with the simulated syst…

quant-ph2025★ 1 cited

Protein folding with an all-to-all trapped-ion quantum computer

Sebastián V. Romero, Alejandro Gomez Cadavid, Pavle Nikačević +8

We experimentally demonstrate that the bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm, implemented on IonQ's fully connected trapped-ion quantum proc…

quant-ph2025★ 2 cited

Pathfinding Quantum Simulations of Neutrinoless Double-Beta Decay

Ivan A. Chernyshev, Roland C. Farrell, Marc Illa +10

We present results from co-designed quantum simulations of the neutrinoless double-beta decay of a simple nucleus in 1+1D quantum chromodynamics using IonQ's Forte-generation trapp…

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…