Noisy logic operations on a quantum computational register -- e.g., one or more qubits -- can be described by transfer matrices (a.k.a. CPTP maps or superoperators) that act linearly on the density matrix representing the register's quantum state. Collectively, these operations form a gate set. Gate sets have a gauge freedom; many gate sets that appear different actually predict the same experimental outcomes. A property of a gate set can be observable (and thus physically relevant) only if it is gauge-invariant. Unfortunately, no good gauge-invariant parameterizations of gate sets are known. We introduce the next best thing, a perturbative gauge-invariant parameterization of small Markovian errors in gate sets. We construct vector spaces of properties that are first-order gauge-invariant (FOGI). We show how to construct and understand FOGI properties, how to use them as coordinates to parameterize gate sets without gauge freedom, and how to extract approximately gauge-invariant error metrics.
It is well-known that every n-qubit unitary can be decomposed into a product of controlled single-qubit unitaries. We show that the control conditions in such a decomposition naturally define a quasi-process function, an object that originally came up in the study of indefinite causal order. Here quasi-process function...
Spin qubits in gate-defined quantum dots provide a highly programmable platform for simulating condensed-matter phenomena. In this work, we introduce a digital-analog quantum simulation protocol for extracting the single-particle spectrum of a Kitaev chain. The Kitaev chain is mapped onto qubits via the standard Jordan...
The output of a parameterized quantum circuit (PQC) can be expressed as a finite Fourier series whose accessible frequencies are fixed by the data-encoding gates. While the encoder determines which frequencies can appear, the corresponding Fourier coefficients depend on how the trainable and entangling gates are arrang...
Seungcheol Oh, Chaemoon Im, Daeyeun Kim et al.· 1 citation