Cover Image

Quantum-Classical Separations in Shallow-Circuit-Based Learning with and without Noises

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhang, Zhihan, Gong, Weiyuan, Li, Weikang, Deng, Dong-Ling
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Computational Complexity Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Noisy Quantum Learning Theory
by: Cotler, Jordan, et al.
Published: (2025)

Stabilizer bootstrapping: A recipe for efficient agnostic tomography and magic estimation
by: Chen, Sitan, et al.
Published: (2024)

Classical Simulability of Quantum Circuits with Shallow Magic Depth
by: Zhang, Yifan, et al.
Published: (2024)

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

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

Entanglement-induced provable and robust quantum learning advantages
by: Zhao, Haimeng, et al.
Published: (2024)

Learning Robust Observable to Address Noise in Quantum Machine Learning
by: Khanal, Bikram, et al.
Published: (2024)

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

Improved Circuit Lower Bounds and Quantum-Classical Separations
by: Grewal, Sabee, et al.
Published: (2024)

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

An Exponential Separation Between Quantum and Quantum-Inspired Classical Algorithms for Linear Systems
by: Grønlund, Allan, et al.
Published: (2024)

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

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

The Power of Shallow-depth Toffoli and Qudit Quantum Circuits
by: Grilo, Alex Bredariol, et al.
Published: (2024)

Learning Quantum Processes with Quantum Statistical Queries
by: Wadhwa, Chirag, et al.
Published: (2023)

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

Scalable Quantum Error Mitigation with Neighbor-Informed Learning
by: Chen, Zhenyu, et al.
Published: (2025)

Quantum versus Classical Separation in Simultaneous Number-on-Forehead Communication
by: Yang, Guangxu, et al.
Published: (2025)

Oracle Separations for the Quantum-Classical Polynomial Hierarchy
by: Agarwal, Avantika, et al.
Published: (2024)

Separating Quantum and Classical Advice with Good Codes
by: Bostanci, John, et al.
Published: (2026)

Quantum Learning Theory Beyond Batch Binary Classification
by: Mohan, Preetham, et al.
Published: (2023)

Exponential Separation of Quantum and Classical One-Way Numbers-on-Forehead Communication
by: Yang, Guangxu, et al.
Published: (2026)

Classical Verification of Quantum Learning Advantages with Noises
by: Ma, Yinghao, et al.
Published: (2024)

Reachability Constraints in Variational Quantum Circuits: Optimization within Polynomial Group Module
by: Oh, Yun-Tak, et al.
Published: (2026)

Coherence in Property Testing: Quantum-Classical Collapses and Separations
by: Jeronimo, Fernando Granha, et al.
Published: (2024)

Generalization Error Bound for Quantum Machine Learning in NISQ Era -- A Survey
by: Khanal, Bikram, et al.
Published: (2024)

Proper vs Improper Quantum PAC learning
by: Nayak, Ashwin, et al.
Published: (2024)

Quantum computing and persistence in topological data analysis
by: Gyurik, Casper, et al.
Published: (2024)

Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom
by: Grewal, Sabee, et al.
Published: (2022)

Gradient Scalability and Taylor Surrogation of Quantum Cost Landscapes
by: Meyer, Sabri, et al.
Published: (2025)

Spacetime-Efficient Low-Depth Quantum State Preparation with Applications
by: Gui, Kaiwen, et al.
Published: (2023)

Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant Gates
by: Nelson, Jon, et al.
Published: (2024)

Reducing the Complexity of Matrix Multiplication to $O(N^2log_2N)$ by an Asymptotically Optimal Quantum Algorithm
by: Yao, Jiaqi, et al.
Published: (2026)

Learning unitaries with quantum statistical queries
by: Angrisani, Armando
Published: (2023)

Learning quantum states and unitaries of bounded gate complexity
by: Zhao, Haimeng, et al.
Published: (2023)

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

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

Lower Bounds for Learning Quantum States with Single-Copy Measurements
by: Lowe, Angus, et al.
Published: (2022)

Noise-tolerant learnability of shallow quantum circuits from statistics and the cost of quantum pseudorandomness
by: Wadhwa, Chirag, et al.
Published: (2024)