Leveraging commuting groups for an efficient variational Hamiltonian ansatz
arXiv:2312.08502 · doi:10.1088/2058-9565/adf507
Abstract
Efficiently calculating the low-lying eigenvalues of Hamiltonians, written as sums of Pauli operators, is a fundamental challenge in quantum computing. While various methods have been proposed to reduce the complexity of quantum circuits for this task, there remains room for further improvement. In this article, we introduce a new circuit design using commuting groups within the Hamiltonian to further reduce the circuit complexity of Hamiltonian-based quantum circuits. Our approach involves partitioning the Pauli operators into mutually commuting clusters and finding Clifford unitaries that diagonalize each cluster. We then design an ansatz that uses these Clifford unitaries for efficient switching between the clusters, complemented by a layer of parameterized single qubit rotations for each individual cluster. By conducting numerical simulations, we demonstrate the effectiveness of our method in accurately determining the ground state energy of different quantum chemistry Hamiltonians. Our results highlight the applicability and potential of our approach for designing problem-inspired ansatz for various quantum computing applications.
References in corpus (36)
- SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
- Quantum Computing in the NISQ era and beyond
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Barren plateaus in quantum neural network training landscapes
- The theory of variational hybrid quantum-classical algorithms
- Noisy intermediate-scale quantum (NISQ) algorithms
- Quantum computational chemistry
- Improved Simulation of Stabilizer Circuits
- Quantum Convolutional Neural Networks
- Simulated Quantum Computation of Molecular Energies
- Parameterized quantum circuits as machine learning models
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
- Towards Practical Quantum Variational Algorithms
- qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
- Layerwise learning for quantum neural networks
- Improved classical simulation of quantum circuits dominated by Clifford gates
- Qulacs: a fast and versatile quantum circuit simulator for research purpose
- 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
- Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
- Quantum circuit architecture search for variational quantum algorithms
- Efficient quantum measurement of Pauli operators in the presence of finite sampling error
- Differentiable Quantum Architecture Search
- Measurement reduction in variational quantum algorithms
- Quantum-optimal-control-inspired ansatz for variational quantum algorithms
- Tequila: A platform for rapid development of quantum algorithms
- Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters
- TETRIS-ADAPT-VQE: An adaptive algorithm that yields shallower, denser circuit ansätze
- Optimized Low-Depth Quantum Circuits for Molecular Electronic Structure using a Separable Pair Approximation
- Partitioning Quantum Chemistry Simulations with Clifford Circuits
- Information flow in parameterized quantum circuits
- Toward Reliability in the NISQ Era: Robust Interval Guarantee for Quantum Measurements on Approximate States
- Hamiltonian-based graph-state ansatz for variational quantum algorithms