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.
In this paper, we introduce a new quantum algorithm for approximating matrix elements of functions of unitiaries, i.e., quantities of the form ⟨ψ1|f(U)|ψ0⟩.
In this work, we introduce an end-to-end framework that provides an efficient partitioning scheme for large-scale QCs alongside a flexible code generator to offer a portable solution that minimizes data movement between compute nodes.
We collect vendor quantum computer hardware roadmaps and compare against quantum resource estimates in the physical sciences. Additionally, we propose a metric, dubbed Sustained Quantum System Performance (SQSP), to evaluate system-level performance and throughput for a heterogeneous workload.
In this paper, we introduce a novel measurement-driven approach that finds eigenenergies by collecting real-time measurements and post-processing them using the machinery of dynamic mode decomposition (DMD).
This work proposes a framework for DMFT calculations on quantum computers, focusing on near-term applications. It leverages the structure of the impurity problem, combining a low-rank Gaussian subspace representation of the ground state and a compressed, short-depth quantum circuit that joins the Gaussian state preparation with the time evolution to compute the necessary Green's functions.