QFAST: Conflating Search and Numerical Optimization for Scalable Quantum Circuit Synthesis

@article{Younis2021QFASTCS,
  title={QFAST: Conflating Search and Numerical Optimization for Scalable Quantum Circuit Synthesis},
  author={Ed Younis and Koushik Sen and Katherine A. Yelick and Costin Iancu},
  journal={2021 IEEE International Conference on Quantum Computing and Engineering (QCE)},
  year={2021},
  pages={232-243}
}
  • Ed Younis, Koushik Sen, Costin Iancu
  • Published 12 March 2021
  • Computer Science
  • 2021 IEEE International Conference on Quantum Computing and Engineering (QCE)
We present a topology aware quantum synthesis algorithm designed to produce short circuits and to scale well in practice. The main contribution is a novel representation of circuits able to encode placement and topology using generic "gates", which allows the QFAST algorithm to replace expensive searches over circuit structures with few steps of numerical optimization. When compared against optimal depth, search based state-of-the-art techniques, QFAST produces comparable results: 1.19× longer… 
LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach
TLDR
The LEAP algorithm improves scaling across these dimensions using iterative circuit synthesis, incremental reoptimization, dimensionality reduction, and improved numerical optimization.
Approaching the theoretical limit in quantum gate decomposition
TLDR
It turns out that 15 and 63CNOT gates are sufficient to decompose a general 3- and 4-qubit unitary, respectively, with high numerical accuracy.
A novel quantum-inspired evolutionary computation-based quantum circuit synthesis for various universal gate libraries
TLDR
This paper proposes a novel quantum-inspired evolutionary computation method to synthesize quantum circuits effectively and efficiently, and demonstrates that the proposed method can be more effective in composing a compact quantum circuit than the state-of-the-art method.
Quantum Circuit Optimization and Transpilation via Parameterized Circuit Instantiation
TLDR
This work describes algorithms to apply instantiation during two common compilation steps: circuit optimization and gate-set transpilation, and shows how instantiation can be incorporated into a compiler workflow to improve circuit quality and enhance portability, all while maintaining a reasonably low compile time overhead.
Sketching the Best Approximate Quantum Compiling Problem
TLDR
This paper solves the optimization problem classically and considers algorithmic tools to scale it to higher numbers of qubits, and investigates stochastic gradient descent and two sketch-and-solve algorithms.
Co-Designed Architectures for Modular Superconducting Quantum Computers
TLDR
A collaboratively designed superconducting quantum computer using a Superconducting Nonlinear Asymmetric Inductive eLement (SNAIL) modulator is proposed and a gate duration sensitivity study is provided on further decreasing the SNAIL pulse length to realize n √ iSWAP qubit systems to reduce decoherence.
Efficient variational synthesis of quantum circuits with coherent multi-start optimization
TLDR
This work considers the problem of the variational quantum circuit synthesis into a gate set consisting of the CNOT gate and arbitrary single-qubit (1q) gates and proposes a coherent optimization of the architecture together with 1q gates which appears to work surprisingly well in practice.
QUEST: systematically approximating Quantum circuits for higher output fidelity
TLDR
The results indicate that QUEST can reduce CNOT gate count by 30-80% on ideal systems and decrease the impact of noise on existing and near-future quantum systems.
Co-Design quantum simulation of nanoscale NMR
Manuel G. Algaba, ∗ Mario Ponce-Martinez, 2, ∗ Carlos Munuera-Javaloy, Vicente Pina-Canelles, Manish Thapa, Bruno G. Taketani, Martin Leib, Inés de Vega, 2 Jorge Casanova, 4 and Hermanni Heimonen
An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation
TLDR
It is shown that Hamiltonian simulation of certain spin models known as free fermions can be performed in a quantum circuit with a depth that is independent of simulation time and that grows linearly in the number of spins.
...
...

References

SHOWING 1-10 OF 48 REFERENCES
An Introduction to Cartan's KAK Decomposition for QC Programmers
This paper presents no new results; its goals are purely pedagogical. A special case of the Cartan Decomposition has found much utility in the field of quantum computing, especially in its sub-field
Towards Optimal Topology Aware Quantum Circuit Synthesis
TLDR
An algorithm for compiling arbitrary unitaries into a sequence of gates native to a quantum processor, which minimizes their count while accounting for connectivity, and discusses the formulation of synthesis as a search problem as well as an algorithm to find solutions.
Quantum Circuits for Isometries
TLDR
A theoretical lower bound on the number of cnot gates required to decompose an arbitrary isometry from $m$ to $n$ qubits is derived and three explicit gate decompositions are given that achieve this bound up to a factor of about 2 in the leading order.
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits
We present an algorithm for computing depth-optimal decompositions of logical operations, leveraging a meet-in-the-middle technique to provide a significant speedup over simple brute force
Synthesis of quantumlogic circuits
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 25(6):1000–1010, June
  • 2006
Heuristics for Quantum Compiling with a Continuous Gate Set
TLDR
This work presents an algorithm for compiling arbitrary unitaries into a sequence of gates native to a quantum processor, which attempts to minimize their count, while accounting for connectivity, and produces solutions well within the best upper bounds published in literature.
Optimizing Noisy-Intermediate Scale Quantum Circuits: A Block-Based Synthesis
TLDR
A hierarchical, block-by-block optimization framework, QGo, for quantum circuit optimization that can reduce the number of CNOT gates by 29.9% on average and up to 50% when compared with industrial compilers such as t|ket>.
Towards simulation of the dynamics of materials on quantum computers
TLDR
A successful simulation of nontrivial quantum dynamics on IBM's Q16 Melbourne quantum processor and Rigetti's Aspen quantum processor is demonstrated, namely, ultrafast control of emergent magnetism by THz radiation in an atomically-thin two-dimensional material.
QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space
TLDR
A novel representation of circuits able to encode placement and topology and 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 is presented.
MATLAB PROGRAMS FOR MATRIX EXPONENTIAL FUNCTION DERIVATIVE EVALUATION
The paper deals with six approaches how to determine a derivative of the matrix exponential function in the Matlab language environment. Namely, a Taylor series expansion, an augmented matrix
...
...