Related papers: Entanglement Production and Convergence Properties of the Variational Quantum Eigensolver

Entanglement Production and Convergence Properties of the Variational Quantum Eigensolver

URL: http://arxiv.org/abs/2003.12490v2
Date: Mon, 26 Oct 2020 09:52:13 GMT
Title: Entanglement Production and Convergence Properties of the Variational Quantum Eigensolver
Authors: Andreas J. C. Woitzik, Panagiotis Kl. Barkoutsos, Filip Wudarski, Andreas Buchleitner, Ivano Tavernelli
Abstract summary: We use the Variational Quantum Eigensolver (VQE) algorithm to determine the ground state energies of two-dimensional model fermionic systems. In particular, we focus on the nature of the entangler blocks which provide the most efficient convergence to the system ground state. We show that the number of gates required to reach a solution within an error follows the Solovay-Kitaev scaling.
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: We perform a systematic investigation of variational forms (wave function Ans\"atze), to determine the ground state energies and properties of two-dimensional model fermionic systems on triangular lattices (with and without periodic boundary conditions), using the Variational Quantum Eigensolver (VQE) algorithm. In particular, we focus on the nature of the entangler blocks which provide the most efficient convergence to the system ground state inasmuch as they use the minimal number of gate operations, which is key for the implementation of this algorithm in NISQ computers. Using the concurrence measure, the amount of entanglement of the register qubits is monitored during the entire optimization process, illuminating its role in determining the efficiency of the convergence. Finally, we investigate the scaling of the VQE circuit depth as a function of the desired energy accuracy. We show that the number of gates required to reach a solution within an error $\varepsilon$ follows the Solovay-Kitaev scaling, $\mathcal{O}(\log^c(1/\varepsilon))$, with an exponent $c = 1.31 {\rm{\pm}}0.13$.

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)
High-precision and low-depth eigenstate property estimation: theory and resource estimation [2.6811507121199325]
Estimating the eigenstate properties of quantum many-body systems is a long-standing, challenging problem for both classical and quantum computing. Here, we present a full-stack design of a random sampling algorithm for estimating the eigenenergy and the observable expectations on the eigenstates.
arXiv Detail & Related papers (2024-06-06T17:54:26Z)
Polynomial-time Solver of Tridiagonal QUBO and QUDO problems with Tensor Networks [41.94295877935867]
We present an algorithm for solving tridiagonal Quadratic Unconstrained Binary Optimization (QUBO) problems and Quadratic Unconstrained Discrete Optimization (QUDO) problems with one-neighbor interactions. Our method is based on the simulation of a quantum state to which we will apply an imaginary time evolution and perform a series of partial traces to obtain the state of maximum amplitude.
arXiv Detail & Related papers (2023-09-19T10:45:15Z)
GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
arXiv Detail & Related papers (2023-07-17T13:37:18Z)
Classically efficient regimes in measurement based quantum computation performed using diagonal two qubit gates and cluster measurements [0.0]
We explicitly compute $lambda$ for any two qubit diagonal gate, thereby extending the computation of arXiv:2201.07655v2 beyond CZ gates. For any finite degree graph this allows us to describe a two parameter family of pure entangled quantum states.
arXiv Detail & Related papers (2023-07-04T16:09:24Z)
Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
arXiv Detail & Related papers (2023-02-28T07:36:02Z)
Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z)
Adaptive variational quantum eigensolvers for highly excited states [4.038971004196936]
Highly excited states of quantum many-body systems are central objects in the study of quantum dynamics and thermalization. We propose an adaptive variational algorithm, adaptive VQE-X, that self-generates a variational ansatz for arbitrary eigenstates of a many-body Hamiltonian $H$.
arXiv Detail & Related papers (2021-04-26T15:03:51Z)
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)
Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
arXiv Detail & Related papers (2020-05-11T17:20:51Z)

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