A Solovay-Kitaev theorem for quantum signal processing

• URL: http://arxiv.org/abs/2505.05468v1
• Date: Thu, 08 May 2025 17:58:07 GMT
• Title: A Solovay-Kitaev theorem for quantum signal processing
• Authors: Zane M. Rossi,
• Abstract summary: Solovay-Kitaev theorem (SKT) establishes an equivalence between the universality of a gate set and its ability to efficiently approximate other gates.<n>In this work we prove an 'SKT for QSP,' showing that the density of parameterized circuit ans"atze in classes of functions implies the existence of short circuits approxing desired functions.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum signal processing (QSP) studies quantum circuits interleaving known unitaries (the phases) and unknown unitaries encoding a hidden scalar (the signal). For a wide class of functions one can quickly compute the phases applying a desired function to the signal; surprisingly, this ability can be shown to unify many quantum algorithms. A separate, basic subfield in quantum computing is gate approximation: among its results, the Solovay-Kitaev theorem (SKT) establishes an equivalence between the universality of a gate set and its ability to efficiently approximate other gates. In this work we prove an 'SKT for QSP,' showing that the density of parameterized circuit ans\"atze in classes of functions implies the existence of short circuits approximating desired functions. This is quite distinct from a pointwise application of the usual SKT, and yields a suite of independently interesting 'lifted' variants of standard SKT proof techniques. Our method furnishes alternative, flexible proofs for results in QSP, extends simply to ans\"atze for which standard QSP proof methods fail, and establishes a formal intersection between QSP and gate approximation.

Related papers

• Generalized Quantum Signal Processing and Non-Linear Fourier Transform are equivalent [0.0]
  Quantum signal processing (QSP) and quantum singular value transformation (QSVT) are powerful techniques for the development of quantum procedures.<n>Recent research showed that Non-Linear Fourier Analysis (NLFA) can be employed to numerically compute a QSP protocol, with provable stability.
  arXiv  Detail & Related papers  (2025-03-04T22:02:38Z)
• Quantum signal processing without angle finding [0.0]
  Quantum signal processing (QSP) has emerged as a unifying computation in quantum algorithms.<n>We propose a novel approach to QSP that bypasses the computationally intensive angle-finding step.<n>Our work significantly broadens the applicability of QSP in quantum computing.
  arXiv  Detail & Related papers  (2025-01-13T01:35:56Z)
• Entanglement scaling in matrix product state representation of smooth functions and their shallow quantum circuit approximations [0.28917933888634956]
  matrix product state (MPS) methods emerged as the most promising approach for constructing shallow quantum circuits.<n>We derive rigorous expansions for the decay of entanglement across bonds in the MPS representation depending on the smoothness of the input function.<n>We construct an improved MPS-based algorithm yielding shallow and accurate encoding quantum circuits.
  arXiv  Detail & Related papers  (2024-12-06T17:31:35Z)
• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• YAQQ: Yet Another Quantum Quantizer -- Design Space Exploration of Quantum Gate Sets using Novelty Search [0.9932551365711049]
  We present a software tool for comparative analysis of quantum processing units and control protocols based on their native gates. The developed software, YAQQ (Yet Another Quantum Quantizer), enables the discovery of an optimized set of quantum gates.
  arXiv  Detail & Related papers  (2024-06-25T14:55:35Z)
• Reductive Quantum Phase Estimation [0.0]
  We show a circuit that distinguishes an arbitrary set of phases with a fewer number of qubits and unitary applications. We show a trade-off between measurement precision and phase distinguishability, which allows one to tune the circuit to be optimal for a specific application.
  arXiv  Detail & Related papers  (2024-02-06T23:38:36Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Implementation and Learning of Quantum Hidden Markov Models [0.0]
  We use the theory of quantum channels and open quantum systems to provide an efficient unitary characterization of a class of generators known as quantum hidden Markov models (QHMMs)<n>We prove that QHMMs are more compact and more expressive definitions of process languages compared to the equivalent classical hidden Markov models (HMMs)<n>We propose two practical learning algorithms for QHMMs.
  arXiv  Detail & Related papers  (2022-12-07T17:25:02Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.