Circuit Complexity and Approximate Operations

Jinmin Yi, Ruizhi Liu, Zhi Li

Daan Camps, Roel Van Beeumen

One of the challenges in quantum computing is the synthesis of unitary operators into quantum circuits with polylogarithmic gate complexity. Exact synthesis of generic unitaries requires an exponential number of gates in general. We propose a novel approximate quantum circuit synthesis technique by relaxing the unitary constraints and interchanging them for ancilla qubits via block encodings. This approach combines smaller block encodings, which are easier to synthesize, into quantum circuits for larger operators. Due to the use of block encodings, our technique is not limited to unitary operators and can be applied for the synthesis of arbitrary operators. We show that operators which can be approximated by a canonical polyadic expression with a polylogarithmic number of terms can be synthesized with polylogarithmic gate complexity with respect to the matrix dimension.

Bernard Zygelman

Philipp Schmocker

We derive approximation rates for Sobolev functions defined on the complex unit sphere and complex projective space, representing quantum states, and on the special and projective unitary groups, representing quantum unitary operations. By using harmonic analysis on compact groups and compact homogeneous spaces, we characterize the corresponding Peter--Weyl decompositions and Sobolev spaces via irreducible representations and the Laplace--Beltrami operator. Combining spectral truncation with finite-depth quantum-circuit approximation, invoking the Solovay--Kitaev theorem, we establish quantitative rates that separate the spectral truncation error from the circuit approximation error.

Lukas Brenner, Libor Caha, Xavier Coiteux-Roy +1 more

We initiate the study of state complexity for continuous-variable quantum systems. Concretely, we consider a setup with bosonic modes and auxiliary qubits, where available operations include Gaussian one- and two-mode operations and single- and two-qubit operations as well as qubit-controlled phase-space displacements. We define the (approximate) complexity of a bosonic state by the minimum size of a circuit that prepares an approximation to the state in trace distance. We propose a new circuit which prepares an approximate Gottesman-Kitaev-Preskill (GKP) state | G K P κ , Δ ⟩ . Here, κ − 2 is the variance of the envelope, and Δ 2 is the variance of the individual peaks. We show that the circuit accepts with constant probability and—conditioned on acceptance—the output state is polynomially close in ( κ , Δ ) to the state | G K P κ , Δ ⟩ . The size of our circuit is linear in ( log 1 / κ , log 1 / Δ ) . To our knowledge, this is the first protocol for GKP-state preparation with fidelity guarantees for the prepared state. We also show converse bounds, establishing that the linear circuit-size dependence of our construction is optimal. This fully characterizes the complexity of GKP states.

Jarosław Adam Miszczak