99.9%-fidelity in measuring a superconducting qubit

  1. Can Wang,
  2. Feng-Ming Liu,
  3. He Chen,
  4. Yi-Fei Du,
  5. Chong Ying,
  6. Jian-Wen Wang,
  7. Yong-Heng Huo,
  8. Cheng-Zhi Peng,
  9. Xiaobo Zhu,
  10. Ming-Cheng Chen,
  11. Chao-Yang Lu,
  12. and Jian-Wei Pan
Despite the significant progress in superconducting quantum computation over the past years, quantum state measurement still lags nearly an order of magnitude behind quantum gate operations
in speed and fidelity. The main challenge is that the strong coupling and readout signal used to probe the quantum state may also introduce additional channels which may cause qubit state transitions. Here, we design a novel architecture to implement the long-sought longitudinal interaction scheme between qubits and resonators. This architecture not only provides genuine longitudinal interaction by eliminating residual transversal couplings, but also introduces proper nonlinearity to the resonator that can further minimize decay error and measurement-induced excitation error. Our experimental results demonstrate a measurement fidelity of 99.8% in 202 ns without the need for any first-stage amplification. After subtracting the residual preparation errors, the pure measurement fidelity is above 99.9%. Our scheme is compatible with the multiplexing readout scheme and can be used for quantum error correction.

Quantum Design for Advanced Qubits

  1. Feng-Ming Liu,
  2. Ming-Cheng Chen,
  3. Can Wang,
  4. Shao-Wei Li,
  5. Zhong-Xia Shang,
  6. Chong Ying,
  7. Jian-Wen Wang,
  8. Cheng-Zhi Peng,
  9. Xiaobo Zhu,
  10. Chao-Yang Lu,
  11. and Jian-Wei Pan
Simulations of high-complexity quantum systems, which are intractable for classical computers, can be efficiently done with quantum computers. Similarly, the increasingly complex quantum
electronic circuits themselves will also need efficient simulations on quantum computers, which in turn will be important in quantum-aided design for next-generation quantum processors. Here, we implement variational quantum eigensolvers to simulate a Josephson-junction-array quantum circuit, which leads to the discovery of a new type of high-performance qubit, plasonium. We fabricate this new qubit and demonstrate that it exhibits not only long coherence time and high gate fidelity, but also a shrinking physical size and larger anharmonicity than the transmon, which can offer a number of advantages for scaling up multi-qubit devices. Our work opens the way to designing advanced quantum processors using existing quantum computing resources.

Demonstration of Adiabatic Variational Quantum Computing with a Superconducting Quantum Coprocessor

  1. Ming-Cheng Chen,
  2. Ming Gong,
  3. Xiao-Si Xu,
  4. Xiao Yuan,
  5. Jian-Wen Wang,
  6. Can Wang,
  7. Chong Ying,
  8. Jin Lin,
  9. Yu Xu,
  10. Yulin Wu,
  11. Shiyu Wang,
  12. Hui Deng,
  13. Futian Liang,
  14. Cheng-Zhi Peng,
  15. Simon C. Benjamin,
  16. Xiaobo Zhu,
  17. Chao-Yang Lu,
  18. and Jian-Wei Pan
Adiabatic quantum computing enables the preparation of many-body ground states. This is key for applications in chemistry, materials science, and beyond. Realisation poses major experimental
challenges: Direct analog implementation requires complex Hamiltonian engineering, while the digitised version needs deep quantum gate circuits. To bypass these obstacles, we suggest an adiabatic variational hybrid algorithm, which employs short quantum circuits and provides a systematic quantum adiabatic optimisation of the circuit parameters. The quantum adiabatic theorem promises not only the ground state but also that the excited eigenstates can be found. We report the first experimental demonstration that many-body eigenstates can be efficiently prepared by an adiabatic variational algorithm assisted with a multi-qubit superconducting coprocessor. We track the real-time evolution of the ground and exited states of transverse-field Ising spins with a fidelity up that can reach about 99%.

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.

Emulating anyonic fractional statistical behavior in a superconducting quantum circuit

  1. Y. P. Zhong,
  2. D. Xu,
  3. P. Wang,
  4. C. Song,
  5. Q. J. Guo,
  6. W. X. Liu,
  7. K. Xu,
  8. B. X. Xia,
  9. Chao-Yang Lu,
  10. Siyuan Han,
  11. Jian-Wei Pan,
  12. and Haohua Wang
Anyons are exotic quasiparticles obeying fractional statistics,whose behavior can be emulated in artificially designed spin systems.Here we present an experimental emulation of creating
anyonic excitations in a superconducting circuit that consists of four qubits, achieved by dynamically generating the ground and excited states of the toric code model, i.e., four-qubit Greenberger-Horne-Zeilinger states. The anyonic braiding is implemented via single-qubit rotations: a phase shift of \pi related to braiding, the hallmark of Abelian 1/2 anyons, has been observed through a Ramsey-type interference measurement.