Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2211.06523

Realization of two-qutrit quantum algorithms on a programmable superconducting processor

Tanay Roy, Ziqian Li, Eliot Kapit, David Schuster

Published Nov 12, 2022• 6 citations
arXivHTMLPDF

Abstract

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 efficient ancilla-free 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.

DOI
10.48550/arxiv.2211.06523

Related papers

Two-Qutrit Quantum Algorithms on a Programmable Superconducting Processor

Tanay Roy, Ziqian Li, Eliot Kapit +1 more

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.

Physical Review Applied•Jun 7, 2023•55 citations

Programmable Superconducting Processor with Native Three-Qubit Gates

Tanay Roy, Sumeru Hazra, Suman Kundu +3 more

Higher-dimensional gates involving more than two qubits could play a major role in boosting the performance of quantum processors. While native two-qubit gates are ubiquitous on the superconducting-qubit platform, realizing high-fidelity three-qubit gates is challenging and typically requires multiple two-qubit gates, which leads to error accumulation. The authors utilize a multimodal ``trimon'' circuit to realize $n\phantom{\rule{0}{0ex}}a\phantom{\rule{0}{0ex}}t\phantom{\rule{0}{0ex}}i\phantom{\rule{0}{0ex}}v\phantom{\rule{0}{0ex}}e$ three-qubit gates that enable efficient implementation of important quantum algorithms, such as Grover's search. These results point to improved processor performance when the trimon is used as a building block for larger systems.

arXiv:1809.00668•Physical Review Applied•Jul 23, 2020•49 citations

A programmable two-qubit solid-state quantum processor under ambient conditions

Yang Wu, Ya Wang, Xi Qin +2 more

Abstract Quantum computers, which take advantage of the superposition and entanglement of physical states, could outperform their classical counterparts in solving problems with technological impact such as factoring large numbers and searching databases. A quantum processor executes algorithms by applying a programmable sequence of gates to an initialized state of qubits, which coherently evolves into a final state containing the result of the computation. Although quantum processors with a few qubits have been demonstrated on multiple quantum computing platforms, realization of solid-state programmable quantum processor under ambient conditions remains elusive. Here we report a programable quantum processor that can be programmed with fifteen parameters to realize arbitrary unitary transformations on two spin qubits in a nitrogen-vacancy (NV) center in diamond. We implemented the Deutsch-Jozsa and Grover search algorithms with average success rates above 80%. The results pave the way to implement the programmable method in a large-scale quantum processor.

arXiv:1808.05733•npj Quantum Information•Jan 25, 2019•61 citations

High-fidelity qutrit entangling gates for superconducting circuits

Noah Goss, Alexis Morvan, Brian Marinelli +9 more

Abstract Ternary quantum information processing in superconducting devices poses a promising alternative to its more popular binary counterpart through larger, more connected computational spaces and proposed advantages in quantum simulation and error correction. Although generally operated as qubits, transmons have readily addressable higher levels, making them natural candidates for operation as quantum three-level systems (qutrits). Recent works in transmon devices have realized high fidelity single qutrit operation. Nonetheless, effectively engineering a high-fidelity two-qutrit entanglement remains a central challenge for realizing qutrit processing in a transmon device. In this work, we apply the differential AC Stark shift to implement a flexible, microwave-activated, and dynamic cross-Kerr entanglement between two fixed-frequency transmon qutrits, expanding on work performed for the Z Z interaction with transmon qubits. We then use this interaction to engineer efficient, high-fidelity qutrit CZ † and CZ gates, with estimated process fidelities of 97.3(1)% and 95.2(3)% respectively, a significant step forward for operating qutrits on a multi-transmon device.

arXiv:2206.07216•Nature Communications•Dec 5, 2022•131 citations

Demonstrating advantages of dynamic quantum circuits on a hybrid superconducting qubit-cavity processor

Hongbo Wu, Ling Hu, Jiasheng Mai +10 more

Dynamic quantum circuits (DQCs) provide a hardware-efficient route to quantum computing by reducing physical-qubit overhead and compressing circuit topology through mid-circuit measurements, qubit reset and reuse, and classical feed-forward control. Here, we demonstrate the advantages of DQCs on a single hybrid superconducting qubit-cavity processor by implementing a hierarchy of algorithms with increasing complexity. This hybrid architecture consists of a high-dimensional cavity qudit serving as the computational register and a dispersively coupled superconducting transmon ancilla that is repeatedly measured, reset, and reused to enable dynamic control. Using this device, we implement a 10-bit Bernstein-Vazirani algorithm with an average success probability of 82%, surpassing state-of-the-art dynamic and static implementations in both scale and performance; an 8-bit quantum phase-estimation protocol with estimation errors below 10-3; and the first dynamic-circuit implementation of Shor's algorithm on a superconducting platform, factoring 15 over all coprime bases with squared statistical overlap values above 99.8%. These results provide concrete benchmarks for future DQC implementations and highlight the versatile advantages of DQCs with the hybrid qubit-qudit architecture, establishing it as a promising route toward scalable, programmable quantum computation.

quant-pharXiv:2608.04780•Aug 6, 2026•0 citations

Implementation of refined Deutsch–Jozsa algorithm in a superconducting qutrit system

Jie Zhao, Xinsheng Tan, Dong Lan +4 more

Abstract Superconducting quantum circuits are promising candidates for realizing quantum computation due to their intrinsic scalability. Here, we report the implementation of the refined Deutsch–Jozsa algorithm in a 3D superconducting transmon qutrit system. Such 3D superconducting systems usually preserve a relatively long coherence time. A qutrit can take advantage of the third level of a superconducting artificial atom and extends the Hilbert space. Compared with the two‐qubit system used for realizing Deutsch–Jozsa algorithm, the employment of qutrit simplifies the hardware design. This simplification and the intrinsic long coherence time jointly lead to a higher fidelity than in previous transmon implementation [DiCarlo et al., Nature 460 (7252), 240–244 (2009)].

physica status solidi (b)•Nov 25, 2016•1 citation
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 efficient ancilla-free 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.
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.
Higher-dimensional gates involving more than two qubits could play a major role in boosting the performance of quantum processors. While native two-qubit gates are ubiquitous on the superconducting-qubit platform, realizing high-fidelity three-qubit gates is challenging and typically requires multiple two-qubit gates, which leads to error accumulation. The authors utilize a multimodal ``trimon'' circuit to realize $n\phantom{\rule{0}{0ex}}a\phantom{\rule{0}{0ex}}t\phantom{\rule{0}{0ex}}i\phantom{\rule{0}{0ex}}v\phantom{\rule{0}{0ex}}e$ three-qubit gates that enable efficient implementation of important quantum algorithms, such as Grover's search. These results point to improved processor performance when the trimon is used as a building block for larger systems.
Abstract Quantum computers, which take advantage of the superposition and entanglement of physical states, could outperform their classical counterparts in solving problems with technological impact such as factoring large numbers and searching databases. A quantum processor executes algorithms by applying a programmable sequence of gates to an initialized state of qubits, which coherently evolves into a final state containing the result of the computation. Although quantum processors with a few qubits have been demonstrated on multiple quantum computing platforms, realization of solid-state programmable quantum processor under ambient conditions remains elusive. Here we report a programable quantum processor that can be programmed with fifteen parameters to realize arbitrary unitary transformations on two spin qubits in a nitrogen-vacancy (NV) center in diamond. We implemented the Deutsch-Jozsa and Grover search algorithms with average success rates above 80%. The results pave the way to implement the programmable method in a large-scale quantum processor.
Abstract Ternary quantum information processing in superconducting devices poses a promising alternative to its more popular binary counterpart through larger, more connected computational spaces and proposed advantages in quantum simulation and error correction. Although generally operated as qubits, transmons have readily addressable higher levels, making them natural candidates for operation as quantum three-level systems (qutrits). Recent works in transmon devices have realized high fidelity single qutrit operation. Nonetheless, effectively engineering a high-fidelity two-qutrit entanglement remains a central challenge for realizing qutrit processing in a transmon device. In this work, we apply the differential AC Stark shift to implement a flexible, microwave-activated, and dynamic cross-Kerr entanglement between two fixed-frequency transmon qutrits, expanding on work performed for the Z Z interaction with transmon qubits. We then use this interaction to engineer efficient, high-fidelity qutrit CZ † and CZ gates, with estimated process fidelities of 97.3(1)% and 95.2(3)% respectively, a significant step forward for operating qutrits on a multi-transmon device.
Dynamic quantum circuits (DQCs) provide a hardware-efficient route to quantum computing by reducing physical-qubit overhead and compressing circuit topology through mid-circuit measurements, qubit reset and reuse, and classical feed-forward control. Here, we demonstrate the advantages of DQCs on a single hybrid superconducting qubit-cavity processor by implementing a hierarchy of algorithms with increasing complexity. This hybrid architecture consists of a high-dimensional cavity qudit serving as the computational register and a dispersively coupled superconducting transmon ancilla that is repeatedly measured, reset, and reused to enable dynamic control. Using this device, we implement a 10-bit Bernstein-Vazirani algorithm with an average success probability of 82%, surpassing state-of-the-art dynamic and static implementations in both scale and performance; an 8-bit quantum phase-estimation protocol with estimation errors below 10-3; and the first dynamic-circuit implementation of Shor's algorithm on a superconducting platform, factoring 15 over all coprime bases with squared statistical overlap values above 99.8%. These results provide concrete benchmarks for future DQC implementations and highlight the versatile advantages of DQCs with the hybrid qubit-qudit architecture, establishing it as a promising route toward scalable, programmable quantum computation.
Abstract Superconducting quantum circuits are promising candidates for realizing quantum computation due to their intrinsic scalability. Here, we report the implementation of the refined Deutsch–Jozsa algorithm in a 3D superconducting transmon qutrit system. Such 3D superconducting systems usually preserve a relatively long coherence time. A qutrit can take advantage of the third level of a superconducting artificial atom and extends the Hilbert space. Compared with the two‐qubit system used for realizing Deutsch–Jozsa algorithm, the employment of qutrit simplifies the hardware design. This simplification and the intrinsic long coherence time jointly lead to a higher fidelity than in previous transmon implementation [DiCarlo et al., Nature 460 (7252), 240–244 (2009)].