Performing SU(d) Operations and Rudimentary Algorithms in a Superconducting Transmon Qudit for d=3 and d=4
Pei Liu, Ruixia Wang, Jing-Ning Zhang, Yingshan Zhang, Xiaoxia Cai, Huikai Xu, Zhiyuan Li, Jiaxiu Han, Xuegang Li, Guangming Xue, Weiyang Liu, Li You, Yirong Jin, Haifeng Yu
DOI 10.1103/PhysRevX.13.021028 · Physical Review X
Active bibliographic source — not scientific approval
Bibliographic access preserves source history; it does not approve extracted materials or validate reported claims. Review warnings on each occurrence separately.
Abstract
Quantum-computation architecture based on d-level systems, or qudits, has attracted considerable attention recently due to their enlarged Hilbert space. Extensive theoretical and experimental studies have addressed aspects of algorithms and benchmarking techniques for qudit-based quantum computation and quantum-information processing. Here, we report a physical realization of a qudit with up to four embedded levels in a superconducting transmon demonstrating high-fidelity initialization, manipulation, and simultaneous multilevel readout. In addition to constructing SU(d) operations and benchmarking protocols for quantum-state tomography, quantum-process tomography, randomized benchmarking, etc., we experimentally carry out these operations for d=3 and d=4. Moreover, we perform prototypical quantum algorithms and observe outcomes consistent with expectations. Our work will hopefully stimulate further research interest in developing manipulation protocols and efficient applications for quantum processors with qudits.
Similar papers
Universal Pulses for Superconducting Qudit Ladder Gates
similarity 0.92Boxi Li et al.
Source status unknown — claims are unverified
Robust, fast, and high-fidelity composite single-qubit gates for superconducting transmon qubits
similarity 0.89Hristo G. Tonchev et al.
Source status unknown — claims are unverified
Characterization of control in a superconducting qutrit using randomized benchmarking
similarity 0.89M. Kononenko et al.
Source status unknown — claims are unverified
Ground-state geometric quantum computing in superconducting systems
similarity 0.88P. Solinas et al.
Source status unknown — claims are unverified
Efficient two-qutrit gates in superconducting circuits using parametric coupling
similarity 0.88Mahadevan Subramanian & Adrian Lupascu
Source status unknown — claims are unverified
Digital Quantum Simulation of Spin Systems in Superconducting Circuits
similarity 0.88U. Las Heras et al.
Source status unknown — claims are unverified