Cover Image

Quantum linear system algorithm with optimal queries to initial state preparation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Low, Guang Hao, Su, Yuan
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Data Structures and Algorithms Numerical Analysis
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Quantum eigenvalue processing
by: Low, Guang Hao, et al.
Published: (2024)

Quantum algorithms for general nonlinear dynamics based on the Carleman embedding
by: Jennings, David, et al.
Published: (2025)

Quantum matrix arithmetics with Hamiltonian evolution
by: Kang, Christopher, et al.
Published: (2025)

Quantum Realization of the Finite Element Method
by: Deiml, Matthias, et al.
Published: (2024)

Spectral Gaps with Quantum Counting Queries and Oblivious State Preparation
by: Vazquez, Almudena Carrera, et al.
Published: (2025)

Block Encoding of Sparse Matrices via Coherent Permutation
by: Setty, Abhishek
Published: (2025)

A Survey of Quantum Alternatives to Randomized Algorithms: Monte Carlo Integration and Beyond
by: Intallura, Philip, et al.
Published: (2023)

The Lanczos algorithm for matrix functions: a handbook for scientists
by: Chen, Tyler
Published: (2024)

Fast algorithms for least square problems with Kronecker lower subsets
by: Malik, Osman Asif, et al.
Published: (2022)

The Better Solution Probability Metric: Optimizing QAOA to Outperform its Warm-Start Solution
by: Feeney, Sean, et al.
Published: (2024)

Near-optimal hierarchical matrix approximation from matrix-vector products
by: Chen, Tyler, et al.
Published: (2024)

Exponential quantum advantages for practical non-Hermitian eigenproblems
by: Zhang, Xiao-Ming, et al.
Published: (2024)

Exponentially Reduced Circuit Depths Using Trotter Error Mitigation
by: Watson, James D., et al.
Published: (2024)

A Monte Carlo algorithm for efficient large matrix inversion
by: Garcia-Cortes, L. A., et al.
Published: (2004)

Randomized adiabatic quantum linear solver algorithm with optimal complexity scaling and detailed running costs
by: Jennings, David, et al.
Published: (2023)

Stochastic Rounding 2.0, with a View towards Complexity Analysis
by: Drineas, Petros, et al.
Published: (2024)

Algorithms and data structures for numerical computations with automatic precision estimation
by: Netay, Igor V.
Published: (2024)

Fixed-sparsity matrix approximation from matrix-vector products
by: Amsel, Noah, et al.
Published: (2024)

Analysis of Different Algorithmic Design Techniques for Seam Carving
by: Aijaz, Owais, et al.
Published: (2024)

Sublinear Time Low-Rank Approximation of Toeplitz Matrices
by: Musco, Cameron, et al.
Published: (2024)

Finer-Grained Hardness of Kernel Density Estimation
by: Alman, Josh, et al.
Published: (2024)

Complex Mean and Variance of Linear Regression Model for High-Noised Systems by Kriging
by: Suslo, Tomasz
Published: (2005)

Stability of the Lanczos Method for Matrix Function Approximation
by: Musco, Cameron, et al.
Published: (2017)

Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop
by: Amsel, Noah, et al.
Published: (2026)

Randomized matrix-free quadrature: unified and uniform bounds for stochastic Lanczos quadrature and the kernel polynomial method
by: Chen, Tyler, et al.
Published: (2022)

Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination
by: Bentert, Matthias, et al.
Published: (2025)

Block subsampled randomized Hadamard transform for low-rank approximation on distributed architectures
by: Balabanov, Oleg, et al.
Published: (2022)

Sublinear Time Low-Rank Approximation of Hankel Matrices
by: Kapralov, Michael, et al.
Published: (2025)

Revisiting Approximate Leverage Score Sketching for Matrix Least Squares
by: Larsen, Brett W., et al.
Published: (2022)

Preserving Extreme Singular Values with One Oblivious Sketch
by: Mango, John M., et al.
Published: (2025)

A simple analysis of a quantum-inspired algorithm for solving low-rank linear systems
by: Chen, Tyler, et al.
Published: (2025)

A quantum central path algorithm for linear optimization
by: Augustino, Brandon, et al.
Published: (2023)

A square root algorithm faster than Newton's method for multiprecision numbers, using floating-point arithmetic
by: Romano, Fabio
Published: (2024)

A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs
by: Apers, Simon, et al.
Published: (2021)

A Note on Fine-Grained Quantum Reductions for Linear Algebraic Problems
by: Doney, Kyle, et al.
Published: (2025)

Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity
by: Chenakkod, Shabarish, et al.
Published: (2024)

Fast algorithms for classical specifications of stabiliser states and Clifford gates
by: de Silva, Nadish, et al.
Published: (2023)

Diagonally-Addressed Matrix Nicknack: How to improve SpMV performance
by: Saak, Jens, et al.
Published: (2023)

Conjugate queries can help
by: Tang, Ewin, et al.
Published: (2025)

Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios
by: Benchasattabuse, Naphan, et al.
Published: (2023)