Imagen de Portada

Parameterized Quantum Query Algorithms for Graph Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Terao, Tatsuya, Mori, Ryuhei
Formato:	Preprint
Publicado:	2024
Materias:	Quantum Physics Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Deterministic $(2/3-\varepsilon)$-Approximation of Matroid Intersection Using Nearly-Linear Independence-Oracle Queries
por: Terao, Tatsuya
Publicado: (2024)

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

Simple Quantum Algorithm for Approximate $k$-Mismatch Problem
por: Habib, Ruhan, et al.
Publicado: (2025)

Faster Approximate Linear Matroid Intersection
por: Terao, Tatsuya
Publicado: (2026)

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

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

Quantum Data Structure for Range Minimum Query
por: Wang, Qisheng, et al.
Publicado: (2026)

Loop Composition in Quantum Algorithms
por: Jeffery, Stacey, et al.
Publicado: (2026)

Subquadratic Submodular Maximization with a General Matroid Constraint
por: Kobayashi, Yusuke, et al.
Publicado: (2024)

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

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

Quantum Honest Byzantine Agreement as a Distributed Quantum Algorithm
por: Edwards, Marcus
Publicado: (2023)

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

Quantum Graph-State Synthesis with SAT
por: Brand, Sebastiaan, et al.
Publicado: (2023)

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

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

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

Quantum Circuit for Quantum Fourier Transform for Arbitrary Qubit Connectivity Graphs
por: Khadiev, Kamil, et al.
Publicado: (2025)

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

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

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

Quantum Search with In-Place Queries
por: Holman, Blake, et al.
Publicado: (2025)

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

Exponential Quantum Advantage for Pathfinding in Regular Sunflower Graphs
por: Li, Jianqiang, et al.
Publicado: (2024)

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

Circuits of Quantum Hashing and Quantum Fourier Transform for a Cactus as a Qubit Connectivity Graph
por: Khadiev, Kamil, et al.
Publicado: (2026)

Parameterized Algorithms for the Drone Delivery Problem
por: Bartlmae, Simon, et al.
Publicado: (2026)

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

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

Query-optimal estimation of unitary channels in diamond distance
por: Haah, Jeongwan, et al.
Publicado: (2023)

Deterministic Search on Complete Bipartite Graphs by Continuous Time Quantum Walk
por: Lin, Honghong, et al.
Publicado: (2024)

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

A Framework for Parameterized Subexponential-Subcubic-Time Algorithms for Weighted Problems in Planar Graphs
por: Bentert, Matthias, et al.
Publicado: (2026)

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

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

Parameterized Algorithms for the Steiner Arborescence Problem on a Hypercube
por: Mahapatra, Sugyani, et al.
Publicado: (2021)

Structural Parameterizations of $k$-Planarity
por: Gima, Tatsuya, et al.
Publicado: (2025)

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs
por: Feldmann, Andreas Emil, et al.
Publicado: (2024)

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
por: Bergougnoux, Benjamin, et al.
Publicado: (2023)

Parameterized Approximation Algorithms for TSP on Non-Metric Graphs
por: Zhao, Jingyang, et al.
Publicado: (2025)