From Qubits to Qudits

Marcin Pawłowski, Andreas Winter

Denis A. Drozhzhin, Anastasiia S. Nikolaeva, Evgeniy O. Kiktenko +1 more

In this paper, we introduce the workflow for converting qubit circuits represented by Open Quantum Assembly format (OpenQASM, also known as QASM) into the qudit form for execution on qudit hardware and provide a method for translating qudit experiment results back into qubit results. We present the comparison of several qudit transpilation regimes, which differ in decomposition of multicontrolled gates: qubit as ordinary qubit transpilation and execution, qutrit with d=3 levels and single qubit in qudit, and ququart with d=4 levels and 2 qubits per ququart. We provide several examples of transpiling circuits for trapped ion qudit processors, which demonstrate potential advantages of qudits.

Ray LaPierre

Jonathan E. Moussa

We consider four-dimensional qudits as qubit pairs and their qudit Pauli operators as qubit Clifford operators. This introduces a nesting, C^2_1 belong to C^4_2 belong to C^2_3 , where Cmn is the nth level of the m-dimensional qudit Clifford hierarchy. If we can convert between logical qubits and qudits, then qudit Clifford operators are qubit non-Clifford operators. Conversion is achieved by qubit fusion and qudit fission using stabilizer circuits that consume a resource state. This resource is a fused qubit stabilizer state with a faulttolerant state preparation using stabilizer circuits.

Liam Lysaght, Timothée Goubault, Patrick Sinnott +2 more

We present qubit logic on qudits (QLOQ), a compression scheme in which the qubits from a hardware agnostic circuit are divided into groups of various sizes, and each group is mapped to a physical qudit for computation. QLOQ circuits have qubit-logic inputs, outputs, and gates, making them compatible with existing qubit-based algorithms and Hamiltonians. We show that arbitrary qubit-logic unitaries can in principle be implemented with significantly fewer two-level (qubit) physical entangling gates in QLOQ than in qubit encoding. We achieve this advantage in practice for two applications: variational quantum algorithms, and unitary decomposition. The variational quantum eigensolver (VQE) for LiH took 5 hours using QLOQ on one of Quandela's cloud-accessible photonic quantum computers, whereas it would have taken 4.39 years in qubit encoding. We also provide a QLOQ version of the Quantum Shannon Decomposition, which not only outperforms previous qudit-based proposals, but also beats the theoretical lower bound on the CNOT cost of unitary decomposition in qubit encoding.