Thomas Propson

TL;DR: In this paper, the authors propose two strategies for partial compilation, exploiting the structure of variational circuits to pre-compile optimal pulses for specific blocks of gates, with only a small fraction of the compilation latency of GRAPE.

TL;DR: In this article, the authors present a general software solution to alleviate frequency crowding by systematically tuning qubit frequencies according to input programs, trading parallelism for higher gate fidelity when necessary.

TL;DR: In this article, robust trajectory optimization techniques are applied to suppress gate errors arising from system parameter uncertainty, and a derivative-based approach that maintains computational efficiency by using forward-mode differentiation is proposed.

TL;DR: In this article, a quantum processor with qubits, a classical memory including a quantum program defining a plurality of instructions in a source language, and a classical processor configured to: (i) receive a circuit of gates representing a quantum programs for a variational algorithm in which computation is interleaved with compilation; (ii) identify a plurality-of-blocks, each block includes a subcircuit of gates, leaving one or more remainder subcircuits outside of the plurality of blocks.