We show that if an electromagnetic energy pulse in a multimode coherent state with average photon number
n is used to carry out the same quantum logical operation on a set of
N atoms, either simultaneously or sequentially, the overall error probability in the worst-case scenario (i.e., maximized over all the possible initial atomic states) scales as
N2∕n. This means that in order to keep the error probability bounded by
Nϵ, with $ϵ\ensuremath{\sim}1∕\overline{n}$, one needs to use
Nn photons or, equivalently,
N separate ``minimum-energy'' pulses: in this sense the pulses cannot, in general, be shared. The origin of this phenomenon is found in atom-field entanglement. These results may have important consequences for quantum logic and, in particular, for large-scale quantum computation.
A lower bound on the amount of energy needed to carry out an elementary logical operation on a qubit system, with a given accuracy and in a given time, has been recently postulated. This paper is an attempt to formalize this bound and explore the conditions under which it may be expected to hold. For a specific, important case (namely, when the control system is a quantized electromagnetic field) it is shown how one can extend this result to a generally stronger constraint on the minimum energy density required, per pulse.
Abstract Contemporary methods for benchmarking noisy quantum processors typically measure average error rates or process infidelities. However, thresholds for fault-tolerant quantum error correction are given in terms of worst-case error rates—defined via the diamond norm—which can differ from average error rates by orders of magnitude. One method for resolving this discrepancy is to randomize the physical implementation of quantum gates, using techniques like randomized compiling (RC). In this work, we use gate set tomography to perform precision characterization of a set of two-qubit logic gates to study RC on a superconducting quantum processor. We find that, under RC, gate errors are accurately described by a stochastic Pauli noise model without coherent errors, and that spatially correlated coherent errors and non-Markovian errors are strongly suppressed. We further show that the average and worst-case error rates are equal for randomly compiled gates, and measure a maximum worst-case error of 0.0197(3) for our gate set. Our results show that randomized benchmarks are a viable route to both verifying that a quantum processor’s error rates are below a fault-tolerance threshold, and to bounding the failure rates of near-term algorithms, if—and only if—gates are implemented via randomization methods which tailor noise.