Phase polynomials synthesis algorithms for NISQ architectures and beyond

Abstract

We present a framework for the synthesis of phase polynomials that addresses both cases of full connectivity and partial connectivity for NISQ architectures. In most cases, our algorithms generate circuits with lower CNOT count and CNOT depth than the state of the art or have a significantly smaller running time for similar performances. We also provide methods that can be applied to our algorithms in order to trade an increase in the CNOT count for a decrease in execution time, thereby filling the gap between our algorithms and faster ones.

References in corpus (8)

• A Quantum Approximate Optimization Algorithm
• Experimental Comparison of Two Quantum Computing Architectures
• Quantum Circuit Placement
• Linear Depth Stabilizer and Quantum Fourier Transformation Circuits with no Auxiliary Qubits in Finite Neighbor Quantum Architectures
• Quantum circuits and low-degree polynomials over F_2
• A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
• Architecture aware compilation of quantum circuits via lazy synthesis
• Efficient CNOT Synthesis for NISQ Devices

Cited by in corpus (9)

• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• Automatic Depth-Optimized Quantum Circuit Synthesis for Diagonal Unitary Matrices with Asymptotically Optimal Gate Count
• Optimal Hadamard gate count for Clifford$+T$ synthesis of Pauli rotations sequences
• Dynamic Qubit Routing with CNOT Circuit Synthesis for Quantum Compilation
• Lower T-count with faster algorithms
• On the role of coherence for quantum computational advantage
• The Parity Flow Formalism: Tracking Quantum Information Throughout Computation
• A graph-state based synthesis framework for Clifford isometries
• Quantum Circuits in Additive Hilbert Space