Iterative Qubit Coupled Cluster using only Clifford circuits
- URL: http://arxiv.org/abs/2211.10501v1
- Date: Fri, 18 Nov 2022 20:31:10 GMT
- Title: Iterative Qubit Coupled Cluster using only Clifford circuits
- Authors: James Brown, Marc P. Coons, Erika Lloyd, Alexandre Fleury, Krzysztof
Bieniasz, Valentin Senicourt, Arman Zaribafiyan
- Abstract summary: 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.
- Score: 52.77024349608834
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We draw attention to a variant of the iterative qubit coupled cluster (iQCC)
method that only uses Clifford circuits. The iQCC method relies on a small
parameterized wave function ansatz, which takes form as a product of
exponentiated Pauli word operators, to approximate the ground state electronic
energy of a mean field reference state through iterative qubit Hamiltonian
transformations. In this variant of the iQCC method, the wave function ansatz
at each iteration is restricted to a single exponentiated Pauli word operator
and parameter. The Rotosolve algorithm utilizes Hamiltonian expectation values
computed with Clifford circuits to optimize the single-parameter Pauli word
ansatz. Although the exponential growth of Hamiltonian terms is preserved with
this variation of iQCC, we suggest several methods to mitigate this effect.
This method is useful for near-term variational quantum algorithm applications
as it generates good initial parameters by using Clifford circuits which can be
efficiently simulated on a classical computers according to the Gottesman-Knill
theorem. It may also be useful beyond the NISQ era to create short-depth
Clifford pre-optimized circuits that improve the success probability for
fault-tolerant algorithms such as phase estimation.
Related papers
- Simulation of IBM's kicked Ising experiment with Projected Entangled
Pair Operator [71.10376783074766]
We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation.
Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture.
We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
arXiv Detail & Related papers (2023-08-06T10:24:23Z) - Efficient Classical Simulation of Clifford Circuits from Framed Wigner
Functions [4.282159812965446]
Wigner function formalism serves as crucial tool for simulating continuous-variable and odd-prime dimensional quantum circuits.
We introduce a novel classical simulation method for non-adaptive Clifford circuits based on the framed Wigner function.
arXiv Detail & Related papers (2023-07-31T14:02:33Z) - Simulating quantum circuit expectation values by Clifford perturbation
theory [0.0]
We consider the expectation value problem for circuits composed of Clifford gates and non-Clifford Pauli rotations.
We introduce a perturbative approach based on the truncation of the exponentially growing sum of Pauli terms in the Heisenberg picture.
Results indicate that this systematically improvable perturbative method offers a viable alternative to exact methods for approxing expectation values of large near-Clifford circuits.
arXiv Detail & Related papers (2023-06-07T21:42:10Z) - Partitioning Quantum Chemistry Simulations with Clifford Circuits [1.0286890995028481]
Current quantum computing hardware is restricted by the availability of only few, noisy qubits.
We investigate the limits of their classical and near-classical treatment while staying within the framework of quantum circuits.
arXiv Detail & Related papers (2023-03-02T13:05:19Z) - A single $T$-gate makes distribution learning hard [56.045224655472865]
This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits.
We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
arXiv Detail & Related papers (2022-07-07T08:04:15Z) - Clifford Circuit Initialisation for Variational Quantum Algorithms [0.0]
We present an initialisation method for variational quantum algorithms applicable to intermediate scale quantum computers.
We numerically demonstrate the effectiveness of the technique, and how it depends on Hamiltonian structure, number of qubits and circuit depth.
arXiv Detail & Related papers (2022-07-04T15:59:33Z) - 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) - 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) - Quadratic Clifford expansion for efficient benchmarking and
initialization of variational quantum algorithms [0.8808007156832224]
Variational quantum algorithms are considered to be appealing applications of near-term quantum computers.
We propose a perturbative approach for efficient benchmarking of variational quantum algorithms.
arXiv Detail & Related papers (2020-11-19T16:09:00Z) - A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz [68.8204255655161]
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.
arXiv Detail & Related papers (2020-07-20T22:26:16Z)
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.