Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices

Abstract

We propose a new algorithm to synthesise quantum circuits for phase polynomials, which takes into account the qubit connectivity of the quantum computer. We focus on the architectures of currently available NISQ devices. Our algorithm generates circuits with a smaller CNOT depth than the algorithms currently used in Staq and tket, while improving the runtime with respect the former.

arXiv commentIn Proceedings QPL 2022, arXiv:2311.08375. This paper was originally accepted as Submission 38 in QPL2020, but was not included in the proceedings because of a clerical error

References in corpus (12)

• Quantum Computing in the NISQ era and beyond
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
• Mapping Quantum Circuits to IBM QX Architectures Using the Minimal Number of SWAP and H Operations
• Quantum Picturalism
• Quantum circuit optimizations for NISQ architectures
• Phase Gadget Synthesis for Shallow Circuits
• staq -- A full-stack quantum processing toolkit
• On the qubit routing problem
• On the CNOT-complexity of CNOT-PHASE circuits
• Optimization of CNOT circuits on limited connectivity architecture
• Using ZDDs in the Mapping of Quantum Circuits

Cited by in corpus (8)

• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• Phase polynomials synthesis algorithms for NISQ architectures and beyond
• Parity Quantum Optimization: Benchmarks
• 2QAN: A quantum compiler for 2-local qubit Hamiltonian simulation algorithms
• Diagrammatic Differentiation for Quantum Machine Learning
• Fermihedral: On the Optimal Compilation for Fermion-to-Qubit Encoding
• Software-Hardware Co-Optimization for Computational Chemistry on Superconducting Quantum Processors
• HATT: Hamiltonian Adaptive Ternary Tree for Optimizing Fermion-to-Qubit Mapping