CNOT-Efficient Circuits for Arbitrary Rank Many-Body Fermionic and Qubit
Excitations
- URL: http://arxiv.org/abs/2210.05771v1
- Date: Tue, 11 Oct 2022 20:25:42 GMT
- Title: CNOT-Efficient Circuits for Arbitrary Rank Many-Body Fermionic and Qubit
Excitations
- Authors: Ilias Magoulas, Francesco A. Evangelista
- Abstract summary: Efficient quantum circuits are necessary for realizing quantum algorithms on noisy intermediate-scale quantum devices.
In this work, we extend CNOT-efficient quantum circuits to arbitrary excitation ranks.
We show that both FEB- and QEB-SPQE decrease the number of CNOT gates compared to traditional SPQE by factors as large as 15.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Efficient quantum circuits are necessary for realizing quantum algorithms on
noisy intermediate-scale quantum devices. Fermionic excitations entering
unitary coupled-cluster (UCC) ans\"atze give rise to quantum circuits
containing CNOT "staircases" whose number scales exponentially with the
excitation rank. Recently, Yordanov et al. [Phys. Rev. A 102, 062612 (2020);
Commun. Phys. 4, 228 (2021)] constructed CNOT-efficient quantum circuits for
both fermionic- (FEB) and qubit-excitation-based (QEB) singles and doubles and
illustrated their usefulness in adaptive derivative-assembled
pseudo-Trotterized variational quantum eigensolver (ADAPT-VQE) simulations. In
this work, we extend these CNOT-efficient quantum circuits to arbitrary
excitation ranks. To illustrate the benefits of these compact FEB and QEB
quantum circuits, we perform numerical simulations using the recently developed
selected projective quantum eigensolver (SPQE) approach, which relies on an
adaptive UCC ansatz built from arbitrary-order particle-hole excitation
operators. We show that both FEB- and QEB-SPQE decrease the number of CNOT
gates compared to traditional SPQE by factors as large as 15. At the same time,
QEB-SPQE requires, in general, more ansatz parameters than FEB-SPQE, in
particular those corresponding to higher-than-double excitations, resulting in
quantum circuits with larger CNOT counts. Although ADAPT-VQE generates quantum
circuits with fewer CNOTs than SPQE, SPQE requires orders of magnitude less
residual element evaluations than gradient element evaluations in ADAPT-VQE.
Related papers
- A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - 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) - Variational quantum eigensolver for closed-shell molecules with
non-bosonic corrections [6.3235499003745455]
We introduce a simple correction scheme in the electron correlation model approximated by the geometrical mean of the bosonic terms.
We find our non-bosonic correction method reaches reliable quantum chemistry simulations at least for the tested systems.
arXiv Detail & Related papers (2023-10-11T16:47:45Z) - Modular Cluster Circuits for the Variational Quantum Eigensolver [0.0]
In the present work, we introduce a modular 2-qubit cluster circuit that allows for the design of a shallow-depth quantum circuit.
The design was tested on the H2, (H2) and LiH molecules, as well as the finite-size transverse-field Ising model.
arXiv Detail & Related papers (2023-05-08T02:33:33Z) - Quantum Imitation Learning [74.15588381240795]
We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL.
We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL)
Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
arXiv Detail & Related papers (2023-04-04T12:47:35Z) - 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) - Orbital-optimized pair-correlated electron simulations on trapped-ion
quantum computers [0.471876092032107]
Variational quantum eigensolvers (VQE) are among the most promising approaches for solving electronic structure problems on quantum computers.
A critical challenge for VQE in practice is that one needs to strike a balance between the expressivity of the VQE ansatz versus the number of quantum gates required to implement the ansatz.
We run end-to-end VQE algorithms with up to 12 qubits and 72 variational parameters - the largest full VQE simulation with a correlated wave function on quantum hardware.
arXiv Detail & Related papers (2022-12-05T18:40:54Z) - 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) - Natural parameterized quantum circuit [0.0]
We introduce the natural parameterized quantum circuit (NPQC) that can be initialised with a Euclidean quantum geometry.
For a general class of quantum circuits, the NPQC has the minimal quantum Cram'er-Rao bound.
Our results can be used to enhance currently available quantum processors.
arXiv Detail & Related papers (2021-07-29T14:54:04Z) - Variational Quantum Eigensolver with Reduced Circuit Complexity [3.1158760235626946]
We present a novel approach to reduce quantum circuit complexity in VQE for electronic structure calculations.
Our algorithm, called ClusterVQE, splits the initial qubit space into subspaces (qubit clusters) which are further distributed on individual quantum circuits.
The new algorithm simultaneously reduces the number of qubits and circuit depth, making it a potential leader for quantum chemistry simulations on NISQ devices.
arXiv Detail & Related papers (2021-06-14T17:23:46Z) - 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.