Benchmarking non-Clifford gates using only Pauli twirling group
- URL: http://arxiv.org/abs/2510.15554v1
- Date: Fri, 17 Oct 2025 11:38:17 GMT
- Title: Benchmarking non-Clifford gates using only Pauli twirling group
- Authors: Han Ye, Guoding Liu, Xiongfeng Ma,
- Abstract summary: Quantum gate benchmarking is unavoidably influenced by state preparation and measurement errors.<n>In practice, local twirling gates are preferred due to their high fidelity and experimental feasibility.<n>We introduce the Pauli Transfer Character Benchmarking, which estimates the Pauli transfer matrix elements for a quantum channel using only local Pauli operations.
- Score: 2.314868859930996
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum gate benchmarking is unavoidably influenced by state preparation and measurement errors. Randomized benchmarking addresses this challenge by employing group twirling to regularize the noise channel, then provides a characterization of quantum channels that is robust to these errors through exponential fittings. In practice, local twirling gates are preferred due to their high fidelity and experimental feasibility. However, while existing RB methods leveraging local twirling gates are effective for benchmarking Clifford gates, they face fundamental challenges in benchmarking non-Clifford gates. In this work, we solve this problem by introducing the Pauli Transfer Character Benchmarking. This protocol estimates the Pauli transfer matrix elements for a quantum channel using only local Pauli operations. Building on this protocol, we develop a fidelity benchmarking method for non-Clifford gates $U$ satisfying $U^2=I$. We validate the feasibility of our protocol through numerical simulations applied to Toffoli gates as a concrete example.
Related papers
- When Clifford benchmarks are sufficient; estimating application performance with scalable proxy circuits [0.0]
We show that for a broad class of error models these concerns are unwarranted.<n>We show that for error models that admit noise tailoring by Pauli twirling, the diamond norm and fidelity of any generic circuit is well approximated by the fidelities of proxy circuits composed only of Clifford gates.
arXiv Detail & Related papers (2025-03-07T21:18:59Z) - Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
arXiv Detail & Related papers (2024-12-19T18:55:44Z) - Group twirling and noise tailoring for multi-qubit controlled phase
gates [0.974963895316339]
We study the issue of finding twirling groups for generic quantum gates within a widely used circuit structure.
For multi-qubit controlled phase gates, we identify optimal twirling groups within the realm of classically replaceable unitary operations.
arXiv Detail & Related papers (2023-09-27T13:38:44Z) - Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
An ideal state preparation protocol can be characterized by being easily generated classically.
We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC)
We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
arXiv Detail & Related papers (2022-11-18T20:31:10Z) - Transversal Injection: A method for direct encoding of ancilla states
for non-Clifford gates using stabiliser codes [55.90903601048249]
We introduce a protocol to potentially reduce this overhead for non-Clifford gates.
Preliminary results hint at high quality fidelities at larger distances.
arXiv Detail & Related papers (2022-11-18T06:03:10Z) - Scalable fast benchmarking for individual quantum gates with local
twirling [1.7995166939620801]
We propose a character-cycle benchmarking protocol and a character-average benchmarking protocol only using local twirling gates.
We numerically demonstrate our protocols for a non-Clifford gate -- controlled-$(TX)$ and a Clifford gate -- five-qubit quantum error-correcting encoding circuit.
arXiv Detail & Related papers (2022-03-19T13:01:14Z) - Analytical and experimental study of center line miscalibrations in M\o
lmer-S\o rensen gates [51.93099889384597]
We study a systematic perturbative expansion in miscalibrated parameters of the Molmer-Sorensen entangling gate.
We compute the gate evolution operator which allows us to obtain relevant key properties.
We verify the predictions from our model by benchmarking them against measurements in a trapped-ion quantum processor.
arXiv Detail & Related papers (2021-12-10T10:56:16Z) - Learnability of the output distributions of local quantum circuits [53.17490581210575]
We investigate, within two different oracle models, the learnability of quantum circuit Born machines.
We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable.
We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
arXiv Detail & Related papers (2021-10-11T18:00:20Z) - Accurate methods for the analysis of strong-drive effects in parametric
gates [94.70553167084388]
We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach.
We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
arXiv Detail & Related papers (2021-07-06T02:02:54Z) - Coherent randomized benchmarking [68.8204255655161]
We show that superpositions of different random sequences rather than independent samples are used.
We show that this leads to a uniform and simple protocol with significant advantages with respect to gates that can be benchmarked.
arXiv Detail & Related papers (2020-10-26T18:00:34Z) - Characterizing Universal Gate Sets via Dihedral Benchmarking [0.0]
We describe a practical experimental protocol for robustly characterizing the error rates of non-Clifford gates associated with dihedral groups.<n>Our dihedral benchmarking protocol is a generalization of randomized benchmarking that relaxes the usual unitary 2-design condition.
arXiv Detail & Related papers (2015-08-25T21:36:28Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.