Orchestrated trios: compiling for efficient communication in Quantum programs with 3-Qubit gates
Casey Duckering, Jonathan M. Baker, Andrew Litteken, Frederic T. Chong
Abstract
Current quantum computers are especially error prone and require high levels of optimization to reduce operation counts and maximize the probability the compiled program will succeed. These computers only support operations decomposed into one- and two-qubit gates and only two-qubit gates between physically connected pairs of qubits. Typical compilers first decompose operations, then route data to connected qubits. We propose a new compiler structure, Orchestrated Trios, that first decomposes to the three-qubit Toffoli, routes the inputs of the higher-level Toffoli operations to groups of nearby qubits, then finishes decomposition to hardware-supported gates.
Topics & Concepts
CompilerComputer scienceToffoli gateDecompositionOptimizing compilerProgramming languageParallel computingQuantum gateQuantum computerTheoretical computer scienceLogic gateArithmeticQuantumAlgorithmQuantum circuitComputer engineeringSequence (biology)Program optimizationQuantum Computing Algorithms and ArchitectureQuantum Information and CryptographyParallel Computing and Optimization Techniques