Core Concepts
The authors propose a hardware-efficient, fault-tolerant approach to realizing complex sampling circuits by co-designing the circuits with appropriate quantum error correcting codes. They focus on a family of high-dimensional color codes that support transversal non-Clifford gates, enabling the efficient implementation of classically hard instantaneous quantum polynomial (IQP) circuits.
Abstract
The authors present a fault-tolerant logical sampling architecture based on a family of [2D, D, 2] color codes. These codes support a transversal gate set that includes non-Clifford CkZ gates, allowing the efficient implementation of degree-D IQP circuits without the need for magic state distillation.
The authors design a hardware-efficient family of degree-D IQP circuits with connectivity given by a D-dimensional hypercube, which they call hypercube IQP (hIQP) circuits. They show that this family rapidly converges to uniform IQP circuits and can therefore be thought of as a fault-tolerant compilation of the uniform IQP family.
The authors analyze the conditions under which random degree-D hIQP circuits are sufficiently scrambling for quantum advantage and benchmarking applications. They develop a theory of second-moment properties of degree-D IQP circuits, mapping them to a statistical mechanics model, which allows them to study the scrambling properties and the linear cross-entropy benchmark (XEB) of the hIQP circuits.
To address the issue of efficiently verifying quantum advantage, the authors show that degree-D IQP sampling can be efficiently validated by measuring two copies of a logical degree-(D+1) circuit in the Bell basis.
Finally, the authors devise new families of [O(dD), D, d] color codes that support scalable fault-tolerant transversal IQP sampling, with an error correction threshold that allows the quantum output distribution to converge exponentially to the target distribution as the code size is increased.
Stats
"Realizing computationally complex quantum circuits in the presence of noise and imperfections is a challenging task."
"Quantum error correction (QEC) provides a potential solution to this challenge by encoding error-corrected "logical" qubits across many redundant physical qubits."
"Sampling from such circuits which are also fast scrambling can be used to benchmark the performance of a quantum processor."
"We find that already after two rounds of gates on all hypercube edges the output states are close to maximally scrambled."
"We show that the runtime of existing classical simulation methods, in particular the recently developed near-Clifford simulator for degree-D circuits, roughly scales as Ω(2n)."
Quotes
"Realizing computationally complex quantum circuits in the presence of noise and imperfections is a challenging task."
"Quantum error correction (QEC) provides a potential solution to this challenge by encoding error-corrected "logical" qubits across many redundant physical qubits."
"Sampling from such circuits which are also fast scrambling can be used to benchmark the performance of a quantum processor."