Deterministic Algorithms for Compiling Quantum Circuits with Recurrent Patterns

Abstract

Current quantum processors are noisy, have limited coherence and imperfect gate implementations. On such hardware, only algorithms that are shorter than the overall coherence time can be implemented and executed successfully. A good quantum compiler must translate an input program into the most efficient equivalent of itself, getting the most out of the available hardware. In this work, we present novel deterministic algorithms for compiling recurrent quantum circuit patterns in polynomial time. In particular, such patterns appear in quantum circuits that are used to compute the ground state properties of molecular systems using the variational quantum eigensolver (VQE) method together with the RyRz heuristic wavefunction Ansatz. We show that our pattern-oriented compiling algorithms, combined with an efficient swapping strategy, produces - in general - output programs that are comparable to those obtained with state-of-art compilers, in terms of CNOT count and CNOT depth. In particular, our solution produces unmatched results on RyRz circuits.

References in corpus (18)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum Machine Learning
• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Supervised learning with quantum enhanced feature spaces
• Quantum Convolutional Neural Networks
• Quantum principal component analysis
• Quantum Generative Adversarial Networks for Learning and Loading Random Distributions
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
• An Artificial Neuron Implemented on an Actual Quantum Processor
• Challenges and Opportunities of Near-Term Quantum Computing Systems
• ScaffCC: Scalable Compilation and Analysis of Quantum Programs
• Quipper: A Scalable Quantum Programming Language
• Quantum hardware simulating four-dimensional inelastic neutron scattering
• Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits
• Demonstration of entanglement assisted invariance on IBM's Quantum Experience
• Efficient and Effective Quantum Compiling for Entanglement-based Machine Learning on IBM Q Devices

Cited by in corpus (3)

• A Modular Quantum Compilation Framework for Distributed Quantum Computing
• Topological-Graph Dependencies and Scaling Properties of a Heuristic Qubit-Assignment Algorithm
• Noise-Adaptive Quantum Compilation Strategies Evaluated with Application-Motivated Benchmarks