Abstract:With the advent of hybrid quantum classical algorithms using parameterized quantum circuits, the question of how to optimize these algorithms and circuits emerges. In this paper, it is shown 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. It is also shown that the performance of a variational quantum eigensolver (VQE) is unaffected by a similar decrease in single-qubit rotation… Show more
“…This question of circuit expressivity is an active area of research, see Refs. [22][23][24][25][26][27][28][29][30][31][32] and references therein. In particular, it has been proposed to assess the expressivity of a parametric quantum circuit by quantifying the circuit's ability to uniformly reach the full Hilbert space [23], which was accomplished by computing statistical properties based on randomly sampling states from a given circuit template.…”
Section: Introductionmentioning
confidence: 99%
“…In particular, it has been proposed to assess the expressivity of a parametric quantum circuit by quantifying the circuit's ability to uniformly reach the full Hilbert space [23], which was accomplished by computing statistical properties based on randomly sampling states from a given circuit template. Using this ansatz, it has been shown that the number of single-qubit rotations in certain parameterized quantum circuits can be decreased without compromising the expressivity of the circuit [26]. On the other hand, it has been shown that the inclusion of redundant parametrized gates can make the quantum circuits more resilient to noise [29,32].…”
Parametric quantum circuits play a crucial role in the performance of many variational quantum algorithms. To successfully implement such algorithms, one must design efficient quantum circuits that sufficiently approximate the solution space while maintaining a low parameter count and circuit depth. In this paper, develop a method to analyze the dimensional expressivity of parametric quantum circuits. Our technique allows for identifying superfluous parameters in the circuit layout and for obtaining a maximally expressive ansatz with a minimum number of parameters. Using a hybrid quantum-classical approach, we show how to efficiently implement the expressivity analysis using quantum hardware, and we provide a proof of principle demonstration of this procedure on IBM's quantum hardware. We also discuss the effect of symmetries and demonstrate how to incorporate or remove symmetries from the parametrized ansatz.
“…This question of circuit expressivity is an active area of research, see Refs. [22][23][24][25][26][27][28][29][30][31][32] and references therein. In particular, it has been proposed to assess the expressivity of a parametric quantum circuit by quantifying the circuit's ability to uniformly reach the full Hilbert space [23], which was accomplished by computing statistical properties based on randomly sampling states from a given circuit template.…”
Section: Introductionmentioning
confidence: 99%
“…In particular, it has been proposed to assess the expressivity of a parametric quantum circuit by quantifying the circuit's ability to uniformly reach the full Hilbert space [23], which was accomplished by computing statistical properties based on randomly sampling states from a given circuit template. Using this ansatz, it has been shown that the number of single-qubit rotations in certain parameterized quantum circuits can be decreased without compromising the expressivity of the circuit [26]. On the other hand, it has been shown that the inclusion of redundant parametrized gates can make the quantum circuits more resilient to noise [29,32].…”
Parametric quantum circuits play a crucial role in the performance of many variational quantum algorithms. To successfully implement such algorithms, one must design efficient quantum circuits that sufficiently approximate the solution space while maintaining a low parameter count and circuit depth. In this paper, develop a method to analyze the dimensional expressivity of parametric quantum circuits. Our technique allows for identifying superfluous parameters in the circuit layout and for obtaining a maximally expressive ansatz with a minimum number of parameters. Using a hybrid quantum-classical approach, we show how to efficiently implement the expressivity analysis using quantum hardware, and we provide a proof of principle demonstration of this procedure on IBM's quantum hardware. We also discuss the effect of symmetries and demonstrate how to incorporate or remove symmetries from the parametrized ansatz.
“…Unlike the initial circuit energy L(θ 0 ) that cannot differ much from the ensemble average (7), the energy L(θ τ ) at an intermediate time τ should significantly deviate almost by definition (27) of the steepest descent method. It indicates how distinctive the intermediate states |ψ(θ τ ) are from initial states, thus requiring independent exploration of their geometric properties.…”
Section: Optimization Trajectorymentioning
confidence: 99%
“…The curves in Figures 3a and 3b are respectively the energy gap ∆E and Renyi-2 entanglement entropy R (2) evaluated under an equal partitioning of n = 12 qubits. The blue/orange colors indicate whether the displayed values are before/after applying the gradient descent (27) to circuit parameters τ = 5000 times. When the average entanglement entropy of the pre-optimization states saturates to the maximum possible value, as the cases for p ≤ 0.1, Figure 3a exhibits the formulation of orange dot clusters around ∆E ∼ 9.…”
Section: A Circuit State Entanglementmentioning
confidence: 99%
“…When the average entanglement entropy of the pre-optimization states saturates to the maximum possible value, as the cases for p ≤ 0.1, Figure 3a exhibits the formulation of orange dot clusters around ∆E ∼ 9. It means the failure of many circuit instances in reducing ∆E via the local gradient search (27). The gradient descent fails to make a trajectory towards the Ising ground state, while stopping at a suboptimal extremum in the quantum energy landscape.…”
We study the effects of entanglement and control parameters on the energy landscape and optimization performance of the variational quantum circuit. Through a systematic analysis of the Hessian spectrum, we characterize the local geometry of the energy landscape at a random point and along an optimization trajectory. We argue that decreasing the entangling capability and increasing the number of circuit parameters have the same qualitative effect on the Hessian eigenspectrum. Both the low-entangling capability and the abundance of control parameters increase the curvature of non-flat directions, contributing to the efficient search of area-law entangled ground states as to the optimization accuracy and the convergence speed.
The variational quantum eigensolver is a prominent hybrid quantum‐classical algorithm expected to impact near‐term quantum devices. They are usually based on a circuit ansatz consisting of parameterized single‐qubit gates and fixed two‐qubit gates. The effect of parameterized two‐qubit gates in the variational quantum eigensolver is studied. A variational quantum eigensolver algorithm is simulated using fixed and parameterized two‐qubit gates in the circuit ansatz and it is shown that the parameterized versions outperform the fixed versions, both when it comes to best energy and reducing outliers, for a range of Hamiltonians with applications in quantum chemistry and materials science.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.