Greater Efficiency for Quantum Applications by Breaking Abstractions

Classical computation has a significant role to play towards practical quantum computation. First, substantially greater circuit fidelities can be achieved through physics-aware compilation of circuits. Second, classical simulation of quantum circuits, especially special classes such as Clifford and Near-Clifford circuits, can substantially aid circuit optimization and initialization of quantum algorithms. Lastly, techniques such as circuit cutting can take advantage of a hybrid classical-quantum architecture to achieve computations beyond the scale of near-term quantum machines.