Optimizing Parameterized Quantum Circuits with Free-Axis Selection

• URL: http://arxiv.org/abs/2104.14875v2
• Date: Wed, 22 Feb 2023 05:53:07 GMT
• Title: Optimizing Parameterized Quantum Circuits with Free-Axis Selection
• Authors: Hiroshi C. Watanabe and Rudy Raymond and Yu-ya Ohnishi and Eriko Kaminishi and Michihiko Sugawara
• Abstract summary: Variational quantum algorithms, which utilize Parametrized Quantum Circuits (PQCs), are promising tools to achieve quantum advantage for optimization problems on near-term quantum devices. We propose a method to construct a PQC by continuous parametrization of both the angles and the axes of its single-qubit rotation gates. We show the simplified free-axis selection method has better expressibility against other structural optimization methods when measured with Kullback-Leibler (KL) divergence.
• Score: 3.265379077082569
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Variational quantum algorithms, which utilize Parametrized Quantum Circuits (PQCs), are promising tools to achieve quantum advantage for optimization problems on near-term quantum devices. Their PQCs have been conventionally constructed from parametrized rotational angles of single-qubit gates around predetermined set of axes, and two-qubit entangling gates, such as CNOT gates. We propose a method to construct a PQC by continuous parametrization of both the angles and the axes of its single-qubit rotation gates. The method is based on the observation that when rotational angles are fixed, optimal axes of rotations can be computed by solving a system of linear equations whose coefficients can be determined from the PQC with small computational overhead. The method can be further simplified to select axes freely from continuous parameters with rotational angles fixed to half rotation or $\pi$. We show the simplified free-axis selection method has better expressibility against other structural optimization methods when measured with Kullback-Leibler (KL) divergence. We also demonstrate PQCs with free-axis selection are more effective to search the ground states of Hamiltonians for quantum chemistry and combinatorial optimization. Because free-axis selection allows designing PQCs without specifying their single-qubit rotational axes, it may significantly improve the handiness of PQCs.

Related papers

• Optimizing a parameterized controlled gate with Free Quaternion Selection [0.4353365283165517]
  In this study, we propose an algorithm to estimate the optimal parameters for locally minimizing the cost value of a single-qubit gate. To benchmark the performance, we apply the proposed method to various optimization problems, including the Variational Eigensolver (VQE) for Ising and molecular Hamiltonians.
  arXiv  Detail & Related papers  (2024-09-20T14:46:00Z)
• Beyond Quantum Annealing: Optimal control solutions to MaxCut problems [0.7864304771129751]
  Quantum Annealing (QA) relies on mixing two Hamiltonian terms, a simple driver and a complex problem Hamiltonian, in a linear combination. We present different techniques for improving on the linear-schedule along two directions, conceptually distinct but leading to similar outcomes.
  arXiv  Detail & Related papers  (2024-05-14T14:08:55Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
  The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
  arXiv  Detail & Related papers  (2023-07-17T13:37:18Z)
• Constrained Optimization via Exact Augmented Lagrangian and Randomized Iterative Sketching [55.28394191394675]
  We develop an adaptive inexact Newton method for equality-constrained nonlinear, nonIBS optimization problems. We demonstrate the superior performance of our method on benchmark nonlinear problems, constrained logistic regression with data from LVM, and a PDE-constrained problem.
  arXiv  Detail & Related papers  (2023-05-28T06:33:37Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Gradient-descent quantum process tomography by learning Kraus operators [63.69764116066747]
  We perform quantum process tomography (QPT) for both discrete- and continuous-variable quantum systems. We use a constrained gradient-descent (GD) approach on the so-called Stiefel manifold during optimization to obtain the Kraus operators. The GD-QPT matches the performance of both compressed-sensing (CS) and projected least-squares (PLS) QPT in benchmarks with two-qubit random processes.
  arXiv  Detail & Related papers  (2022-08-01T12:48:48Z)
• Accelerated Convergence of Contracted Quantum Eigensolvers through a Quasi-Second-Order, Locally Parameterized Optimization [0.0]
  A contracted quantum eigensolver (CQE) finds a solution to the many-electron Schr"odinger equation on a quantum computer. In this work, we accelerate the convergence of the CQE and its wavefunction ansatz via tools from classical optimization theory.
  arXiv  Detail & Related papers  (2022-05-03T18:48:04Z)
• Simulating Time Evolution with Fully Optimized Single-Qubit Gates on Parameterized Quantum Circuits [3.5462326830737805]
  We propose a novel method to sequentially optimize arbitrary single-qubit gates in parameterized quantum circuits. We show the method can be applied to real time evolution and discuss the tradeoff between its simulation accuracy and hardware efficiency.
  arXiv  Detail & Related papers  (2021-11-10T05:46:15Z)
• Simulating Many-Body Systems with a Projective Quantum Eigensolver [0.0]
  We present a new hybrid quantum-classical algorithm for optimizing unitary coupled-cluster wave functions. We also introduce a selected variant of PQE (SPQE) that uses an adaptive ansatz built from arbitrary-order particle-hole operators.
  arXiv  Detail & Related papers  (2021-01-31T00:31:12Z)

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.