Joshua Apanavicius

Joshua Apanavicius

Auto-generated profile, based on publicly available information

Joshua Apanavicius

Applied Physics Laboratory, Johns Hopkins University, Baltimore, United States

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 August 2024 in ACM Transactions on Quantum Computing
Verified
Journal Article
Open access
TLThomas Lubinski
Thomas Lubinski
CCCarleton Coffrin
Carleton Coffrin
CMCatherine McGeoch
Catherine McGeoch
PSPratik Sathe
Pratik Sathe
JAJoshua Apanavicius
Joshua Apanavicius
QCQuantum Economic Development Consortium(QED-C) Collaboration
Quantum Economic Development Consortium(QED-C) Collaboration
Combinatorial optimization is anticipated to be one of the primary use cases for quantum computation in the coming years. The Quantum Approximate Optimization Algorithm and Quantum Annealing can potentially demonstrate significant run-time performance benefits over current state-of-the-art solutions. Inspired by existing methods to characterize classical optimization algorithms, we analyze the solution quality obtained by solving Max-cut problems using gate-model quantum devices and a quantum annealing device. This is used to guide the development of an advanced benchmarking framework for quantum computers designed to evaluate the trade-off between run-time execution performance and the solution quality for iterative hybrid quantum-classical applications. The framework generates performance profiles through compelling visualizations that show performance progression as a function of time for various problem sizes and illustrates algorithm limitations uncovered by the benchmarking approach. As an illustration, we explore the factors that influence quantum computing system throughput, using results obtained through execution on various quantum simulators and quantum hardware systems.