Experimental implementation of non-Clifford interleaved randomized benchmarking with a controlled-S gate

• URL: http://arxiv.org/abs/2007.08532v2
• Date: Sun, 14 Mar 2021 11:21:20 GMT
• Title: Experimental implementation of non-Clifford interleaved randomized benchmarking with a controlled-S gate
• Authors: Shelly Garion, Naoki Kanazawa, Haggai Landa, David C. McKay, Sarah Sheldon, Andrew W. Cross, Christopher J. Wood
• Abstract summary: In some applications access to a non-Clifford two-qubit gate can result in more optimal circuit decompositions. We demonstrate calibration of a low error non-Clifford Controlled-$fracpi2$ phase (CS) gate on a cloud based IBM Quantum computing.
• Score: 0.1759008116536278
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Hardware efficient transpilation of quantum circuits to a quantum devices native gateset is essential for the execution of quantum algorithms on noisy quantum computers. Typical quantum devices utilize a gateset with a single two-qubit Clifford entangling gate per pair of coupled qubits, however, in some applications access to a non-Clifford two-qubit gate can result in more optimal circuit decompositions and also allows more flexibility in optimizing over noise. We demonstrate calibration of a low error non-Clifford Controlled-$\frac{\pi}{2}$ phase (CS) gate on a cloud based IBM Quantum computing using the Qiskit Pulse framework. To measure the gate error of the calibrated CS gate we perform non-Clifford CNOT-Dihedral interleaved randomized benchmarking. We are able to obtain a gate error of $5.9(7) \times 10^{-3}$ at a gate length 263 ns, which is close to the coherence limit of the associated qubits, and lower error than the backends standard calibrated CNOT gate.

Related papers

• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• High-fidelity parallel entangling gates on a neutral atom quantum computer [41.74498230885008]
  We report the realization of two-qubit entangling gates with 99.5% fidelity on up to 60 atoms in parallel. These advances lay the groundwork for large-scale implementation of quantum algorithms, error-corrected circuits, and digital simulations.
  arXiv  Detail & Related papers  (2023-04-11T18:00:04Z)
• Comparing planar quantum computing platforms at the quantum speed limit [0.0]
  We present a comparison of the theoretical minimal gate time, i.e., the quantum speed limit (QSL) for realistic two- and multi-qubit gate implementations in neutral atoms and superconducting qubits. We analyze these quantum algorithms in terms of circuit run times and gate counts both in the standard gate model and the parity mapping.
  arXiv  Detail & Related papers  (2023-04-04T12:47:00Z)
• A fault-tolerant variational quantum algorithm with limited T-depth [2.7648976108201815]
  We propose a variational quantum eigensolver (VQE) algorithm that uses a fault-tolerant gate-set. VQE is suitable for implementation on a future error-corrected quantum computer.
  arXiv  Detail & Related papers  (2023-03-08T10:31:12Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era [0.0]
  Fault-tolerant quantum computation (FTQC) is essential to implement quantum algorithms in a noise-resilient way. In FTQC, a quantum circuit is decomposed into universal gates that can be fault-tolerantly implemented. In this paper, we propose that the Clifford+$T$ decomposition error for a given quantum circuit can be modeled as the depolarizing noise.
  arXiv  Detail & Related papers  (2023-01-10T19:00:01Z)
• Universal logic with encoded spin qubits in silicon [1.5796098351442824]
  Qubits encoded in a decoherence-free subsystem and realized in exchange-coupled silicon quantum dots are promising candidates for fault-tolerant quantum computing. Key difficulties are that encoded entangling gates require a large number of control pulses and high-yielding quantum dot arrays. Here we show a device made using the single-layer etch-defined gate architecture that achieves both the required functional yield needed for full control and the coherence necessary for thousands of exchange pulses to be applied.
  arXiv  Detail & Related papers  (2022-02-08T02:23:46Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)
• Benchmarking the noise sensitivity of different parametric two-qubit gates in a single superconducting quantum computing platform [0.0]
  A larger hardware-native gate set may decrease the number of required gates, provided that all gates are realized with high fidelity. We benchmark both controlled-Z (CZ) and exchange-type (iSWAP) gates using a parametrically driven tunable coupler. We argue that spurious $ZZ$-type couplings are the dominant error source for the iSWAP gate.
  arXiv  Detail & Related papers  (2020-05-12T11:38:41Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

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.