Image de couverture de livre

On the exact quantum query complexity of $\text{MOD}_m^n$ and $\text{EXACT}_{k,l}^n$

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Yao, Penghui, Ye, Zekun
Format:	Preprint
Publié:	2023
Sujets:	Quantum Physics Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Quantum and Classical Communication Complexity of Permutation-Invariant Functions
par: Guan, Ziyi, et autres
Publié: (2023)

Quantum and classical query complexities of functions of matrices
par: Montanaro, Ashley, et autres
Publié: (2023)

On query complexity measures and their relations for symmetric functions
par: Mittal, Rajat, et autres
Publié: (2021)

Direct sum theorems beyond query complexity
par: Suruga, Daiki
Publié: (2024)

Separations in query complexity for total search problems
par: Ben-David, Shalev, et autres
Publié: (2024)

Classical versus quantum queries in quantum PCPs with classical proofs
par: Buhrman, Harry, et autres
Publié: (2024)

Learning unitaries with quantum statistical queries
par: Angrisani, Armando
Publié: (2023)

A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity
par: Wu, Xudong, et autres
Publié: (2025)

Local Quantum Search Algorithm for Random $k$-SAT with $Ω(n^{1+ε})$ Clauses
par: Wu, Mingyou
Publié: (2024)

Efficient quantum circuits for high-dimensional representations of SU(n) and Ramanujan quantum expanders
par: Iyer, Vishnu, et autres
Publié: (2026)

Nonlocal Games in the High-Noise Regime: Optimal Quantum Values and Rigidity
par: Fu, Honghao, et autres
Publié: (2025)

Anticoncentrated $n$-bit distribution from $\log(n)$ qubits
par: Zhang, Bingzhi, et autres
Publié: (2025)

On the complexity of unique quantum witnesses and quantum approximate counting
par: Anshu, Anurag, et autres
Publié: (2024)

The Computational Advantage of MIP* Vanishes in the Presence of Noise
par: Dong, Yangjing, et autres
Publié: (2023)

A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs
par: Apers, Simon, et autres
Publié: (2021)

Physical complexity and black hole quantum computers
par: Reilly, Michele, et autres
Publié: (2025)

Conjugate queries can help
par: Tang, Ewin, et autres
Publié: (2025)

Hamiltonians whose low-energy states require $Ω(n)$ T gates
par: Coble, Nolan J., et autres
Publié: (2023)

Lower bounds for quantum-inspired classical algorithms via communication complexity
par: Mande, Nikhil S., et autres
Publié: (2024)

On the quantum computational complexity of classical linear dynamics with geometrically local interactions: Dequantization and universality
par: Sakamoto, Kazuki, et autres
Publié: (2025)

Quantum Pseudorandom Scramblers
par: Lu, Chuhan, et autres
Publié: (2023)

Parallel Kac's Walk Generates PRU
par: Lu, Chuhan, et autres
Publié: (2025)

Quantum Kolmogorov complexity and quantum correlations in deterministic-control quantum Turing machines
par: Lemus, Mariano, et autres
Publié: (2023)

Quantum k-SAT Related Hypergraph Problems
par: Kremer, Simon-Luca, et autres
Publié: (2025)

Magic and communication complexity
par: Girish, Uma, et autres
Publié: (2025)

Learning quantum states and unitaries of bounded gate complexity
par: Zhao, Haimeng, et autres
Publié: (2023)

Quantum Advantages in (n,d)->1 Random Access Codes
par: Ambainis, Andris, et autres
Publié: (2015)

Quantum computational complexity of matrix functions
par: Cifuentes, Santiago, et autres
Publié: (2024)

On the average-case complexity of learning output distributions of quantum circuits
par: Nietner, Alexander, et autres
Publié: (2023)

The $\text{FP}^\text{NP}$ versus #P dichotomy for #EO
par: Meng, Boning, et autres
Publié: (2025)

Computational complexity of isometric tensor network states
par: Malz, Daniel, et autres
Publié: (2024)

On the complexity of estimating ground state entanglement and free energy
par: Gharibian, Sevag, et autres
Publié: (2025)

On the communication complexity of finding a king in a tournament
par: Mande, Nikhil S., et autres
Publié: (2024)

Quasi-quantum states and the quasi-quantum PCP theorem
par: Arad, Itai, et autres
Publié: (2024)

Unambiguous parity-query complexity
par: Gavinsky, Dmytro
Publié: (2024)

Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes
par: Dinur, Irit, et autres
Publié: (2024)

On classical advice, sampling advice and complexity assumptions for learning separations
par: Pérez-Guijarro, Jordi
Publié: (2024)

Fermionic Independent Set and Laplacian of an independence complex are QMA-hard
par: Rayudu, Chaithanya
Publié: (2024)

Efficiently verifiable quantum advantage on near-term analog quantum simulators
par: Liu, Zhenning, et autres
Publié: (2024)

Collapses in quantum-classical probabilistically checkable proofs and the quantum polynomial hierarchy
par: Anand, Kartik, et autres
Publié: (2025)