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

Abstract

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 qu\emph{quart} via a \emph{compression scheme}. We use quantum optimal control to design efficient proof-of-concept gates that fully replicate standard qubit computation on these encoded qubits. We extend qubit compilation schemes to efficiently route qubits on an arbitrary mixed-radix system consisting of both qubits and ququarts, reducing communication and minimizing excess circuit execution time introduced by longer-duration ququart gates. In conjunction with these compilation strategies, we introduce several methods to find beneficial compressions, reducing circuit error due to computation and communication by up to 50\%. These methods can increase the computational space available on a limited near-term machine by up to 2x while maintaining circuit fidelity.

arXiv comment14 pages, 13 figures, 1 table, to be published at ASPLOS 2023

References in corpus (21)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Elementary gates for quantum computation
• Charge insensitive qubit design derived from the Cooper pair box
• A Quantum Approximate Optimization Algorithm
• Procedure for systematically tuning up crosstalk in the cross resonance gate
• A new quantum ripple-carry addition circuit
• Quantum Information Scrambling in a Superconducting Qutrit Processor
• Demonstrating a Driven Reset Protocol of a Superconducting Qubit
• Loading a Bose-Einstein Condensate onto an Optical Lattice: an Application of Optimal Control Theory to The Non Linear Schrödinger Equation
• High-fidelity gates in a Josephson qubit
• Factoring with Qutrits: Shor's Algorithm on Ternary and Metaplectic Quantum Architectures
• Life after charge noise: recent results with transmon qubits
• Experimental high-dimensional Greenberger-Horne-Zeilinger entanglement with superconducting transmon qutrits
• Asymptotic Improvements to Quantum Circuits via Qutrits
• Universal gates for protected superconducting qubits using optimal control
• A fast quantum mechanical algorithm for database search
• Discrete Adjoints for Accurate Numerical Optimization with Application to Quantum Control
• Optimal Control of Closed Quantum Systems via B-Splines with Carrier Waves
• Time-Efficient Qudit Gates through Incremental Pulse Re-seeding
• Communication Trade Offs in Intermediate Qudit Circuits
• A Generalization of Bernstein-Vazirani Algorithm to Qudit Systems