Chronological feed of everything captured from Travis Humble.
paper / travishumble / Jan 23
A test-driven method decomposes NISQ application circuits into subcircuits for individual experimental characterization, yielding a composite model of the full noisy circuit. This approach predicts outcomes for related programs with high accuracy, measured by total variation distance on superconducting transmon devices running GHZ-state preparation and Bernstein-Vazirani algorithms. Models balance computational efficiency against tunable predictive accuracy without full-circuit simulations.
nisq-devicesquantum-noise-modelingquantum-circuit-characterizationghz-state-preparationbernstein-vaziranisuperconducting-qubitsarxiv-paper
“Decomposing NISQ circuits into subcircuits and characterizing them experimentally generates a composite model for the original circuit and related programs.”
paper / travishumble / Nov 6
XACC provides a service-oriented, system-level software infrastructure for heterogeneous quantum-classical computing, shifting from high-level REST APIs to low-level co-processor models. It exposes modular interfaces for quantum programming, compilation, and execution, remaining hardware-agnostic for both NISQ and future architectures. The framework enables tight integration of quantum and classical workflows, demonstrated through paradigmatic tasks, and supports development of compilers and runtimes.
quantum-computingquantum-softwarexacc-frameworkquantum-classical-hybridprogramming-infrastructurearxiv-papersystem-software
“Quantum programming has advanced significantly over the past five years, primarily through high-level frameworks targeting remote REST library APIs.”
paper / travishumble / Oct 29
Hybrid models integrate deterministic classical algorithms with quantum computing to tackle combinatorial complexity in large-scale mixed-integer programming. Applied to molecular conformation, job-shop scheduling, manufacturing cell formation, and vehicle routing problems, these approaches yield superior solution quality and computation time. Results demonstrate that leveraging quantum features complements classical methods for computationally challenging instances.
quantum-computinghybrid-algorithmsoptimizationmixed-integer-programmingjob-shop-schedulingvehicle-routingmolecular-conformation
“Hybrid QC-based algorithms address four specific applications: molecular conformation, job-shop scheduling, manufacturing cell formation, and vehicle routing problems.”
paper / travishumble / May 4
Researchers developed a VQE-based quantum chemistry benchmark incorporating active space reduction, reduced unitary coupled cluster ansatz, and McWeeny density purification for NISQ devices. Simulations of alkali metal hydrides (NaH, KH, RbH) on IBM Tokyo (20 qubits) and Rigetti Aspen (16 qubits) highlight characteristic high noise in superconducting hardware. Post-processing error mitigation, particularly density purification, dramatically improves ground-state energy accuracy, enabling chemical accuracy for specific settings via cloud access.
quantum-computingquantum-chemistryvariational-quantum-eigensolvernisqerror-mitigationquantum-benchmarksuperconducting-qubits
“The benchmark simulates alkali metal hydrides NaH, KH, RbH on 20-qubit IBM Tokyo and 16-qubit Rigetti Aspen processors using VQE.”
paper / travishumble / Apr 27
Quantum annealing on D-Wave 2000Q solves Nurse Scheduling Problem (NSP) instances by mapping to an Ising-type Hamiltonian, yielding solutions that satisfy hard constraints. Empirical tests show the method produces diverse, practical solutions. Reverse annealing significantly improves solution quality by refining initial results through a second annealing pass.
quantum-annealingnurse-schedulingd-wave-2000qcombinatorial-optimizationreverse-annealingising-hamiltonian
“Quantum annealing on D-Wave 2000Q recovers satisfying solutions for Nurse Scheduling Problem instances with hard constraints.”
paper / travishumble / Feb 4
Continuous-time quantum walks (CTQWs) extend from static to dynamic graphs, where a sequence of graphs drives the walk's free evolution. Perfect state transfer in these walks designs dynamic graphs implementing a universal set of quantum logic gates, demonstrated for a complete logical basis. Numerical simulations validate implementations for quantum teleportation and addition circuits. Realization is feasible using actively controlled quantum optical waveguides.
quantum-walkscontinuous-time-quantum-walksdynamic-graphsquantum-computationquantum-logic-gatesquantum-opticsarxiv-paper
“CTQWs on static graphs enable efficient search, sampling, and model universal quantum computation.”
paper / travishumble / Feb 1
Presents an iterative quantum algorithm for maximizing a function in dynamic models where prior search results refine the acceptable input set. Builds on quantum search with a dynamic oracle that marks items based on updated constraints. Demonstrates correctness via numerical simulations of quantum circuits for the Knapsack problem using explicit arithmetic oracles and comparators up to 30 qubits.
quantum-algorithmquantum-searchfunction-optimizationknapsack-problemquantum-circuitsdynamic-oracle
“The algorithm iteratively finds the maximum value of a function by updating the acceptable response based on prior search results.”
paper / travishumble / Dec 17
Researchers introduce a direct quantum annealing method to solve general polynomial equation systems, bypassing iterative solvers' variable convergence tied to condition numbers. Validated on second-order polynomials using a commercial annealer, it applies to linear regression and scales with problem size, condition number, and precision. An iterative annealing variant achieves 10^{-8} tolerance for linear systems.
quantum-annealingpolynomial-equationslinear-systemsquantum-computingarxiv-paperscientific-computing
“Quantum annealing provides a direct method for solving general systems of polynomial equations”