:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Kalai, Gil, Rinott, Yosef, Shoham, Tomer
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Computational Complexity Statistics Theory
Online Access:	https://arxiv.org/abs/2404.00935
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Further Statistical Study of NISQ Experiments
by: Kalai, Gil, et al.
Published: (2025)

Classically Sampling Noisy Quantum Circuits in Quasi-Polynomial Time under Approximate Markovianity
by: Zhang, Yifan F., et al.
Published: (2025)

Towards Exponential Quantum Improvements in Solving Cardinality-Constrained Binary Optimization
by: Yuan, Haomu, et al.
Published: (2026)

Efficient Pauli channel estimation with logarithmic quantum memory
by: Chen, Sitan, et al.
Published: (2023)

A simple lower bound for the complexity of estimating partition functions on a quantum computer
by: Chen, Zherui, et al.
Published: (2024)

Learning and Generating Mixed States Prepared by Shallow Channel Circuits
by: Hu, Fangjun, et al.
Published: (2026)

Landauer Principle and Thermodynamics of Computation
by: Chattopadhyay, Pritam, et al.
Published: (2025)

Learning to erase quantum states: thermodynamic implications of quantum learning theory
by: Zhao, Haimeng, et al.
Published: (2025)

Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes
by: Dinur, Irit, et al.
Published: (2024)

Random unitaries that conserve energy
by: Mao, Liang, et al.
Published: (2025)

Quantum advantage from measurement-induced entanglement in random shallow circuits
by: Watts, Adam Bene, et al.
Published: (2024)

Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage
by: Gao, Xun, et al.
Published: (2021)

NLTS Hamiltonians from good quantum codes
by: Anshu, Anurag, et al.
Published: (2022)

Efficient witnessing and testing of magic in mixed quantum states
by: Haug, Tobias, et al.
Published: (2025)

A complexity phase transition at the EPR Hamiltonian
by: Marwaha, Kunal, et al.
Published: (2026)

Random unitaries from Hamiltonian dynamics
by: Cui, Laura, et al.
Published: (2025)

Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique
by: Gamarnik, David, et al.
Published: (2023)

Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering
by: Philip, Aby, et al.
Published: (2023)

Unconditional Quantum Advantage for Sampling with Shallow Circuits
by: Watts, Adam Bene, et al.
Published: (2023)

Random ensembles of symplectic and unitary states are indistinguishable
by: West, Maxwell, et al.
Published: (2024)

Quantum Advantages in (n,d)->1 Random Access Codes
by: Ambainis, Andris, et al.
Published: (2015)

Wasserstein Complexity of Quantum Circuits
by: Li, Lu, et al.
Published: (2022)

Rapidly mixing loop representation quantum Monte Carlo for Heisenberg models on star-like bipartite graphs
by: Takahashi, Jun, et al.
Published: (2024)

Anti-Concentration for the Unitary Haar Measure and Applications to Random Quantum Circuits
by: Fefferman, Bill, et al.
Published: (2024)

Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression
by: Buhai, Rares-Darius, et al.
Published: (2024)

Fault-tolerant compiling of classically hard IQP circuits on hypercubes
by: Hangleiter, Dominik, et al.
Published: (2024)

A List of Complexity Bounds for Property Testing by Quantum Sample-to-Query Lifting
by: Chen, Kean, et al.
Published: (2025)

Computational Complexity of Statistics: New Insights from Low-Degree Polynomials
by: Wein, Alexander S.
Published: (2025)

Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals
by: Grier, Daniel, et al.
Published: (2025)

Symmetric Perceptrons, Number Partitioning and Lattices
by: Vafa, Neekon, et al.
Published: (2025)

Taming Barren Plateaus in Arbitrary Parameterized Quantum Circuits without Sacrificing Expressibility
by: Chen, Zhenyu, et al.
Published: (2025)

Fast computational deep thermalization
by: Chakraborty, Shantanav, et al.
Published: (2025)

A Framework for Computational Lower Bounds in Nontrivial Norm Approximation
by: Tang, Runshi, et al.
Published: (2026)

Detection Is Harder Than Estimation in Certain Regimes: Inference for Moment and Cumulant Tensors
by: Tang, Runshi, et al.
Published: (2026)

Computational Equivalence of Spiked Covariance and Spiked Wigner Models via Gram-Schmidt Perturbation
by: Bresler, Guy, et al.
Published: (2025)

Fourier Spectrum of Noisy Quantum Algorithms
by: Girish, Uma
Published: (2025)

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

Approximate Computation via Le Cam Simulability
by: Akdemir, Deniz
Published: (2025)

Thermodynamic Signature of Logical Depth in Quantum Circuits
by: Ibnouhsein, Issam
Published: (2025)

Unconditional Pseudorandomness against Shallow Quantum Circuits
by: Ghosh, Soumik, et al.
Published: (2025)