Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization

Abstract

Quantum algorithms for selecting a subspace of Hamiltonians to diagonalize have emerged as a promising alternative to variational algorithms in the NISQ era. So far, such algorithms, which include the quantum selected configuration interaction (QSCI) and sample-based quantum diagonalization (SQD), have been formulated within second-quantization in Fock space, which leads to inefficient usage of qubit resources. We introduce the first QSCI algorithm developed in the CI-matrix (CIM) framework, which is known to have optimal qubit scaling of exactly $\lceil {\log }_2(N)\rceil$ where $N$ is the size of the CIM. In addition, we introduce a novel single-bit flip error mitigation which comes at the overhead of a single qubit and we combine this with a stochastic approximate Trotterization evolution adapted from qDRIFT. Simulating benchmark N${}_2$ and naphthalene molecules on quantum hardware, our results achieved similar accuracy as SQD methods but with significantly less quantum resources. However, our CIM-QSCI algorithm and SQD methods could not match the performance of classical heat-bath CI (HCI) for the same task. Hence, we introduce an augmented version of QSCI called quantum selected heat-bath CI (QSHCI). This variant replaces classical heat-bath sampling with quantum sampling from QSCI to achieve performance comparable to HCI. We note that a current drawback of our approach is the preprocessing cost of $\mathcal{O}(N^2\log N)$ for constructing the CIM and performing the Pauli decomposition. This can be further improved by considering efficient CIM access models for the stochastic Trotter evolution.

19 pages, 5 figures

References in corpus (28)

• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Quantum Chemistry in the Age of Quantum Computing
• Recent developments in the PySCF program package
• The Variational Quantum Eigensolver: a review of methods and best practices
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Quantum algorithms for quantum chemistry and quantum materials science
• Validating quantum computers using randomized model circuits
• Heat-bath Configuration Interaction: An efficient selected CI algorithm inspired by heat-bath sampling
• A random compiler for fast Hamiltonian simulation
• Barren Plateaus in Variational Quantum Computing
• Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer
• Fundamental limits of quantum error mitigation
• Can single-reference coupled cluster theory describe static correlation?
• Exponentially More Precise Quantum Simulation of Fermions in the Configuration Interaction Representation
• Quantum algorithms: A survey of applications and end-to-end complexities
• ADAPT-QSCI: Adaptive Construction of an Input State for Quantum-Selected Configuration Interaction
• Accelerated quantum Monte Carlo with mitigated error on noisy quantum computer
• Quantum-centric computation of molecular excited states with extended sample-based quantum diagonalization
• Tensorized Pauli decomposition algorithm
• qSWIFT: High-order randomized compiler for Hamiltonian simulation
• Hamiltonian simulation-based quantum-selected configuration interaction for large-scale electronic structure calculations with a quantum computer
• Handbook for Quantifying Robustness of Magic
• Quantum-selected configuration interaction with time-evolved state
• Pauli Decomposition via the Fast Walsh-Hadamard Transform
• Neural Network Assisted Fermionic Compression Encoding: A Lossy-QSCI Framework for Resource-Efficient Ground-State Simulations
• Purified phase estimation samples spectra efficiently