Thomas Lubinski

Thomas Lubinski

Auto-generated profile, based on publicly available information

Thomas Lubinski

Quantum Circuits Inc, New Haven, CT, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
7 March 2023 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
TLThomas Lubinski
Thomas Lubinski
SJSonika Johri
Sonika Johri
PVPaul Varosy
Paul Varosy
JCJeremiah Coleman
Jeremiah Coleman
LZLuning Zhao
Luning Zhao
TPTimothy Proctor
Timothy Proctor
In this work we introduce an open source suite of quantum application-oriented performance benchmarks that is designed to measure the effectiveness of quantum computing hardware at executing quantum applications. These benchmarks probe a quantum computer's performance on various algorithms and small applications as the problem size is varied, by mapping out the fidelity of the results as a function of circuit width and depth using the framework of volumetric benchmarking. In addition to estimating the fidelity of results generated by quantum execution, the suite is designed to benchmark certain aspects of the execution pipeline in order to provide end-users with a practical measure of both the quality of and the time to solution. Our methodology is constructed to anticipate advances in quantum computing hardware that are likely to emerge in the next five years. This benchmarking suite is designed to be readily accessible to a broad audience of users and provides benchmarks that correspond to many well-known quantum computing algorithms.

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.

4 April 2025 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
ACAvimita Chatterjee
Avimita Chatterjee
SRSonny Rappaport
Sonny Rappaport
AGAnish Giri
Anish Giri
SJSonika Johri
Sonika Johri
TPTimothy Proctor
Timothy Proctor
TLThomas Lubinski
Thomas Lubinski
Quantum Hamiltonian simulation is one of the most promising applications of quantum computing and forms the basis for many quantum algorithms. Benchmarking them is an important gauge of progress in quantum computing technology. We present a methodology and software framework to evaluate various facets of the performance of gate-based quantum computers on Trotterized quantum Hamiltonian evolution. We propose three distinct modes for benchmarking: (i) comparing simulation on a real device to that on a noiseless classical simulator, (ii) comparing simulation on a real device with exact diagonalization results, and (iii) using scalable mirror circuit techniques to assess hardware performance in scenarios beyond classical simulation methods. We demonstrate this framework on five Hamiltonian models from the HamLib library: the Fermi and Bose-Hubbard models, the transverse field Ising model, the Heisenberg model, and the Max3SAT problem. Experiments were conducted using Qiskit's Aer simulator, BlueQubit's CPU cluster and GPU simulators, and IBM's quantum hardware. Our framework, extendable to other Hamiltonians, provides comprehensive performance profiles that reveal hardware and algorithmic limitations and measure both fidelity and execution times, identifying crossover points where quantum hardware outperforms CPU/GPU simulators.

18 March 2026 in Computer Physics Communications
Verified
Journal Article
Closed access
WBW. Michael Brown
W. Michael Brown
ARAnurag Ramesh
Anurag Ramesh
TLThomas Lubinski
Thomas Lubinski
TNThien Nguyen
Thien Nguyen
DNDavid Bernal Neira
David Bernal Neira