Optimized Low-Depth Quantum Circuits for Molecular Electronic Structure
using a Separable Pair Approximation
- URL: http://arxiv.org/abs/2105.03836v3
- Date: Sat, 19 Mar 2022 20:09:09 GMT
- Title: Optimized Low-Depth Quantum Circuits for Molecular Electronic Structure
using a Separable Pair Approximation
- Authors: Jakob S. Kottmann, Al\'an Aspuru-Guzik
- Abstract summary: We present a classically solvable model that leads to optimized low-depth quantum circuits leveraging separable pair approximations.
The obtained circuits are well suited as a baseline circuit for emerging quantum hardware and can, in the long term, provide significantly improved initial states for quantum algorithms.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We present a classically solvable model that leads to optimized low-depth
quantum circuits leveraging separable pair approximations. The obtained
circuits are well suited as a baseline circuit for emerging quantum hardware
and can, in the long term, provide significantly improved initial states for
quantum algorithms. The associated wavefunctions can be represented with linear
memory requirement which allows classical optimization of the circuits and
naturally defines a minimum benchmark for quantum algorithms. In this work, we
employ directly determined pair-natural orbitals within a basis-set-free
approach. This leads to an accurate representation of the one- and many-body
parts for weakly correlated systems and we explicitly illustrate how the model
can be integrated into variational and projective quantum algorithms for
stronger correlated systems.
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) - Surrogate optimization of variational quantum circuits [1.0546736060336612]
Variational quantum eigensolvers are touted as a near-term algorithm capable of impacting many applications.
Finding algorithms and methods to improve convergence is important to accelerate the capabilities of near-term hardware for VQE.
arXiv Detail & Related papers (2024-04-03T18:00:00Z) - 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) - 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) - Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs)
We propose a new protocol for approximating TN states using realistic quantum circuits.
Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
arXiv Detail & Related papers (2022-09-01T17:08:41Z) - Say NO to Optimization: A Non-Orthogonal Quantum Eigensolver [0.0]
A balanced description of both static and dynamic correlations in electronic systems with nearly degenerate low-lying states presents a challenge for multi-configurational methods on classical computers.
We present here a quantum algorithm utilizing the action of correlating cluster operators to provide high-quality wavefunction ans"atze.
arXiv Detail & Related papers (2022-05-18T16:20:36Z) - Numerical Simulations of Noisy Quantum Circuits for Computational
Chemistry [51.827942608832025]
Near-term quantum computers can calculate the ground-state properties of small molecules.
We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
arXiv Detail & Related papers (2021-12-31T16:33:10Z) - Feasible Architecture for Quantum Fully Convolutional Networks [4.849886707973093]
We propose a feasible pure quantum architecture that can be operated on noisy intermediate-scale quantum devices.
Our study represents the successful training of a pure quantum fully convolutional network and discusses advantages by comparing it with the hybrid solution.
arXiv Detail & Related papers (2021-10-05T01:06:54Z) - Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions.
Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
arXiv Detail & Related papers (2021-06-24T20:16:02Z) - Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron
Correlation [58.720142291102135]
We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer.
We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
arXiv Detail & Related papers (2021-06-22T18:00:00Z) - Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices.
We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT)
Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
arXiv Detail & Related papers (2020-10-01T18:14:11Z)
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.