Imagen de Portada

On the average-case complexity of learning output distributions of quantum circuits

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Nietner, Alexander, Ioannou, Marios, Sweke, Ryan, Kueng, Richard, Eisert, Jens, Hinsche, Marcel, Haferkamp, Jonas
Formato:	Preprint
Publicado:	2023
Materias:	Quantum Physics Computational Complexity Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Interactive proofs for verifying (quantum) learning and testing
por: Caro, Matthias C., et al.
Publicado: (2024)

Classical Verification of Quantum Learning
por: Caro, Matthias C., et al.
Publicado: (2023)

Shallow shadows: Expectation estimation using low-depth random Clifford circuits
por: Bertoni, Christian, et al.
Publicado: (2022)

A measurement-driven quantum algorithm for SAT: Performance guarantees via spectral gaps and measurement parallelization
por: Schreiber, Franz J., et al.
Publicado: (2025)

On the complexity of unique quantum witnesses and quantum approximate counting
por: Anshu, Anurag, et al.
Publicado: (2024)

Free Fermion Distributions Are Hard to Learn
por: Nietner, Alexander
Publicado: (2023)

Single-copy stabilizer testing
por: Hinsche, Marcel, et al.
Publicado: (2024)

Clifford testing: algorithms and lower bounds
por: Hinsche, Marcel, et al.
Publicado: (2025)

Efficient distributed inner product estimation via Pauli sampling
por: Hinsche, Marcel, et al.
Publicado: (2024)

Incompressibility and spectral gaps of random circuits
por: Chen, Chi-Fang, et al.
Publicado: (2024)

Quantum complexity phase transitions in monitored random circuits
por: Suzuki, Ryotaro, et al.
Publicado: (2023)

Dynamic parameterized quantum circuits: expressive and barren-plateau free
por: Deshpande, Abhinav, et al.
Publicado: (2024)

Verifiable measurement-based quantum random sampling with trapped ions
por: Ringbauer, Martin, et al.
Publicado: (2023)

On estimating the entropy of shallow circuit outputs
por: Gheorghiu, Alexandru, et al.
Publicado: (2020)

Benchmarking bosonic and fermionic dynamics
por: Wilkens, Jadwiga, et al.
Publicado: (2024)

An in-principle super-polynomial quantum advantage for approximating combinatorial optimization problems via computational learning theory
por: Pirnay, Niklas, et al.
Publicado: (2022)

Learning junta distributions, quantum junta states, and QAC$^0$ circuits
por: Bao, Jinge, et al.
Publicado: (2024)

Separating QMA from QCMA with a classical oracle
por: Bostanci, John, et al.
Publicado: (2025)

The abelian state hidden subgroup problem: Learning stabilizer groups and beyond
por: Hinsche, Marcel, et al.
Publicado: (2025)

Random unitaries in extremely low depth
por: Schuster, Thomas, et al.
Publicado: (2024)

The power of quantum circuits in sampling
por: Blanc, Guy, et al.
Publicado: (2025)

Bell sampling from quantum circuits
por: Hangleiter, Dominik, et al.
Publicado: (2023)

Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood
por: Chen, Sitan, et al.
Publicado: (2025)

Optimising quantum circuits is generally hard
por: van de Wetering, John, et al.
Publicado: (2023)

How hard is it to verify a classical shadow?
por: Karaiskos, Georgios, et al.
Publicado: (2025)

Exponential improvements to the average-case hardness of BosonSampling
por: Bouland, Adam, et al.
Publicado: (2024)

Classically estimating observables of noiseless quantum circuits
por: Angrisani, Armando, et al.
Publicado: (2024)

Efficient quantum circuits for high-dimensional representations of SU(n) and Ramanujan quantum expanders
por: Iyer, Vishnu, et al.
Publicado: (2026)

The computational two-way quantum capacity
por: Meyer, Johannes Jakob, et al.
Publicado: (2026)

On the complexity of estimating ground state entanglement and free energy
por: Gharibian, Sevag, et al.
Publicado: (2025)

Short-time simulation of quantum dynamics by Pauli measurements
por: Faehrmann, Paul K., et al.
Publicado: (2024)

Classical simulability of quantum circuits followed by sparse classical post-processing
por: Takahashi, Yasuhiro, et al.
Publicado: (2026)

Ideal random quantum circuits pass the LXEB test
por: Hunter-Jones, Nicholas, et al.
Publicado: (2026)

In the shadow of the Hadamard test: Using the garbage state for good and further modifications
por: Faehrmann, Paul K., et al.
Publicado: (2025)

Gate-based quantum simulation of Gaussian bosonic circuits on exponentially many modes
por: Barthe, Alice, et al.
Publicado: (2024)

When quantum resources backfire: Non-gaussianity and symplectic coherence in noisy bosonic circuits
por: Upreti, Varun, et al.
Publicado: (2025)

Quartic quantum speedups for planted inference
por: Schmidhuber, Alexander, et al.
Publicado: (2024)

An alternative explicit circuit diagram for the quantum search algorithm by implementing a non-unitary gate
por: Daskin, Ammar
Publicado: (2024)

Physical complexity and black hole quantum computers
por: Reilly, Michele, et al.
Publicado: (2025)

Complexity of quantum circuits via sensitivity, magic, and coherence
por: Bu, Kaifeng, et al.
Publicado: (2022)