Copertina

Improved quantum algorithms for linear and nonlinear differential equations

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Krovi, Hari
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Quantum Physics Data Structures and Algorithms Plasma Physics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Fast quantum algorithm for differential equations
di: Bagherimehrab, Mohsen, et al.
Pubblicazione: (2023)

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

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

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

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

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

Challenges for quantum computation of nonlinear dynamical systems using linear representations
di: Lin, Yen Ting, et al.
Pubblicazione: (2022)

Improved algorithms for learning quantum Hamiltonians, via flat polynomials
di: Narayanan, Shyam
Pubblicazione: (2024)

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

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

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

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

Quantum linear system algorithm with optimal queries to initial state preparation
di: Low, Guang Hao, et al.
Pubblicazione: (2024)

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

Quantum algorithms and lower bounds for eccentricity, radius, and diameter in undirected graphs
di: Wesołowski, Adam, et al.
Pubblicazione: (2025)

An algebraic interpretation of Pauli flow, leading to faster flow-finding algorithms
di: Mitosek, Piotr, et al.
Pubblicazione: (2024)

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

High-level quantum algorithm programming using Silq
di: Bezganovic, Viktorija, et al.
Pubblicazione: (2024)

Elfs, trees and quantum walks
di: Apers, Simon, et al.
Pubblicazione: (2022)

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

Enumeration algorithms for combinatorial problems using Ising machines: When should we stop exploring energy landscapes?
di: Mizuno, Yuta, et al.
Pubblicazione: (2024)

Randomized and quantum approximate matrix multiplication
di: Apers, Simon, et al.
Pubblicazione: (2025)

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

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

Improved Quantum Query Complexity on Easier Inputs
di: Anderson, Noel T., et al.
Pubblicazione: (2023)

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

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

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

An Improved Classical Singular Value Transformation for Quantum Machine Learning
di: Bakshi, Ainesh, et al.
Pubblicazione: (2023)

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

Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances
di: Abbas, Amira, et al.
Pubblicazione: (2025)

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

Smarter k-Partitioning of ZX-Diagrams for Improved Quantum Circuit Simulation
di: Sutcliffe, Matthew
Pubblicazione: (2024)

Improved Dual Attack and Trapdoor Sampling via Quantum Rejection Sampling
di: Ling, Cong, et al.
Pubblicazione: (2026)

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

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

Provably faster randomized and quantum algorithms for $k$-means clustering via uniform sampling
di: Chen, Tyler, et al.
Pubblicazione: (2025)

No quantum advantage implies improved bounds and classical algorithms for the binary paint shop problem
di: Goh, Mark, et al.
Pubblicazione: (2026)

Non-unitary enhanced transfer efficiency in quantum walk search on complex networks
di: Nzongani, Ugo, et al.
Pubblicazione: (2025)

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