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:2304.11159 · Physical Review A

Exploring ququart computation on a transmon using optimal control

Lennart Maximilian Seifert, Ziqian Li, Tanay Roy, David Schuster, Frederic T. Chong, Jonathan M. Baker

Published Dec 11, 2023• 22 citations
arXivHTMLPDF

Abstract

Contemporary quantum computers encode and process quantum information in binary qubits $(d=2)$. However, many architectures include higher energy levels that are left as unused computational resources. We demonstrate a superconducting ququart $(d=4)$ 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 $\ensuremath{\ge}95%$ and identify coherence as the primary limiting factor. Our results validate ququarts as a viable tool for quantum information processing.

DOI
10.1103/physreva.108.062609

Related papers

Universal Qudit Gate Synthesis for Transmons

Laurin E. Fischer, Alessandro Chiesa, Francesco Tacchino +3 more

Gate-based quantum computers typically encode and process information in two-dimensional units called qubits.Using d-dimensional qudits instead may offer intrinsic advantages, including more efficient circuit synthesis, problem-tailored encodings and embedded error correction.In this work, we design a superconducting qudit-based quantum processor wherein the logical space of transmon qubits is extended to higher-excited levels.We propose a universal gate set featuring a two-qudit cross-resonance entangling gate, for which we predict fidelities beyond 99% in the d = 4 case of ququarts with realistic experimental parameters.Furthermore, we present a decomposition routine that compiles general qudit unitaries into these elementary gates, requiring fewer entangling gates than qubit alternatives.As proof-of-concept applications, we numerically demonstrate the synthesis of SU(16) gates for noisy quantum hardware and an embedded error-correction sequence that encodes a qubit memory in a transmon ququart to protect against pure dephasing noise.We conclude that universal qudit control-a valuable extension to the operational toolbox of superconducting quantum information processing-is within reach of current transmon-based architectures and has applications to near-term and long-term hardware.

arXiv:2212.04496•PRX Quantum•Aug 28, 2023•63 citations

Qompress: Efficient Compilation for Ququarts Exploiting Partial and Mixed Radix Operations for Communication Reduction

Andrew Litteken, Lennart Maximilian Seifert, Jason D. Chadwick +3 more

Quantum computing is in an era of limited resources. Current hardware lacks high fidelity gates, long coherence times, and the number of computational units required to perform meaningful computation. Contemporary quantum devices typically use a binary system, where each qubit exists in a superposition of the 0 and 1 states. However, it is often possible to access the 2 or even 3 states in the same physical unit by manipulating the system in different ways. In this work, we consider automatically encoding two qubits into one four-state ququart via a compression scheme. We use quantum optimal control to design efficient proof-of-concept gates that fully replicate standard qubit computation on these encoded qubits.

arXiv:2303.00658•International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS)•Jan 27, 2023•5 citations

Metrology of Quantum Control and Measurement in Superconducting Qubits

Zijun Chen

Quantum computers have the potential to solve problems which are classically intractable. Superconducting qubits present a promising path to building such a computer. Recent experiments with these qubits have demonstrated the principles of quantum error correction, quantum simulation, quantum annealing, and more. Current research with superconducting qubits is focused on two primary goals: creating a fully fault tolerant logical qubit out of many physical qubits using surface code error correction, and demonstrating an exponential speedup over any classical computer for a well-defined computational problem. To achieve either of these goals requires high precision control of three components: single qubit gates, two qubit gates, and qubit measurement. In this thesis, we use randomized benchmarking to characterize single qubit gates with 99.95\\% fidelity and two qubit gates wiht 99.5\\% fidelity in superconducting transmon qubits. In addition, we use standard decoherence measurements as well as newly developed extensions of randomized benchmarking to determine the limiting sources of error. Finally, we explore the surprisingly complicated dynamics of measuring the transmon state through a coupled resonator, and show that fully understanding this process requires breaking a few "standard" assumptions.

•Jan 1, 2018•29 citations

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

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

Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures

Andrew Litteken, Lennart Maximilian Seifert, Jason D. Chadwick +6 more

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.

arXiv:2303.14069•Proceedings - International Symposium on Computer Architecture/Proceedings•Jun 16, 2023•12 citations
Contemporary quantum computers encode and process quantum information in binary qubits (d=2)(d=2)(d=2). However, many architectures include higher energy levels that are left as unused computational resources. We demonstrate a superconducting ququart (d=4)(d=4)(d=4) 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 \ensuremath≥95\ensuremath{\ge}95%\ensuremath≥95 and identify coherence as the primary limiting factor. Our results validate ququarts as a viable tool for quantum information processing.
Gate-based quantum computers typically encode and process information in two-dimensional units called qubits.Using d-dimensional qudits instead may offer intrinsic advantages, including more efficient circuit synthesis, problem-tailored encodings and embedded error correction.In this work, we design a superconducting qudit-based quantum processor wherein the logical space of transmon qubits is extended to higher-excited levels.We propose a universal gate set featuring a two-qudit cross-resonance entangling gate, for which we predict fidelities beyond 99% in the d = 4 case of ququarts with realistic experimental parameters.Furthermore, we present a decomposition routine that compiles general qudit unitaries into these elementary gates, requiring fewer entangling gates than qubit alternatives.As proof-of-concept applications, we numerically demonstrate the synthesis of SU(16) gates for noisy quantum hardware and an embedded error-correction sequence that encodes a qubit memory in a transmon ququart to protect against pure dephasing noise.We conclude that universal qudit control-a valuable extension to the operational toolbox of superconducting quantum information processing-is within reach of current transmon-based architectures and has applications to near-term and long-term hardware.
Quantum computing is in an era of limited resources. Current hardware lacks high fidelity gates, long coherence times, and the number of computational units required to perform meaningful computation. Contemporary quantum devices typically use a binary system, where each qubit exists in a superposition of the 0 and 1 states. However, it is often possible to access the 2 or even 3 states in the same physical unit by manipulating the system in different ways. In this work, we consider automatically encoding two qubits into one four-state ququart via a compression scheme. We use quantum optimal control to design efficient proof-of-concept gates that fully replicate standard qubit computation on these encoded qubits.
Quantum computers have the potential to solve problems which are classically intractable. Superconducting qubits present a promising path to building such a computer. Recent experiments with these qubits have demonstrated the principles of quantum error correction, quantum simulation, quantum annealing, and more. Current research with superconducting qubits is focused on two primary goals: creating a fully fault tolerant logical qubit out of many physical qubits using surface code error correction, and demonstrating an exponential speedup over any classical computer for a well-defined computational problem. To achieve either of these goals requires high precision control of three components: single qubit gates, two qubit gates, and qubit measurement. In this thesis, we use randomized benchmarking to characterize single qubit gates with 99.95\\% fidelity and two qubit gates wiht 99.5\\% fidelity in superconducting transmon qubits. In addition, we use standard decoherence measurements as well as newly developed extensions of randomized benchmarking to determine the limiting sources of error. Finally, we explore the surprisingly complicated dynamics of measuring the transmon state through a coupled resonator, and show that fully understanding this process requires breaking a few "standard" assumptions.
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.
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.