Quantum Computing

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

We study the dynamics of long-lived oscillations of false and true vacuum states in neutral atom systems.

We test the capabilities of the Aquila quantum simulator on a variety of tasks.

We provide explicit quantum circuits for the block encoding of certain sparse matrices.

This paper proposes a nested state preparation circuit construction with a high degree of quantum parallelism. We test this circuit to load a variety of data sets stemming from applications and process them directly on a real QPU.

In this paper, we explore the use of real-time evolution for computing the trace of a broad class of operators, including matrix functions of the target Hamiltonian.

We simulate the physics of dirty bosons in 1D on quantum computer and in 2D on a quantum circuit simulator.

In this paper, we introduce a notion of commutativity between operators on a tensor product space, nominally Pauli strings on qubits, that interpolates between qubit-wise commutativity and (full) commutativity.

We present a model to estimate the resources in terms of qubits, runtime, and cost associated with large-scale quantum computations.

Quantum content-addressable memory through Grover search and quantum counting with parallel uniformly controlled rotation gates.