Testing quantum satisfiability

DOI10.1007/S00220-025-05377-4MaRDI QIDQ6933525zbMATH OpenFDO

Authors Ashley Montanaro, Changpeng Shao, Dominic Verdon

Publication date 4 September 2025

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

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

satisfiabilityproduct statesfrustration-free Hamiltonian

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40)

Cites work

• scientific article; zbMATH DE number 3857249 (Why is no real title available?)
• scientific article; zbMATH DE number 6789292 (Why is no real title available?)
• A construction of combinatorial NLTS
• A note on the optimality of decomposable entanglement witnesses and completely entangled subspaces
• A quantum Lovász local lemma
• Efficient algorithm for a quantum analogue of 2-SAT
• Faithful squashed entanglement
• Linear-Time Algorithm for Quantum 2SAT
• Modern computer algebra
• NLTS Hamiltonians from good quantum codes
• On efficiently solvable cases of quantum \(k\)-SAT
• On the complexity of the \(F_5\) Gröbner basis algorithm
• On the maximal dimension of a completely entangled subspace for finite level quantum systems
• Partial shadows of set systems
• Product-state approximations to quantum states
• Quantum de finetti theorems under local measurements with applications
• Random quantum satisfiability
• Shadows and intersections: Stability and new proofs
• Testing satisfiability
• “Squashed entanglement”: An additive entanglement measure

This page was built for publication: Testing quantum satisfiability

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