Circuit-Efficient Qubit-Excitation-based Variational Quantum Eigensolver
- URL: http://arxiv.org/abs/2406.11699v1
- Date: Mon, 17 Jun 2024 16:16:20 GMT
- Title: Circuit-Efficient Qubit-Excitation-based Variational Quantum Eigensolver
- Authors: Zhijie Sun, Jie Liu, Zhenyu Li, Jinlong Yang,
- Abstract summary: We present a circuit-efficient implementation of two-body Qubit-Excitation-Based (QEB) operator for building shallow-circuit wave function Ansatze.
This work shows great promise for quantum simulations of electronic structures, leading to improved performance on current quantum hardware.
- Score: 7.865137519552981
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The wave function Ansatze are crucial in the context of the Variational Quantum Eigensolver (VQE). In the Noisy Intermediate-Scale Quantum era, the design of low-depth wave function Ansatze is of great importance for executing quantum simulations of electronic structure on noisy quantum devices. In this work, we present a circuit-efficient implementation of two-body Qubit-Excitation-Based (QEB) operator for building shallow-circuit wave function Ansatze within the framework of Adaptive Derivative-Assembled Pseudo-Trotter (ADAPT) VQE. This new algorithm is applied to study ground- and excited-sate problems for small molecules, demonstrating significant reduction of circuit depths compared to fermionic excitation-based and QEB ADAPT-VQE algorithms. This circuit-efficient algorithm shows great promise for quantum simulations of electronic structures, leading to improved performance on current quantum hardware.
Related papers
- Pulse-based variational quantum optimization and metalearning in superconducting circuits [3.770494165043573]
We introduce pulse-based variational quantum optimization (PBVQO) as a hardware-level framework.
We illustrate the framework by optimizing external superconducting on quantum interference devices.
The synergy between PBVQO and meta-learning provides an advantage over conventional gate-based variational algorithms.
arXiv Detail & Related papers (2024-07-17T15:05:36Z) - Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems.
In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems.
We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
arXiv Detail & Related papers (2024-04-17T11:00:12Z) - 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) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - Reinforcement learning-assisted quantum architecture search for variational quantum algorithms [0.0]
This thesis focuses on identifying functional quantum circuits in noisy quantum hardware.
We introduce a tensor-based quantum circuit encoding, restrictions on environment dynamics to explore the search space of possible circuits efficiently.
In dealing with various VQAs, our RL-based QAS outperforms existing QAS.
arXiv Detail & Related papers (2024-02-21T12:30:39Z) - On-the-fly Tailoring towards a Rational Ansatz Design for Digital
Quantum Simulations [0.0]
It is imperative to develop low depth quantum circuits that are physically realizable in quantum devices.
We develop a disentangled ansatz construction protocol that can dynamically tailor an optimal ansatz.
The construction of the ansatz may potentially be performed in parallel quantum architecture through energy sorting and operator commutativity prescreening.
arXiv Detail & Related papers (2023-02-07T11:22:01Z) - Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most.
We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
arXiv Detail & Related papers (2022-04-12T19:39:31Z) - 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 algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - Improved accuracy on noisy devices by non-unitary Variational Quantum
Eigensolver for chemistry applications [0.0]
We propose a modification of the Variational Quantum Eigensolver algorithm for electronic structure optimization using quantum computers.
A non-unitary operator is combined with the original system Hamiltonian leading to a new variational problem with a simplified wavefunction Ansatz.
arXiv Detail & Related papers (2021-01-22T20:17:37Z) - 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)
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.