Compact fermionic quantum state preparation with a natural-orbitalizing variational quantum eigensolving scheme

• URL: http://arxiv.org/abs/2406.14170v1
• Date: Thu, 20 Jun 2024 10:23:28 GMT
• Title: Compact fermionic quantum state preparation with a natural-orbitalizing variational quantum eigensolving scheme
• Authors: Pauline Besserve, Michel Ferrero, Thomas Ayral,
• Abstract summary: Near-term quantum state preparation is typically realized by means of the variational quantum eigensolver (VQE) algorithm. We present a refined VQE scheme that consists in topping VQE with state-informed updates of the elementary fermionic modes. For a fixed circuit structure, the method is shown to enhance the capabilities of the circuit to reach a state close to the target state without incurring too much overhead from shot noise.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Assemblies of strongly interacting fermions, whether in a condensed-matter or a quantum chemistry context, range amongst the most promising candidate systems for which quantum computing platforms could provide an advantage. Near-term quantum state preparation is typically realized by means of the variational quantum eigensolver (VQE) algorithm. One of the main challenges to a successful implementation of VQE lies in the sensitivity to noise exhibited by deep variational circuits. On the other hand, sufficient depth must be allowed to be able to reach a good approximation to the target state. In this work, we present a refined VQE scheme that consists in topping VQE with state-informed updates of the elementary fermionic modes (spin-orbitals). These updates consist in moving to the natural-orbital basis of the current, converged variational state, a basis we argue eases the task of state preparation. We test the method on the Hubbard model in the presence of experimentally relevant noise levels. For a fixed circuit structure, the method is shown to enhance the capabilities of the circuit to reach a state close to the target state without incurring too much overhead from shot noise. Moreover, coupled with an adaptive VQE scheme that constructs the circuit on the fly, we evidence reduced requirements on the depth of the circuit as the orbitals get updated.

Related papers

• A circuit-generated quantum subspace algorithm for the variational quantum eigensolver [0.0]
  We propose combining quantum subspace techniques with the variational quantum eigensolver (VQE) In our approach, the parameterized quantum circuit is divided into a series of smaller subcircuits. The sequential application of these subcircuits to an initial state generates a set of wavefunctions that we use as a quantum subspace to obtain high-accuracy groundstate energies.
  arXiv  Detail & Related papers  (2024-04-09T18:00:01Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Sparse Quantum State Preparation for Strongly Correlated Systems [0.0]
  In principle, the encoding of the exponentially scaling many-electron wave function onto a linearly scaling qubit register offers a promising solution to overcome the limitations of traditional quantum chemistry methods. An essential requirement for ground state quantum algorithms to be practical is the initialisation of the qubits to a high-quality approximation of the sought-after ground state. Quantum State Preparation (QSP) allows the preparation of approximate eigenstates obtained from classical calculations, but it is frequently treated as an oracle in quantum information.
  arXiv  Detail & Related papers  (2023-11-06T18:53:50Z)
• Efficient Quantum Circuits based on the Quantum Natural Gradient [0.0]
  Efficient preparation of arbitrary entangled quantum states is crucial for quantum computation. We propose symmetry-conserving modified quantum approximate optimization algorithm(SCom-QAOA) circuits. The proposed scheme enlarges the set of the initial states accessible for variational quantum algorithms and widens the scope of investigation of non-equilibrium phenomena in quantum simulators.
  arXiv  Detail & Related papers  (2023-10-16T16:08:57Z)
• Ground or Excited State: a State-Specific Variational Quantum Eigensolver for Them All [0.0]
  Variational Quantum Eigensolver (VQE) provides a lucrative platform to determine molecular energetics in quantum devices. We propose a unified VQE framework that treats the ground and excited states in the same footings. We introduce the notion of totally symmetric, spin-scalar unitary which maintains the purity of the reference at each step of the optimization.
  arXiv  Detail & Related papers  (2023-08-21T13:39:58Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• State Preparation Boosters for Early Fault-Tolerant Quantum Computation [0.0]
  We introduce the method of ground state boosting, which uses a limited-depth quantum circuit to reliably increase the overlap with the ground state. This circuit, which we call a booster, can be used to augment an ansatz from VQE or be used as a stand-alone state preparation method.
  arXiv  Detail & Related papers  (2022-02-14T19:00:13Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• 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.