1 citations · 1 across the 1 of their papers we have counts for
2 papers
quant-ph2019
Improved success probability with greater circuit depth for the quantum approximate optimization algorithm
Andreas Bengtsson, Pontus Vikstål, Christopher Warren +12
Present-day, noisy, small or intermediate-scale quantum processors---although far from fault-tolerant---support the execution of heuristic quantum algorithms, which might enable a…
quant-ph2019
Calibration of the cross-resonance two-qubit gate between directly-coupled transmons
A. D. Patterson, J. Rahamim, T. Tsunoda +8
Quantum computation requires the precise control of the evolution of a quantum system, typically through application of discrete quantum logic gates on a set of qubits. Here, we us…