QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space

Abstract

We present QFAST, a quantum synthesis tool designed to produce short circuits and to scale well in practice. Our contributions are: 1) a novel representation of circuits able to encode placement and topology; 2) a hierarchical approach with an iterative refinement formulation that combines "coarse-grained" fast optimization during circuit structure search with a good, but slower, optimization stage only in the final circuit instantiation stage. When compared against state-of-the-art techniques, although not optimal, QFAST can generate much shorter circuits for "time dependent evolution" algorithms used by domain scientists. We also show the composability and tunability of our formulation in terms of circuit depth and running time. For example, we show how to generate shorter circuits by plugging in the best available third party synthesis algorithm at a given hierarchy level. Composability enables portability across chip architectures, which is missing from the available approaches.

References in corpus (20)

• The theory of variational hybrid quantum-classical algorithms
• A Quantum Approximate Optimization Algorithm
• Synthesis of Quantum Logic Circuits
• A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
• Quantum Circuits for General Multiqubit Gates
• Quantum-assisted quantum compiling
• Efficient decomposition of quantum gates
• Quantum Circuits for Isometries
• Exact synthesis of multiqubit Clifford+T circuits
• Compiling quantum algorithms for architectures with multi-qubit gates
• A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
• An Introduction to Cartan's KAK Decomposition for QC Programmers
• Cartan Decomposition of SU(2^n), Constructive Controllability of Spin systems and Universal Quantum Computing
• Realization of a General Three-Qubit Quantum Gate
• A Rudimentary Quantum Compiler(2cnd Ed.)
• The block-ZXZ synthesis of an arbitrary quantum circuit
• Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
• Heuristics for Quantum Compiling with a Continuous Gate Set
• Introduction to UniversalQCompiler
• On an implementation of the Solovay-Kitaev algorithm

Cited by in corpus (13)

• Quantum simulation of open quantum systems in heavy-ion collisions
• Approaching the theoretical limit in quantum gate decomposition
• LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach
• Constant-Depth Circuits for Dynamic Simulations of Materials on Quantum Computers
• Approximate Quantum Circuit Synthesis using Block-Encodings
• Leveraging Randomized Compiling for the QITE Algorithm
• QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis
• Domain-Specific Compilers for Dynamic Simulations of Quantum Materials on Quantum Computers
• Synthesis of CNOT-Dihedral circuits with optimal number of two qubit gates
• Sketching the Best Approximate Quantum Compiling Problem
• Quantum-gate decomposer
• Extending C++ for Heterogeneous Quantum-Classical Computing
• A Novel Single-Layer Quantum Neural Network for Approximate SRBB-Based Unitary Synthesis