Imagen de Portada

Anti-concentration is (almost) all you need

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Heinrich, Markus, Haferkamp, Jonas, Roth, Ingo, Helsen, Jonas
Formato:	Preprint
Publicado:	2025
Materias:	Quantum Physics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Will it glue? On short-depth designs beyond the unitary group
por: Grevink, Lorenzo, et al.
Publicado: (2025)

Random regular graph states are complex at almost any depth
por: Ghosh, Soumik, et al.
Publicado: (2024)

A Bravyi-König theorem for Floquet codes generated by locally conjugate instantaneous stabiliser groups
por: Mackeprang, Jelena, et al.
Publicado: (2026)

Error correction with brickwork Clifford circuits
por: Kroll, Twan, et al.
Publicado: (2026)

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

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

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

Trotter error and gate complexity of the SYK and sparse SYK models
por: Chen, Yiyuan, et al.
Publicado: (2025)

Quantum PCPs: on Adaptivity, Multiple Provers and Reductions to Local Hamiltonians
por: Buhrman, Harry, et al.
Publicado: (2024)

Tolerant testing of stabilizer states with a polynomial gap via a generalized uncertainty relation
por: Bao, Zongbo, et al.
Publicado: (2024)

Catalytic entanglement transformations with noisy hardware
por: Sharma, Hemant, et al.
Publicado: (2025)

Arts & crafts: Strong random unitaries and geometric locality
por: Folkertsma, Marten, et al.
Publicado: (2026)

Mutual information fluctuations and non-stabilizerness in random circuits
por: Ahmadi, Arash, et al.
Publicado: (2024)

Stability of classical shadows under gate-dependent noise
por: Brieger, Raphael, et al.
Publicado: (2023)

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

Efficient Quantum Pseudorandomness from Hamiltonian Phase States
por: Bostanci, John, et al.
Publicado: (2024)

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

Robustly learning the Hamiltonian dynamics of a superconducting quantum processor
por: Hangleiter, Dominik, et al.
Publicado: (2021)

Minimising the number of edges in LC-equivalent graph states
por: Sharma, Hemant, et al.
Publicado: (2025)

Dropout is all you need: robust two-qubit gate with reinforcement learning
por: Xu, Tian-Niu, et al.
Publicado: (2023)

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

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

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

On the sample complexity of purity and inner product estimation
por: Gong, Weiyuan, et al.
Publicado: (2024)

On Clifford hierarchy testing and near-extremizers of noncommutative uniformity norms
por: Zongbo, et al.
Publicado: (2026)

All you need is Trotter
por: Rendon, Gumaro
Publicado: (2023)

Spin coupling is all you need: Encoding strong electron correlation in molecules on quantum computers
por: Marti-Dafcik, Daniel, et al.
Publicado: (2024)

A short trajectory is all you need: A transformer-based model for long-time dissipative quantum dynamics
por: Rodríguez, Luis E. Herrera, et al.
Publicado: (2024)

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

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

Complexity-constrained quantum thermodynamics
por: Munson, Anthony, et al.
Publicado: (2024)

QAOA-MaxCut has barren plateaus for almost all graphs
por: Mao, Rui, et al.
Publicado: (2025)

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

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

Operator Lanczos Approach enabling Neural Quantum States as Real-Frequency Impurity Solvers
por: Rigo, Jonas B., et al.
Publicado: (2025)

Quantum neural network with ensemble learning to mitigate barren plateaus and cost function concentration
por: Friedrich, Lucas, et al.
Publicado: (2024)

Quantum complexity in gravity, quantum field theory, and quantum information science
por: Baiguera, Stefano, et al.
Publicado: (2025)

Algorithmic idealism: what should you believe to experience next?
por: Mueller, Markus P.
Publicado: (2024)

On Groups in the Qubit Clifford Hierarchy
por: Anderson, Jonas T.
Publicado: (2022)

A Floquet analysis perspective of driven light-matter interaction models
por: Larson, Jonas
Publicado: (2024)