Corpus ID: 221150325

Mutual information-assisted Adaptive Variational Quantum Eigensolver Ansatz Construction

  title={Mutual information-assisted Adaptive Variational Quantum Eigensolver Ansatz Construction},
  author={Zijian Zhang and T. H. Kyaw and Jakob S. Kottmann and M. Degroote and A. Aspuru-Guzik},
  journal={arXiv: Quantum Physics},
Adaptive construction of ansatz circuits offers a promising route towards applicable variational quantum eigensolvers (VQE) on near-term quantum hardware. Those algorithms aim to build up optimal circuits for a certain problem. Ansatz circuits are adaptively constructed by selecting and adding entanglers from a predefined pool in those algorithms. In this work, we propose a way to construct entangler pools with reduced size for those algorithms by leveraging classical algorithms. Our method… Expand

Figures and Tables from this paper

On Assessing the Quantum Advantage for MaxCut Provided by Quantum Neural Network Ans\"atze
In this work we design a class of Ansätze to solve MaxCut on a parameterized quantum circuit (PQC). Gaining inspiration from properties of quantum optimal control landscapes, we consider the presenceExpand
A semi-agnostic ansatz with variable structure for quantum machine learning
This paper presents a meta-analyses of the Fisica Teorica: Informacio i Fenomens Quantics, a large-scale probabilistic simulation of the response of the immune system to quantum entanglement. Expand
Simulating Many-Body Systems with a Projective Quantum Eigensolver
We present a new hybrid quantum-classical algorithm for optimizing unitary coupled-cluster (UCC) wave functions deemed the projective quantum eigensolver (PQE), amenable to near-term noisy quantumExpand
Towards favorable landscapes in quantum combinatorial optimization
The performance of variational quantum algorithms relies on the success of using quantum and classical computing resources in tandem. Here, we study how these quantum and classical componentsExpand
Correlation-Informed Permutation of Qubits for Reducing Ansatz Depth in the Variational Quantum Eigensolver
This work proposes a novel approach to reduce ansatz circuit depth in Variational Quantum Eigensolver by adding an additional optimization loop to VQE that permutes qubits in order to solve for the qubit Hamiltonian that minimizes long-range correlations in the ground state. Expand
From Pulses to Circuits and Back Again: A Quantum Optimal Control Perspective on Variational Quantum Algorithms
A unified picture is suggested of several ways that the different levels of abstraction may be connected, in order to facilitate the application of quantum optimal control theory to VQA challenges associated with ansatz selection, optimization landscapes, noise, and robustness. Expand


The theory of variational hybrid quantum-classical algorithms
Many quantumalgorithms have daunting resource requirements when compared towhat is available today. To address this discrepancy, a quantum-classical hybrid optimization scheme known as ‘theExpand
Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz
The variational quantum eigensolver (VQE) algorithm combines the ability of quantum computers to efficiently compute expectation values with a classical optimization routine in order to approximateExpand
Iterative Qubit Coupled Cluster approach with efficient screening of generators.
An iterative version of the qubit coupled cluster (QCC) method to find ground electronic energies of molecules on noisy intermediate-scale quantum (NISQ) devices is proposed and an algorithm for constructing this set that scales linearly with the size of the Hamiltonian is reported. Expand
An adaptive variational algorithm for exact molecular simulations on a quantum computer
A new variational hybrid quantum-classical algorithm which allows the system being simulated to determine its own optimal state, and highlights the potential of the adaptive algorithm for exact simulations with present-day and near-term quantum hardware. Expand
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
The experimental optimization of Hamiltonian problems with up to six qubits and more than one hundred Pauli terms is demonstrated, determining the ground-state energy for molecules of increasing size, up to BeH2. Expand
A variational eigenvalue solver on a photonic quantum processor
The proposed approach drastically reduces the coherence time requirements and combines this method with a new approach to state preparation based on ansätze and classical optimization, enhancing the potential of quantum resources available today and in the near future. Expand
Tapering off qubits to simulate fermionic Hamiltonians
We discuss encodings of fermionic many-body systems by qubits in the presence of symmetries. Such encodings eliminate redundant degrees of freedom in a way that preserves a simple structure of theExpand
Qubit Coupled Cluster Method: A Systematic Approach to Quantum Chemistry on a Quantum Computer.
A qubit coupled cluster (QCC) method that starts directly in the qubit space and uses energy response estimates for ranking the importance of individual entanglers for the variational energy minimization and provides an exact factorization of a unitary rotation of more than two qubits to a product of two-qubit unitary rotations. Expand
A Comparison of the Bravyi–Kitaev and Jordan–Wigner Transformations for the Quantum Simulation of Quantum Chemistry
This paper uses 86 molecular systems to demonstrate that the use of the Bravyi–Kitaev transformation is typically at least approximately as efficient as the canonical Jordan–Wigner transformation and results in substantially reduced gate count estimates when performing limited circuit optimizations. Expand
Optimizing the density-matrix renormalization group method using quantum information entropy
In order to optimize the ordering of the lattice sites in the momentum space and quantum chemistry versions of the density-matrix renormalization group (DMRG) method we have studied the separabilityExpand