Quadratic Clifford expansion for efficient benchmarking and
initialization of variational quantum algorithms
- URL: http://arxiv.org/abs/2011.09927v2
- Date: Mon, 14 Dec 2020 08:14:29 GMT
- Title: Quadratic Clifford expansion for efficient benchmarking and
initialization of variational quantum algorithms
- Authors: Kosuke Mitarai and Yasunari Suzuki and Wataru Mizukami and Yuya O.
Nakagawa and Keisuke Fujii
- Abstract summary: 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.
- Score: 0.8808007156832224
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Variational quantum algorithms are considered to be appealing applications of
near-term quantum computers. However, it has been unclear whether they can
outperform classical algorithms or not. To reveal their limitations, we must
seek a technique to benchmark them on large scale problems. Here, we propose a
perturbative approach for efficient benchmarking of variational quantum
algorithms. The proposed technique performs perturbative expansion of a circuit
consisting of Clifford and Pauli rotation gates, which is enabled by exploiting
the classical simulatability of Clifford circuits. Our method can be applied to
a wide family of parameterized quantum circuits consisting of Clifford gates
and single-qubit rotation gates. The approximate optimal parameter obtained by
the method can also serve as an initial guess for further optimizations on a
quantum device, which can potentially solve the so-called ``barren-plateau''
problem. As the first application of the method, we perform a benchmark of
so-called hardware-efficient-type ansatzes when they are applied to the VQE of
one-dimensional hydrogen chains up to $\mathrm{H}_{24}$, which corresponds to
$48$-qubit system, using a standard workstation.
Related papers
- QuCLEAR: Clifford Extraction and Absorption for Significant Reduction in Quantum Circuit Size [8.043057448895343]
Currently available quantum devices suffer from noisy quantum gates, which degrade the fidelity of executed quantum circuits.
We present QuCLEAR, a compilation framework designed to optimize quantum circuits.
arXiv Detail & Related papers (2024-08-23T18:03:57Z) - A quantum implementation of high-order power method for estimating geometric entanglement of pure states [39.58317527488534]
This work presents a quantum adaptation of the iterative higher-order power method for estimating the geometric measure of entanglement of multi-qubit pure states.
It is executable on current (hybrid) quantum hardware and does not depend on quantum memory.
We study the effect of noise on the algorithm using a simple theoretical model based on the standard depolarising channel.
arXiv Detail & Related papers (2024-05-29T14:40:24Z) - Hybrid quantum-classical and quantum-inspired classical algorithms for
solving banded circulant linear systems [0.8192907805418583]
We present an efficient algorithm based on convex optimization of combinations of quantum states to solve for banded circulant linear systems.
By decomposing banded circulant matrices into cyclic permutations, our approach produces approximate solutions to such systems with a combination of quantum states linear to $K$.
We validate our methods with classical simulations and actual IBM quantum computer implementation, showcasing their applicability for solving physical problems such as heat transfer.
arXiv Detail & Related papers (2023-09-20T16:27:16Z) - Efficient DCQO Algorithm within the Impulse Regime for Portfolio
Optimization [41.94295877935867]
We propose a faster digital quantum algorithm for portfolio optimization using the digitized-counterdiabatic quantum optimization (DCQO) paradigm.
Our approach notably reduces the circuit depth requirement of the algorithm and enhances the solution accuracy, making it suitable for current quantum processors.
We experimentally demonstrate the advantages of our protocol using up to 20 qubits on an IonQ trapped-ion quantum computer.
arXiv Detail & Related papers (2023-08-29T17:53:08Z) - Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits.
This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
arXiv Detail & Related papers (2023-02-09T14:05:18Z) - Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
An ideal state preparation protocol can be characterized by being easily generated classically.
We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC)
We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
arXiv Detail & Related papers (2022-11-18T20:31:10Z) - 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) - Quantum Speedup for Higher-Order Unconstrained Binary Optimization and
MIMO Maximum Likelihood Detection [2.5272389610447856]
We propose a quantum algorithm that supports a real-valued higher-order unconstrained binary optimization problem.
The proposed algorithm is capable of reducing the query complexity in the classical domain and providing a quadratic speedup in the quantum domain.
arXiv Detail & Related papers (2022-05-31T00:14:49Z) - Efficient Classical Computation of Quantum Mean Values for Shallow QAOA
Circuits [15.279642278652654]
We present a novel graph decomposition based classical algorithm that scales linearly with the number of qubits for the shallow QAOA circuits.
Our results are not only important for the exploration of quantum advantages with QAOA, but also useful for the benchmarking of NISQ processors.
arXiv Detail & Related papers (2021-12-21T12:41:31Z) - 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) - Improving the Performance of Deep Quantum Optimization Algorithms with
Continuous Gate Sets [47.00474212574662]
Variational quantum algorithms are believed to be promising for solving computationally hard problems.
In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances.
Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
arXiv Detail & Related papers (2020-05-11T17:20:51Z)
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.