Quantum circuit ensembles that have the properties of unitary k-designs represent applications where there is no obvious bias toward any particular Pauli support, as is the case in simulating systems exhibiting ''quantum chaos,'' which range from quantum dynamics near black holes to gapless spin fluid analysis. However, noisy hardware makes quantum circuits prone to a myriad of error sources, of which depolarizing and coherent error can be particularly destructive. To combat depolarizing error, popular techniques typically involve circuit or gate folding, which can be time-intensive procedures due to increased circuit depth and shot overhead. Other tensor-network-based mitigation techniques suffer from intractability in high-entanglement regimes. In this work, we leverage the structure of unitary k-design Pauli support distributions by introducing a technique we name ''circuit balancing,'' along with gate benchmarking data, in order to estimate circuit-wide depolarization. We describe how to invert the diagnosed circuit depolarization even in the presence of coherent error, via Pauli twirling. We provide asymptotics to estimate the number of twirls needed to maintain a desired output fidelity. We test our method numerically in a variety of simulation settings and find that it can significantly reduce average random circuit infidelity. Further, we employ our methods to find significant infidelity reductions when running a random circuit ensemble on a contemporary superconducting quantum computer, IBM Fez. Overall, we show that the method effectively reduces gate-based error for unitary k-designs without incurring any two-qubit gate overhead.
Finding correctable encoding that protects against a quantum process is in general a difficult task. Two main obstacles are that an exponential number of experiments are needed to gain complete information about the quantum process, and known algorithmic methods for finding correctable encodings involve operations on exponentially large matrices. \n \nIn this thesis we discuss how useful partial information of a quantum channel can be systematically extracted by averaging the channel under the action of a set of unitaries in a process known as twirling. We show that in some cases it is possible to find correctable encodings for the channel using the partial information obtained via twirling. \n \nWe investigate the particular case of twirling over the set of Pauli operators and qubit permutations, and show that the resulting quantum operation can be characterized experimentally in a scalable \nmanner. A post-processing scheme for finding \nunitarily correctable codes for these twirled channels is presented which does \nnot involve exponentially large matrices. A test for non-Markovian noise using such a twirling process is also discussed.
We propose a method to estimate the average fidelity using the unitary 2 t -design of a twirled noisy channel, which is suitable for large-scale quantum circuits. Compared with the unitary 2-design in randomized benchmarking, the unitary 2 t -design for the twirling of noisy channels is more flexible in construction and can provide more information. In addition, we prove that the proposed method provides an efficient and reliable estimation of the average fidelity in benchmarking multistage quantum gates and estimating the weakly gate- and time-dependent noise. For time-dependent noise, we provide a scheme of moment superoperator to analyze the noise in different experiments. In particular, we give a lower bound on the average fidelity of a channel with imperfect implementation of benchmarking and state preparation and measurement errors (SPAM).
Unitary
T-designs play an important role in quantum information, with diverse applications in quantum algorithms, benchmarking, tomography, and communication. Until now, the most efficient construction of unitary
T-designs for
n-qudit systems has been via random local quantum circuits, which have been shown to converge to approximate
T-designs in the diamond norm using
O(T5+o(1)n2) quantum gates. In this work, we provide a new construction of
T-designs via random matrix theory using
O~(T2n2) quantum gates. Our construction leverages two key ideas. First, in the spirit of central limit theorems, we approximate the Gaussian Unitary Ensemble (GUE) by an i.i.d. sum of random Hermitian matrices. Second, we show that the product of just two exponentiated GUE matrices is already approximately Haar random. Thus, multiplying two exponentiated sums over rather simple random matrices yields a unitary
T-design, via Hamiltonian simulation. A central feature of our proof is a new connection between the polynomial method in quantum query complexity and the large-dimension (
N) expansion in random matrix theory. In particular, we show that the polynomial method provides exponentially improved bounds on the high moments of certain random matrix ensembles, without requiring intricate Weingarten calculations. In doing so, we define and solve a new type of moment problem on the unit circle, asking whether a finite number of equally weighted points, corresponding to eigenvalues of unitary matrices, can reproduce a given set of moments.
Random many-body states and matrices are both a useful tool to model certain physical systems and an important asset for quantum computation. Realizing them, however, generally requires an exponential (in system size) amount of resources. Recent research has presented a way out by showing that one can generate random states and matrices, or more precisely a controlled approximation of them, by applying a quantum circuit built in terms of few-body unitary gates. Most of this research has been focussed on the case of quantum circuits composed by fully random unitary gates. Here we consider what happens for circuits that, instead, involve a minimal degree of randomness. Specifically, we concentrate on two different settings: (a) brickwork quantum circuits with a single one-qudit random matrix at a boundary; (b) brickwork quantum circuits with fixed interactions but random one-qudit gates everywhere. We show that, for any given initial state, (a) and (b) produce a distribution of states approaching the Haar distribution in the limit of large circuit depth. More precisely, we show that the moments of the distribution produced by our circuits can approximate the ones of the Haar distribution in a depth proportional to the system size. Interestingly we find that in both Cases (a) and (b) the relaxation to the Haar distribution occurs in two steps—this is in contrast with what happens in fully random circuits. Moreover, we show that choosing appropriately the fixed interactions, for example taking the local gate to be a dual-unitary gate with high enough entangling power, minimally random circuits produce a Haar random distribution more rapidly than fully random circuits. In particular, dual-unitary circuits with maximal entangling power—i.e. perfect tensors—appear to provide the optimal quantum state design preparation for any design number. Our results also suggest that the minimally random settings (a) and (b) give an optimal framework to prepare unitary designs, i.e., random unitary matrices.
We study efficient generations of random diagonal-unitary matrices, an ensemble of unitary matrices diagonal in a given basis with randomly distributed phases for their eigenvalues. Despite the simple algebraic structure, they cannot be achieved by quantum circuits composed of a few-qubit diagonal gates. We introduce diagonal-unitaryt-designs and present two quantum circuits that implement diagonal-unitary 2-design with the computational basis in N-qubit systems. One is composed of single-qubit diagonal gates and controlled-phase gates with randomized phases, which achieves an exact diagonal-unitary 2-design after applying the gates on all pairs of qubits. The number of required gates is N(N - 1)/2. If the controlled-Z gates are used instead of the controlled-phase gates, the circuit cannot achieve an exact 2-design, but achieves an ϵ-approximate 2-design by applying gates on randomly selected pairs of qubits. Due to the random choice of pairs, the circuit obtains extra randomness and the required number of gates is at most O(N2(N + log 1/∊)). We also provide an application of the circuits, a protocol of generating an exact 2-design of random states by combining the circuits with a simple classical procedure requiring O(N) random classical bits.