A construction of combinatorial NLTS

DOI10.1063/5.0113731OpenAlexW4310524734MaRDI QIDQ5882999FDOQ5882999

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• 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

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)