Quantum Computing

QCaMP: A 4-Week Summer Camp Introducing High School Students to Quantum Information Science and Technology

In this paper, we provide details on the curriculum and outcomes of the 2024 Quantum Computing, Math and Physics Camp (QCaMP).

A Practical Framework for Assessing the Performance of Observable Estimation in Quantum Simulation

In this paper, we integrate a framework for benchmarking quantum simulation and observable estimation in the QED-C benmark suite.

QCLAB: A Matlab Toolbox for Quantum Computing

We present v1.0 of QCLAB, an object-oriented MATLAB toolbox for constructing, representing, and simulating quantum circuits.

Diagrammatic Quantum Circuit Compression for Hamiltonian Simulation

We derive the results on compression of Hamiltonian simulation circuits using ZX-calculus.

HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware

HamLib is an extensive dataset of qubit Hamiltonians spanning a large range of problem sizes and instances that is designed for testing quantum algorithms, software and hardware.

Long-lived oscillations of metastable states in neutral atom systems

We study the dynamics of long-lived oscillations of metastable states in neutral atom systems.

False vacuum decay and nucleation dynamics in neutral atom systems

We study the dynamics of neutral atom systems in the false vacuum decay and annealing regimes.

Efficient Measurement-Driven Eigenenergy Estimation with Classical Shadows

In this paper, we introduce the multi-observable dynamic mode decomposition (MODMD) approach combining ODMD with classical shadows for efficient low-lying energy computations on near-term and early fault-tolerant quantum computers.

Non-Clifford diagonalization for measurement shot reduction in quantum expectation value estimation

In this paper, we introduce k-NoCliD, a method to reduce the number of measurements for estimating expectation values that relaxes the constraint of commutativity.

Quantum Rational Transformation Using Linear Combinations of Hamiltonian Simulations

We propose two methods for implementing operator resolvents on a quantum computer based on Hamiltonian simulation: a first method based on discretization of integral representations of the resolvent through Gauss quadrature rule and a second method that leverages a continuous variable ancilla qubit. We use these results to study the implementation of rational functions on a quantum computer and illustrate their potential for estimating low-lying energies.