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

• URL: http://arxiv.org/abs/2309.15651v1
• Date: Wed, 27 Sep 2023 13:38:44 GMT
• Title: Group twirling and noise tailoring for multi-qubit controlled phase gates
• Authors: Guoding Liu, Ziyi Xie, Zitai Xu, and Xiongfeng Ma
• Abstract summary: 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.
• Score: 0.974963895316339
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Benchmarking non-Clifford gates using only Pauli twirling group [2.314868859930996]
  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.
  arXiv  Detail & Related papers  (2025-10-17T11:38:17Z)
• Accelerating Transpilation in Quantum Machine Learning with Haiqu's Rivet-transpiler [45.88028371034407]
  We develop the Rivet transpiler, which accelerates transpilation by reusing previously transpiled circuits.<n>We demonstrate up to 600% improvement in transpilation time for quantum layerwise learning.
  arXiv  Detail & Related papers  (2025-08-29T06:00:29Z)
• Symmetric Clifford twirling for cost-optimal quantum error mitigation in early FTQC regime [0.0]
  Twirling noise affecting quantum gates is essential in understanding and controlling errors. We propose symmetric Clifford twirling, a twirling utilizing only symmetric Clifford operators that commute with certain Pauli subgroups. We fully characterize how each Pauli noise is converted through the twirling and show that certain Pauli noise can be scrambled to a noise exponentially close to the global white noise.
  arXiv  Detail & Related papers  (2024-05-13T13:14:01Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• Robustness of a universal gate set implementation in transmon systems via Chopped Random Basis optimal control [50.591267188664666]
  We numerically study the implementation of a universal two-qubit gate set, composed of CNOT, Hadamard, phase and $pi/8$ gates, for transmon-based systems. The control signals to implement such gates are obtained using the Chopped Random Basis optimal control technique, with a target gate infidelity of $10-2$.
  arXiv  Detail & Related papers  (2022-07-27T10:55:15Z)
• Demonstrating scalable randomized benchmarking of universal gate sets [0.0]
  We introduce and demonstrate a technique for scalable Randomized (RB) of many universal and continuously parameterized gate sets. We use our technique to benchmark universal gate sets on four qubits of the Advanced Quantum Testbed. We demonstrate that our technique scales to many qubits with experiments on a 27-qubit IBM Q processor.
  arXiv  Detail & Related papers  (2022-07-15T03:41:21Z)
• 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)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Clifford Circuit Optimization with Templates and Symbolic Pauli Gates [11.978356827088595]
  The Clifford group is a finite subgroup of the unitary group generated by the Hadamard, the CNOT, and the Phase gates. Here we consider the problem of finding a short quantum circuit implementing a given Clifford group element. Our methods aim to minimize the entangling gate count assuming all-to-all qubit connectivity.
  arXiv  Detail & Related papers  (2021-05-05T19:18:35Z)
• Randomized Benchmarking with Stabilizer Verification and Gate Synthesis [0.0]
  We modify the standard Clifford randomized benchmarking (RB) and interleaved RB schemes targeting them to hardware limitations. We also develop a technique for characterising a variety of non-Clifford gates, by combining tools from gate synthesis with interleaved RB.
  arXiv  Detail & Related papers  (2021-02-25T17:54:47Z)
• On the robustness of the hybrid qubit computational gates through simulated randomized benchmarking protocols [0.0]
  Noise characterization can be achieved by exploiting different techniques, such as randomization. A scalable and robust algorithm able to benchmark the full set of Clifford gates is called randomized benchmarking. In this study, we simulated randomized benchmarking protocols in a semiconducting all-electrical three-electron double-quantum dot qubit.
  arXiv  Detail & Related papers  (2020-11-03T09:35:39Z)
• 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)
• A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz [68.8204255655161]
  We describe a compilation strategy for Variational Quantum Eigensolver (VQE) algorithms. We use the Unitary Coupled Cluster (UCC) ansatz to reduce circuit depth and gate count.
  arXiv  Detail & Related papers  (2020-07-20T22:26:16Z)

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.