Black-Box Quantum State Preparation without Arithmetic.

Black-box quantum state preparation is an important subroutine in many quantum algorithms. The standard approach requires the quantum computer to do arithmetic, which is a key contributor to the complexity. Here we present a new algorithm that avoids arithmetic. We thereby reduce the number of gates by a factor of 286-374 over the best prior work for realistic precision; the improvement factor increases with the precision. As quantum state preparation is a crucial subroutine in many approaches to simulating physics on a quantum computer, our new method brings useful quantum simulation closer to reality.

Efficient estimation of resonant coupling between quantum systems.

We present an efficient method for the characterization of two coupled discrete quantum systems, one of which can be controlled and measured. For two systems with transition frequencies ωq, ωr, and coupling strength g we show how to obtain estimates of g and ωr whose error decreases exponentially in the number of measurement shots rather than as a power law expected in simple approaches. Our algorithm can thereby identify g and ωr simultaneously with high precision in a few hundred measurement shots. This is achieved by adapting measurement settings upon data as it is collected. We also introduce a method to eliminate erroneous estimates with small overhead. Our algorithm is robust against the presence of relaxation and typical noise. Our results are applicable to many candidate technologies for quantum computation, in particular, for the characterization of spurious two-level systems in superconducting qubits or stripline resonators.