ArXivCSExplorer
β˜†β˜†BookmarksπŸ†RSSHow to UseFAQ
Built with and by Teycir Ben Soltaneβ€’
How to Useβ€’FAQβ€’GitHubβ€’arXiv.orgβ€’
Share:

20 results for β€œQuantum query complexity”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.β“˜

Want pure semantic search? Try claim verification β†’

quant-phcs.CCTheoreticalRecentOct 30, 2026

Quantum query complexity of Hurwitz stability testing

Maxwell Fitzsimmons, Mohamed Serry, Meenu Kumari, Jun Liu

Determining the stability of a linear system using quantum query complexity.

View β†’
quant-phcs.DSmath.NATheoreticalRecentJul 8, 2026

Faster quantum linear system solver beyond the condition number

Alexander M. Dalzell, Jianqiang Li, Yuan Su

This paper presents two quantum algorithms for solving linear systems with normalized solution $|x angle$ to accuracy $Ξ΅$, independent of the condition number $ΞΊ$.

View β†’
cs.CCquant-phTheoreticalRecentNov 12, 2026

Exact Quantum Algorithms for Composed Boolean Functions

Gagan Chiruvella, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar +1 more

This paper presents exact quantum algorithms for block compositions of total Boolean functions.

View β†’
cs.DScs.CCcs.ITTheoreticalRecentJun 9, 2026

A Unified Lower Bound on the Noisy Query Complexity of Boolean Functions

Yuzhou Gu, Xin Li, Yinzhan Xu

The paper provides a general lower bound on the noisy query complexity of Boolean functions in the noisy query model.

View β†’
quant-phcs.CCTheoreticalRecentOct 7, 2026

Quantum Approximation Complexity of Classical Optimization Problems

Stuart Hadfield

The paper defines and studies the complexity classes for quantum approximation algorithms and establishes a hierarchy of quantum approximation classes.

View β†’
cs.CCTheoreticalRecentJul 9, 2026

QMA Lower Bounds for Batch Verification via Approximate Degree

Mark Bun, Mandar Juvekar, Samuel King

The paper studies the resources required to batch verify Boolean functions and provides lower bounds on the witness-query tradeoff based on approximate degree.

View β†’
quant-phcond-mat.dis-nncs.CCTheoreticalRecentJul 15, 2026

Circuit complexity lower bounds for quantum spin glasses

Omar Al-Ghattas, David Gamarnik

This paper shows that shallow circuits cannot prepare near-optimal states for random quantum $p$-spin glasses, and proves depth lower bounds for such preparations.

View β†’
cs.CCTheoreticalRecentJun 16, 2026

On the Complexity of the Circuit Width Problem

Zhengfeng Ji, Yinchen Liu, Zhe'ou Zhou

This paper studies the computational complexity of the width parameter in Montanaro's polynomial representation of quantum circuits.

View β†’
quant-phcs.CCcs.DSTheoreticalRecentJun 11, 2026

Approximability limits for bounded-degree max-LINSAT and implications for decoded quantum interferometry

Maximilian J. Kramer, Carsten Schubert, Jens Eisert

This paper proves that certain optimization problems are NP-hard and provides a complexity-theoretic benchmark for quantum algorithms.

View β†’
quant-phcs.CRApr 13, 2026

Answering Counting Queries with Differential Privacy on a Quantum Computer

Arghya Mukherjee, Hassan Jameel Asghar, Gavin K. Brennen

This paper develops and analyzes two differentially private methods for answering counting queries on quantum-encoded datasets, demonstrating improved privacy guarantees and a quantum-safe approach fo…

View β†’