Partitioning Quantum Chemistry Simulations with Clifford Circuits

Abstract

Current quantum computing hardware is restricted by the availability of only few, noisy qubits which limits the investigation of larger, more complex molecules in quantum chemistry calculations on quantum computers in the near-term. In this work, we investigate the limits of their classical and near-classical treatment while staying within the framework of quantum circuits and the variational quantum eigensolver. To this end, we consider naive and physically motivated, classically efficient product ansatz for the parametrized wavefunction adapting the separable pair ansatz form. We combine it with post-treatment to account for interactions between subsystems originating from this ansatz. The classical treatment is given by another quantum circuit that has support between the enforced subsystems and is folded into the Hamiltonian. To avoid an exponential increase in the number of Hamiltonian terms, the entangling operations are constructed from purely Clifford or near-Clifford circuits. While Clifford circuits can be simulated efficiently classically, they are not universal. In order to account for missing expressibility, near-Clifford circuits with only few, selected non-Clifford gates are employed. The exact circuit structure to achieve this objective is molecule-dependent and is constructed using simulated annealing and genetic algorithms. We demonstrate our approach on a set of molecules of interest and investigate the extent of our methodology's reach. Empirical validation of our approach using numerical simulations shows a reduction of the qubit count of up to a 50\% at a similar accuracy as compared to the separable-pair ansatz.

arXiv comment12 pages, 9 figures plus 3 pages, 8 figures appendix

References in corpus (44)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computational chemistry
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Quantum Chemistry in the Age of Quantum Computing
• Simulated Quantum Computation of Molecular Energies
• Recent developments in the PySCF program package
• Evaluating analytic gradients on quantum hardware
• The Variational Quantum Eigensolver: a review of methods and best practices
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• A Theory of Fault-Tolerant Quantum Computation
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Variational Quantum Computation of Excited States
• Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
• qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
• Qulacs: a fast and versatile quantum circuit simulator for research purpose
• Subspace-search variational quantum eigensolver for excited states
• Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• Doubling the size of quantum simulators by entanglement forging
• Quantum Orbital-Optimized Unitary Coupled Cluster Methods in the Strongly Correlated Regime: Can Quantum Algorithms Outperform their Classical Equivalents?
• Orbital optimized unitary coupled cluster theory for quantum computer
• Universal Variational Quantum Computation
• MADNESS: A Multiresolution, Adaptive Numerical Environment for Scientific Simulation
• Nearly Optimal Measurement Scheduling for Partial Tomography of Quantum States
• Hardware Efficient Quantum Algorithms for Vibrational Structure Calculations
• A state-averaged orbital-optimized hybrid quantum-classical algorithm for a democratic description of ground and excited states
• A Feasible Approach for Automatically Differentiable Unitary Coupled-Cluster on Quantum Computers
• Correlation-Informed Permutation of Qubits for Reducing Ansatz Depth in VQE
• Tequila: A platform for rapid development of quantum algorithms
• Variational Quantum Eigensolver with Reduced Circuit Complexity
• Analytic gradients in variational quantum algorithms: Algebraic extensions of the parameter-shift rule to general unitary transformations
• Reducing qubit requirements while maintaining numerical precision for the Variational Quantum Eigensolver: A Basis-Set-Free Approach
• Optimized Low-Depth Quantum Circuits for Molecular Electronic Structure using a Separable Pair Approximation
• Differentiable quantum chemistry with PySCF for molecules and materials at the mean-field level and beyond
• Transport and entanglement growth in long-range random Clifford circuits
• Optimising Clifford Circuits with Quantomatic
• Improving the Accuracy of the Variational Quantum Eigensolver for Molecular Systems by the Explicitly-Correlated Perturbative [2]-R12-Correction
• On Clifford groups in quantum computing

Cited by in corpus (6)

• Fourier expansion in variational quantum algorithms
• Reducing Entanglement With Physically-Inspired Fermion-To-Qubit Mappings
• Stabilizer ground states for simulating quantum many-body physics: theory, algorithms, and applications
• Hamiltonian-based graph-state ansatz for variational quantum algorithms
• Leveraging commuting groups for an efficient variational Hamiltonian ansatz
• Stabilizer configuration interaction: Finding molecular subspaces with error detection properties