Low overhead universality and quantum supremacy using only $Z$-control

Abstract

We consider a model of quantum computation we call "Varying-$Z$" (V$Z$), defined by applying controllable $Z$-diagonal Hamiltonians in the presence of a uniform and constant external $X$-field, and prove that it is universal, even in 1D. Universality is demonstrated by construction of a universal gate set with $O(1)$ depth overhead. We then use this construction to describe a circuit whose output distribution cannot be classically simulated unless the polynomial hierarchy collapses, with the goal of providing a low-resource method of demonstrating quantum supremacy. The V$Z$ model can achieve quantum supremacy in $O(n)$ depth, equivalent to the random circuit sampling models despite a higher degree of homogeneity: it requires no individually addressed $X$-control.

arXiv comment15 pages, 10 figures. v2: added one figure

References in corpus (30)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Elementary gates for quantum computation
• Entanglement of a Pair of Quantum Bits
• Quantum computational advantage using photons
• A Quantum Approximate Optimization Algorithm
• Two-Bit Gates are Universal for Quantum Computation
• Quantum Computational Supremacy
• The Flux Qubit Revisited to Enhance Coherence and Reproducibility
• Efficient Z-Gates for Quantum Computing
• A blueprint for demonstrating quantum supremacy with superconducting qubits
• A geometric theory of non-local two-qubit operations
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Average-case complexity versus approximate simulation of commuting quantum computations
• Quantum Supremacy and the Complexity of Random Circuit Sampling
• Low-decoherence flux qubit
• The power of quantum systems on a line
• Achieving quantum supremacy with sparse and noisy commuting quantum computations
• Experimental Demonstration of a Robust and Scalable Flux Qubit
• Architectures for quantum simulation showing a quantum speedup
• On the Universality of the Quantum Approximate Optimization Algorithm
• Quantum Computing with Globally Controlled Exchange-type Interactions
• Quantum approximate optimization is computationally universal
• Distance Bounds on Quantum Dynamics
• Anticoncentration theorems for schemes showing a quantum speedup
• Quantum computation via translation-invariant operations on a chain of qubits
• Boundaries of quantum supremacy via random circuit sampling
• Closing gaps of a quantum advantage with short-time Hamiltonian dynamics
• What do QAOA energies reveal about graphs?
• Signatures of quantum phase transitions in the dynamic response of fluxonium qubit chains