Capacity and quantum geometry of parametrized quantum circuits
- URL: http://arxiv.org/abs/2102.01659v1
- Date: Tue, 2 Feb 2021 18:16:57 GMT
- Title: Capacity and quantum geometry of parametrized quantum circuits
- Authors: Tobias Haug, Kishor Bharti, M. S. Kim
- Abstract summary: Parametrized quantum circuits can be effectively implemented on current devices.
We evaluate the capacity and trainability of these circuits using the geometric structure of the parameter space.
Our results enhance the understanding of parametrized quantum circuits for improving variational quantum algorithms.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: To harness the potential of noisy intermediate-scale quantum devices, it is
paramount to find the best type of circuits to run hybrid quantum-classical
algorithms. Key candidates are parametrized quantum circuits that can be
effectively implemented on current devices. Here, we evaluate the capacity and
trainability of these circuits using the geometric structure of the parameter
space via the effective quantum dimension, which reveals the expressive power
of circuits in general as well as of particular initialization strategies. We
assess the representation power of various popular circuit types and find
striking differences depending on the type of entangling gates used. Particular
circuits are characterized by scaling laws in their expressiveness. We identify
a transition in the quantum geometry of the parameter space, which leads to a
decay of the quantum natural gradient for deep circuits. For shallow circuits,
the quantum natural gradient can be orders of magnitude larger in value
compared to the regular gradient; however, both of them can suffer from
vanishing gradients. By tuning a fixed set of circuit parameters to randomized
ones, we find a region where the circuit is expressive, but does not suffer
from barren plateaus, hinting at a good way to initialize circuits. Our results
enhance the understanding of parametrized quantum circuits for improving
variational quantum algorithms.
Related papers
- QAdaPrune: Adaptive Parameter Pruning For Training Variational Quantum Circuits [2.3332157823623403]
emphQAdaPrune is an adaptive parameter pruning algorithm that automatically determines the threshold and then intelligently prunes the redundant and non-performing parameters.
We show that the resulting sparse parameter sets yield quantum circuits that perform comparably to the unpruned quantum circuits.
arXiv Detail & Related papers (2024-08-23T19:57:40Z) - Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.
We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.
We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
arXiv Detail & Related papers (2024-05-03T17:32:55Z) - 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) - Symmetry-Based Quantum Circuit Mapping [2.51705778594846]
We introduce a quantum circuit remapping algorithm that leverages the intrinsic symmetries in quantum processors.
This algorithm identifies all topologically equivalent circuit mappings by constraining the search space using symmetries and accelerates the scoring of each mapping using vector computation.
arXiv Detail & Related papers (2023-10-27T10:04:34Z) - 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) - Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most.
We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
arXiv Detail & Related papers (2022-04-12T19:39:31Z) - Gaussian initializations help deep variational quantum circuits escape
from the barren plateau [87.04438831673063]
Variational quantum circuits have been widely employed in quantum simulation and quantum machine learning in recent years.
However, quantum circuits with random structures have poor trainability due to the exponentially vanishing gradient with respect to the circuit depth and the qubit number.
This result leads to a general belief that deep quantum circuits will not be feasible for practical tasks.
arXiv Detail & Related papers (2022-03-17T15:06:40Z) - Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task.
Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate.
The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
arXiv Detail & Related papers (2021-06-06T13:15:25Z) - QUANTIFY: A framework for resource analysis and design verification of
quantum circuits [69.43216268165402]
QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits.
It is based on Google Cirq and is developed with Clifford+T circuits in mind.
For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
arXiv Detail & Related papers (2020-07-21T15:36:25Z) - Reducing the amount of single-qubit rotations in VQE and related
algorithms [0.0]
We show that the number of single-qubit rotations in parameterized quantum circuits can be decreased without compromising the relative expressibility or entangling capability of the circuit.
We also show that the performance of a variational quantum eigensolver is unaffected by a similar decrease in single-qubit rotations.
arXiv Detail & Related papers (2020-05-27T18:00:01Z)
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.