A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz
- URL: http://arxiv.org/abs/2007.10515v3
- Date: Thu, 27 Aug 2020 13:16:04 GMT
- Title: A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz
- Authors: Alexander Cowtan and Will Simmons and Ross Duncan
- Abstract summary: We describe a compilation strategy for Variational Quantum Eigensolver (VQE) algorithms.
We use the Unitary Coupled Cluster (UCC) ansatz to reduce circuit depth and gate count.
- Score: 68.8204255655161
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We describe a compilation strategy for Variational Quantum Eigensolver (VQE)
algorithms which use the Unitary Coupled Cluster (UCC) ansatz, designed to
reduce circuit depth and gate count. This is achieved by partitioning Pauli
exponential terms into mutually commuting sets. These sets are then
diagonalised using Clifford circuits and synthesised using the phase polynomial
formalism. This strategy reduces cx depth by 75.4% on average, and by up to
89.9%, compared to naive synthesis for a variety of molecules, qubit encodings
and basis sets.
Related papers
- Unitary Synthesis of Clifford+T Circuits with Reinforcement Learning [2.4646794072984477]
Unitary synthesis aims to identify a quantum circuit that represents a given unitary.
We apply the tree-search method Gumbel AlphaZero to solve the problem for a subset of exactly synthesizable Clifford+T unitaries.
Our inference times are around 30 seconds on a single GPU on average, surpassing state-of-the-art algorithms QuantumCircuitOpt and MIN-T-SYNTH for higher qubit numbers.
arXiv Detail & Related papers (2024-04-23T09:37:52Z) - Reinforcement Learning Based Quantum Circuit Optimization via ZX-Calculus [0.0]
We propose a novel Reinforcement Learning (RL) method for optimizing quantum circuits using graph-theoretic simplification rules of ZX-diagrams.
We demonstrate the capacity of our approach by comparing it against the best performing ZX-Calculus-based algorithm for the problem in hand.
Our approach is ready to be used as a valuable tool for the implementation of quantum algorithms in the near-term intermediate-scale range (NISQ)
arXiv Detail & Related papers (2023-12-18T17:59:43Z) - Optimization at the Interface of Unitary and Non-unitary Quantum
Operations in PCOAST [0.3496513815948205]
Pauli-based Circuit Optimization, Analysis and Synthesis Toolchain (PCOAST) introduced as framework for optimizing quantum circuits.
In this paper, we focus on the set of subroutines which look to optimize the PCOAST graph in cases involving unitary and non-unitary operations.
We evaluate the PCOAST optimization subroutines using the Intel Quantum SDK on examples of the Variational Quantum Eigensolver (VQE) algorithm.
arXiv Detail & Related papers (2023-05-16T22:58:14Z) - Iterative Qubit Coupled Cluster using only Clifford circuits [52.77024349608834]
We draw attention to a variant of the iterative qubit coupled cluster (iQCC) method that only uses Clifford circuits.
This method is useful for near-term variational quantum algorithm applications as it generates good initial parameters.
It may also be useful beyond the NISQ era to create short-depth Clifford pre-optimized circuits.
arXiv Detail & Related papers (2022-11-18T20:31:10Z) - Twisted hybrid algorithms for combinatorial optimization [68.8204255655161]
Proposed hybrid algorithms encode a cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity.
We show that for levels $p=2,ldots, 6$, the level $p$ can be reduced by one while roughly maintaining the expected approximation ratio.
arXiv Detail & Related papers (2022-03-01T19:47:16Z) - Communication-Efficient Federated Learning via Quantized Compressed
Sensing [82.10695943017907]
The presented framework consists of gradient compression for wireless devices and gradient reconstruction for a parameter server.
Thanks to gradient sparsification and quantization, our strategy can achieve a higher compression ratio than one-bit gradient compression.
We demonstrate that the framework achieves almost identical performance with the case that performs no compression.
arXiv Detail & Related papers (2021-11-30T02:13:54Z) - Clifford Circuit Optimization with Templates and Symbolic Pauli Gates [11.978356827088595]
The Clifford group is a finite subgroup of the unitary group generated by the Hadamard, the CNOT, and the Phase gates.
Here we consider the problem of finding a short quantum circuit implementing a given Clifford group element.
Our methods aim to minimize the entangling gate count assuming all-to-all qubit connectivity.
arXiv Detail & Related papers (2021-05-05T19:18:35Z) - 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) - Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP.
The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth.
We present empiric evidence for the feasibility of learning the layout method using approximation.
arXiv Detail & Related papers (2020-07-29T05:26:19Z)
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.