A unitary t-design is a powerful tool in quantum information science and fundamental physics.Despite its usefulness, only approximate implementations were known for general t.In this paper, we provide quantum circuits that generate exact unitary t-designs for any t on an arbitrary number of qubits.Our construction is inductive and is of practical use in small systems.We then introduce a tth-order generalization of randomized benchmarking (t-RB) as an application of exact 2t-designs.We particularly study the 2-RB in detail and show that it reveals self-adjointness of quantum noise, a metric related to the feasibility of quantum error correction (QEC).We numerically demonstrate that the 2-RB in one-and two-qubit systems is feasible, and experimentally characterize background noise of a superconducting qubit by the 2-RB.It is shown from the experiment that interactions with adjacent qubits induce the noise that may result in an obstacle toward a realization of QEC.
A unitary t-design is a powerful tool in quantum information science and fundamental physics.Despite its usefulness, only approximate implementations were known for general t.In this paper, we provide quantum circuits that generate exact unitary t-designs for any t on an arbitrary number of qubits.Our construction is inductive and is of practical use in small systems.We then introduce a tth-order generalization of randomized benchmarking (t-RB) as an application of exact 2t-designs.We particularly study the 2-RB in detail and show that it reveals self-adjointness of quantum noise, a metric related to the feasibility of quantum error correction (QEC).We numerically demonstrate that the 2-RB in one-and two-qubit systems is feasible, and experimentally characterize background noise of a superconducting qubit by the 2-RB.It is shown from the experiment that interactions with adjacent qubits induce the noise that may result in an obstacle toward a realization of QEC.
Randomized benchmarking is a useful scheme for evaluation the average fidelity of a noisy quantum circuit. However, it is insensitive to the unitary error. Here, we propose a method of randomized benchmarking in which a unitary t-design is applied and by which the unitary error estimation can be converted to analysis of pseudo-randomness on a set of unitary operators. We give a bound on the number of randomized benchmarking sequences, when performing a unitary t-design on n-qubit d-dimensional system. By applying local random unitary operators, a decomposition of a unitary t-design, the bound is more practical than the previous bound for multi-qubit circuit. We also give a rigorous bound of a diamond norm between arbitrary and uniform distributions of a set of unitary operators to form an ε-approximate unitary t-design. It can be used to quantitatively analyze the corresponding average fidelity and errors in a large-scale quantum circuit.
Unitary t-designs are some of the most versatile tools in quantum information theory. Their applications range from randomized benchmarking and shadow tomography, to more fundamental ones such as emulating quantum chaos and establishing exponential separations between classical and quantum query complexity. While unitary designs originating from a group structure, such as the Clifford group, have proven to be incredibly useful for qubit systems, unfortunately, this is no longer true for qudits. In fact, the classification of finite-group representations rules out the existence of unitary 2-designs for arbitrary qudit dimensions. This severely limits the applicability of standard quantum information primitives when it comes to qudit systems. We overcome these limitations with a three-fold contribution. First, we introduce a general technique to construct families of weighted state t-designs in arbitrary qudit dimensions. These weighted state-designs generalize classical shadow tomography protocol from qubits to qudits. Second, we introduce a Clifford character RB that allows us to benchmark the qudit Clifford group in any dimension, including non-prime-power dimensions. And third, we establish bounds on the quantum circuit complexity of generating approximate unitary-designs from native gates in existing quantum hardware such as high-spin and cavity-QED qudits. Our work further highlights the analogy between spin and optical coherent states by proving that spin-GKP codewords form a state 2-design while spin coherent states do not; in direct analogy with the optical case. This work is structured as a pedagogical and self-contained introduction to unitary designs and their applications to qudit systems.
Abstract Noise characterization methods such as randomized benchmarking (RB) are critical for the development of scalable quantum computers. Modern RB protocols for multiqubit systems extract physically relevant error rates by exploiting the structure of the group representation generated by the set of benchmarked operations. However, existing techniques become prohibitively inefficient for representations that are highly reducible yet decompose into irreducible subspaces of high dimension. These situations prevail when benchmarking high-dimensional systems such as qudits or bosonic modes, where experimental control is limited to implementing a small subset of all possible unitary operations. We introduce a broad framework for enhancing the sample efficiency of RB that is sufficiently powerful to extend the practical reach of RB beyond the multiqubit setting. Our strategy, which applies to any benchmarking group, uses ‘synthetic’ quantum circuits with classical post-processing of both input and output data to leverage the full structure of reducible superoperator representations. To demonstrate the efficacy of our approach, we develop a detailed theory of RB for systems with rotational symmetry. Such systems carry a natural action of the group SU ( 2 ) , and they form the basis for several novel quantum error-correcting codes. We show that, for experimentally accessible high-spin systems, synthetic RB protocols can reduce the complexity of measuring rotationally invariant error rates by two orders of magnitude relative to standard approaches such as character RB.
Abstract Unitary t -designs are ‘good’ finite subsets of the unitary group that approximate the whole unitary group well. Unitary t -designs have been applied in randomized benchmarking, tomography, quantum cryptography and many other areas of quantum information science. If a unitary t -design itself is a group then it is called a unitary t -group. Although it is known that unitary t -designs in exist for any t and d , the unitary t -groups do not exist for if , as it is shown by Guralnick–Tiep (Guralnick and Tiep 2005 Represent. Theory 9 138–208) and Bannai–Navarro–Rizo–Tiep (Bannai et al 2018 J. Math. Soc. Japan (accepted) ). Explicit constructions of exact unitary t -designs in are not easy in general. In particular, explicit constructions of unitary 4-designs in have been an open problem in quantum information theory. We prove that some exact unitary -designs in the unitary group are constructed from unitary t -groups in that satisfy certain specific conditions. Based on this result, we specifically construct exact unitary 3-designs in from the unitary 2-group in and also unitary 4-designs in from the unitary 3-group in numerically. We also discuss some related problems and a few applications to physics problems.
In its many variants, randomized benchmarking (RB) is a broadly used technique for assessing the quality of gate implementations on quantum computers. A detailed theoretical understanding and general guarantees exist for the functioning and interpretation of RB protocols if the gates under scrutiny are drawn uniformly at random from a compact group. In contrast, many practically attractive and scalable RB protocols implement random quantum circuits with local gates randomly drawn from some gate-set. Despite their abundance in practice, for those non-uniform RB protocols, general guarantees for gates from arbitrary compact groups under experimentally plausible assumptions are missing. In this work, we derive such guarantees for a large class of RB protocols for random circuits that we refer to as filtered RB. Prominent examples include linear cross-entropy benchmarking, character benchmarking, Pauli-noise tomography and variants of simultaneous RB. Building upon recent results for random circuits, we show that many relevant filtered RB schemes can be realized with random quantum circuits in linear depth, and we provide explicit small constants for common instances. We further derive general sample complexity bounds for filtered RB. We show filtered RB to be sample-efficient for several relevant groups, including protocols addressing higher-order cross-talk. Our theory for non-uniform filtered RB is, in principle, flexible enough to design new protocols for non-universal and analog quantum simulators.
Random unitaries are fundamental to quantum information and many-body physics, with widespread applications ranging from quantum learning and metrology to device benchmarking. A central pursuit is to minimize the space and circuit depth required to generate them. However, existing methods for generating low-depth random unitaries rely heavily on an extensive number of ancillary qubits, imposing severe spatial overhead. In this work, we prove that random unitaries can be generated in optimal depth without ancillae. For multiplicative-error approximate k-designs on n qubits, our circuits achieve a depth of O(k)(logn)1/δ on δ-dimensional architectures and O(k)loglogn with all-to-all connectivity. Furthermore, by introducing a general exactification lemma, we lift our construction to optimal-depth exact k-designs, yielding an exponential resource reduction over state-of-the-art exact constructions. Our results minimize the space-time costs for a wide range of quantum protocols.