:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Skelton, S. E.
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics
Online Access:	https://arxiv.org/abs/2408.04321
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Hitchhiker's Guide to QSP pre-processing
by: Skelton, S. E.
Published: (2025)

Prospects of Quantum Error Mitigation for Quantum Signal Processing
by: Liaubaitė, Ugnė, et al.
Published: (2025)

Exact QSP angles for odd monomials
by: Kegeles, A., et al.
Published: (2025)

Qubit-optimal quantum phase estimation of block-encoded Hamiltonians
by: Skelton, S. E.
Published: (2025)

Multivariable QSP and Bosonic Quantum Simulation using Iterated Quantum Signal Processing
by: Gomes, Niladri, et al.
Published: (2024)

Comment on "Multivariable quantum signal processing (M-QSP): prophecies of the two-headed oracle"
by: Mori, Hitomi, et al.
Published: (2023)

Advantage of Warm Starts for Electron-Phonon Systems on Quantum Computers
by: Adhikary, Arnab, et al.
Published: (2025)

A Quantum of Hope
by: Skelton, Shawn E. S., et al.
Published: (2025)

Polynomial Reduction Methods and their Impact on QAOA Circuits
by: Schmidbauer, Lukas, et al.
Published: (2024)

Parallel Quantum Signal Processing Via Polynomial Factorization
by: Martyn, John M., et al.
Published: (2024)

Beyond asymptotic scaling: Comparing functional quantum linear solvers
by: Lefterovici, Andreea-Iulia, et al.
Published: (2025)

Some Entanglement Survives Most Measurements
by: Gonzales, Alvin, et al.
Published: (2023)

Most incompatible measurements and sum-of-squares optimisation
by: Designolle, Sébastien
Published: (2025)

Most Subradiant Bound Photon Pairs from Chirality-Mediated Dispersion Softening
by: Tan, Kailin, et al.
Published: (2026)

Bridging Commutant and Polynomial Methods for Hilbert Space Fragmentation
by: Chen, Bo-Ting, et al.
Published: (2026)

Direct Analysis of Zero-Noise Extrapolation: Polynomial Methods, Error Bounds, and Simultaneous Physical-Algorithmic Error Mitigation
by: Mohammadipour, Pegah, et al.
Published: (2025)

Half the Interference, Most of the Answer: Approximate Quantum Simulation via Path-Sum Pruning
by: Pehlivanoglu, Sinan, et al.
Published: (2026)

Polynomial-time Extraction of Entanglement Resources
by: Chen, Si-Yi, et al.
Published: (2025)

The Most Informative Cramér--Rao Bound for Quantum Two-Parameter Estimation with Pure State Probes
by: Yung, Simon K., et al.
Published: (2025)

Oracle Separation between Noisy Quantum Polynomial Time and the Polynomial Hierarchy
by: Chia, Nai-Hui, et al.
Published: (2024)

EHands: Quantum Protocol for Polynomial Computation on Real-Valued Encoded States
by: Balewski, Jan, et al.
Published: (2025)

Lanczos Meets Orthogonal Polynomials
by: Qu, Le-Chen
Published: (2025)

Polynomial complexity of open quantum system problems
by: Chen, Chong, et al.
Published: (2025)

Unitary Gate Synthesis via Polynomial Optimization
by: Gaggioli, Llorenç Balada, et al.
Published: (2025)

Quantum Aberrations: Entangling Photons with Zernike Polynomials
by: Avetisyan, Hakob, et al.
Published: (2025)

Non-Unitary Quantum Many-Body Dynamics using the Faber Polynomial Method
by: Soares, Rafael D., et al.
Published: (2024)

Analytical Angle-Finding and Series Expansions for Quantum Signal Processing via Orthogonal Polynomial Theory
by: Bernard, Pierre-Antoine, et al.
Published: (2026)

Krylov Polynomials and Quantum Query Complexity
by: Adhikari, Kiran
Published: (2025)

Quantum Entanglement, Quantum Teleportation, Multilinear Polynomials and Geometry
by: Romero, Juan M., et al.
Published: (2024)

Piecewise Polynomial Tensor Network Quantum Feature Encoding
by: Ali, Mazen, et al.
Published: (2024)

Elevating Variational Quantum Semidefinite Programs for Polynomial Objectives
by: Wang, Iria W., et al.
Published: (2024)

Quantum Imaginary-Time Evolution with Polynomial Resources in Time
by: Zhang, Lei, et al.
Published: (2025)

Polynomial Equivalence of Complexity Geometries
by: Brown, Adam R.
Published: (2022)

Finite Imaginary-Time Evolution for Polynomial Unconstrained Binary Optimization
by: Kim, Jaehee, et al.
Published: (2026)

Simulating Noisy Variational Quantum Algorithms: A Polynomial Approach
by: Shao, Yuguo, et al.
Published: (2023)

The Entangled Quantum Polynomial Hierarchy Collapses
by: Grewal, Sabee, et al.
Published: (2024)

Quasi-Monte Carlo Method for Linear Combination Unitaries via Classical Post-Processing
by: Kawamata, Yuya, et al.
Published: (2025)

Exploring the neighborhood of 1-layer QAOA with Instantaneous Quantum Polynomial circuits
by: Leontica, Sebastian, et al.
Published: (2022)

Polynomial-time thermalization and Gibbs sampling from system-bath couplings
by: Slezak, Samuel, et al.
Published: (2026)

Polynomial Resource Classification of Quantum Circuit Familes via Classical Shadows
by: Maciejunes, Andrew, et al.
Published: (2026)