Investigating Parameter Trainability in the SNAP-Displacement Protocol of a Qudit system

• URL: http://arxiv.org/abs/2309.14942v1
• Date: Tue, 26 Sep 2023 13:57:40 GMT
• Title: Investigating Parameter Trainability in the SNAP-Displacement Protocol of a Qudit system
• Authors: Oluwadara Ogunkoya and Kirsten Morris and Do\~ga Murat K\"urk\c{c}\"uo\~glu
• Abstract summary: We investigate the sensitivity of training any of the SNAP parameters in the SNAP-Displacement protocol. We analyze conditions that could potentially lead to the Barren Plateau problem in a qudit system.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this study, we explore the universality of Selective Number-dependent Arbitrary Phase (SNAP) and Displacement gates for quantum control in qudit-based systems. However, optimizing the parameters of these gates poses a challenging task. Our main focus is to investigate the sensitivity of training any of the SNAP parameters in the SNAP-Displacement protocol. We analyze conditions that could potentially lead to the Barren Plateau problem in a qudit system and draw comparisons with multi-qubit systems. The parameterized ansatz we consider consists of blocks, where each block is composed of hardware operations, namely SNAP and Displacement gates \cite{fosel2020efficient}. Applying Variational Quantum Algorithm (VQA) with observable and gate cost functions, we utilize techniques similar to those in \cite{mcclean2018barren} and \cite{cerezo2021cost} along with the concept of $t-$design. Through this analysis, we make the following key observations: (a) The trainability of a SNAP-parameter does not exhibit a preference for any particular direction within our cost function landscape, (b) By leveraging the first and second moments properties of Haar measures, we establish new lemmas concerning the expectation of certain polynomial functions, and (c) utilizing these new lemmas, we identify a general condition that indicates an expected trainability advantage in a qudit system when compared to multi-qubit systems.

Related papers

• Towards a theory of phase transitions in quantum control landscapes [0.0]
  Control landscape phase transitions occur as abrupt changes in the cost function landscape upon varying a control parameter. We lay the foundations of an analytical theory for CLPTs by developing Dyson, Magnus, and cumulant expansions for the cost function. Our work provides the first steps towards a systematic theory of CLPTs and paves the way for utilizing statistical field theory techniques for generic complex control landscapes.
  arXiv  Detail & Related papers  (2024-08-20T18:08:49Z)
• Linearly simplified QAOA parameters and transferability [0.6834295298053009]
  Quantum Approximate Algorithm Optimization (QAOA) provides a way to solve optimization problems using quantum computers. We present some numerical results that are obtained for instances of the random Ising model and of the max-cut problem.
  arXiv  Detail & Related papers  (2024-05-01T17:34:32Z)
• 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)
• Measurement-Based Quantum Approximate Optimization [0.24861619769660645]
  We focus on measurement-based quantum computing protocols for approximate optimization. We derive measurement patterns for applying QAOA to the broad and important class of QUBO problems. We discuss the resource requirements and tradeoffs of our approach to that of more traditional quantum circuits.
  arXiv  Detail & Related papers  (2024-03-18T06:59:23Z)
• Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms [65.268245109828]
  We take inspiration from Kearns' SQ oracle and Valiant's weak evaluation oracle. We introduce an extensive yet intuitive framework that yields unconditional lower bounds for learning from evaluation queries.
  arXiv  Detail & Related papers  (2023-10-26T18:23:21Z)
• Exploring Parameter Redundancy in the Unitary Coupled-Cluster Ansatze for Hybrid Variational Quantum Computing [5.9640499950316945]
  The number of parameters in the standard UCC ansatze exhibits unfavorable scaling with respect to the system size. Efforts have been taken to propose some variants of UCC ansatze with better scaling. In this paper we explore the parameter redundancy in the preparation of unitary coupled-cluster singles and doubles.
  arXiv  Detail & Related papers  (2023-01-24T05:36:37Z)
• Restricting to the chip architecture maintains the quantum neural network accuracy [0.0]
  variational quantum algorithms (VQAs) are a prominent strategy for constructing quantum machine learning models. This article aims to address several critical questions, such as determining the optimal gate sequence, efficient parameter optimization strategies, and understanding the influence of quantum chip architectures on the final results.
  arXiv  Detail & Related papers  (2022-12-29T18:57:05Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• FLIP: A flexible initializer for arbitrarily-sized parametrized quantum circuits [105.54048699217668]
  We propose a FLexible Initializer for arbitrarily-sized Parametrized quantum circuits. FLIP can be applied to any family of PQCs, and instead of relying on a generic set of initial parameters, it is tailored to learn the structure of successful parameters. We illustrate the advantage of using FLIP in three scenarios: a family of problems with proven barren plateaus, PQC training to solve max-cut problem instances, and PQC training for finding the ground state energies of 1D Fermi-Hubbard models.
  arXiv  Detail & Related papers  (2021-03-15T17:38:33Z)
• Adaptive Control and Regret Minimization in Linear Quadratic Gaussian (LQG) Setting [91.43582419264763]
  We propose LqgOpt, a novel reinforcement learning algorithm based on the principle of optimism in the face of uncertainty. LqgOpt efficiently explores the system dynamics, estimates the model parameters up to their confidence interval, and deploys the controller of the most optimistic model.
  arXiv  Detail & Related papers  (2020-03-12T19:56:38Z)

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.