Realization of High-Fidelity CZ Gate based on a Double-Transmon Coupler

  1. Rui Li,
  2. Kentaro Kubo,
  3. Yinghao Ho,
  4. Zhiguang Yan,
  5. Yasunobu Nakamura,
  6. and Hayato Goto
Striving for higher gate fidelity is crucial not only for enhancing existing noisy intermediate-scale quantum (NISQ) devices but also for unleashing the potential of fault-tolerant
quantum computation through quantum error correction. A recently proposed theoretical scheme, the double-transmon coupler (DTC), aims to achieve both suppressed residual interaction and a fast high-fidelity two-qubit gate simultaneously, particularly for highly detuned qubits. Harnessing the state-of-the-art fabrication techniques and a model-free pulse-optimization process based on reinforcement learning, we translate the theoretical DTC scheme into reality, attaining fidelities of 99.92% for a CZ gate and 99.98% for single-qubit gates. The performance of the DTC scheme demonstrates its potential as a competitive building block for superconducting quantum processors.

Verification of a resetting protocol for an uncontrolled superconducting qubit

  1. Ming Gong,
  2. Feihu Xu,
  3. Zheng-Da Li,
  4. Zizhu Wang,
  5. Yu-Zhe Zhang,
  6. Yulin Wu,
  7. Shaowei Li,
  8. Youwei Zhao,
  9. Shiyu Wang,
  10. Chen Zha,
  11. Hui Deng,
  12. Zhiguang Yan,
  13. Hao Rong,
  14. Futian Liang,
  15. Jin Lin,
  16. Yu Xu,
  17. Cheng Guo,
  18. Lihua Sun,
  19. Anthony D. Castellano,
  20. Chengzhi Peng,
  21. Yu-Ao Chen,
  22. Xiaobo Zhu,
  23. and Jian-Wei Pan
We experimentally verify the simplest non-trivial case of a quantum resetting protocol with five superconducting qubits, testing it with different types of free evolutions and target-probe
interactions. After post-selection, we obtained a reset state fidelity as high as 0.951, and the process fidelity was found to be 0.792. We also implemented 100 randomly-chosen interactions and demonstrated an average success probability of 0.323, experimentally confirmed the non-zeros probability of success for unknown interactions; the numerical simulated value is 0.384. We anticipate this protocol will have widespread applications in quantum information processing science, since it is able to combat any form of free evolution.

Genuine 12-qubit entanglement on a superconducting quantum processor

  1. Ming Gong,
  2. Ming-Cheng Chen,
  3. Yarui Zheng,
  4. Shiyu Wang,
  5. Chen Zha,
  6. Hui Deng,
  7. Zhiguang Yan,
  8. Hao Rong,
  9. Yulin Wu,
  10. Shaowei Li,
  11. Fusheng Chen,
  12. Youwei Zhao,
  13. Futian Liang,
  14. Jin Lin,
  15. Yu Xu,
  16. Cheng Guo,
  17. Lihua Sun,
  18. Anthony D. Castellano,
  19. Haohua Wang,
  20. Chengzhi Peng,
  21. Chao-Yang Lu,
  22. Xiaobo Zhu,
  23. and Jian-Wei Pan
We report the preparation and verification of a genuine 12-qubit entanglement in a superconducting processor. The processor that we designed and fabricated has qubits lying on a 1D
chain with relaxation times ranging from 29.6 to 54.6 μs. The fidelity of the 12-qubit entanglement was measured to be above 0.5544±0.0025, exceeding the genuine multipartite entanglement threshold by 21 standard deviations. Our entangling circuit to generate linear cluster states is depth-invariant in the number of qubits and uses single- and double-qubit gates instead of collective interactions. Our results are a substantial step towards large-scale random circuit sampling and scalable measurement-based quantum computing.

Solving Systems of Linear Equations with a Superconducting Quantum Processor

  1. Yarui Zheng,
  2. Chao Song,
  3. Ming-Cheng Chen,
  4. Benxiang Xia,
  5. Wuxin Liu,
  6. Qiujiang Guo,
  7. Libo Zhang,
  8. Da Xu,
  9. Hui Deng,
  10. Keqiang Huang,
  11. Yulin Wu,
  12. Zhiguang Yan,
  13. Dongning Zheng,
  14. Li Lu,
  15. Jian-Wei Pan,
  16. H. Wang,
  17. Chao-Yang Lu,
  18. and Xiaobo Zhu
Superconducting quantum circuits are promising candidate for building scalable quantum computers. Here, we use a four-qubit superconducting quantum processor to solve a two-dimensional
system of linear equations based on a quantum algorithm proposed by Harrow, Hassidim, and Lloyd [Phys. Rev. Lett. \textbf{103}, 150502 (2009)], which promises an exponential speedup over classical algorithms under certain circumstances. We benchmark the solver with quantum inputs and outputs, and characterize it by non-trace-preserving quantum process tomography, which yields a process fidelity of 0.837±0.006. Our results highlight the potential of superconducting quantum circuits for applications in solving large-scale linear systems, a ubiquitous task in science and engineering.

An efficient and compact quantum switch for quantum circuits

  1. Yulin Wu,
  2. Li-Ping Yang,
  3. Yarui Zheng,
  4. Hui Deng,
  5. Zhiguang Yan,
  6. Yanjun Zhao,
  7. Keqiang Huang,
  8. William J. Munro,
  9. Kae Nemoto,
  10. Dong-Ning Zheng,
  11. C. P. Sun,
  12. Yu-xi Liu,
  13. Xiaobo Zhu,
  14. and Li Lu
The engineering of quantum devices has reached the stage where we now have small scale quantum processors containing multiple interacting qubits within them. Simple quantum circuits
have been demonstrated and scaling up to larger numbers is underway. However as the number of qubits in these processors increases, it becomes challenging to implement switchable or tunable coherent coupling among them. The typical approach has been to detune each qubit from others or the quantum bus it connected to, but as the number of qubits increases this becomes problematic to achieve in practice due to frequency crowding issues. Here, we demonstrate that by applying a fast longitudinal control field to the target qubit, we can turn off its couplings to other qubits or buses (in principle on/off ratio higher than 100 dB). This has important implementations in superconducting circuits as it means we can keep the qubits at their optimal points, where the coherence properties are greatest, during coupling/decoupling processing. Our approach suggests a new way to control coupling among qubits and data buses that can be naturally scaled up to large quantum processors without the need for auxiliary circuits and yet be free of the frequency crowding problems.