Ziqian Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ziqian Li has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- David I. Schuster
Stanford University
8 shared publications - Tanay Roy
Fermilab
8 shared publications Eliot Kapit
Department of Physics, Colorado School of Mines, Golden, USA
7 shared publications- Andrei Vrajitoarea
Center for Quantum Information Physics, Department of Physics, New York University, New York, USA
2 shared publications David Rodríguez Pérez
Department of Physics, Colorado School of Mines, Golden, USA
2 shared publications- David Rodríguez Pérez
Atom Computing, Inc
2 shared publications
Latest Publications
- 8 September 2026
- Published by Springer Nature in Nature Physics
- Vol. 22 (11) , 1840-1846
A cascaded random access quantum memory
- 8 September 2026
- Published by Springer Nature in Nature Physics
- Vol. 22 (11) , 1840-1846
A cascaded random access quantum memory
- Open Access
- 13 November 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (4)
Implementation of a Quantum Addressable Router Using Superconducting Qubits
The implementation of a quantum router capable of performing both quantum signal routing and quantum addressing (a Q 2 -router) represents a key step toward building quantum networks and quantum random access memories. We realize a Q 2 -router that uses fixed-frequency transmon qubits to implement a routing protocol based on two native controlled- i gates. These gates leverage a large Z Z interaction to selectively route information according to a quantum address. We find an estimated average routing fidelity of 95.3 % , with errors arising primarily from decoherence or state preparation and measurement. We present a comprehensive calibration and characterization of both the c- i gates and the overall routing protocol through randomized benchmarking techniques and state tomography.
- 13 November 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (4)
Open AccessImplementation of a Quantum Addressable Router Using Superconducting Qubits
The implementation of a quantum router capable of performing both quantum signal routing and quantum addressing (a Q 2 -router) represents a key step toward building quantum networks and quantum random access memories. We realize a Q 2 -router that uses fixed-frequency transmon qubits to implement a routing protocol based on two native controlled- i gates. These gates leverage a large Z Z interaction to selectively route information according to a quantum address. We find an estimated average routing fidelity of 95.3 % , with errors arising primarily from decoherence or state preparation and measurement. We present a comprehensive calibration and characterization of both the c- i gates and the overall routing protocol through randomized benchmarking techniques and state tomography.
- Open Access
- 9 July 2025
- Published by Springer Nature in Research Square
A Cascaded Random Access Quantum Memory
Dynamic random access memory is critical to classical computing but notably absent in experimental quantum computers. Here we realize an 8-bit cascaded random access quantum memory using superconducting circuits and cavities and showcase the ability to perform arbitrary gate operations on it. In addition to individual error channels such as photon loss, quantum memories can also experience decoherence from many-body self-interaction. We characterize the origin and contributions of many-body infidelity throughout the memory cycle. We find that individual modes can be accessed with ≤ 1.5% infidelity per mode and that the entire memory can be accessed in arbitrary order with an error rate below the depolarization threshold of the surface code, paving the way for fault-tolerant quantum memories.
- 9 July 2025
- Published by Springer Nature in Research Square
Open AccessA Cascaded Random Access Quantum Memory
Dynamic random access memory is critical to classical computing but notably absent in experimental quantum computers. Here we realize an 8-bit cascaded random access quantum memory using superconducting circuits and cavities and showcase the ability to perform arbitrary gate operations on it. In addition to individual error channels such as photon loss, quantum memories can also experience decoherence from many-body self-interaction. We characterize the origin and contributions of many-body infidelity throughout the memory cycle. We find that individual modes can be accessed with ≤ 1.5% infidelity per mode and that the entire memory can be accessed in arbitrary order with an error rate below the depolarization threshold of the surface code, paving the way for fault-tolerant quantum memories.
- Open Access
- 14 August 2024
- Published by Springer Nature in Nature Communications
- Vol. 15 (1) , 1-6
Autonomous stabilization with programmable stabilized state
Reservoir engineering is a powerful technique to autonomously stabilize a quantum state. Traditional schemes involving multi-body states typically function for discrete entangled states. In this work, we enhance the stabilization capability to a continuous manifold of states with programmable stabilized state selection using multiple continuous tuning parameters. We experimentally achieve 84.6% and 82.5% stabilization fidelity for the odd and even-parity Bell states as two special points in the manifold. We also perform fast dissipative switching between these opposite parity states within 1.8 μs and 0.9 μs by sequentially applying different stabilization drives. Our result is a precursor for new reservoir engineering-based error correction schemes.
- 14 August 2024
- Published by Springer Nature in Nature Communications
- Vol. 15 (1) , 1-6
Open AccessAutonomous stabilization with programmable stabilized state
Reservoir engineering is a powerful technique to autonomously stabilize a quantum state. Traditional schemes involving multi-body states typically function for discrete entangled states. In this work, we enhance the stabilization capability to a continuous manifold of states with programmable stabilized state selection using multiple continuous tuning parameters. We experimentally achieve 84.6% and 82.5% stabilization fidelity for the odd and even-parity Bell states as two special points in the manifold. We also perform fast dissipative switching between these opposite parity states within 1.8 μs and 0.9 μs by sequentially applying different stabilization drives. Our result is a precursor for new reservoir engineering-based error correction schemes.
- Open Access
- 7 March 2024
- Published by Springer Nature in Research Square
Autonomous stabilization with programmable stabilized state
Reservoir engineering is a powerful technique to autonomously stabilize a quantum state. Traditional schemes involving multi-body states typically function for discrete entangled states. In this work, we enhance the stabilization capability to a continuous manifold of states with programmable stabilized state selection using multiple continuous tuning parameters. We experimentally achieve 84.6% and 82.5% stabilization fidelity for the odd and even-parity Bell states as two special points in the manifold. We also perform fast dissipative switching between these opposite parity states within 1.8 μs and 0.9 μs by sequentially applying different stabilization drives. Our result is a precursor for new reservoir engineering-based error correction schemes.
- 7 March 2024
- Published by Springer Nature in Research Square
Open AccessAutonomous stabilization with programmable stabilized state
Reservoir engineering is a powerful technique to autonomously stabilize a quantum state. Traditional schemes involving multi-body states typically function for discrete entangled states. In this work, we enhance the stabilization capability to a continuous manifold of states with programmable stabilized state selection using multiple continuous tuning parameters. We experimentally achieve 84.6% and 82.5% stabilization fidelity for the odd and even-parity Bell states as two special points in the manifold. We also perform fast dissipative switching between these opposite parity states within 1.8 μs and 0.9 μs by sequentially applying different stabilization drives. Our result is a precursor for new reservoir engineering-based error correction schemes.
- Open Access
- 23 February 2024
- Published by Springer Nature in Nature Communications
- Vol. 15 (1) , 1-6
Autonomous error correction of a single logical qubit using two transmons
Large-scale quantum computers will inevitably need quantum error correction to protect information against decoherence. Traditional error correction typically requires many qubits, along with high-efficiency error syndrome measurement and real-time feedback. Autonomous quantum error correction instead uses steady-state bath engineering to perform the correction in a hardware-efficient manner. In this work, we develop a new autonomous quantum error correction scheme that actively corrects single-photon loss and passively suppresses low-frequency dephasing, and we demonstrate an important experimental step towards its full implementation with transmons. Compared to uncorrected encoding, improvements are experimentally witnessed for the logical zero, one, and superposition states. Our results show the potential of implementing hardware-efficient autonomous quantum error correction to enhance the reliability of a transmon-based quantum information processor.
- 23 February 2024
- Published by Springer Nature in Nature Communications
- Vol. 15 (1) , 1-6
Open AccessAutonomous error correction of a single logical qubit using two transmons
Large-scale quantum computers will inevitably need quantum error correction to protect information against decoherence. Traditional error correction typically requires many qubits, along with high-efficiency error syndrome measurement and real-time feedback. Autonomous quantum error correction instead uses steady-state bath engineering to perform the correction in a hardware-efficient manner. In this work, we develop a new autonomous quantum error correction scheme that actively corrects single-photon loss and passively suppresses low-frequency dephasing, and we demonstrate an important experimental step towards its full implementation with transmons. Compared to uncorrected encoding, improvements are experimentally witnessed for the logical zero, one, and superposition states. Our results show the potential of implementing hardware-efficient autonomous quantum error correction to enhance the reliability of a transmon-based quantum information processor.
- Open Access
- 15 February 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (1) , 013171
Hardware-efficient autonomous error correction with linear couplers in superconducting circuits
Large-scale quantum computers will inevitably need quantum error correction (QEC) to protect information against decoherence. Given that the overhead of such error correction is often formidable, autonomous quantum error correction (AQEC) proposals offer a promising near-term alternative. AQEC schemes work by transforming error states into excitations that can be efficiently removed through engineered dissipation. The recently proposed AQEC scheme by Li et al., called the Star code, can autonomously correct or suppress all single qubit error channels using two transmons as encoders with a tunable coupler and two lossy resonators as a cooling source. The Star code requires only two-photon interactions and can be realized with linear coupling elements, avoiding experimentally challenging higher-order terms needed in many other AQEC proposals, but needs carefully selected parameters to achieve quadratic improvements in logical states' lifetimes. Here, we theoretically and numerically demonstrate the optimal parameter choices in the Star code. We further discuss adapting the Star code to other planar superconducting circuits, which offers a scalable alternative to single qubits for incorporation in larger quantum computers or error correction codes.
- 15 February 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (1) , 013171
Open AccessHardware-efficient autonomous error correction with linear couplers in superconducting circuits
Large-scale quantum computers will inevitably need quantum error correction (QEC) to protect information against decoherence. Given that the overhead of such error correction is often formidable, autonomous quantum error correction (AQEC) proposals offer a promising near-term alternative. AQEC schemes work by transforming error states into excitations that can be efficiently removed through engineered dissipation. The recently proposed AQEC scheme by Li et al., called the Star code, can autonomously correct or suppress all single qubit error channels using two transmons as encoders with a tunable coupler and two lossy resonators as a cooling source. The Star code requires only two-photon interactions and can be realized with linear coupling elements, avoiding experimentally challenging higher-order terms needed in many other AQEC proposals, but needs carefully selected parameters to achieve quadratic improvements in logical states' lifetimes. Here, we theoretically and numerically demonstrate the optimal parameter choices in the Star code. We further discuss adapting the Star code to other planar superconducting circuits, which offers a scalable alternative to single qubits for incorporation in larger quantum computers or error correction codes.
- 11 December 2023
- Published by American Physical Society (APS) in Physical Review A
- Vol. 108 (6) , 062609
Exploring ququart computation on a transmon using optimal control
Contemporary quantum computers encode and process quantum information in binary qubits . However, many architectures include higher energy levels that are left as unused computational resources. We demonstrate a superconducting ququart processor and combine quantum optimal control with efficient gate decompositions to implement high-fidelity ququart gates. We distinguish between viewing the ququart as a generalized four-level qubit and an encoded pair of qubits, and characterize the resulting gates in each case. In randomized benchmarking experiments we observe gate fidelities and identify coherence as the primary limiting factor. Our results validate ququarts as a viable tool for quantum information processing.- 11 December 2023
- Published by American Physical Society (APS) in Physical Review A
- Vol. 108 (6) , 062609
Exploring ququart computation on a transmon using optimal control
Contemporary quantum computers encode and process quantum information in binary qubits . However, many architectures include higher energy levels that are left as unused computational resources. We demonstrate a superconducting ququart processor and combine quantum optimal control with efficient gate decompositions to implement high-fidelity ququart gates. We distinguish between viewing the ququart as a generalized four-level qubit and an encoded pair of qubits, and characterize the resulting gates in each case. In randomized benchmarking experiments we observe gate fidelities and identify coherence as the primary limiting factor. Our results validate ququarts as a viable tool for quantum information processing.- Open Access
- 17 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-14
Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures
Superconducting quantum devices are a leading technology for quantum computation, but they face several challenges. Gate errors, coherence errors and a lack of connectivity all contribute to low fidelity results. In particular, connectivity restrictions enforce a gate set that requires three-qubit gates to be decomposed into one- or two-qubit gates. This substantially increases the number of two-qubit gates that need to be executed. However, many quantum devices have access to higher energy levels. We can expand the qubit abstraction of |0〉 and |1〉 to a ququart which has access to the |2〉 and |3〉 state, but with shorter coherence times. This allows for two qubits to be encoded in one ququart, enabling increased virtual connectivity between physical units from two adjacent qubits to four fully connected qubits. This connectivity scheme allows us to more efficiently execute three-qubit gates natively between two physical devices. We present direct-to-pulse implementations of several three-qubit gates, synthesized via optimal control, for compilation of three-qubit gates onto a superconducting-based architecture with access to four-level devices with the first experimental demonstration of four-level ququart gates designed through optimal control. We demonstrate strategies that temporarily use higher level states to perform Toffoli gates and always use higher level states to improve fidelities for quantum circuits. We find that these methods improve expected fidelities with increases of 2x across circuit sizes using intermediate encoding, and increases of 3x for fully-encoded ququart compilation.
- 17 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-14
Open AccessDancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures
Superconducting quantum devices are a leading technology for quantum computation, but they face several challenges. Gate errors, coherence errors and a lack of connectivity all contribute to low fidelity results. In particular, connectivity restrictions enforce a gate set that requires three-qubit gates to be decomposed into one- or two-qubit gates. This substantially increases the number of two-qubit gates that need to be executed. However, many quantum devices have access to higher energy levels. We can expand the qubit abstraction of |0〉 and |1〉 to a ququart which has access to the |2〉 and |3〉 state, but with shorter coherence times. This allows for two qubits to be encoded in one ququart, enabling increased virtual connectivity between physical units from two adjacent qubits to four fully connected qubits. This connectivity scheme allows us to more efficiently execute three-qubit gates natively between two physical devices. We present direct-to-pulse implementations of several three-qubit gates, synthesized via optimal control, for compilation of three-qubit gates onto a superconducting-based architecture with access to four-level devices with the first experimental demonstration of four-level ququart gates designed through optimal control. We demonstrate strategies that temporarily use higher level states to perform Toffoli gates and always use higher level states to improve fidelities for quantum circuits. We find that these methods improve expected fidelities with increases of 2x across circuit sizes using intermediate encoding, and increases of 3x for fully-encoded ququart compilation.
- 7 June 2023
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 19 (6) , 064024
Two-Qutrit Quantum Algorithms on a Programmable Superconducting Processor
Processing quantum information using quantum three-level systems or qutrits as the fundamental unit is an alternative to contemporary qubit-based architectures with the potential to provide significant computational advantages. We demonstrate a fully programmable two-qutrit quantum processor by utilizing the third energy eigenstates of two transmons. We develop a parametric coupler to achieve excellent connectivity in the nine-dimensional Hilbert space enabling efficient implementations of two-qutrit gates. We characterize our processor by realizing several algorithms like Deutsch-Jozsa, Bernstein-Vazirani, and Grover’s search. Our hardware-efficient protocols allow us to show that two stages of Grover’s amplification can improve the success rates of an unstructured search with quantum advantage. Our results pave the way for building fully programmable ternary quantum processors using transmons as building blocks for a universal quantum computer.
- 7 June 2023
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 19 (6) , 064024
Two-Qutrit Quantum Algorithms on a Programmable Superconducting Processor
Processing quantum information using quantum three-level systems or qutrits as the fundamental unit is an alternative to contemporary qubit-based architectures with the potential to provide significant computational advantages. We demonstrate a fully programmable two-qutrit quantum processor by utilizing the third energy eigenstates of two transmons. We develop a parametric coupler to achieve excellent connectivity in the nine-dimensional Hilbert space enabling efficient implementations of two-qutrit gates. We characterize our processor by realizing several algorithms like Deutsch-Jozsa, Bernstein-Vazirani, and Grover’s search. Our hardware-efficient protocols allow us to show that two stages of Grover’s amplification can improve the success rates of an unstructured search with quantum advantage. Our results pave the way for building fully programmable ternary quantum processors using transmons as building blocks for a universal quantum computer.