Cover Image

Learning quantum states and unitaries of bounded gate complexity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhao, Haimeng, Lewis, Laura, Kannan, Ishaan, Quek, Yihui, Huang, Hsin-Yuan, Caro, Matthias C.
Format:	Preprint
Published:	2023
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 to erase quantum states: thermodynamic implications of quantum learning theory
by: Zhao, Haimeng, et al.
Published: (2025)

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

Quantum advantage from random geometrically-two-local Hamiltonian dynamics
by: Quek, Yihui
Published: (2025)

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

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

Exponential quantum advantage in processing massive classical data
by: Zhao, Haimeng, et al.
Published: (2026)

Exponential speedups in fault-tolerant processing of quantum experiments
by: Kannan, Ishaan, et al.
Published: (2026)

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

Information-theoretic generalization bounds for learning from quantum data
by: Caro, Matthias, et al.
Published: (2023)

Testing classical properties from quantum data
by: Caro, Matthias C., 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)

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

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

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

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

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

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

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

Lower bounds for quantum-inspired classical algorithms via communication complexity
by: Mande, Nikhil S., et al.
Published: (2024)

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

Another generalization of Hadamard test: Optimal sample complexities for learning functions on the unitary group
by: Suruga, Daiki
Published: (2025)

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

The vast world of quantum advantage
by: Huang, Hsin-Yuan, et al.
Published: (2025)

Hamiltonian Property Testing
by: Bluhm, Andreas, et al.
Published: (2024)

Hamiltonians whose low-energy states require $Ω(n)$ T gates
by: Coble, Nolan J., et al.
Published: (2023)

Strong random unitaries and fast scrambling
by: Schuster, Thomas, et al.
Published: (2025)

Optimal lower bounds for quantum state tomography
by: Scharnhorst, Thilo, et al.
Published: (2025)

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

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

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

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

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

Space-bounded quantum interactive proof systems
by: Gall, François Le, et al.
Published: (2024)

Computational complexity of isometric tensor network states
by: Malz, Daniel, et al.
Published: (2024)

Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
by: Allcock, Jonathan, et al.
Published: (2025)

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

Unitary synthesis with fewer T gates
by: Tan, Xinyu
Published: (2025)

Transversal non-Clifford gates for quantum LDPC codes on sheaves
by: Lin, Ting-Chun
Published: (2024)

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

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