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:2003.03307 · Physical Review X

Quantum Information Scrambling on a Superconducting Qutrit Processor

Machiel Blok, Vinay Ramasesh, Thomas Schuster, Kevin P. O’Brien, John Mark Kreikebaum, Dar Dahlen, Alexis Morvan, Beni Yoshida, Norman Y. Yao, Irfan A. Siddiqi

Published Apr 9, 2021• 269 citations
arXivHTMLPDF

Abstract

A quantum processor based on three-level ``qutrits,'' as opposed to two-level qubits, successfully runs a quantum teleportation algorithm in a proof-of-concept demonstration of resource-efficient three-level systems.
DOI
10.1103/physrevx.11.021010

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

3D Integration of Superconducting Qubits in a Three-Tiered Quantum Processor

Justin Mallek, D. Yost, Rabindra Nath Das +14 more

Bulletin of the American Physical Society•Mar 7, 2019•0 citations

Realization of 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 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.

arXiv:2211.06523•Nov 12, 2022•6 citations

Experimental demonstration of quantum algorithms on a 4-qubit/5-resonator quantum microprocessor utilizing superconducting qubits in the RezQu architecture

Erik A. Lucero, R. Barends, Radoslaw C. Bialczak +16 more

Bulletin of the American Physical Society•Mar 21, 2011•0 citations

Quantum speeding-up of computation demonstrated in a superconducting two-qubit processor

Andreas Dewes, Romain Lauro, Florian R. Ong +5 more

We operate a superconducting quantum processor consisting of two tunable transmon qubits coupled by a swapping interaction, and equipped with nondestructive single-shot readout of the two qubits. With this processor, we run the Grover search algorithm among four objects and find that the correct answer is retrieved after a single run with a success probability between $0.52$ and $0.67$, which is significantly larger than the $0.25$ achieved with a classical algorithm. This constitutes a proof of concept for the quantum speed-up of electrical quantum processors.

Physical Review B•Apr 5, 2012•33 citations

Demonstration of two-qubit algorithms with a superconducting quantum processor

L. DiCarlo, Jerry M. Chow, Jay Gambetta +8 more

arXiv:0903.2030•Nature•Jun 28, 2009•1,173 citations
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.
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.
We operate a superconducting quantum processor consisting of two tunable transmon qubits coupled by a swapping interaction, and equipped with nondestructive single-shot readout of the two qubits. With this processor, we run the Grover search algorithm among four objects and find that the correct answer is retrieved after a single run with a success probability between 0.520.520.52 and 0.670.670.67, which is significantly larger than the 0.250.250.25 achieved with a classical algorithm. This constitutes a proof of concept for the quantum speed-up of electrical quantum processors.