Scalable circuit depth reduction in feedback-based quantum optimization with a quadratic approximation

• URL: http://arxiv.org/abs/2407.17810v1
• Date: Thu, 25 Jul 2024 06:44:41 GMT
• Title: Scalable circuit depth reduction in feedback-based quantum optimization with a quadratic approximation
• Authors: Don Arai, Ken N. Okada, Yuichiro Nakano, Kosuke Mitarai, Keisuke Fujii,
• Abstract summary: We propose a new feedback law for parameter determination by introducing the second-order approximation with respect to time interval. We demonstrate that our proposal significantly reduces circuit depth, with its linear scaling with the problem size smaller by more than an order of magnitude.
• Score: 0.6834295298053009
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Combinatorial optimization problems are one of the areas where near-term noisy quantum computers may have practical advantage against classical computers. Recently a novel feedback-based quantum optimization algorithm has been proposed by Magann \textit{et al}. The method explicitly determines quantum circuit parameters by feeding back measurement results thus avoids classical parameter optimization that is known to cause significant trouble in quantum approximate optimization algorithm, the well-studied near-term algorithm. Meanwhile, a significant drawback of the feedback-based quantum optimization is that it requires deep circuits, rendering the method unsuitable to noisy quantum devices. In this study we propose a new feedback law for parameter determination by introducing the second-order approximation with respect to time interval, a hyperparameter in the feedback-based quantum optimization. This allows one to take larger time interval, leading to acceleration of convergence to solutions. In numerical simulations on the maximum cut problem we demonstrate that our proposal significantly reduces circuit depth, with its linear scaling with the problem size smaller by more than an order of magnitude. We expect that the new feedback law proposed in this work may pave the way for feedback-based quantum optimization with near-term noisy quantum computers.

Related papers

• 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)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Bayesian Optimization for QAOA [0.0]
  We present a Bayesian optimization procedure to optimise a quantum circuit. We show that our approach allows for a significant reduction in the number of calls to the quantum circuit. Our results suggest that the method proposed here is a promising framework to leverage the hybrid nature of QAOA on the noisy intermediate-scale quantum devices.
  arXiv  Detail & Related papers  (2022-09-08T13:59:47Z)
• Bayesian Learning of Parameterised Quantum Circuits [0.0]
  We take a probabilistic point of view and reformulate the classical optimisation as an approximation of a Bayesian posterior. We describe a dimension reduction strategy based on a maximum a posteriori point estimate with a Laplace prior. Experiments on the Quantinuum H1-2 computer show that the resulting circuits are faster to execute and less noisy than circuits trained without a gradient.
  arXiv  Detail & Related papers  (2022-06-15T14:20:14Z)
• Adiabatic quantum computing with parameterized quantum circuits [0.0]
  We propose a discrete version of adiabatic quantum computing that can be implemented in a near-term device. We compare our proposed algorithm with the Variational Quantum Eigensolver on two classical optimization problems.
  arXiv  Detail & Related papers  (2022-06-09T09:31:57Z)
• 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)
• Avoiding local minima in Variational Quantum Algorithms with Neural Networks [0.0]
  Variational Quantum Algorithms have emerged as a leading paradigm for near-term computation. In this paper we present two algorithms within benchmark them on instances of the gradient landscape problem. We suggest that our approach suggests that the cost landscape is a fruitful path to improving near-term quantum computing algorithms.
  arXiv  Detail & Related papers  (2021-04-07T07:07:28Z)
• Feedback-based quantum optimization [0.0]
  We introduce a feedback-based strategy for quantum optimization, where the results of qubit measurements are used to constructively assign values to quantum circuit parameters. We show that this procedure results in an estimate of the optimization problem solution that improves monotonically with the depth of the quantum circuit.
  arXiv  Detail & Related papers  (2021-03-15T18:01:03Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)
• Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA [68.11912614360878]
  Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications. Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem. In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
  arXiv  Detail & Related papers  (2020-03-11T13:52:41Z)

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.