Mostly Harmless Methods for QSP-Processing with Laurent Polynomials

• URL: http://arxiv.org/abs/2408.04321v1
• Date: Thu, 8 Aug 2024 09:02:01 GMT
• Title: Mostly Harmless Methods for QSP-Processing with Laurent Polynomials
• Authors: S. E. Skelton,
• Abstract summary: We introduce a method of QSP-processing complexs that identifies a solution without optimization or root-finding. We demonstrate the success of our technique for relevant targets and precision regimes. For popular choices of sign inverse function approximations, we characterize regimes where all known QSP-processing methods should be expected to struggle without arbitrary precision arithmetic.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum signal processing (QSP) and its extensions are increasingly popular frameworks for developing quantum algorithms. Yet QSP implementations still struggle to complete a classical pre-processing step ('QSP-processing') that determines the set of $SU(2)$ rotation matrices defining the QSP circuit. We introduce a method of QSP-processing for complex polynomials that identifies a solution without optimization or root-finding and verify the success of our methods with polynomials characterized by floating point precision coefficients. We demonstrate the success of our technique for relevant target polynomials and precision regimes, including the Jacobi-Anger expansion used in QSP Hamiltonian Simulation. For popular choices of sign and inverse function approximations, we characterize regimes where all known QSP-processing methods should be expected to struggle without arbitrary precision arithmetic.

Related papers

• Double-bracket algorithm for quantum signal processing without post-selection [0.0]
  Quantum signal processing (QSP) is a fundamental primitive in various quantum algorithms. Despite its versatility, a potentially underappreciated challenge is that all systematic protocols for implementing QSP rely on post-selection. We introduce a new formula for implementing QSP transformations of Hermitian matrices, which requires neither auxiliary qubits nor post-selection.
  arXiv  Detail & Related papers  (2025-04-01T18:00:04Z)
• The Hitchhiker's Guide to QSP pre-processing [0.0]
  Quantum signal processing (QSP) relies on a historically costly pre-processing step, "QSP-processing/phase-factor finding" This work provides a whirlwind tour through QSP conventions and pre-processing methods.
  arXiv  Detail & Related papers  (2025-01-10T14:01:37Z)
• Polynomial time constructive decision algorithm for multivariable quantum signal processing [0.7332146059733189]
  Multivariable quantum signal processing (M-QSP) is proposed. M-QSP interleaves signal operators corresponding to each variable with signal processing operators. A classical algorithm is proposed to determine whether a given pair of Laurents can be implemented by M-QSP.
  arXiv  Detail & Related papers  (2024-10-03T09:30:35Z)
• 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)
• Pointer Networks with Q-Learning for Combinatorial Optimization [55.2480439325792]
  We introduce the Pointer Q-Network (PQN), a hybrid neural architecture that integrates model-free Q-value policy approximation with Pointer Networks (Ptr-Nets) Our empirical results demonstrate the efficacy of this approach, also testing the model in unstable environments.
  arXiv  Detail & Related papers  (2023-11-05T12:03:58Z)
• Generalized Quantum Signal Processing [0.6768558752130311]
  We present a Generalized Quantum Signal Processing approach, employing general SU(2) rotations as our signal processing operators. Our approach lifts all practical restrictions on the family of achievable transformations, with the sole remaining condition being that $|P|leq 1$. In cases where only $P$ is known, we provide an efficient GPU optimization capable of identifying in under a minute of time, a corresponding $Q$ for degree on the order of $107$.
  arXiv  Detail & Related papers  (2023-08-03T01:51:52Z)
• Robust iterative method for symmetric quantum signal processing in all parameter regimes [1.3614427997190908]
  This paper addresses the problem of solving nonlinear systems in the context of symmetric quantum signal processing (QSP) We present a novel Newtons method tailored for efficiently solving the nonlinear system involved in determining the phase factors within the symmetric QSP framework.
  arXiv  Detail & Related papers  (2023-07-24T01:45:12Z)
• Realization of quantum signal processing on a noisy quantum computer [0.4593579891394288]
  We propose a strategy to run an entire QSP protocol on noisy quantum hardware by carefully reducing overhead costs at each step. We test the protocol by running the algorithm on the Quantinuum H1-1 trapped-ion quantum computer powered by Honeywell. Our results are the first step in the experimental realization of QSP-based quantum algorithms.
  arXiv  Detail & Related papers  (2023-03-09T19:00:17Z)
• 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)
• 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)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• 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)
• Momentum Q-learning with Finite-Sample Convergence Guarantee [49.38471009162477]
  This paper analyzes a class of momentum-based Q-learning algorithms with finite-sample guarantee. We establish the convergence guarantee for MomentumQ with linear function approximations and Markovian sampling. We demonstrate through various experiments that the proposed MomentumQ outperforms other momentum-based Q-learning algorithms.
  arXiv  Detail & Related papers  (2020-07-30T12:27:03Z)
• Efficient phase-factor evaluation in quantum signal processing [1.3614427997190908]
  Quantum signal processing (QSP) is a powerful quantum algorithm to exactly implement matrixs on quantum computers. There is so far no classically stable algorithm allowing computation of the phase factors that are needed to build QSP circuits. We present here an optimization based method that can accurately compute the phase factors using standard double precision arithmetic operations.
  arXiv  Detail & Related papers  (2020-02-26T17:23:55Z)

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.