2 citations · 5 across the 13 of their papers we have counts for
17 papers
Quantum simulation of field-tunable spin spectroscopy of the quantum magnet Cs2CoCl4 on a trapped-ion quantum computer
Elias Kokkas, Nora Bauer, Justin Provazza +7
The collective excitation spectra of quantum magnets provide a direct test of quantum computers as tools for studying strongly correlated matter. Hardware noise limits the circuit…
Two-Stage Quantum-Classical Distribution Network Reconfiguration via Cycle-Edge Encoding
Nowar Alashkar, Cade Kennedy, Phillip C. Lotshaw +6
Distribution network reconfiguration (DNR) is a combinatorial optimization problem that seeks a low-loss network topology subject to topological and electrical operating constraint…
Warm-Start Iterative QITE for Distribution Network Reconfiguration via Branch-Exchange Encoding
Noah Crum, Pete Pritchard, Tanner Rase +5
We present a hybrid quantum-classical algorithm for distribution network reconfiguration, a combinatorial optimization problem on power distribution networks, that combines a radia…
Protein folding on a 64 qubit trapped-ion hardware via counterdiabatic quantum optimization
Alejandro Gomez Cadavid, Pavle Nikačević, Pranav Chandarana +11
We report the largest trapped-ion hardware demonstration of lattice protein-folding optimization to date, using bias-field digitized counterdiabatic quantum optimization (BF-DCQO)…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
Performant near-term quantum combinatorial optimization
Titus D. Morris, Ananth Kaushik, Martin Roetteler +1
Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an imp…
Simulating the flight gate assignment problem on a trapped ion quantum computer
Yahui Chai, Evgeny Epifanovsky, Karl Jansen +2
We study the flight gate assignment problem on IonQ's Aria trapped ion quantum computer using the variational quantum eigensolver. Utilizing the conditional value at risk as an agg…