NMR quantum computing

Abstract:

Quantum computers are on the brink of surpassing the capabilities of even the most powerful classical computers, which naturally raises the question of how one can trust the results of a quantum computer when they cannot be compared to classical simulation Here, we present a cross-verification technique that exploits the principles of measurement-based quantum computation to link quantum circuits of different input size, depth, and structure. Our technique enables consistency checks of quantum computations between independent devices, as well as within a single device. We showcase our protocol by applying it to five state-of-the-art quantum processors, based on four distinct physical architectures: nuclear magnetic resonance, superconducting circuits, trapped ions, and photonics, with up to six qubits and up to 200 distinct circuits.

Abstract:

We consider the problem of selectively controlling couplings in a practical quantum processor with always-on interactions that are diagonal in the computational basis, using sequences of local not gates. This methodology is well known in nuclear magnetic resonance implementations, but previous approaches do not scale efficiently for the general fully connected Hamiltonian, where the complexity of finding time-optimal solutions makes them only practical up to a few tens of qubits. Given the rapid growth in the number of qubits in cutting-edge quantum processors, it is of interest to investigate the applicability of this control scheme to much larger-scale systems with realistic restrictions on connectivity. Here we present an efficient scheme to find near time-optimal solutions that can be applied to engineered qubit arrays with local connectivity for any number of qubits, indicating the potential for practical quantum computing in such systems.