Image de couverture de livre

On classical advice, sampling advice and complexity assumptions for learning separations

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Pérez-Guijarro, Jordi
Format:	Preprint
Publié:	2024
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

Even quantum advice is unlikely to solve PP
par: Yirka, Justin
Publié: (2024)

Hydrodynamic and symbolic models of computation with advice
par: Cardona, Robert
Publié: (2023)

Improved separation between quantum and classical computers for sampling and functional tasks
par: Marshall, Simon C., et autres
Publié: (2024)

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

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

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)

Another generalization of Hadamard test: Optimal sample complexities for learning functions on the unitary group
par: Suruga, Daiki
Publié: (2025)

Finding quantum partial assignments by search-to-decision reductions
par: Weggemans, Jordi
Publié: (2024)

Lower Bounds for Unitary Property Testing with Proofs and Advice
par: Weggemans, Jordi
Publié: (2024)

Oracle separation of QMA and QCMA with bounded adaptivity
par: Ben-David, Shalev, et autres
Publié: (2024)

Quantum Merlin-Arthur with an internally separable proof
par: Bassirian, Roozbeh, et autres
Publié: (2024)

How hard is it to verify a classical shadow?
par: Karaiskos, Georgios, et autres
Publié: (2025)

Quantum algorithms to simulate quadratic classical Hamiltonians and optimal control
par: Krovi, Hari
Publié: (2024)

Classical simulability of quantum circuits followed by sparse classical post-processing
par: Takahashi, Yasuhiro, et autres
Publié: (2026)

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

Quantum PCPs: on Adaptivity, Multiple Provers and Reductions to Local Hamiltonians
par: Buhrman, Harry, et autres
Publié: (2024)

Complexity of the Guided Local Hamiltonian Problem: Improved Parameters and Extension to Excited States
par: Cade, Chris, et autres
Publié: (2022)

Guidable Local Hamiltonian Problems with Implications to Heuristic Ansätze State Preparation and the Quantum PCP Conjecture
par: Weggemans, Jordi, et autres
Publié: (2023)

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

Unconditionally separating noisy $\mathsf{QNC}^0$ from bounded polynomial threshold circuits of constant depth
par: Hsieh, Min-Hsiu, et autres
Publié: (2024)

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

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

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

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)

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

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

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

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

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

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

Quantum complexity of the Kronecker coefficients
par: Bravyi, Sergey, et autres
Publié: (2023)

On the exact quantum query complexity of $\text{MOD}_m^n$ and $\text{EXACT}_{k,l}^n$
par: Yao, Penghui, et autres
Publié: (2023)

Improved Hardness Results for the Guided Local Hamiltonian Problem
par: Cade, Chris, et autres
Publié: (2022)

Gibbs state preparation for commuting Hamiltonian: Mapping to classical Gibbs sampling
par: Hwang, Yeongwoo, et autres
Publié: (2024)

SAT, Gadgets, Max2XOR, and Quantum Annealers
par: Ansótegui, Carlos, et autres
Publié: (2024)

Random regular graph states are complex at almost any depth
par: Ghosh, Soumik, et autres
Publié: (2024)

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

Fault-tolerant compiling of classically hard IQP circuits on hypercubes
par: Hangleiter, Dominik, et autres
Publié: (2024)