Cover Image

Learning the closest product state

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bakshi, Ainesh, Bostanci, John, Kretschmer, William, Landau, Zeph, Li, Jerry, Liu, Allen, O'Donnell, Ryan, Tang, Ewin
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An Improved Classical Singular Value Transformation for Quantum Machine Learning
by: Bakshi, Ainesh, et al.
Published: (2023)

Learning quantum Hamiltonians at any temperature in polynomial time
by: Bakshi, Ainesh, et al.
Published: (2023)

High-Temperature Gibbs States are Unentangled and Efficiently Preparable
by: Bakshi, Ainesh, et al.
Published: (2024)

A Dobrushin condition for quantum Markov chains: Rapid mixing and conditional mutual information at high temperature
by: Bakshi, Ainesh, et al.
Published: (2025)

Structure learning of Hamiltonians from real-time evolution
by: Bakshi, Ainesh, et al.
Published: (2024)

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

Query-optimal estimation of unitary channels in diamond distance
by: Haah, Jeongwan, et al.
Published: (2023)

Rapid mixing for high-temperature Gibbs states with arbitrary external fields
by: Bakshi, Ainesh, et al.
Published: (2026)

Improved quantum data analysis
by: Bădescu, Costin, et al.
Published: (2020)

Mixed state tomography reduces to pure state tomography
by: Pelecanos, Angelos, et al.
Published: (2025)

Quantum chi-squared tomography and mutual information testing
by: Flammia, Steven T., et al.
Published: (2023)

SPAM Tolerance for Pauli Error Estimation
by: O'Donnell, Ryan, et al.
Published: (2025)

Few Single-Qubit Measurements Suffice to Certify Any Quantum State
by: Gupta, Meghal, et al.
Published: (2025)

Entanglement in quantum spin chains is strictly finite at any temperature
by: Bakshi, Ainesh, et al.
Published: (2026)

Instance-Optimal Quantum State Certification with Entangled Measurements
by: O'Donnell, Ryan, et al.
Published: (2025)

Polynomial-Time Preparation of Low-Temperature Gibbs States for 2D Toric Code
by: Ding, Zhiyan, et al.
Published: (2024)

Sharp Bounds on the Eigenvalues of Kikuchi Graphs and Applications to Quantum Max Cut
by: Bakshi, Ainesh, et al.
Published: (2026)

Amplitude amplification and estimation require inverses
by: Tang, Ewin, et al.
Published: (2025)

Are controlled unitaries helpful?
by: Tang, Ewin, et al.
Published: (2025)

Beating the natural Grover bound for low-energy estimation and state preparation
by: Buhrman, Harry, et al.
Published: (2024)

Beating full state tomography for unentangled spectrum estimation
by: Pelecanos, Angelos, et al.
Published: (2025)

Fiber Bundle Codes: Breaking the $N^{1/2} \operatorname{polylog}(N)$ Barrier for Quantum LDPC Codes
by: Hastings, Matthew B., et al.
Published: (2020)

Optimal learning of quantum Hamiltonians from high-temperature Gibbs states
by: Haah, Jeongwan, et al.
Published: (2021)

Quartic quantum speedups for planted inference
by: Schmidhuber, Alexander, et al.
Published: (2024)

No exponential quantum speedup for $\mathrm{SIS}^\infty$ anymore
by: Kothari, Robin, et al.
Published: (2025)

A Classical Quadratic Speedup for Planted $k$XOR
by: Gupta, Meghal, et al.
Published: (2025)

Uniformity testing when you have the source code
by: Canonne, Clément L., et al.
Published: (2024)

Conjugate queries can help
by: Tang, Ewin, et al.
Published: (2025)

Quantum Pseudorandomness and Classical Complexity
by: Kretschmer, William
Published: (2021)

Finding the disjointness of stabilizer codes is NP-complete
by: Bostanci, John, et al.
Published: (2021)

Quantum Event Learning and Gentle Random Measurements
by: Watts, Adam Bene, et al.
Published: (2022)

Learning shallow quantum circuits
by: Huang, Hsin-Yuan, et al.
Published: (2024)

Non-iid hypothesis testing: from classical to quantum
by: De Palma, Giacomo, et al.
Published: (2025)

Quantum Mass Production Theorems
by: Kretschmer, William
Published: (2022)

Parameterized quantum algorithms for closest string problems
by: Cudby, Josh, et al.
Published: (2025)

Computability Theory of Closed Timelike Curves
by: Aaronson, Scott, et al.
Published: (2016)

Commuting Local Hamiltonians Beyond 2D
by: Bostanci, John, et al.
Published: (2024)

Unentanglement and Post-Measurement Branching in Quantum Interactive Proofs
by: Grewal, Sabee, et al.
Published: (2025)

Local transformations of bipartite entanglement are rigid
by: Bostanci, John, et al.
Published: (2025)

An optimal tradeoff between entanglement and copy complexity for state tomography
by: Chen, Sitan, et al.
Published: (2024)