Copertina

Simple Quantum Algorithm for Approximate $k$-Mismatch Problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Habib, Ruhan, Shahriar, Shadman
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Quantum Physics Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Quantum Algorithm for the Multiple String Matching Problem
di: Khadiev, Kamil, et al.
Pubblicazione: (2024)

Parameterized Quantum Query Algorithms for Graph Problems
di: Terao, Tatsuya, et al.
Pubblicazione: (2024)

Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching
di: Kociumaka, Tomasz, et al.
Pubblicazione: (2024)

A Feasibility-Preserved Quantum Approximate Solver for the Capacitated Vehicle Routing Problem
di: Xie, Ningyi, et al.
Pubblicazione: (2023)

Quantum Algorithms for the Shortest Common Superstring and Text Assembling Problems
di: Khadiev, Kamil, et al.
Pubblicazione: (2023)

A Quantum Approximation Scheme for k-Means
di: Jaiswal, Ragesh
Pubblicazione: (2023)

Sublinear Time Quantum Algorithm for Attention Approximation
di: Song, Zhao, et al.
Pubblicazione: (2026)

Product-State Approximation Algorithms for the Transverse Field Ising Model
di: Lipardi, Vincenzo, et al.
Pubblicazione: (2026)

Quantum Sketches, Hashing, and Approximate Nearest Neighbors
di: Hashemian, Sajjad
Pubblicazione: (2026)

Loop Composition in Quantum Algorithms
di: Jeffery, Stacey, et al.
Pubblicazione: (2026)

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

Accelerating Regression Tasks with Quantum Algorithms
di: Liu, Chenghua, et al.
Pubblicazione: (2025)

Variational Quantum Algorithms for Semidefinite Programming
di: Patel, Dhrumil, et al.
Pubblicazione: (2021)

Quantum Honest Byzantine Agreement as a Distributed Quantum Algorithm
di: Edwards, Marcus
Pubblicazione: (2023)

A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix
di: Chen, Yanlin, et al.
Pubblicazione: (2024)

Quantum Algorithms for One-Sided Crossing Minimization
di: Caroppo, Susanna, et al.
Pubblicazione: (2024)

Comparison of Hyperplane Rounding for Max-Cut and Quantum Approximate Optimization Algorithm over Certain Regular Graph Families
di: Tate, Reuben, et al.
Pubblicazione: (2025)

Quantum Approximate Optimization Algorithms for Maximum Cut on Low-Girth Graphs
di: Li, Tongyang, et al.
Pubblicazione: (2024)

An Optimal Product-State Approximation for 2-Local Quantum Hamiltonians with Positive Terms
di: Parekh, Ojas, et al.
Pubblicazione: (2022)

Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms
di: Caroppo, Susanna, et al.
Pubblicazione: (2025)

A Quantum Algorithm for the Classification of Patterns of Boolean Functions
di: Andronikos, Theodore, et al.
Pubblicazione: (2025)

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

How to Design a Quantum Streaming Algorithm Without Knowing Anything About Quantum Computing
di: Kallaugher, John, et al.
Pubblicazione: (2024)

Quantum Algorithm for Searching for the Longest Segment and the Largest Empty Rectangle
di: Khadiev, Kamil, et al.
Pubblicazione: (2025)

Algorithmic Cluster Expansions for Quantum Problems
di: Mann, Ryan L., et al.
Pubblicazione: (2023)

On Tight FPT Time Approximation Algorithms for k-Clustering Problems
di: Dai, Han, et al.
Pubblicazione: (2025)

3-Local Hamiltonian Problem and Constant Relative Error Quantum Partition Function Approximation: $O(2^{\frac{n}{2}})$ Algorithm Is Nearly Optimal under QSETH
di: Chia, Nai-Hui, et al.
Pubblicazione: (2025)

Tensor Decompositions and Adiabatic Quantum Computing for Discovering Practical Matrix Multiplication Algorithms
di: Uotila, Valter
Pubblicazione: (2024)

On the Communication Complexity of Approximate Pattern Matching
di: Kociumaka, Tomasz, et al.
Pubblicazione: (2024)

A New Quantum Linear System Algorithm Beyond the Condition Number and Its Application to Solving Multivariate Polynomial Systems
di: Li, Jianqiang
Pubblicazione: (2025)

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

An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem
di: Cohen-Addad, Vincent, et al.
Pubblicazione: (2025)

Classical Algorithms for Constant Approximation of the Ground State Energy of Local Hamiltonians
di: Gall, François Le
Pubblicazione: (2024)

A Linear Time Quantum Algorithm for Pairwise Sequence Alignment
di: Khan, Md. Rabiul Islam, et al.
Pubblicazione: (2023)

Efficient Approximation of Quantum Channel Fidelity Exploiting Symmetry
di: Chee, Yeow Meng, et al.
Pubblicazione: (2023)

Bernstein-Vazirani Algorithm with A CCNOT-Based Oracle
di: Annaby, Mahmoud H.
Pubblicazione: (2025)

Cycle Basis Algorithms for Reducing Maximum Edge Participation
di: Wang, Fan, et al.
Pubblicazione: (2025)

No Quantum Advantage in Decoded Quantum Interferometry for MaxCut
di: Parekh, Ojas
Pubblicazione: (2025)

Multidimensional Quantum Walks, Recursion, and Quantum Divide & Conquer
di: Jeffery, Stacey, et al.
Pubblicazione: (2024)

Coherent Rollout Oracles for Finite-Horizon Sequential Decision Problems
di: Shukla, Nishant
Pubblicazione: (2026)