Avoiding symmetry roadblocks and minimizing the measurement overhead of adaptive variational quantum eigensolvers

• URL: http://arxiv.org/abs/2109.05340v2
• Date: Tue, 6 Jun 2023 09:27:12 GMT
• Title: Avoiding symmetry roadblocks and minimizing the measurement overhead of adaptive variational quantum eigensolvers
• Authors: V. O. Shkolnikov, Nicholas J. Mayhall, Sophia E. Economou, Edwin Barnes
• Abstract summary: Quantum simulation of strongly correlated systems is potentially the most feasible useful application of near-term quantum computers. A promising class of algorithms for this purpose consists of variational quantum eigensolvers (VQEs) Here, we show that this overhead can be reduced to an amount that grows only linearly with the number $n$ of qubits, instead of quartically as in the original ADAPT-VQE.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum simulation of strongly correlated systems is potentially the most feasible useful application of near-term quantum computers. Minimizing quantum computational resources is crucial to achieving this goal. A promising class of algorithms for this purpose consists of variational quantum eigensolvers (VQEs). Among these, problem-tailored versions such as ADAPT-VQE that build variational ans\"atze step by step from a predefined operator pool perform particularly well in terms of circuit depths and variational parameter counts. However, this improved performance comes at the expense of an additional measurement overhead compared to standard VQEs. Here, we show that this overhead can be reduced to an amount that grows only linearly with the number $n$ of qubits, instead of quartically as in the original ADAPT-VQE. We do this by proving that operator pools of size $2n-2$ can represent any state in Hilbert space if chosen appropriately. We prove that this is the minimal size of such "complete" pools, discuss their algebraic properties, and present necessary and sufficient conditions for their completeness that allow us to find such pools efficiently. We further show that, if the simulated problem possesses symmetries, then complete pools can fail to yield convergent results, unless the pool is chosen to obey certain symmetry rules. We demonstrate the performance of such symmetry-adapted complete pools by using them in classical simulations of ADAPT-VQE for several strongly correlated molecules. Our findings are relevant for any VQE that uses an ansatz based on Pauli strings.

Related papers

• High-Entanglement Capabilities for Variational Quantum Algorithms: The Poisson Equation Case [0.07366405857677226]
  This research attempts to resolve problems by utilizing the IonQ Aria quantum computer capabilities. We propose a decomposition of the discretized equation matrix (DPEM) based on 2- or 3-qubit entanglement gates and is shown to have $O(1)$ terms with respect to system size. We also introduce the Globally-Entangling Ansatz which reduces the parameter space of the quantum ansatz while maintaining enough expressibility to find the solution.
  arXiv  Detail & Related papers  (2024-06-14T16:16:50Z)
• Performance analysis of a filtering variational quantum algorithm [0.0]
  Filtering Variational Quantum Eigensolver (F-VQE) is a variational hybrid quantum algorithm designed to solve optimization problems on existing quantum computers. We employ Instantaneous Quantum Polynomial circuits as our parameterized quantum circuits. Despite some observed positive signs, we conclude that significant development is necessary for a practical advantage with F-VQE.
  arXiv  Detail & Related papers  (2024-04-13T08:50:44Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Study of Adaptative Derivative-Assemble Pseudo-Trotter Ansatzes in VQE through qiskit API [0.0]
  Variational Quantum Algorithms (VQAs) were designed to answer the problem of Quantum Phase Estimation Algorithm. ADAPT-VQE determines a quasi-optimal ansatz with a minimal number of parameters. We will compare all of these algorithms on different criterions such as the number of parameters, the accuracy or the number of CNOT gate used on H2 and LiH molecules.
  arXiv  Detail & Related papers  (2022-10-25T16:53:14Z)
• Scaling adaptive quantum simulation algorithms via operator pool tiling [0.0]
  We present a technique called operator pool tiling that facilitates the construction of problem-tailored pools for arbitrarily large problem instances. We demonstrate the method here on strongly correlated quantum spin models in one and two dimensions, finding that ADAPT automatically finds a highly effective ansatz for these systems.
  arXiv  Detail & Related papers  (2022-06-28T18:00:06Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• Simulating Many-Body Systems with a Projective Quantum Eigensolver [0.0]
  We present a new hybrid quantum-classical algorithm for optimizing unitary coupled-cluster wave functions. We also introduce a selected variant of PQE (SPQE) that uses an adaptive ansatz built from arbitrary-order particle-hole operators.
  arXiv  Detail & Related papers  (2021-01-31T00:31:12Z)
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms [105.54048699217668]
  A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries. This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
  arXiv  Detail & Related papers  (2020-08-03T18:00:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.