Cover Image

Randomized and quantum approximate matrix multiplication

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Apers, Simon, Cornelissen, Arjan, Wang, Samson
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Elfs, trees and quantum walks
by: Apers, Simon, et al.
Published: (2022)

Quantum Speedup for Sampling Random Spanning Trees
by: Apers, Simon, et al.
Published: (2025)

Directed st-connectivity with few paths is in quantum logspace
by: Apers, Simon, et al.
Published: (2024)

Quantum walks, the discrete wave equation and Chebyshev polynomials
by: Apers, Simon, et al.
Published: (2024)

Elfs, transducers and quantum walks
by: Apers, Simon, et al.
Published: (2026)

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

Quantum speedups for linear programming via interior point methods
by: Apers, Simon, et al.
Published: (2023)

(No) Quantum space-time tradeoff for USTCON
by: Apers, Simon, et al.
Published: (2022)

Quantum property testing in sparse directed graphs
by: Apers, Simon, et al.
Published: (2024)

Do you know what q-means?
by: Cornelissen, Arjan, et al.
Published: (2023)

Qubit-Efficient Randomized Quantum Algorithms for Linear Algebra
by: Wang, Samson, et al.
Published: (2023)

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)

On computing approximate Lewis weights
by: Apers, Simon, et al.
Published: (2024)

Tight Lieb-Robinson Bound for approximation ratio in Quantum Annealing
by: Braida, Arthur, et al.
Published: (2023)

Basic quantum subroutines: finding multiple marked elements and summing numbers
by: van Apeldoorn, Joran, et al.
Published: (2023)

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

Improved approximation algorithms for the EPR Hamiltonian
by: Ju, Nathan, et al.
Published: (2025)

Randomized Quantum Singular Value Transformation
by: Wang, Xinzhao, et al.
Published: (2025)

A 0.8395-approximation algorithm for the EPR problem
by: Apte, Anuj, et al.
Published: (2025)

Random Natural Gradient
by: Kolotouros, Ioannis, et al.
Published: (2023)

A quantum neural network framework for scalable quantum circuit approximation of unitary matrices
by: Sarkar, Rohit Sarma, et al.
Published: (2024)

Quantum algorithm for approximating the expected value of a random-exist quantified oracle
by: Rotello, Caleb
Published: (2024)

Unifying quantum spatial search, state transfer and uniform sampling on graphs: simple and exact
by: Wang, Qingwen, et al.
Published: (2024)

Simulating quantum collision models with Hamiltonian simulations using early fault-tolerant quantum computers
by: Garg, Kushagra, et al.
Published: (2025)

Quartic quantum speedups for community detection
by: Schmidhuber, Alexander, et al.
Published: (2025)

On the quantum time complexity of divide and conquer
by: Allcock, Jonathan, et al.
Published: (2023)

Resource-aware scheduling of multiple quantum circuits on a hardware device
by: Bhoumik, Debasmita, et al.
Published: (2024)

Holey graphs: very large Betti numbers are testable
by: Szabó, Dániel, et al.
Published: (2024)

Variational ground-state quantum adiabatic theorem
by: Žunkovič, Bojan, et al.
Published: (2024)

Big data applications on small quantum computers
by: Yogendran, Boniface, et al.
Published: (2024)

Analysis of sum-of-squares relaxations for the quantum rotor model
by: Rao, Sujit
Published: (2023)

A quantum algorithm for solving 0-1 Knapsack problems
by: Wilkening, Sören, et al.
Published: (2023)

Assessing fault-tolerant quantum advantage for $k$-SAT with structure
by: Brehm, Martijn, et al.
Published: (2024)

Anti-crossings occurrence as exponentially closing gaps in Quantum Annealing
by: Braida, Arthur, et al.
Published: (2023)

Nonlinear transformation of complex amplitudes via quantum singular value transformation
by: Guo, Naixu, et al.
Published: (2021)

Non-unitary enhanced transfer efficiency in quantum walk search on complex networks
by: Nzongani, Ugo, 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 unified approach to quantum de Finetti theorems and SoS rounding via geometric quantization
by: Rao, Sujit
Published: (2024)

A Dobrushin condition for quantum Markov chains: Rapid mixing and conditional mutual information at high temperature
by: Bakshi, Ainesh, et al.
Published: (2025)

Revisiting Majumdar-Ghosh spin chain model and Max-cut problem using variational quantum algorithms
by: Britant, et al.
Published: (2024)