Cover Image

Learning junta distributions, quantum junta states, and QAC$^0$ circuits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bao, Jinge, Escudero-Gutiérrez, Francisco
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Low-degree approximation of QAC$^0$ circuits
by: Montanaro, Ashley, et al.
Published: (2024)

Parity $\notin$ QAC0 $\iff$ QAC0 is Fourier-Concentrated
by: Gretta, Lucas, et al.
Published: (2026)

On the Pauli Spectrum of QAC0
by: Nadimpalli, Shivam, et al.
Published: (2023)

Improved Lower Bounds for QAC0
by: Joshi, Malvika Raj, et al.
Published: (2025)

$\mathsf{QAC}^0$ Contains $\mathsf{TC}^0$ (with Many Copies of the Input)
by: Grier, Daniel, et al.
Published: (2026)

Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates
by: Allcock, Jonathan, et al.
Published: (2023)

Tight bounds on depth-2 QAC-circuits computing parity
by: Fenner, Stephen, et al.
Published: (2025)

Learning quantum states prepared by shallow circuits in polynomial time
by: Landau, Zeph, et al.
Published: (2024)

On Estimating the Quantum Tsallis Relative Entropy
by: Bao, Jinge, et al.
Published: (2025)

Grothendieck inequalities characterize converses to the polynomial method
by: Briët, Jop, et al.
Published: (2022)

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

Testing and learning structured quantum Hamiltonians
by: Arunachalam, Srinivasan, et al.
Published: (2024)

Sparse juntas on the biased hypercube
by: Dinur, Irit, et al.
Published: (2017)

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

On the average-case complexity of learning output distributions of quantum circuits
by: Nietner, Alexander, et al.
Published: (2023)

Bell sampling from quantum circuits
by: Hangleiter, Dominik, et al.
Published: (2023)

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

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

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

Certifying and learning quantum Ising Hamiltonians
by: Bluhm, Andreas, et al.
Published: (2025)

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

Learning depth-3 circuits via quantum agnostic boosting
by: Arunachalam, Srinivasan, et al.
Published: (2025)

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

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

Learning stabilizer structure of quantum states
by: Arunachalam, Srinivasan, et al.
Published: (2025)

Learning low-degree quantum objects
by: Arunachalam, Srinivasan, et al.
Published: (2024)

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

Quasi-quantum states and the quasi-quantum PCP theorem
by: Arad, Itai, et al.
Published: (2024)

Unconditionally separating noisy $\mathsf{QNC}^0$ from bounded polynomial threshold circuits of constant depth
by: Hsieh, Min-Hsiu, et al.
Published: (2024)

IQP circuits for 2-Forrelation
by: Buzet, Quentin, et al.
Published: (2026)

Certifying and learning local quantum Hamiltonians
by: Bluhm, Andreas, et al.
Published: (2026)

Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances
by: Abbas, Amira, et al.
Published: (2025)

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

Complexity and hardness of random peaked circuits
by: Zhang, Yuxuan
Published: (2025)

Fast simulation of planar Clifford circuits
by: Gosset, David, et al.
Published: (2020)

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

Simple algorithms to test and learn local Hamiltonians
by: Gutiérrez, Francisco Escudero
Published: (2024)

Space-bounded quantum state testing via space-efficient quantum singular value transformation
by: Gall, François Le, et al.
Published: (2023)

Exact spectral gaps of random one-dimensional quantum circuits
by: Deneris, Andrew E., et al.
Published: (2024)

Quantum circuit lower bounds in the magic hierarchy
by: Parham, Natalie
Published: (2025)