A construction of combinatorial NLTS

DOI10.1063/5.0113731MaRDI QIDQ5882999zbMATH OpenOpenAlexFDO

Authors Anurag Anshu, Nikolas P. Breuckmann

Publication date 29 March 2023

Published in Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2206.02741

Mathematics Subject Classification ID

Partial differential equations (35-XX) Quantum theory (81-XX)

Recommendations

• Approximate low-weight check codes and circuit lower bounds for noisy ground states
• Good approximate quantum LDPC codes from spacetime circuit Hamiltonians
• Quantum locally testable codes
• Product-state approximations to quantum states
• scientific article; zbMATH DE number 5568625

Cites work

• A practical introduction to tensor networks: Matrix product states and projected entangled pair states
• Asymptotically good Quantum and locally testable classical LDPC codes
• Balanced Product Quantum Codes
• Computational Complexity of Projected Entangled Pair States
• Expander codes
• Fiber bundle codes: breaking the n ^1/2 polylog( n ) barrier for Quantum LDPC codes
• Frustration free gapless Hamiltonians for matrix product states
• Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence
• Homology with local coefficients
• scientific article; zbMATH DE number 3763833 (Why is no real title available?)
• Inclusion-exclusion: exact and approximate
• Pseudorandomness
• Quantum locally testable codes
• Ramanujan graphs

Cited in

(5)

• A direct complement construction for LR(1) grammars
• Approximate low-weight check codes and circuit lower bounds for noisy ground states
• NLTS Hamiltonians from good quantum codes
• Circuit lower bounds for low-energy states of quantum code Hamiltonians
• Testing quantum satisfiability

This page was built for publication: A construction of combinatorial NLTS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5882999)