Group twirling and noise tailoring for multi-qubit controlled phase gates

Abstract

Group twirling is crucial in quantum information processing, particularly in randomized benchmarking and random compiling. While protocols based on Pauli twirling have been effectively crafted to transform arbitrary noise channels into Pauli channels for Clifford gates -- thereby facilitating efficient benchmarking and mitigating worst-case errors -- practical twirling groups for multi-qubit non-Clifford gates are lacking. In this work, we study the issue of finding twirling groups for generic quantum gates within a widely used circuit structure in randomized benchmarking or random compiling. For multi-qubit controlled phase gates, which are essential in both the quantum Fourier transform and quantum search algorithms, we identify optimal twirling groups within the realm of classically replaceable unitary operations. In contrast to the simplicity of the Pauli twirling group for Clifford gates, the optimal groups for such gates are much larger, highlighting the overhead of tailoring noise channels in the presence of global non-Clifford gates.

arXiv comment43 pages,13 figures

References in corpus (40)

• Quantifying Coherence
• NMR Techniques for Quantum Control and Computation
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Randomized Benchmarking of Quantum Gates
• Operational Resource Theory of Coherence
• Robust randomized benchmarking of quantum processes
• Parallel implementation of high-fidelity multi-qubit gates with neutral atoms
• Noise tailoring for scalable quantum computation via randomized compiling
• Scalable Noise Estimation with Random Unitary Operators
• Characterizing Quantum Gates via Randomized Benchmarking
• Efficient measurement of quantum gate error by interleaved randomized benchmarking
• Implementation of a Toffoli Gate with Superconducting Circuits
• Realization of the quantum Toffoli gate with trapped ions
• Quantum certification and benchmarking
• Symmetrised Characterisation of Noisy Quantum Processes
• Characterizing large-scale quantum computers via cycle benchmarking
• Universal fault-tolerant quantum computation with only transversal gates and error correction
• Efficient learning of quantum noise
• Quantum Hypergraph States
• A general framework for randomized benchmarking
• Efficient estimation of Pauli channels
• Hamiltonian Simulation Using Linear Combinations of Unitary Operations
• High-fidelity three-qubit iToffoli gate for fixed-frequency superconducting qubits
• Robust Extraction of Tomographic Information via Randomized Benchmarking
• Scalable randomized benchmarking of non-Clifford gates
• Programmable Heisenberg interactions between Floquet qubits
• Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates
• The learnability of Pauli noise
• Fast Estimation of Sparse Quantum Noise
• Reducing the Depth of Linear Reversible Quantum Circuits
• Pauli error estimation via Population Recovery
• Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
• Experimental implementation of non-Clifford interleaved randomized benchmarking with a controlled-S gate
• Estimating gate-set properties from random sequences
• A four-dimensional toric code with non-Clifford transversal gates
• Benchmarking universal quantum gates via channel spectrum
• Randomized Benchmarking Beyond Groups
• Scalable fast benchmarking for individual quantum gates with local twirling
• Classically Replaceable Operations
• Robust Estimation of Nonlinear Properties of Quantum Processes

Cited by in corpus (5)

• Phase Estimation with Compressed Controlled Time Evolution
• Benchmarking non-Clifford gates using only Pauli twirling group
• Assessing the dynamical assumptions in Tsirelson inequality tests of non-classicality in harmonic oscillators
• Fermionic Averaged Circuit Eigenvalue Sampling
• Approximate Quantum Error Correction with 1D Log-Depth Circuits